排序方式: 共有34条查询结果,搜索用时 15 毫秒
11.
《Discrete Mathematics》2022,345(9):112944
The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for this class. In this note, we will give bijective proofs of three of their results. Two of our bijections answer questions raised in their paper. 相似文献
12.
13.
Éric Fusy 《Discrete Mathematics》2009,309(7):1870-1894
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under the name of regular edge-labelling and consists of two bipolar orientations that are transversal. For this reason, the terminology used here is that of transversal structures. The main results obtained in the article are a bijection between irreducible triangulations and ternary trees, and a straight-line drawing algorithm for irreducible triangulations. For a random irreducible triangulation with n vertices, the grid size of the drawing is asymptotically with high probability 11n/27×11n/27 up to an additive error of . In contrast, the best previously known algorithm for these triangulations only guarantees a grid size (⌈n/2⌉−1)×⌊n/2⌋. 相似文献
14.
We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson's rank. These symmetries are established by direct bijections. 相似文献
15.
L-模糊集的L-模糊映射 总被引:11,自引:12,他引:11
引入L-模糊集的L-模糊映射,L-模糊单射,L-模糊满射及L-模糊双射等概念,并给出了它们的刻画。 相似文献
16.
17.
《Discrete Mathematics》2022,345(6):112855
Given a vertex colouring of the infinite n-ary Cantor tree with m colours (), the natural problem arises: may this colouring induce a bijective colouring of the infinite paths starting at the root, i.e., that every infinite m-coloured string is used for some of these paths but different paths are not coloured identically? In other words, we ask if the above vertex colouring may define a bijective short map between the corresponding Cantor spaces. We show that the answer is positive if and only if , and provide an effective construction of the bijective colouring in terms of Mealy automata and functions defined by such automata. We also show that a finite Mealy automaton may define such a bijective colouring only in the trivial case, i.e. . 相似文献
18.
《Discrete Mathematics》2020,343(2):111650
Building on a bijection of Vandervelde, we enumerate certain unimodal sequences whose alternating sum equals zero. This enables us to refine the enumeration of strict partitions with respect to the number of parts and the BG-rank. 相似文献
19.
Sergi Elizalde 《Journal of Combinatorial Theory, Series A》2007,114(8):1481-1503
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length 2(n−4). This solves the problem of finding a bijective proof of a result of Jonsson for the case k=2. We obtain the bijection by constructing isomorphic generating trees for the sets of 2-triangulations and pairs of non-crossing Dyck paths. 相似文献
20.
Michael La Croix 《Discrete Mathematics》2006,306(18):2251-2256
A combinatorial proof is given of a result of Gessel and Greene relating the sizes of two classes of permutations. A natural map from one class to the other is described in terms of a shared recursive structure. 相似文献