The rank enumeration of certain parabolic non-crossing partitions
نویسندگان
چکیده
We consider $m$-divisible non-crossing partitions of $\{1,2,\ldots,mn\}$ with the property that for some $t\leq n$ no block contains more than one first $t$ integers. give a closed formula number multi-chains such prescribed blocks. Building on this result, we compute Chapoton's $M$-triangle in setting and conjecture combinatorial interpretation $H$-triangle. This is proved $m=1$.
منابع مشابه
Asymptotic enumeration of non-crossing partitions on surfaces
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface Σ and introduce the number CΣ(n) of noncrossing partitions of a set of n points laying on the boundary of Σ. Our main result is an asymptotic estimate for CΣ(n). The proofs use bijective techniques arising from map enumeration, joint with the symbolic method and singul...
متن کاملA bijection between certain non-crossing partitions and sequences
We present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks such that no block contains two consecutive integers, and the set of sequences {si}n1 such that 1 ≤ si ≤ i, and if si = j, then si−r ≤ j − r for 1 ≤ r ≤ j − 1.
متن کاملEnumeration of 1- and 2-crossing Partitions with Refinements
An enumeration of the 1-crossing partitions of [n] into k blocks by bijection with ordered trees with n edges, k internal nodes, and root degree j = 4 is presented. A semi-bijection of these ordered trees to Dyck paths of semilength n, k peaks, and j = 4 last peak height is used to derive a conjectured formula for the number of 1-crossing partitions of [n] with k blocks. We also explore some na...
متن کاملSimply Generated Non-Crossing Partitions
We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing partitions with constraints on their block sizes. Our main tool is a bijection between non-crossing partitions and plane trees, which maps such simply generated non-c...
متن کاملPositroids and Non-crossing Partitions
We investigate the role that non-crossing partitions play in the study of positroids, a class of matroids introduced by Postnikov. We prove that every positroid can be constructed uniquely by choosing a non-crossing partition on the ground set, and then freely placing the structure of a connected positroid on each of the blocks of the partition. This structural result yields several combinatori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2022
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.219