中文
相关论文

相关论文: Three interacting families of Fuss-Catalan posets

200 篇论文

We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…

组合数学 · 数学 2022-04-11 Camille Combe , Samuele Giraudo

The Fuss-Catalan numbers are a generalization of the Catalan numbers. They enumerate a large class of objects and in particular m-Dyck paths and m+1-ary trees. Recently, F. Bergeron defined an analogue for generic m of the Tamari order on…

组合数学 · 数学 2014-06-09 Jean-Christophe Novelli

We introduce new partial order structures on the underlying sets of free nonsymmetric operads. These posets involve decorated ordered rooted trees, and their terminal intervals are lattices. These lattices are not graded, not self-dual, and…

组合数学 · 数学 2025-07-04 Samuele Giraudo

Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…

q-alg · 数学 2008-02-03 Elisa Ercolessi , Giovanni Landi , Paulo Teotonio-Sobrinho

We introduce a novel combinatorial structure called pointed building sets, which can be viewed as families of lattices equipped with compatibility relations. To each pointed building set $\mathsf{B}$, we associate a complete lattice…

组合数学 · 数学 2026-02-06 Andrew Sack

For positive integers $m$ and $k$, we introduce a family of lattices $\mathcal{C}_{k}^{(m)}$ associated to the Cambrian lattice $\mathcal{C}_{k}$ of the dihedral group $I_{2}(k)$. We show that $\mathcal{C}_{k}^{(m)}$ satisfies some basic…

组合数学 · 数学 2014-08-13 Myrto Kallipoliti , Henri Mühle

The three main objects in noncrossing Catalan combinatorics associated to a finite Coxeter system are noncrossing partitions, clusters, and sortable elements. The first two of these have known Fuss-Catalan generalizations. We provide new…

组合数学 · 数学 2018-10-30 Christian Stump , Hugh Thomas , Nathan Williams

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

组合数学 · 数学 2020-05-19 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

Let W be a finite crystallographic reflection group. The generalized Catalan number of W coincides both with the number of clusters in the cluster algebra associated to W, and with the number of noncrossing partitions for W. Natural…

表示论 · 数学 2011-06-15 Aslak Bakke Buan , Idun Reiten , Hugh Thomas

For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…

We present an exposition on the Fuss--Catalan numbers, which are a generalization of the well known Catalan numbers. The literature on the subject is scattered (especially for the case of multiple independent parameters, as will be…

组合数学 · 数学 2024-12-17 S. R. Mane

Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded…

组合数学 · 数学 2008-12-15 Andrey O. Matveev

We introduce Cayley posets as posets arising naturally from pairs $S<T$ of semigroups, much in the same way that Cayley graph arises from a (semi)group and a subset. We show that Cayley posets are a common generalization of several known…

组合数学 · 数学 2019-08-27 Ignacio García-Marco , Kolja Knauer , Guillaume Mercui-Voyant

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

环与代数 · 数学 2021-03-24 Ivan Chajda , Helmut Länger

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

组合数学 · 数学 2025-04-15 Christoph Minz

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

组合数学 · 数学 2007-05-23 Miklós Bóna , Rodica Simion

I present an overview of the research I have conducted for the past ten years in algebraic, bijective, enumerative, and geometric combinatorics. The two main objects I have studied are the permutahedron and the associahedron as well as the…

组合数学 · 数学 2023-10-20 Viviane Pons

We investigate representations of *-algebras associated with posets. Unitarizable representations of the corresponding (bound) quivers (which are polystable representations for some appropriately chosen slope function) give rise to…

表示论 · 数学 2012-07-12 Thorsten Weist , Kostyantyn Yusenko

In this article we introduce the $m$-cover poset of an arbitrary bounded poset $\mathcal{P}$, which is a certain subposet of the $m$-fold direct product of $\mathcal{P}$ with itself. Its ground set consists of multichains of $\mathcal{P}$…

组合数学 · 数学 2016-07-27 Myrto Kallipoliti , Henri Mühle

The Catalan numbers are well-known to be the answer to many different counting problems, and so there are many different families of sets whose cardinalities are the Catalan numbers. We show how such a family can be given the structure of a…

范畴论 · 数学 2019-07-08 Mitchell Buckley , Richard Garner , Stephen Lack , Ross Street
‹ 上一页 1 2 3 10 下一页 ›