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

Abstract

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.