Excluding a line from positroids

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Boretsky, Jonathan, Walsh, Zach
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912770620915712
author Boretsky, Jonathan
Walsh, Zach
author_facet Boretsky, Jonathan
Walsh, Zach
contents For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of elements. This result continues a long line of research into upper bounds on the number of elements of matroids from various classes that forbid $U_{2,\ell+2}$ as a minor. This is the first paper to study positroids in this context, and it suggests methods to study similar problems for other classes of matroids, such as gammoids or base-orderable matroids.
format Preprint
id arxiv_https___arxiv_org_abs_2512_14939
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Excluding a line from positroids
Boretsky, Jonathan
Walsh, Zach
Combinatorics
05B35, 05E14
For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of elements. This result continues a long line of research into upper bounds on the number of elements of matroids from various classes that forbid $U_{2,\ell+2}$ as a minor. This is the first paper to study positroids in this context, and it suggests methods to study similar problems for other classes of matroids, such as gammoids or base-orderable matroids.
title Excluding a line from positroids
topic Combinatorics
05B35, 05E14
url https://arxiv.org/abs/2512.14939