English
Related papers

Related papers: Fractal classes of matroids

200 papers

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…

Combinatorics · Mathematics 2012-12-18 Nathan Bowler , Johannes Carmesin

Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…

Combinatorics · Mathematics 2021-03-16 Bill Jackson , Shin-ichi Tanigawa

Many concepts from extremal set theory have analogues for families of permutations. This paper is concerned with the notion of shattering for permutations. A family $\mathcal{P}$ of permutations of an $n$-element set $X$ shatters a $k$-set…

Combinatorics · Mathematics 2023-04-06 J. Robert Johnson , Belinda Wickes

We introduce the notion of a quasi-matroidal class of ordered simplicial complexes: an approximation to the idea of a matroid cryptomorphism in the landscape of ordered simplicial complexes. A quasi-matroidal class contains pure shifted…

Combinatorics · Mathematics 2016-08-16 Jose Alejandro Samper

We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the union of two nearly finitary matroids is a…

Combinatorics · Mathematics 2012-07-10 Elad Aigner-Horev , Johannes Carmesin , Jan-Oliver Fröhlich

We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given…

Data Structures and Algorithms · Computer Science 2016-07-20 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…

Combinatorics · Mathematics 2012-09-10 Jim Geelen , Peter Nelson

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

For a matroid $M$, an element $e$ such that both $M\backslash e$ and $M/e$ are regular is called a regular element of $M$. We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small…

Combinatorics · Mathematics 2015-09-15 Sandra Kingan , Manoel Lemos

The classes of bicircular matroids and lattice path matroids are closed under minors. The complete list of excluded minors for the class of lattice path matroids is known, and it has been recently shown that the analogous list for the class…

Combinatorics · Mathematics 2024-02-20 Emma Hogan , Charles Semple

For a matroid $M$ of rank $r$ on $n$ elements, let $b(M)$ denote the fraction of bases of $M$ among the subsets of the ground set with cardinality $r$. We show that $$\Omega(1/n)\leq 1-b(M)\leq O(\log(n)^3/n)\text{ as }n\rightarrow \infty$$…

Combinatorics · Mathematics 2016-10-24 Rudi Pendavingh , Jorn van der Pol

We characterize the 3-connected members of the intersection of the class of bicircular and cobicircular matroids. Aside from some exceptional matroids with rank and corank at most 5, this class consists of just the free swirls and their…

Combinatorics · Mathematics 2020-12-23 Vaidy Sivaraman , Daniel Slilaty

We study geometric rigidity of a class of fractals, which is slightly larger than the collection of self-conformal sets. Namely, using a new method, we shall prove that a set of this class is contained in a smooth submanifold or is totally…

Dynamical Systems · Mathematics 2017-01-31 Antti Käenmäki

Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…

Combinatorics · Mathematics 2015-11-17 Konstantinos Papalamprou , Leonidas Pitsoulis

There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…

Combinatorics · Mathematics 2024-11-05 Kristóf Bérczi , Áron Jánosik , Bence Mátravölgyi

This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…

Combinatorics · Mathematics 2013-11-28 Vanessa Chatelain , Jorge Ramirez Alfonsin

A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.

Combinatorics · Mathematics 2016-05-06 Michael Albert , Vít Jelínek

We show that, if $k$ and $\ell$ are positive integers and $r$ is sufficiently large, then the number of rank-$k$ flats in a rank-$r$ matroid $M$ with no $U_{2,\ell+2}$-minor is less than or equal to number of rank-$k$ flats in a rank-$r$…

Combinatorics · Mathematics 2013-09-18 Peter Nelson

We consider the GF$(4)$-representable matroids with a circuit-hyperplane such that the matroid obtained by relaxing the circuit-hyperplane is also GF$(4)$-representable. We characterize the structure of these matroids as an application of…

Combinatorics · Mathematics 2018-06-04 Ben Clark , James Oxley , Stefan H. M. van Zwam

A family $\mathcal{F}$ of subsets of $[n]=\{1,2,\ldots,n\}$ shatters a set $A \subseteq [n]$ if for every $A' \subseteq A$ there is an $F \in \mathcal{F}$ such that $F \cap A=A'$. We develop a framework to analyze $f(n,k,d)$, the maximum…

Combinatorics · Mathematics 2024-10-29 Noga Alon , Varun Sivashankar , Daniel G. Zhu