scholarly journals A bijection between noncrossing and nonnesting partitions of types A and B

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Ricardo Mamede
Keyword(s):  
Type A ◽  
Binomial Coefficient ◽  
Catalan Number ◽  
Noncrossing Partitions ◽  
Il Y A ◽  
International Audience

International audience The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{ n+1} \binom{2n}{n}$ when $\Psi =A_{n-1}$, and the binomial coefficient $\binom{2n}{n}$ when $\Psi =B_n$, and these numbers coincide with the correspondent number of nonnesting partitions. For type $A$, there are several bijective proofs of this equality; in particular, the intuitive map, which locally converts each crossing to a nesting, is one of them. In this paper we present a bijection between nonnesting and noncrossing partitions of types $A$ and $B$ that generalizes the type $A$ bijection that locally converts each crossing to a nesting. Le nombre total des partitions non-croisées du type $\Psi$ est le $n$-ème nombre de Catalan $\frac{1}{ n+1} \binom{2n}{n}$ si $\Psi =A_{n-1}$, et le coefficient binomial $\binom{2n}{n}$ si $\Psi =B_n$, et ces nombres son coïncidents avec le nombre correspondant des partitions non-emboîtées. Pour le type $A$, il y a plusieurs preuves bijectives de cette égalité; en particulier, la intuitive fonction, qui convertit localement chaque croisée en une emboîtée, c'est un d'entre eux. Dans ce papier nous présentons une bijection entre partitions non-croisées et non-emboîtées des types $A$ et $B$ qui généralise la bijection du type $A$ qui localement convertit chaque croisée en une emboîtée.

scholarly journals $m$-noncrossing partitions and $m$-clusters

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Aslak Bakke Buan ◽  
Idun Reiten ◽  
Hugh Thomas
Keyword(s):  
Positive Integer ◽  
Root System ◽  
Cluster Algebra ◽  
Reflection Group ◽  
Catalan Number ◽  
Explicit Description ◽  
Noncrossing Partitions ◽  
Il Y A ◽  
International Audience ◽  
Exceptional Sequences

International audience Let $W$ be a finite crystallographic reflection group, with root system $\Phi$. Associated to $W$ there is a positive integer, the generalized Catalan number, which counts the clusters in the associated cluster algebra, the noncrossing partitions for $W$, and several other interesting sets. Bijections have been found between the clusters and the noncrossing partitions by Reading and Athanasiadis et al. There is a further generalization of the generalized Catalan number, sometimes called the Fuss-Catalan number for $W$, which we will denote $C_m(W)$. Here $m$ is a positive integer, and $C_1(W)$ is the usual generalized Catalan number. $C_m(W)$ counts the $m$-noncrossing partitions for $W$ and the $m$-clusters for $\Phi$. In this abstract, we will give an explicit description of a bijection between these two sets. The proof depends on a representation-theoretic reinterpretation of the problem, in terms of exceptional sequences of representations of quivers. Soit $W$ un groupe de réflexions fini et cristallographique, avec système de racines $\Phi$. Associé à $W$, il y a un entier positif, le nombre de Catalan généralisé, qui compte les amas dans l'algèbre amassée associée, les partitions non-croisées de $W$, et plusieurs autres ensembles intéressantes. Des bijections entre les amas et les partitions non-croisées ont été données par Reading et Athanasiadis et al. On peut encore généraliser le nombre de Catalan généralisé, obtenant le nombre Fuss-Catalan de $W$, que nous noterons $C_m(W)$. Ici $m$ est un entier positif, et $C_1(W)$ est le nombre Catalan généralisé standard. $C_m(W)$ compte les partitions $m$-non-croisées de $W$ et les $m$-amas de $\Phi$. Dans ce résumé, nous donnerons une bijection explicite entre ces deux ensembles. La démonstration dépend d'une réinterprétation des objets du point de vue des suites exceptionnelles de représentations de carquois.

scholarly journals A combinatorial model for exceptional sequences in type A

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Alexander Garver ◽  
Jacob P. Matherne
Keyword(s):  
Type A ◽  
Linear Extensions ◽  
Quiver Representations ◽  
Noncrossing Partitions ◽  
Labeled Trees ◽  
Combinatorial Model ◽  
International Audience ◽  
Exceptional Sequences ◽  
Nous Utilisons

