English
Related papers

Related papers: Parallelogram polyominoes, partially labelled Dyck…

200 papers

The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…

Combinatorics · Mathematics 2022-03-31 François Bergeron , Mikhail Mazin

A Leavitt labelled path algebra over a commutative unital ring is associated with a labelled space, generalizing Leavitt path algebras associated with graphs and ultragraphs as well as torsion-free commutative algebras generated by…

Rings and Algebras · Mathematics 2021-06-14 Giuliano Boava , Gilles G. de Castro , Daniel Gonçalves , Daniel W. van Wyk

In The Delta Conjecture (arxiv:1509.07058), Haglund, Remmel and Wilson introduced a four variable $q,t,z,w$ Catalan polynomial, so named because the specialization of this polynomial at the values $(q,t,z,w) = (1,1,0,0)$ is equal to the…

Combinatorics · Mathematics 2018-10-10 Mike Zabrocki

Bargraphs are a special class of convex polyominoes. They can be identified with lattice paths with unit steps north, east, and south that start at the origin, end on the $x$-axis, and stay strictly above the $x$-axis everywhere except at…

Combinatorics · Mathematics 2017-05-18 Emeric Deutsch , Sergi Elizalde

The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…

Combinatorics · Mathematics 2019-03-04 Carolyn Chun , Iain Moffatt , Steven D. Noble , Ralf Rueckriemen

We obtain new combinatorial formulae for modified Hall--Littlewood polynomials, for matrix elements of the transition matrix between the elementary symmetric functions and Hall-Littlewood's ones, and for the number of rational points over…

Quantum Algebra · Mathematics 2007-05-23 Anatol N. Kirillov

The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied. Results are proved…

Combinatorics · Mathematics 2023-06-22 Andrei Asinowski , Benjamin Hackl , Sarah J. Selkirk

We announce a series of results on the combinatorial study of the q-Catalan triangle (C_{n,k}(q)), defined by C_{n,0}(q)=q^{n(n-1)/2} and C_{n,k}(q)=C_{n,k-1}(q)+q^{n-k-1}C_{n-1,k}(q). We establish combinatorial interpretations via a…

Combinatorics · Mathematics 2026-05-15 Youssouf Wirdane

In the context of the shuffle theorem, many classical integer sequences appear with a natural refinement by two statistics $q$ and $t$: for example the Catalan and Schr\"oder numbers. In particular, the bigraded Hilbert series of diagonal…

Combinatorics · Mathematics 2024-03-29 Sylvie Corteel , Matthieu Josuat-Vergès , Anna Vanden Wyngaerd

In a 2016 ArXiv posting F. Bergeron listed a variety of symmetric functions $G[X;q]$ with the property that $G[X;1+q]$ is $e$-positive. A large subvariety of his examples could be explained by the conjecture that the Dyck path LLT…

Combinatorics · Mathematics 2019-04-18 Adriano M. Garsia , James Haglund , Dun Qiu , Marino Romero

Parallelogram polyominoes are a subclass of convex polyominoes in the square lattice that has been studied extensively in the literature. Recently congruence classes of convex polyominoes with respect to rotations and reflections have been…

Combinatorics · Mathematics 2007-05-23 Pierre Leroux , Etienne Rassart

Stanley polyominoes are a subclass of parallelogram polyominoes in which each row begins strictly to the right of the beginning of the previous row and ends strictly to the right of the end of the previous row. In this paper, we derive…

Combinatorics · Mathematics 2026-04-15 Jean-Luc Baril , Aubrey Blecher , José Luis ramírez

Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by…

Combinatorics · Mathematics 2008-12-03 Robert Cori

The double Dyck path algebra $\mathbb{A}_{q,t}$ and its polynomial representation first arose as a key figure in the proof of the celebrated Shuffle Theorem of Carlsson and Mellit. A geometric formulation for an equivalent algebra…

Representation Theory · Mathematics 2023-11-30 Nicolle González , Eugene Gorsky , José Simental

Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…

Combinatorics · Mathematics 2021-11-19 Jiangdong Ai , Stefanie Gerke , Gregory Gutin , Yacong Zhou

Symmetric Dyck tilings and ballot tilings are certain tilings in the region surrounded by two ballot paths. We study the relations of combinatorial objects which are bijective to symmetric Dyck tilings such as labeled trees, Hermite…

Combinatorics · Mathematics 2020-11-17 Keiichi Shigechi

In a recent paper [J. Combin. Theory Ser. B}, 113 (2015), pp. 1-17], the authors have extended the concept of quadrangulation of a surface to higher dimension, and showed that every quadrangulation of the $n$-dimensional projective space…

Combinatorics · Mathematics 2018-06-19 Tomáš Kaiser , Matěj Stehlík

We define two symmetric $q,t$-Catalan polynomials in terms of the area and depth statistic and in terms of the dinv and dinv of depth statistics. We prove symmetry using an involution on plane trees. The same involution proves symmetry of…

Combinatorics · Mathematics 2022-08-12 Joseph Pappe , Digjoy Paul , Anne Schilling

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…

Combinatorics · Mathematics 2007-05-23 Andrei Asinowski , Toufik Mansour

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

Combinatorics · Mathematics 2008-12-16 Jun Ma , Yeong-Nan Yeh