English
Related papers

Related papers: Dyck Paths and Positroids from Unit Interval Order…

200 papers

A rational Dyck path of type $(m,d)$ is an increasing unit-step lattice path from $(0,0)$ to $(m,d) \in \mathbb{Z}^2$ that never goes above the diagonal line $y = (d/m)x$. On the other hand, a positroid of rank $d$ on the ground set $[d+m]$…

Combinatorics · Mathematics 2017-07-03 Felix Gotti

A positroid is a special case of a realizable matroid, that arose from the study of totally nonnegative part of the Grassmannian by Postnikov. Postnikov demonstrated that positroids are in bijection with certain interesting classes of…

Combinatorics · Mathematics 2018-07-31 Robert Mcalmon , SuHo Oh

For each positive integer $k$, we consider five well-studied posets defined on the set of Dyck paths of semilength $k$. We prove that uniquely sorted permutations avoiding various patterns are equinumerous with intervals in these posets.…

Combinatorics · Mathematics 2020-03-13 Colin Defant

The Catalan numbers form a sequence that counts over 200 combinatorial objects. A remarkable property of the Catalan numbers, which extends to these objects, is its recursive definition; that is, we can determine the $n^{th}$ object from…

Combinatorics · Mathematics 2022-03-09 Jan Tracy Camacho

A positroid is a special case of a realizable matroid that arose from the study of the totally nonnegative part of the Grassmannian by Postnikov. In this paper, we study the facets of its matroid polytope and the independent set polytope.…

Combinatorics · Mathematics 2021-08-17 Suho Oh , David Xiang

There are two bijections from unit interval orders on $n$ elements to Dyck paths from $(0,0)$ to $(n,n)$. One is to consider the pairs of incomparable elements, which form the set of boxes between some Dyck path and the diagonal. Another is…

Combinatorics · Mathematics 2022-12-26 Félix Gélinas , Adrien Segovia , Hugh Thomas

A positroid is a matroid defined by Postnikov to study the cells in the non-negative part of the Grassmannian. They are in bijection with decorated permutations. We show a way to explain contraction and restriction of positroids in terms of…

Combinatorics · Mathematics 2013-11-26 Suho Oh

Given a permutation $f$, we study the positroid Catalan number $C_f$ defined to be the torus-equivariant Euler characteristic of the associated open positroid variety. We introduce a class of repetition-free permutations and show that the…

Combinatorics · Mathematics 2021-04-13 Pavel Galashin , Thomas Lam

Positroids are a family of matroids introduced by Postnikov in the study of non-negative Grassmannians. Postnikov identified several combinatorial objects in bijections with positroids, among which are bounded affine permutations. On the…

Combinatorics · Mathematics 2024-12-03 Fatemeh Mohammadi , Francesca Zaffalon

Positroids are families of matroids introduced by Postnikov in the study of non-negative Grassmannians. In particular, positroids enumerate a CW decomposition of the totally non-negative Grassmannian. Furthermore, Postnikov has identified…

Combinatorics · Mathematics 2025-09-10 Susama Agarwala , Fatemeh Mohammadi , Francesca Zaffalon

Using Postnikov's Le-diagrams, decorated permutations, and Grassmann necklaces, we classify which positroids are sparse paving matroids. This allows us to enumerate sparse paving positroids, making connections to a known sequence involving…

Combinatorics · Mathematics 2025-11-17 John Machacek , George D. Nasr

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…

Algebraic Geometry · Mathematics 2015-08-11 Nicolas Ford

We introduce flag positroid pipe dreams (FPPs), whose role in the study of complete flag positroids is analogous to the role of Le-diagrams in the study of positroids. We develop the combinatorics of these diagrams and highlight some of…

Combinatorics · Mathematics 2026-05-26 Williem Rizer , Martha Yip

Positroids are certain representable matroids originally studied by Postnikov in connection with the totally nonnegative Grassmannian and now used widely in algebraic combinatorics. The positroids give rise to determinantal equations…

Combinatorics · Mathematics 2022-07-15 Sara C. Billey , Jordan E. Weaver

Positroids are certain representable matroids originally studied by Postnikov in connection with the totally nonnegative Grassmannian and now used widely in algebraic combinatorics. The positroids give rise to determinantal equations…

Combinatorics · Mathematics 2022-04-20 Sara C. Billey , Jordan E. Weaver

Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroid. We prove his conjecture that a positroid is exactly an intersection of…

Combinatorics · Mathematics 2010-10-12 Suho Oh

Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope classes, by their Grassmann necklaces. We give an explicit…

Combinatorics · Mathematics 2025-01-28 Jeremy Quail , Puck Rombach

We discuss the combinatorics of decorated Dyck paths and decorated parallelogram polyominoes, extending to the decorated case the main results of both [Haglund 2004] and [Aval et al. 2014]. This settles in particular the cases…

Combinatorics · Mathematics 2022-06-02 Michele D'Adderio , Alessandro Iraci , Anna Vanden Wyngaerd

Skew shaped positroids (or skew shaped positroid varieties) are certain Richardson varieties in the flag variety that admit a realization as explicit subvarieties of the Grassmannian $\mathrm{Gr}(k,n)$. They are parametrized by a pair of…

Algebraic Geometry · Mathematics 2025-03-10 Eugene Gorsky , Soyeon Kim , Tonie Scroggin , José Simental

We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the "Catalan matroid" C_n. We describe this matroid in detail; among several other results, we show that C_n is self-dual, it is representable…

Combinatorics · Mathematics 2007-05-23 Federico Ardila
‹ Prev 1 2 3 10 Next ›