International audience Exceptional sequences are certain ordered sequences of quiver representations. We use noncrossing edge-labeled trees in a disk with boundary vertices (expanding on T. Araya’s work) to classify exceptional sequences of representations of $Q$, the linearly ordered quiver with $n$ vertices. We also show how to use variations of this model to classify $c$-matrices of $Q$, to interpret exceptional sequences as linear extensions, and to give a simple bijection between exceptional sequences and certain chains in the lattice of noncrossing partitions. In the case of $c$-matrices, we also give an interpretation of $c$-matrix mutation in terms of our noncrossing trees with directed edges. Les suites exceptionnelles sont certaines suites ordonnées de représentations de carquois. Nous utilisons des arbres aux arêtes étiquetés et aux sommets dans le bord d’un disque (expansion sur le travail de T. Araya) pour classifier les suites exceptionnelles de représentations du carquois linéairement ordonné à $n$ sommets. Nous exploitons des variations de ce modèle pour classifier les $c$-matrices dudit carquois, pour interpréter les suites exceptionnelles comme des extensions linéaires, et pour donner une bijection élémentaire entre les suites exceptionnelles et certaines chaînes dans le réseau des partitions sans croisement. Dans le cas des $c$-matrices, nous donnons également une interprétation de la mutation des $c$-matrices en termes des arbres sans croisement aux arêtes orientés.

scholarly journals Chain enumeration of k-divisible noncrossing partitions of classical types

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Jang Soo Kim
Keyword(s):  
Block Size ◽  
Type A ◽  
Noncrossing Partitions ◽  
Cyclic Representation ◽  
International Audience

International audience We give combinatorial proofs of the formulas for the number of multichains in the $k-divisible$ noncrossing partitions of classical types with certain conditions on the rank and the block size due to Krattenthaler and Müller. We also prove Armstrong's conjecture on the zeta polynomial of the poset of k-divisible noncrossing partitions of type A invariant under the 180° rotation in the cyclic representation. Nous donnons une preuve combinatoire de la formule pour le nombre de multichaînes dans les partitions $k-divisibles$ non-croisées de type classique avec certaines conditions sur le rang et la taille du bloc due à Krattenthaler et Müller. Nous prouvons aussi la conjecture d'Amstrong sur le polynôme zeta du poset des partitions k-divisibles non-croisées de type A invariantes par la rotation de 180° dans la représentation cyclique.

scholarly journals Multi-cluster complexes

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Cesar Ceballos ◽  
Jean-Philippe Labbé ◽  
Christian Stump
Keyword(s):  
Coxeter Groups ◽  
Type A ◽  
Simplicial Complexes ◽  
Cluster Complex ◽  
Geometric Properties ◽  
Cluster Complexes ◽  
Combinatorial Description ◽  
Compatibility Relation ◽  
Positive Roots ◽  
International Audience

International audience We present a family of simplicial complexes called \emphmulti-cluster complexes. These complexes generalize the concept of cluster complexes, and extend the notion of multi-associahedra of types ${A}$ and ${B}$ to general finite Coxeter groups. We study combinatorial and geometric properties of these objects and, in particular, provide a simple combinatorial description of the compatibility relation among the set of almost positive roots in the cluster complex. Nous présentons une famille de complexes simpliciaux appelés \emphcomplexes des multi-amas. Ces complexes généralisent le concept de complexes des amas et étendent la notion de multi-associaèdre de type ${A}$ et ${B}$ aux groupes de Coxeter finis. Nous étudions des propriétés combinatoires et géométriques de ces objets et, en particulier nous fournissons une description combinatoire simple de la relation de compatibilité sur l'ensemble des racines presque positives du complexe des amas.

scholarly journals Combinatorics of Exceptional Sequences in Type A

10.37236/6251 ◽  
2019 ◽  
Vol 26 (1) ◽  
Author(s):  
Alexander Garver ◽  
Kiyoshi Igusa ◽  
Jacob P. Matherne ◽  
Jonah Ostroff
Keyword(s):  
Dynkin Diagram ◽  
Type A ◽  
Linear Extensions ◽  
Quiver Representations ◽  
Noncrossing Partitions ◽  
Underlying Graph ◽  
Exceptional Sequences

Exceptional sequences are certain sequences of quiver representations.  We introduce a class of objects called strand diagrams and use these to classify exceptional sequences of representations of a quiver whose underlying graph is a type $\mathbb{A}_n$ Dynkin diagram. We also use variations of these objects to classify $c$-matrices of such quivers, to interpret exceptional sequences as linear extensions of explicitly constructed posets, and to give a simple bijection between exceptional sequences and certain saturated chains in the lattice of noncrossing partitions. 

scholarly journals Minimal factorizations of a cycle: a multivariate generating function

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Philippe Biane ◽  
Matthieu Josuat-Vergès
Keyword(s):  
Symmetric Group ◽  
Generating Function ◽  
Simple Formula ◽  
Hook Length ◽  
Noncrossing Partitions ◽  
Long Cycle ◽  
Number Of Factors ◽  
Multivariate Generalization ◽  
International Audience

