Related papers: Enumerations and Bijections for Stanley Polyominoe…
A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…
Stanley decompositions are used in invariant theory and the theory of normal forms for dynamical systems to provide a unique way of writing each invariant as a polynomial in the Hilbert basis elements. Since the required Stanley…
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
This paper explores the number of parallelograms that appear in a billiard path that enters one corner of a rectangle and leaves a second corner of a rectangle as a function of the normalized dimensions of the rectangle.
These are (mostly) expository notes for lectures on affine Stanley symmetric functions given at the Fields Institute in 2010. We focus on the algebraic and combinatorial parts of the theory. The notes contain a number of exercises and open…
A bargraph is a self-avoiding lattice path with steps $U=(0,1)$, $H=(1,0)$ and $D=(0,-1)$ that starts at the origin and ends on the $x$-axis, and stays strictly above the $x$-axis everywhere except at the endpoints. Bargraphs have been…
We present an equivariant bijection between two actions--promotion and rowmotion--on order ideals in certain posets. This bijection simultaneously generalizes a result of R. Stanley concerning promotion on the linear extensions of two…
This paper solves the combinatorics relating the intersection theory of $\psi$-classes of Hassett spaces to that of $\overline{\mathcal{M}}_{g,n}$. A generating function for intersection numbers of $\psi$ classes on all Hassett spaces is…
We present a simple a bijection between permutations of $\{1,..., n\}$ with $k$ descents and permutation tableaux of length $n$ with $k$ columns.
In this paper, we consider several combinatorial problems whose enumeration leads to the odd-indexed Fibonacci numbers, including certain types of Dyck paths, block fountains, directed column-convex polyominoes, and set partitions with no…
Arnol'd proved in 1992 that Springer numbers enumerate the Snakes, which are type $B$ analogs of alternating permutations. Chen, Fan and Jia in 2011 introduced the labeled ballot paths and established a ``hard'' bijection with snakes.…
The Springer numbers are defined in connection with the irreducible root systems of type $B_n$, which also arise as the generalized Euler and class numbers introduced by Shanks. Combinatorial interpretations of the Springer numbers have…
For integers m, n $\ge$ 1, we describe a bijection sending dissections of the (mn + 2)-regular polygon into (m + 2)-sided polygons to a new basis of the quotient of the polynomial algebra in mn variables by an ideal generated by some kind…
This paper contains a description of a connection between the matching arrangement and the matching polyhedron. A bijection between regions of the matching arragement and LP-orientations of the matching polyhedron is constructed. This…
Another bijective proof of Stanley's hook-content formula for the generating function for semistandard tableaux of a given shape is given that does not involve the involution principle of Garsia and Milne. It is the result of a merge of the…
A permutation can be locally classified according to the four local types: peaks, valleys, double rises and double falls. The corresponding classification of binary increasing trees uses four different types of nodes. Flajolet demonstrated…
The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior…
Consider these two distinct combinatorial objects: (1) the necklaces of length $n$ with at most $q$ colors, and (2) the multisets of integers modulo $n$ with subset sum divisible by $n$ and with the multiplicity of each element being…
We establish a bijection between $01$-fillings of stack polyominoes with at most one $1$ per column and labelings of the corners along the top-right border of stack polyominoes. These labellings indicate the lengths of the longest…
We explore a combinatorial bijection between two seemingly unrelated topics: the roots of irreducible polynomials of degree $m$ over a finite field $F_p$ for a prime number $p$ and the number of points that are periodic of order $m$ for a…