English
Related papers

Related papers: A cyclic flat embedding theorem for transversal $q…

200 papers

In this paper we develop the theory of cyclic flats of $q$-matroids. We show that the lattice of cyclic flats, together with their ranks, uniquely determines a $q$-matroid and hence derive a new $q$-cryptomorphism. We introduce the notion…

Combinatorics · Mathematics 2023-02-15 Gianira N. Alfarano , Eimear Byrne

A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier

There are many similarities between the theories of matroids and $q$-matroids. However, when dealing with the direct sum of $q$-matroids many differences arise. Most notably, it has recently been shown that the direct sum of representable…

Combinatorics · Mathematics 2026-03-11 Gianira N. Alfarano , Relinde Jurrius , Alessandro Neri , Ferdinando Zullo

We study the direct sum of q-matroids by way of their cyclic flats. Using that the rank function of a q-matroid is fully determined by the cyclic flats and their ranks, we show that the cyclic flats of the direct sum of two q-matroids are…

Combinatorics · Mathematics 2023-02-23 Heide Gluesing-Luerssen , Benjamin Jany

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

Combinatorics · Mathematics 2022-03-16 Gianira N. Alfarano , Karan Khathuria , Simran Tinani

We introduce the notion of the free product of $q$-matroids, which is the $q$-analogue of the free product of matroids. We study the properties of this noncommutative binary operation, making an extensive use of the theory of cyclic flats.…

Combinatorics · Mathematics 2024-12-18 Gianira N. Alfarano , Eimear Byrne , Andrew Fulcher

The configuration of a matroid $M$ is the abstract lattice of cyclic flats (flats that are unions of circuits) where we record the size and rank of each cyclic flat, but not the set. One can compute the Tutte polynomial of $M$, and stronger…

Combinatorics · Mathematics 2025-12-18 Joseph E. Bonin , Anna de Mier

This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier

In this paper, first steps are taken towards characterising lattices of cyclic flats $\mathcal{Z}(M)$ that belong to matroids $M$ that can be represented over a prescribed finite field $\mathbb{F}_q$. Two natural maps from $\mathcal{Z}(M)$…

Combinatorics · Mathematics 2019-06-27 Ragnar Freij-Hollanti , Matthias Grezet , Camilla Hollanti , Thomas Westerbäck

In the theory of classical matroids, there are several known equivalent axiomatic systems that define a matroid, which are described as matroid cryptomorphisms. A q-matroid is a q-analogue of a matroid where subspaces play the role of the…

Combinatorics · Mathematics 2021-07-22 Eimear Byrne , Michela Ceria , Relinde Jurrius

In this paper, we investigate the relation between a $q$-matroid and its associated matroid called the projectivization matroid. The latter arises by projectivizing the groundspace of the $q$-matroid and considering the projective space as…

Combinatorics · Mathematics 2022-05-06 Benjamin Jany

We provide evidence for five long-standing, basis-exchange conjectures for matroids by proving them for the enormous class of sparse paving matroids. We also explore the role that these matroids may play in the following problem: as a…

Combinatorics · Mathematics 2010-11-05 Joseph E. Bonin

Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…

Combinatorics · Mathematics 2019-10-15 Laszlo Csirmaz

We show that the Whitney function of a q-matroid can be determined from the cloud and flock polynomials associated to the cyclic flats. These polynomials capture information about the corank (resp., nullity) of certain spaces whose cyclic…

Combinatorics · Mathematics 2025-04-10 Heide Gluesing-Luerssen , Benjamin Jany

We consider structural properties of $\mathcal{L}$-polymatroids, especially those defined on a finite complemented modular lattice $\mathcal{L}$. We introduce a set of cover-weight axioms and establish a cryptomorphism between these axioms…

Combinatorics · Mathematics 2025-12-30 Eimear Byrne , Andrew Fulcher

We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…

Combinatorics · Mathematics 2026-01-08 Or Raz

A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions of nonempty sets of cyclic flats. We prove counterparts, for…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Joseph P. S. Kung , Anna de Mier

q-Matroids form the q-analogue of classical matroids. In this paper we introduce various types of maps between q-matroids. These maps are not necessarily linear, but they map subspaces to subspaces and respect the q-matroid structure in…

Combinatorics · Mathematics 2023-03-14 Heide Gluesing-Luerssen , Benjamin Jany

This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…

Combinatorics · Mathematics 2013-12-16 Franz J. Király , Zvi Rosen , Louis Theran

We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…

Combinatorics · Mathematics 2024-11-21 Jagdeep Singh , Vaidy Sivaraman
‹ Prev 1 2 3 10 Next ›