Search arXivSearch

arXiv · 2306.06694

A characterization of positroids, with applications to amalgams and excluded minors

Abstract

A matroid of rank $r$ on $n$ elements is a positroid if it has a representation by an $r$ by $n$ matrix over $\mathbb{R}$, each $r$ by $r$ submatrix of which has nonnegative determinant. Earlier characterizations of connected positroids and results about direct sums of positroids involve connected flats and non-crossing partitions. We prove another characterization of positroids of a similar flavor and give some applications of the characterization. We show that if $M$ and $N$ are positroids and $E(M)\cap E(N)$ is an independent set and a set of clones in both $M$ and $N$, then the free amalgam of $M$ and $N$ is a positroid, and we prove a second result of that type. Also, we identify several multi-parameter infinite families of excluded minors for the class of positroids.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph E. Bonin. 2024-06-16. A characterization of positroids, with applications to amalgams and excluded minors. https://doi.org/10.1016/j.ejc.2024.104040

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