International audience It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of k cycles of given lengths has a very simple formula: it is nk−1 where n is the rank of the underlying symmetric group and k is the number of factors. In particular, this is nn−2 for transposition factorizations. The goal of this work is to prove a multivariate generalization of this result. As a byproduct, we get a multivariate analog of Postnikov's hook length formula for trees, and a refined enumeration of final chains of noncrossing partitions.

scholarly journals Is the binomial coefficient $2n \choose n$ square free?

1995 ◽  
Vol Volume 18 ◽  
Author(s):  
G Velammal
Keyword(s):  
Binomial Coefficient ◽  
International Audience

International audience In this paper, we prove the Erd\"os conjecture that the binomial coefficient ${2n \choose n}$ is never square free, for all $n>4$.

scholarly journals Matrix-Ball Construction of affine Robinson-Schensted correspondence

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Michael Chmutov ◽  
Pavlo Pylyavskyy ◽  
Elena Yudovina
Keyword(s):  
Symmetric Group ◽  
Weyl Group ◽  
Type A ◽  
Group Symmetry ◽  
Dominant Weight ◽  
Dominance Condition ◽  
The Matrix ◽  
International Audience ◽  
Affine Type

International audience In his study of Kazhdan-Lusztig cells in affine type A, Shi has introduced an affine analog of Robinson- Schensted correspondence. We generalize the Matrix-Ball Construction of Viennot and Fulton to give a more combi- natorial realization of Shi's algorithm. As a biproduct, we also give a way to realize the affine correspondence via the usual Robinson-Schensted bumping algorithm. Next, inspired by Honeywill, we extend the algorithm to a bijection between extended affine symmetric group and triples (P, Q, ρ) where P and Q are tabloids and ρ is a dominant weight. The weights ρ get a natural interpretation in terms of the Affine Matrix-Ball Construction. Finally, we prove that fibers of the inverse map possess a Weyl group symmetry, explaining the dominance condition on weights.

scholarly journals Explicit generating series for connection coefficients

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Ekaterina A. Vassilieva
Keyword(s):  
Symmetric Functions ◽  
Double Coset ◽  
Type A ◽  
Explicit Computation ◽  
Zonal Polynomials ◽  
Connection Coefficients ◽  
Generating Series ◽  
International Audience ◽  
Commutative Subalgebras ◽  
Orientable Surfaces

International audience This paper is devoted to the explicit computation of generating series for the connection coefficients of two commutative subalgebras of the group algebra of the symmetric group, the class algebra and the double coset algebra. As shown by Hanlon, Stanley and Stembridge (1992), these series gives the spectral distribution of some random matrices that are of interest to statisticians. Morales and Vassilieva (2009, 2011) found explicit formulas for these generating series in terms of monomial symmetric functions by introducing a bijection between partitioned hypermaps on (locally) orientable surfaces and some decorated forests and trees. Thanks to purely algebraic means, we recover the formula for the class algebra and provide a new simpler formula for the double coset algebra. As a salient ingredient, we compute an explicit formulation for zonal polynomials indexed by partitions of type $[a,b,1^{n-a-b}]$. Cet article est dédié au calcul explicite des séries génératrices des constantes de structure de deux sous-algèbres commutatives de l'algèbre de groupe du groupe symétrique, l'algèbre de classes et l'algèbre de double classe latérale. Tel que montrè par Hanlon, Stanley and Stembridge (1992), ces séries déterminent la distribution spectrale de certaines matrices aléatoires importantes en statistique. Morales et Vassilieva (2009, 2011) ont trouvè des formules explicites pour ces séries génératrices en termes des monômes symétriques en introduisant une bijection entre les hypercartes partitionnées sur des surfaces (localement) orientables et certains arbres et forêts décorées. Grâce à des moyens purement algébriques, nous retrouvons la formule pour l'algèbre de classe et déterminons une nouvelle formule plus simple pour l'algèbre de double classe latérale. En tant que point saillant de notre démonstration nous calculons une formulation explicite pour les polynômes zonaux indexés par des partitions de type $[a,b,1^{n-a-b}]$.

scholarly journals Affine type A geometric crystal structure on the Grassmannian

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Gabriel Frieden
Keyword(s):  
Crystal Structure ◽  
Type A ◽  
Young Tableaux ◽  
Rectangular Shape ◽  
International Audience ◽  
Affine Type

International audience We construct a type A(1) n−1 affine geometric crystal structure on the Grassmannian Gr(k, n). The tropicalization of this structure recovers the combinatorics of crystal operators on semistandard Young tableaux of rectangular shape (with n − k rows), including the affine crystal operator e 0. In particular, the promotion operation on these tableaux essentially corresponds to cyclically shifting the Plu ̈cker coordinates of the Grassmannian.

Sign in / Sign up

Export Citation Format

Share Document