共查询到20条相似文献,搜索用时 31 毫秒
1.
Guillaume Chapuy 《Probability Theory and Related Fields》2010,147(3-4):415-447
A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of given genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the case of labelled unicellular maps, which are related to all rooted maps by Marcus and Schaeffer’s bijection. This gives an immediate derivation of the asymptotic number of unicellular maps of given genus, and a simple bijective proof of a formula of Lehman and Walsh on the number of triangulations with one vertex. From the labelled case, we deduce an expression of the asymptotic number of maps of genus g with n edges involving the ISE random measure, and an explicit characterization of the limiting profile and radius of random bipartite quadrangulations of genus g in terms of the ISE. 相似文献
2.
Olivier Bernardi 《Advances in Applied Mathematics》2012,48(1):164-180
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is simply connected. In a famous article, Harer and Zagier established a formula for the generating function of unicellular maps counted according to the number of vertices and edges. The keystone of their approach is a counting formula for unicellular maps on orientable surfaces with n edges, and with vertices colored using every color in [q] (adjacent vertices are authorized to have the same color). We give an analogue of this formula for general (locally orientable) surfaces.Our approach is bijective and is inspired by Lass?s proof of the Harer-Zagier formula. We first revisit Lass?s proof and twist it into a bijection between unicellular maps on orientable surfaces with vertices colored using every color in [q], and maps with vertex set [q] on orientable surfaces with a marked spanning tree. The bijection immediately implies Harer-Zagier?s formula and a formula by Jackson concerning bipartite unicellular maps. It also shed a new light on constructions by Goulden and Nica, Schaeffer and Vassilieva, and Morales and Vassilieva. We then extend the bijection to general surfaces and obtain a correspondence between unicellular maps on general surfaces with vertices colored using every color in [q], and maps on orientable surfaces with vertex set [q]with a marked planar submap. This correspondence gives an analogue of the Harer-Zagier formula for general surfaces. We also show that this formula implies a recursion formula due to Ledoux for the numbers of unicellular maps with given numbers of vertices and edges. 相似文献
3.
Recently, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes. The formula involves a sum over objects called excited diagrams, and the term corresponding to each excited diagram has hook lengths in the denominator, like the classical hook-length formula due to Frame, Robinson and Thrall. In this paper, we present a simple bijection that proves an equivalent recursive version of Naruse’s result, in the same way that the celebrated hook-walk proof due to Greene, Nijenhuis and Wilf gives a bijective (or probabilistic) proof of the hook-length formula for ordinary shapes.In particular, we also give a new bijective proof of the classical hook-length formula, quite different from the known proofs. 相似文献
4.
Our work is devoted to the bijective enumeration of the set of factorizations of a permutation into m factors with a given number of cycles. Previously, this major problem in combinatorics and its various specializations were considered mainly from the character theoretic or algebraic geometry point of view. Let us specially mention here the works of Harer and Zagier or Kontsevich. In 1988, Jackson reported a very general formula solving this problem. However, to the author’s own admission this result left little room for combinatorial interpretation and no bijective proof of it was known yet. In 2001, Lass found a combinatorial proof of the celebrated special case of Jackson’s formula known as the Harer–Zagier formula. This work was followed by Goulden and Nica, who presented in 2004 another combinatorial proof involving a direct bijection. In the past two years, we have introduced new sets of objects called partitioned maps and partitioned cacti, the enumeration of which allowed us to construct bijective proofs for more general cases of Jackson’s formula. 相似文献
5.
We consider maps on orientable surfaces. A map is called unicellular if it has a single face. A covered map is a map (of genus g) with a marked unicellular spanning submap (which can have any genus in {0,1,…,g}). Our main result is a bijection between covered maps with n edges and genus g and pairs made of a plane tree with n edges and a unicellular bipartite map of genus g with n+1 edges. In the planar case, covered maps are maps with a marked spanning tree and our bijection specializes into a construction obtained by the first author in Bernardi (2007) [4].Covered maps can also be seen as shuffles of two unicellular maps (one representing the unicellular submap, the other representing the dual unicellular submap). Thus, our bijection gives a correspondence between shuffles of unicellular maps, and pairs made of a plane tree and a unicellular bipartite map. In terms of counting, this establishes the equivalence between a formula due to Harer and Zagier for general unicellular maps, and a formula due to Jackson for bipartite unicellular maps.We also show that the bijection of Bouttier, Di Francesco and Guitter (2004) [8] (which generalizes a previous bijection by Schaeffer, 1998 [33]) between bipartite maps and so-called well-labeled mobiles can be obtained as a special case of our bijection. 相似文献
6.
Victor J.W. Guo 《Discrete Mathematics》2008,308(9):1756-1759
We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which also leads to a double-sum extension of the q-Chu-Vandermonde formula. 相似文献
7.
Kevin Purbhoo 《Journal of Algebraic Combinatorics》2008,28(4):461-480
We define mosaics, which are naturally in bijection with Knutson-Tao puzzles. We define an operation on mosaics, which shows
they are also in bijection with Littlewood-Richardson skew-tableaux. Another consequence of this construction is that we obtain
bijective proofs of commutativity and associativity for the ring structures defined either of these objects. In particular,
we obtain a new, easy proof of the Littlewood-Richardson rule. Finally we discuss how our operation is related to other known
constructions, particularly jeu de taquin. 相似文献
8.
A few years ago, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes, both straight and shifted. The formula involves a sum over objects called excited diagrams, and the term corresponding to each excited diagram has hook lengths in the denominator, like the classical hook-length formula due to Frame, Robinson and Thrall.Recently, the formula for skew straight shapes was proved by the author via a simple bumping algorithm. The aim of this paper is to extend this result to skew shifted shapes. Since straight skew shapes are special cases of skew shifted shapes, this is a bijection that proves the whole family of hook-length formulas, and is also the simplest known bijective proof for shifted (non-skew) shapes. The complexity of the algorithm is studied, and a weighted generalization of Naruse’s formula is also presented. 相似文献
9.
Olivier Bernardi 《Journal of Combinatorial Theory, Series A》2007,114(5):931-956
We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i,j?0 and made of West, South and North-East steps. In 1965, Germain Kreweras discovered a remarkably simple formula giving the number of these walks (with prescribed length and endpoint). Kreweras' proof was very involved and several alternative derivations have been proposed since then. But the elegant simplicity of the counting formula remained unexplained. We give the first purely combinatorial explanation of this formula. Our approach is based on a bijection between Kreweras walks and triangulations with a distinguished spanning tree. We obtain simultaneously a bijective way of counting loopless triangulations. 相似文献
10.
Touchard–Riordan-like formulas are certain expressions appearing in enumeration problems and as moments of orthogonal polynomials. We begin this article with a new combinatorial approach to prove such formulas, related to integer partitions. This gives a new perspective on the original result of Touchard and Riordan. But the main goal is to give a combinatorial proof of a Touchard–Riordan-like formula for q-secant numbers discovered by the first author. An interesting limit case of these objects can be directly interpreted in terms of partitions, so that we obtain a connection between the formula for q-secant numbers, and a particular case of Jacobi’s triple product identity. Building on this particular case, we obtain a “finite version” of the triple product identity. It is in the form of a finite sum which is given a combinatorial meaning, so that the triple product identity can be obtained by taking the limit. Here the proof is non-combinatorial and relies on a functional equation satisfied by a T-fraction. Then from this result on the triple product identity, we derive a whole new family of Touchard–Riordan-like formulas whose combinatorics is not yet understood. Eventually, we prove a Touchard–Riordan-like formula for a q-analog of Genocchi numbers, which is related with Jacobi’s identity for (q;q)3 rather than the triple product identity. 相似文献
11.
Consider a combinatorial identity that can be proved by induction. In this paper, we describe a general method for translating the inductive proof into a recursive bijection. Furthermore, we will demonstrate that the resulting recursive bijection can often be defined in a direct, non-recursive way. Thus, the translation method often results in a bijective proof of the identity that helps illuminate the underlying combinatorial structures. This paper has two main parts: First, we describe the translation method and the accompanying Maple code; and second, we give a few examples of how the method has been used to discover new bijections. 相似文献
12.
The notion of an asymptotic bijection is introduced and used to give bijective proofs of infinite summation formulas for set partitions (Dobinski's formula) and involutions. 相似文献
13.
J.B. Remmel 《Linear and Multilinear Algebra》1982,11(1):45-100
We give a bijective proof of a formula due independently to Frobenius and Young for the number of standard Young tableau of shape λ for λ any partition. Frame, Robinson, and Thrall derived their hook formula for the number of standard Young tableau from the Frobenius-Young formula. As a corollary to our bijective proof of the Frobenius-Young formula, we also give a bijective proof of the Frame-Robinson-Thrall hook formula. 相似文献
14.
《Discrete Mathematics》2020,343(9):111983
Tiered trees were introduced by Dugan–Glennon–Gunnells–Steingrímsson as a generalization of intransitive trees that were introduced by Postnikov, the latter of which have exactly two tiers. Tiered trees arise naturally in counting the absolutely indecomposable representations of certain quivers, and enumerating torus orbits on certain homogeneous varieties over finite fields. By employing generating function arguments and geometric results, Dugan et al. derived an elegant formula concerning the enumeration of tiered trees, which is a generalization of Postnikov’s formula for intransitive trees. In this paper, we provide a bijective proof of this formula by establishing a bijection between tiered trees and certain rooted labeled trees. As an application, our bijection also enables us to derive a refinement of the enumeration of tiered trees with respect to level of the node 1. 相似文献
15.
We present a simple bijection between Baxter permutations of size n and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutations into natural parameters of orientations, and has remarkable symmetry properties. By specialising it to Baxter permutations avoiding the pattern 3142, we obtain a bijection with non-separable planar maps, which had been described only in an implicit recursive manner so far (up to simple symmetries). A further specialization yields a bijection between permutations avoiding 3142 and 2413 and series-parallel maps. 相似文献
16.
Recently, Hillman and Grassl gave a bijective proof for the generating function for the number of reverse plane partitions of a fixed shape λ. We give another bijective proof for this generating function via completelv different methods. Our bijection depends on a lattice path coding of reverse plane partitions and a new method for constructing bisections out of certain pairs of involutions due to Garsia and Milne. 相似文献
17.
Recently, Hillman and Grassl gave a bijective proof for the generating function for the number of reverse plane partitions of a fixed shape λ. We give another bijective proof for this generating function via completelv different methods. Our bijection depends on a lattice path coding of reverse plane partitions and a new method for constructing bisections out of certain pairs of involutions due to Garsia and Milne. 相似文献
18.
M. Kuba 《Discrete Mathematics》2008,308(4):529-540
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive trees and permutations, which relates the arising edge-weights in recursive trees with inversions of the corresponding permutations. Using this bijection we obtain exact and limiting distribution results for the number of permutations of size n, where exactly m elements have j inversions. Furthermore we analyze the distribution of the sum of labels of the elements, which have exactly j inversions, where we can identify Dickman's infinitely divisible distribution as the limit law. Moreover we give a distributional analysis of weighted depths and weighted distances in edge-weighted recursive trees. 相似文献
19.
Kevin W.J Kadell 《Journal of Combinatorial Theory, Series A》1985,40(1):22-44
We give a family of weighted inversion numbers with the same generating function which interpolate between the inversion number and MacMahon's major index. Foata's bijection is obtained in a natural way from a simple involution. An alternative proof uses q-difference equations which yield some new results. We obtain a new generating function for restricted growth functions and two q-analogs of a formula for the number of standard Young tableaux of a given shape. While the first really goes back to MacMahon, the second uses one of our weighted inversion numbers and appears to be new. 相似文献
20.
Jeffrey B Remmel 《Journal of Combinatorial Theory, Series A》1982,33(3):273-286
A bijective proof of a general partition theorem is given which has as direct corollaries many classical partition theorems due to Euler, Glaisher, Schur, Andrews, Subbarao, and others. It is shown that the bijective proof specializes to give bijective proofs of these classical results and moreover the bijections which result often coincide with bijections which have occurred in the literature. Also given are some sufficient conditions for when two classes of words omitting certain sequences of words are in bijection. 相似文献