相关论文: Arrays and the octahedron recurrence
Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…
We define a number of new combinatorial operations on skew semistandard domino tableaux, which together with constructions introduced earlier by C. Carre and B. Leclerc, define an elegant structure on the set of these tableaux, that closely…
We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…
We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…
Baxter permutations originally arose in studying common fixed points of two commuting continuous functions. In 2015, Dilks proposed a conjectured bijection between Baxter permutations and non-intersecting triples of lattice paths in terms…
By the geometric Satake correspondence, the number of components of certain fibres of the affine Grassmannian convolution morphism equals the tensor product multiplicity for representations of the Langlands dual group. On the other hand, in…
Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…
We present a bijection between vacillating tableaux and pairs consisting of a standard Young tableau and an orthogonal Littlewood-Richardson tableau for the special orthogonal group $\mathrm{SO}(2k+1)$. This bijection is motivated by the…
This paper is motivated by the interplay between the Tamari lattice, J.-L. Loday's realization of the associahedron, and J.-L. Loday and M. Ronco's Hopf algebra on binary trees. We show that these constructions extend in the world of…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…
This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…
The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines…
Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We present bijections for the planar cases of two counting formulas on maps that arise from the KP hierarchy (Goulden-Jackson and Carrell-Chapuy formulas), relying on a "cut-and-slide" operation. This is the first time a bijective proof is…
We study the hive model of gl(n) tensor products, following Knutson, Tao, and Woodward. We define a coboundary category where the tensor product is given by hives and where the associator and commutor are defined using a modified octahedron…