Related papers: Representability of Flag Matroids

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

We give a new proof, along with some generalizations, of a folklore theorem (attributed to Laurent Lafforgue) that a rigid matroid (i.e., a matroid with indecomposable basis polytope) has only finitely many projective equivalence classes of…

In this paper we show that certain relative flags cannot have full exceptional collections. We also prove that some of these flags are categorical representable in dimension zero if and only if they admit a full exceptional collection. As a…

We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

Why withdrawn: Main theorem can only be proved, if the flag manifold F with b2=1 is additionally hermitian symmetric.Mistake made at the following place: If F is not hermitian symmetric, certain vector fields are not left invariant

Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes…

We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular…

We classify all products of flag varieties with finitely many orbits under the diagonal action of the general linear group. We also classify the orbits in each case and construct explicit representatives. This generalizes the classical…

Consider a matroid equipped with a labeling of its ground set to an abelian group. We define the label of a subset of the ground set as the sum of the labels of its elements. We study a collection of problems on finding bases and common…

As a natural extension of the theory of uniform vector bundles on Fano manifolds, we consider uniform principal bundles, and study them by means of the associated flag bundles, as their natural projective geometric realizations. In this…

In this paper, we present a lattice-theoretic characterization for valuated matroids, which is an extension of the well-known cryptomorphic equivalence between matroids and geometric lattices ($=$ atomistic semimodular lattices). We…

We identify a link between regular matroids and torus representations all of whose isotropy groups have an odd number of components. Applying Seymour's 1980 classification of the former objects, we obtain a classification of the latter. In…

In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…

In this paper we prove a new formula for the coefficients of the cellular homology of real flag manifolds in terms of the height of certain roots. In particular, for flag manifolds of type A, we get a very simple formula for these…

Recently, it was proved by B\'erczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically intractable. On the other hand, many special cases were…

Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…