Matroid, Ideal, Ultrafilter, Tangle, and so on: Reconsideration of Obstruction to linear decomposition

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Fujita, Takaaki
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908856360108032
author Fujita, Takaaki
author_facet Fujita, Takaaki
contents The investigation of width parameters in both graph and algebraic contexts has attracted considerable interest. Among these parameters, the linear branch width has emerged as a crucial measure. In this concise paper, we explore the concept of linear decomposition, specifically focusing on the single filter in a connectivity system. Additionally, we examine the relevance of matroids, antimatroids, and greedoids in the context of connectivity systems. Our primary objective in this study is to shed light on the impediments to linear decomposition from multiple perspectives.
format Preprint
id arxiv_https___arxiv_org_abs_2309_09199
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Matroid, Ideal, Ultrafilter, Tangle, and so on: Reconsideration of Obstruction to linear decomposition
Fujita, Takaaki
Combinatorics
The investigation of width parameters in both graph and algebraic contexts has attracted considerable interest. Among these parameters, the linear branch width has emerged as a crucial measure. In this concise paper, we explore the concept of linear decomposition, specifically focusing on the single filter in a connectivity system. Additionally, we examine the relevance of matroids, antimatroids, and greedoids in the context of connectivity systems. Our primary objective in this study is to shed light on the impediments to linear decomposition from multiple perspectives.
title Matroid, Ideal, Ultrafilter, Tangle, and so on: Reconsideration of Obstruction to linear decomposition
topic Combinatorics
url https://arxiv.org/abs/2309.09199