Characterizing positroid quotients of uniform matroids

We study two-step flag positroids <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>P</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>P</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> , where <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>P</mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:math> is a quotient of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>P</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> . We provide a complete characterization of all two-step flag positroids that contain a uniform matroid, extending and completing a partial result by Benedetti, Chávez, and Jiménez. Our characterization reveals that “non-local information” is necessary for characterizing flag positroids. To contrast general positroids with the special case of lattice path matroids, we show that the containment relations of Grassmann necklaces and conecklaces fully characterize flag lattice path matroids, but are insufficient for general flag positroids. Additionally, we prove that the decorated permutations of any elementary quotient pair are related by a cyclic shift, resolving a conjecture of Benedetti, Chávez and Jiménez.

Authors

Institutions

Publication Details

Journal
Algebraic Combinatorics
Published
2026-04-30
DOI
https://doi.org/10.5802/alco.475
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Characterizing positroid quotients of uniform matroids

Jiyang Gao, Yuxuan Sun, Zhixing Chen, Yumou Fei et al.
Algebraic Combinatorics
Finite Group Theory Research
article

Characterizing positroid quotients of uniform matroids

Jiyang Gao, Yuxuan Sun, Zhixing Chen, Yumou Fei, Yuchong Zhang
article en

Abstract

We study two-step flag positroids <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>P</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>P</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> , where <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>P</mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:math> is a quotient of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>P</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> . We provide a complete characterization of all two-step flag positroids that contain a uniform matroid, extending and completing a partial result by Benedetti, Chávez, and Jiménez. Our characterization reveals that “non-local information” is necessary for characterizing flag positroids. To contrast general positroids with the special case of lattice path matroids, we show that the containment relations of Grassmann necklaces and conecklaces fully characterize flag lattice path matroids, but are insufficient for general flag positroids. Additionally, we prove that the decorated permutations of any elementary quotient pair are related by a cyclic shift, resolving a conjecture of Benedetti, Chávez and Jiménez.

Algebraic CombinatoricsVol. 9(2)
University of Minnesota (US), Harvard University Press (US), Humboldt-Universität zu Berlin (DE), Twin Cities Orthopedics (US), Massachusetts Institute of Technology (US)
National Natural Science Foundation of China, Peking University
Openalex Percentile: Top 5%
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.