Related papers: Bijective proofs for Eulerian numbers of types B a…
A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any…
The n-th Delannoy number and the n-th Schr\"oder number given by $D_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}$ and $S_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}/(k+1)$ respectively arise naturally from enumerative combinatorics. Let p be an…
Using Reiner's definition of Stirling numbers of type B of the second kind, we provide a 'balls into urns' approach for proving a generalization of a well-known identity concerning the classical Stirling numbers of the second kind:…
We introduce sub-Eulerian polynomials to count elements of $D_n$ by which a recurrence relation for the Eulerian polynomials of type $D$ is obtained.
Let $B$ be a ring, not necessarily commutative, having an involution $*$ and let ${\mathrm U}_{2m}(B)$ be the unitary group of rank $2m$ associated to a hermitian or skew hermitian form relative to $*$. When $B$ is finite, we construct a…
We present a method, illustrated by several examples, to find explicit counts of permutations containing a given multiset of three letter patterns. The method is recursive, depending on bijections to reduce to the case of a smaller…
An identity for binomial symbols modulo an odd positive integer $n$ relating to the least prime factor of $n$ is proved. The identity is discussed within the context of Pell conics.
The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…
We express the N\"{o}rlund polynomials in terms of the second-order Eulerian numbers. Based on this expression, we derive several identities related to the Bernoulli numbers. In particular, we present a short proof of the problem raised by…
We give direct bijective proofs of the symmetry of the distributions of the number of ascents and descents over standard Young tableaux of shape $\lambda$, where $\lambda$ is a rectangle $(n,n,\dots,n)$ or a truncated staircase…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…
Motivated by juggling sequences and bubble sort, we examine permutations on the set {1,2,...,n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive…
We introduce a method that produces a bijection between the posets ${\rm silt-}{A}$ and ${\rm silt-}{B}$ formed by the isomorphism classes of basic silting complexes over finite-dimensional $k$-algebras $A$ and $B$, by lifting $A$ and $B$…
In this paper, we confirm six conjectures on the exact values of some permanents, relating them to the Genocchi numbers of the first and second kinds as well as the Euler numbers. For example, we prove that…
We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…
We prove an enumerative formula for the algebraic Euler characteristic of Brill-Noether varieties, parametrizing degree d and rank r linear series on a general genus g curve, with ramification profiles specified at up to two general points.…
We consider pairs of a set-valued column-strict tableau and a reverse plane partition of the same shape. We introduce algortithms for them, which implies a bijective proof for the finite sum Cauchy identity for Grothendieck polynomials and…
We prove a "decomposition lemma" that allows us to count preimages of certain sets of permutations under West's stack-sorting map $s$. As a first application, we give a new proof of Zeilberger's formula for the number of 2-stack-sortable…
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can find many subsequent bijective proofs of this fact. It turns…