English
Related papers

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

200 papers

Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3]. In the paper we enumerate the terms of the OEIS A036991, Dyck numbers, and construct a…

Combinatorics · Mathematics 2023-02-07 Gennady Eremin

The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle structure is amenable to complete analysis. In particular, each…

Combinatorics · Mathematics 2007-05-23 David Callan

We characterise the permutations pi such that the elements in the closed lower Bruhat interval [id,pi] of the symmetric group correspond to non-taking rook configurations on a skew Ferrers board. It turns out that these are exactly the…

Combinatorics · Mathematics 2007-05-23 Jonas Sjostrand

In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…

Combinatorics · Mathematics 2023-10-24 Juan B. Gil , Jessica A. Tomasko

Catalan numbers and their interpretations in terms of Dyck paths are widely used in different topics of applied mathematics and computer science. Here, we consider a general approach for constrained Dyck paths. In particular, we study Dyck…

Discrete Mathematics · Computer Science 2026-05-06 Antonio Bernini , Stefano Bilotta , Elisa Pergola

We focus on a family of subsets $(\F^p_n)_{p\geq 2}$ of Dyck paths of semilength $n$ that avoid the patterns $DUU$ and $D^{p+1}$, which are enumerated by the generalized Fibonacci numbers. We endow them with the partial order relation…

Combinatorics · Mathematics 2024-11-27 Jean-Luc Baril , Nathanaël Hassler

Caffrey, Egge, Michel, Rubin and Ver Steegh recently introduced snow leopard permutations, which are the anti-Baxter permutations that are compatible with the doubly alternating Baxter permutations. Among other things, they showed that…

Combinatorics · Mathematics 2023-06-22 Eric S. Egge , Kailee Rubin

The Grassmannian is a disjoint union of open positroid varieties $P_v$, certain smooth irreducible subvarieties whose definition is motivated by total positivity. The coordinate ring of $P_v$ is a cluster algebra, and each reduced plabic…

Combinatorics · Mathematics 2022-01-07 Chris Fraser , Melissa Sherman-Bennett

We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as vertical strip --- in particular, unicellular LLT polynomials. We show that there are parallel…

Combinatorics · Mathematics 2018-09-26 Per Alexandersson , Greta Panova

Let (U \subset {\mathbb R}^3) be an open set and (f:U \to f(U) \subset {\mathbb R}^3) be a homeomorphism. Let (p \in U) be a fixed point. It is known that, if (\{p\}) is not an isolated invariant set, the sequence of the fixed point indices…

Dynamical Systems · Mathematics 2014-02-26 Patrice Le Calvez , Francisco R. Ruiz del Portal , José M. Salazar

We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…

Computational Geometry · Computer Science 2024-02-22 Justin Dallant

In this paper, we consider the unit graph $G(\mathbb{Z}_{n})$, where $n=p_{1}^{n_{1}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}}p_{3}^{n_{3}}$ and $p_{1}, p_{2}, p_{3}$ are distinct primes. For any prime…

Rings and Algebras · Mathematics 2024-09-01 Rupali S. Jain , B. Surendranath Reddy , Wajid M. Shaikh

We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…

Combinatorics · Mathematics 2024-06-25 Manosij Ghosh Dastidar , Michael Wallner

We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…

Algebraic Geometry · Mathematics 2024-10-08 Pierrette Cassou-Noguès , Daniel Daigle

A floorplan is a tiling of a rectangle by rectangles. There are natural ways to order the elements---rectangles and segments---of a floorplan. Ackerman, Barequet and Pinter studied a pair of orders induced by neighborhood relations between…

Combinatorics · Mathematics 2025-04-11 Andrei Asinowski , Gill Barequet , Mireille Bousquet-Mélou , Toufik Mansour , Ron Pinter

For fixed non-negative integers $k$, $t$, and $n$, with $t < k$, a $k_t$-Dyck path of length $(k+1)n$ is a lattice path that starts at $(0, 0)$, ends at $((k+1)n, 0)$, stays weakly above the line $y = -t$, and consists of steps from the…

Combinatorics · Mathematics 2023-07-25 Clemens Heuberger , Sarah J. Selkirk , Stephan Wagner

An extension of an induced path $P$ in a graph $G$ is an induced path $P'$ such that deleting the endpoints of $P'$ results in $P$. An induced path in a graph is said to be avoidable if each of its extensions is contained in an induced…

Combinatorics · Mathematics 2021-10-22 Vladimir Gurvich , Matjaž Krnc , Martin Milanič , Mikhail Vyalyi

For a composition $\lambda$ of $n$ we consider the Kazhdan-Lusztig cell in the symmetric group $S_n$ containing the longest element of the standard parabolic subgroup of $S_n$ associated to $\lambda$. In this paper we extend some of the…

Representation Theory · Mathematics 2019-09-05 T. P. McDonough , C. A. Pallikaros

We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering…

Combinatorics · Mathematics 2019-10-02 Antonio Bernini , Matteo Cervetti , Luca Ferrari , Einar Steingrimsson

We consider the set of alternating paths on a fixed fully packed loop of size n. This set is in bijection with the set of fully packed loops of size n. Furthermore, for a special choice of fully packed loop, we demonstrate that the set of…

Combinatorics · Mathematics 2013-01-08 Stephen Ng