A Natural Family of Flag Matroids

  title={A Natural Family of Flag Matroids},
  author={Anna de Mier},
  journal={SIAM J. Discret. Math.},
  • A. Mier
  • Published 29 September 2006
  • Mathematics
  • SIAM J. Discret. Math.
A flag matroid can be viewed as a chain of matroids linked by quotients. Flag matroids, of which relatively few interesting families have previously been known, are a particular class of Coxeter matroids. In this paper we give a family of flag matroids arising from an enumeration problem that is a generalization of the tennis ball problem. These flag matroids can also be defined in terms of lattice paths, and they provide a generalization of the lattice path matroids of [J. Bonin, A. de Mier… 

Figures from this paper

Lattice path matroids and quotients
We characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank
Flag matroids with coefficients
. This paper is a direct generalization of Baker-Bowler theory to flag matroids, including its moduli interpretation as developed by Baker and the second author for matroids. More explicitly, we
Lattice path matroids: The excluded minors
Counting Lattice Paths and Walks with Several Step Vectors
Many famous researchers in computer science, mathematics and other areas have studied enumerative problems in lattice path and walks which could be applied to many fields. We will discuss some new
A Complete Bibliography of Publications in the SIAM Journal on Discrete Mathematics
(1,−1) [dLL09]. (1, 2) [BKM08, DK06, DK10]. (1,≤ l) [Lai05]. (1,m+ 1, n+ 1) [BD01]. (1− ε) ex(n,C4) [BS10a]. (2 + )n [DZ01]. (3, 1)∗ [Xu09]. (7, 2) [CW09]. (9v, 4, 1) [FHMY01]. (d, k) [KS03a]. (k, l)


Lattice path matroids: Structural properties
A linking polynomial of two matroids
The lattice of flats and its underlying flag matroid polytope
LetM be a matroid andF the collection of all linear orderings of bases ofM, orflags ofM. We define the flag matroid polytope Δ(F). We determine when two vertices of Δ(F) are adjacent, and provide a
Lattice path matroids: enumerative aspects and Tutte polynomials
A solution to the tennis ball problem
Gaussian, Strong and Transversal Greedoids
The main purpose of this short paper is to prove directly that the two structures are identical, thus giving a simple axiomatic characterisation of the Gauss greedoids.
Enumerative combinatorics
This review of 3 Enumerative Combinatorics, by Charalambos A.good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations.
Progress in mathematics
Over four decades David Vogan’s groundbreaking work in representation theory has changed the face of the subject. We give a brief summary here.
Europ. J. Combinatorics
  • Europ. J. Combinatorics
  • 1999