Search arXivSearch

arXiv · 2210.15223

Lattices of flats for symplectic matroids

Abstract

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 construction of lattices, resembling a known definition for the geometric lattice corresponding to ordinary matroid. We construct a correspondence to a set of enveloped symplectic matroids, we denote ranked symplectic matroids. As a by-product of our construction, we also obtain a new way of finding symplectic matroids from ordinary ones and an embedding Theorem into geometric lattices. The second part of this paper is dedicated to the properties of ranked symplectic matroids and their enveloping ordinary matroids. We focus on establishing a geometric approach to the study of ranked symplectic matroids, demonstrating the ability to take minors, and proving shellability. We finish with a characterization of ranked symplectic matroids using recursive atom orderings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Or Raz. 2026-01-07. Lattices of flats for symplectic matroids. https://arxiv.org/abs/2210.15223

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO