scholarly journals Non-symmetric Cauchy kernels

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Olga Azenhas ◽  
Aram Emami
Keyword(s):  
Type A ◽  
Cauchy Kernel ◽  
Double Crystal ◽  
Crystal Graphs ◽  
Sum Of Products ◽  
Key Polynomials ◽  
Demazure Characters ◽  
Rsk Algorithm ◽  
International Audience ◽  
Demazure Atoms

International audience Using an analogue of the Robinson-Schensted-Knuth (RSK) algorithm for semi-skyline augmented fillings, due to Sarah Mason, we exhibit expansions of non-symmetric Cauchy kernels $∏_(i,j)∈\eta (1-x_iy_j)^-1$, where the product is over all cell-coordinates $(i,j)$ of the stair-type partition shape $\eta$ , consisting of the cells in a NW-SE diagonal of a rectangle diagram and below it, containing the biggest stair shape. In the spirit of the classical Cauchy kernel expansion for rectangle shapes, this RSK variation provides an interpretation of the kernel for stair-type shapes as a family of pairs of semi-skyline augmented fillings whose key tableaux, determined by their shapes, lead to expansions as a sum of products of two families of key polynomials, the basis of Demazure characters of type A, and the Demazure atoms. A previous expansion of the Cauchy kernel in type A, for the stair shape was given by Alain Lascoux, based on the structure of double crystal graphs, and by Amy M. Fu and Alain Lascoux, relying on Demazure operators, which was also used to recover expansions for Ferrers shapes.

scholarly journals Polynomials Defined by Tableaux and Linear Recurrences

10.37236/5284 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Per Alexandersson
Keyword(s):  
Divided Difference ◽  
Lattice Points ◽  
Difference Operators ◽  
Linear Recurrences ◽  
Natural Operation ◽  
Littlewood Polynomials ◽  
Strongly Connected ◽  
Key Polynomials ◽  
Demazure Characters ◽  
Demazure Atoms

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure atoms. The same technique can be applied to Hall-Littlewood polynomials and dual Grothendieck polynomials.The motivation behind this is that such recurrences are strongly connected with other nice properties, such as interpretations in terms of lattice points in polytopes and divided difference operators.

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 Symplectic Keys and Demazure Atoms in Type C

10.37236/9235 ◽  
2021 ◽  
Vol 28 (2) ◽  
Author(s):  
João Miguel Santos
Keyword(s):  
Type A ◽  
Bruhat Order ◽  
Young Tableaux ◽  
Hyperoctahedral Group ◽  
Similar Role ◽  
Type C ◽  
Left And Right ◽  
Demazure Atoms ◽  
The Right

We compute, mimicking the Lascoux-Schützenberger type A combinatorial procedure, left and right keys for a Kashiwara-Nakashima tableau in type C. These symplectic keys have a similar role as the keys for semistandard Young tableaux. More precisely, our symplectic keys give a tableau criterion for the Bruhat order on the hyperoctahedral group and cosets, and describe Demazure atoms and characters in type C. The right and the left symplectic keys are related through the Lusztig involution. A type C Schützenberger evacuation is defined to realize that involution.

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.

scholarly journals Fan realizations of type $A$ subword complexes and multi-associahedra of rank 3

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Nantel Bergeron ◽  
Cesar Ceballos ◽  
Jean-Philippe Labbé
Keyword(s):  
Coxeter Groups ◽  
Type A ◽  
Nous Obtenons ◽  
Open Case ◽  
International Audience ◽  
Paper Work ◽  
Subword Complex

International audience We present complete simplicial fan realizations of any spherical subword complex of type $A_n$ for $n\leq 3$. This provides complete simplicial fan realizations of simplicial multi-associahedra $\Delta_{2k+4,k}$, whose facets are in correspondence with $k$-triangulations of a convex $(2k+4)$-gon. This solves the first open case of the problem of finding fan realizations where polytopality is not known. The techniques presented in this paper work for all finite Coxeter groups and we hope that they will be useful to construct fans realizing subword complexes in general. In particular, we present fan realizations of two previously unknown cases of subword complexes of type $A_4$, namely the multi-associahedra $\Delta_{9,2}$ and $\Delta_{11,3}$. Nous construisons des éventails simpliciaux complets ayant la combinatoire des complexes de sous-mots de type $A_n$ pour $n\leq 3$. Par conséquent, nous obtenons des constructions d’éventails des multi-associaèdres $\Delta_{2k+4,k}$, dont les facettes correspondent aux $k$-triangulations d’un $(2k+4)$-gone. Cette construction confirme l’existence d’éventails ayant la combinatoire du multi-associaèdres pour une famille dont la polytopalité n’est pas confirmée. Les techniques utilisées fonctionnent pour tous les groupes de Coxeter et nous espérons qu’elles seront utiles afin de construire des éventails réalisant les complexes de sous-mots en général. En particulier, nous présentons des éventails pour deux complexes de sous-mots de type $A_4$ dont l’existence était inconnue: les multi-associaèdres $\Delta_{9,2}$ et $\Delta_{11,3}$.

scholarly journals The generalized Gelfand–Graev characters of GLn(Fq)

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Scott Andrews ◽  
Nathaniel Thiem
Keyword(s):  
Finite Groups ◽  
Type A ◽  
General Linear ◽  
Linear Groups ◽  
General Linear Groups ◽  
Representations Of Finite Groups ◽  
International Audience ◽  
Unipotent Representations ◽  
Groups Of Lie Type

International audience Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, gener- alized Gelfand–Graev characters have remained somewhat mysterious. Even in the case of the finite general linear groups, the combinatorics of their decompositions has not been worked out. This paper re-interprets Kawanaka's def- inition in type A in a way that gives far more flexibility in computations. We use these alternate constructions to show how to obtain generalized Gelfand–Graev representations directly from the maximal unipotent subgroups. We also explicitly decompose the corresponding generalized Gelfand–Graev characters in terms of unipotent representations, thereby recovering the Kostka–Foulkes polynomials as multiplicities.

scholarly journals Hyperplane Arrangements and Diagonal Harmonics

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Drew Armstrong
Keyword(s):  
Symmetric Functions ◽  
Hilbert Series ◽  
Hyperplane Arrangement ◽  
Type A ◽  
Hyperplane Arrangements ◽  
Combinatorial Interpretation ◽  
Nabla Operator ◽  
Affine Weyl Group ◽  
Diagonal Harmonics ◽  
International Audience

International audience In 2003, Haglund's bounce statistic gave the first combinatorial interpretation of the q,t-Catalan numbers and the Hilbert series of diagonal harmonics. In this paper we propose a new combinatorial interpretation in terms of the affine Weyl group of type A. In particular, we define two statistics on affine permutations; one in terms of the Shi hyperplane arrangement, and one in terms of a new arrangement — which we call the Ish arrangement. We prove that our statistics are equivalent to the area' and bounce statistics of Haglund and Loehr. In this setting, we observe that bounce is naturally expressed as a statistic on the root lattice. We extend our statistics in two directions: to "extended'' Shi arrangements and to the bounded chambers of these arrangements. This leads to a (conjectural) combinatorial interpretation for all integral powers of the Bergeron-Garsia nabla operator applied to elementary symmetric functions. En 2003, la statistique bounce de Haglund a donné la première interprétation combinatoire de la somme des nombres q,t-Catalan et de la série de Hilbert des harmoniques diagonaux. Dans cet article nous proposons une nouvelle interprétation combinatoire à partir du groupe de Weyl affine de type A. En particulier, nous définissons deux statistiques sur les permutations affines; l'une à partir de l'arrangement d'hyperplans Shi, et l'autre à partir d'un nouvel arrangement — que nous appelons l'arrangement Ish. Nous prouvons que nos statistiques sont équivalentes aux statistiques area' et bounce de Haglund et Loehr. Dans ce contexte, nous observons que bounce s'exprime naturellement comme une statistique sur le réseau des racines. Nous prolongeons nos statistiques dans deux directions: arrangements Shi "étendus'', et chambres bornées associées. Cela conduit à une interprétation (conjecturale) combinatoire pour toutes les puissances entières de l'opérateur nabla de Bergeron-Garsia appliqué aux fonctions symétriques élémentaires.

scholarly journals Bijections between noncrossing and nonnesting partitions for classical reflection groups

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Alex Fink ◽  
Benjamin Iriarte Giraldo
Keyword(s):  
Type A ◽  
Reflection Group ◽  
Catalan Numbers ◽  
Reflection Groups ◽  
Generalized Catalan Numbers ◽  
Elementary Methods ◽  
International Audience ◽  
Type Sets

International audience We present $\textit{type preserving}$ bijections between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis and Reiner. The bijections for the abstract Coxeter types $B$, $C$ and $D$ are new in the literature. To find them we define, for every type, sets of statistics that are in bijection with noncrossing and nonnesting partitions, and this correspondence is established by means of elementary methods in all cases. The statistics can be then seen to be counted by the generalized Catalan numbers Cat$(W)$ when $W$ is a classical reflection group. In particular, the statistics of type $A$ appear as a new explicit example of objects that are counted by the classical Catalan numbers.

Sign in / Sign up

Export Citation Format

Share Document