scholarly journals Excedances in classical and affine Weyl groups

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Pietro Mongelli
Keyword(s):  
Generating Functions ◽  
Weyl Groups ◽  
Nous Obtenons ◽  
Affine Weyl Groups ◽  
Basic Properties ◽  
Affine Groups ◽  
International Audience ◽  
Affine Permutations

International audience Based on the notion of colored and absolute excedances introduced by Bagno and Garber we give an analogue of the derangement polynomials. We obtain some basic properties of these polynomials. Moreover, we define an excedance statistic for the affine Weyl groups of type $\widetilde{B}_n, \widetilde {C}_n$ and $\widetilde {D}_n$ and determine the generating functions of their distributions. This paper is inspired by one of Clark and Ehrenborg (2011) in which the authors introduce the excedance statistic for the group of affine permutations and ask if this statistic can be defined for other affine groups. Basée sur la notion des excédances colorés et absolu introduits par Bagno and Garber, nous donnons un analogue des polynômes des dérangements. Nous obtenons quelques propriétés de base de ces polynômes. En outre, nous définissons une excédance statistique pour le groupes de Weyl affines de type $\widetilde{B}_n, \widetilde {C}_n$ et $\widetilde {D}_n$ et nous déterminons les fonctions génératrices de leurs distributions. Cet article est inspirè d'un article de Clark et Ehrenborg (2011) dans lequel les auteurs introduisent les excedances pour le groupe des permutations affine et demander si cette statistique peut être éèfinie pour les autres groupes affines.

scholarly journals The enumeration of fully commutative affine permutations

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Christopher R. H. Hanusa ◽  
Brant C. Jones
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Nous Obtenons ◽  
Full Version ◽  
International Audience ◽  
Affine Permutations ◽  
Fixed Rank

International audience We give a generating function for the fully commutative affine permutations enumerated by rank and Coxeter length, extending formulas due to Stembridge and Barcucci–Del Lungo–Pergola–Pinzani. For fixed rank, the length generating functions have coefficients that are periodic with period dividing the rank. In the course of proving these formulas, we obtain results that elucidate the structure of the fully commutative affine permutations. This is a summary of the results; the full version appears elsewhere. Nous présentons une fonction génératrice qui énumère les permutations affines totalement commutatives par leur rang et par leur longueur de Coxeter, généralisant les formules dues à Stembridge et à Barcucci–Del Lungo–Pergola–Pinzani. Pour un rang précis, les fonctions génératrices ont des coefficients qui sont périodiques de période divisant leur rang. Nous obtenons des résultats qui expliquent la structure des permutations affines totalement commutatives. L'article dessous est un aperçu des résultats; la version complète appara\^ıt ailleurs.

scholarly journals The distribution of descents and length in a Coxeter group

10.37236/1219 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Victor Reiner
Keyword(s):  
Rational Function ◽  
Coxeter Group ◽  
Generating Functions ◽  
Length Function ◽  
Weyl Groups ◽  
Coxeter System ◽  
Affine Weyl Groups ◽  
System L

We give a method for computing the $q$-Eulerian distribution $$ W(t,q)=\sum_{w \in W} t^{{\rm des}(w)} q^{l(w)} $$ as a rational function in $t$ and $q$, where $(W,S)$ is an arbitrary Coxeter system, $l(w)$ is the length function in $W$, and ${\rm des}(w)$ is the number of simple reflections $s \in S$ for which $l(ws) < l(w)$. Using this we compute generating functions encompassing the $q$-Eulerian distributions of the classical infinite families of finite and affine Weyl groups.

scholarly journals Enumeration of minimal 3D polyominoes inscribed in a rectangular prism

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Alain Goupil ◽  
Hugo Cloutier
Keyword(s):  
Geometric Structure ◽  
Generating Functions ◽  
Rectangular Prism ◽  
Nous Obtenons ◽  
Minimal Volume ◽  
Connected Sets ◽  
The Family ◽  
International Audience ◽  
Combinatorial Principles ◽  
Rational Generating Functions

International audience We consider the family of 3D minimal polyominoes inscribed in a rectanglar prism. These objects are polyominos and so they are connected sets of unitary cubic cells inscribed in a given rectangular prism of size $b\times k \times h$ and of minimal volume equal to $b+k+h-2$. They extend the concept of minimal 2D polyominoes inscribed in a rectangle studied in a previous work. Using their geometric structure and elementary combinatorial principles, we construct rational generating functions of minimal 3D polyominoes. We also obtain a number of exact formulas and recurrences for sub-families of these polyominoes. Nous considérons la famille des polyominos 3D de volume minimal inscrits dans un prisme rectangulaire. Ces objets sont des polyominos et sont donc des ensembles connexes de cubes unitaires. De plus ils sont inscrits dans un prisme rectangulaire de format $b\times k \times h$ donné et ont un volume minimal égal à $b+k+h-2$. Ces polyominos généralisent le concept de polyomino 2D étudié dans un travail précédent. Nous construisons des séries génératrices rationnelles de polyominos 3D minimaux et nous obtenons des formules exactes et des récurrences pour des sous-familles de ces polyominos.

scholarly journals Deodhar Elements in Kazhdan-Lusztig Theory

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Brant Jones
Keyword(s):  
Coxeter Groups ◽  
Pattern Avoidance ◽  
Weyl Groups ◽  
Schubert Varieties ◽  
Combinatorial Formula ◽  
Nous Obtenons ◽  
Integer Coefficients ◽  
Nous Montrons ◽  
International Audience ◽  
Lusztig Polynomials

International audience The Kazhdan-Lusztig polynomials for finite Weyl groups arise in representation theory as well as the geometry of Schubert varieties. It was proved very soon after their introduction that they have nonnegative integer coefficients, but no simple all positive interpretation for them is known in general. Deodhar has given a framework, which generally involves recursion, to express the Kazhdan-Lusztig polynomials in a very attractive form. We use a new kind of pattern-avoidance that can be defined for general Coxeter groups to characterize when Deodhar's algorithm yields a non-recursive combinatorial formula for Kazhdan-Lusztig polynomials $P_{x,w}(q)$ of finite Weyl groups. This generalizes results of Billey-Warrington which identified the $321$-hexagon-avoiding permutations, and Fan-Green which identified the fully-tight Coxeter groups. We also show that the leading coefficient known as $\mu (x,w)$ for these Kazhdan―Lusztig polynomials is always either $0$ or $1$. Finally, we generalize the simple combinatorial formula for the Kazhdan―Lusztig polynomials of the $321$-hexagon-avoiding permutations to the case when $w$ is hexagon avoiding and maximally clustered. Les polynômes de Kazhdan-Lusztig $P_{x,w}(q)$ des groupes de Weyl finis apparaissent en théorie des représentations, ainsi qu’en géométrie des variétés de Schubert. Il a été démontré peu après leur introduction qu’ils avaient des coefficients entiers positifs, mais on ne connaît toujours pas d’interprétation combinatoire simple de cette propriété dans le cas général. Deodhar a proposé un cadre donnant un algorithme, en général récursif, calculant des formules attractives pour les polynômes de Kazhdan-Lusztig. Billey-Warrington ont démontré que cet algorithme est non récursif lorsque$w$ évite les hexagones et les $321$ et qu’il donne des formules combinatoires simples. Nous introduisons une notion d’évitement de schémas dansles groupes de Coxeter quelconques nous permettant de généraliser les résultats de Billey-Warrington à tout groupe de Weyl fini. Nous montrons que le coefficient de tête $\mu (x,w)$ de ces polynômes de Kazhdan-Lusztig est toujours $0$ ou $1$. Cela généralise aussi des résultats de Fan-Greenqui identifient les groupes de Coxeter complètement serrés. Enfin, en type $A$, nous obtenons une classe plus large de permutations évitant la récursion.

scholarly journals Enumerating projective reflection groups

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Riccardo Biagioli ◽  
Fabrizio Caselli
Keyword(s):  
Representation Theory ◽  
Generating Functions ◽  
Special Class ◽  
Hilbert Series ◽  
Weyl Groups ◽  
Reflection Groups ◽  
One Dimensional ◽  
Complex Reflection Groups ◽  
Major Index ◽  
International Audience

International audience Projective reflection groups have been recently defined by the second author. They include a special class of groups denoted G(r,p,s,n) which contains all classical Weyl groups and more generally all the complex reflection groups of type G(r,p,n). In this paper we define some statistics analogous to descent number and major index over the projective reflection groups G(r,p,s,n), and we compute several generating functions concerning these parameters. Some aspects of the representation theory of G(r,p,s,n), as distribution of one-dimensional characters and computation of Hilbert series of some invariant algebras, are also treated. Les groupes de réflexions projectifs ont été récemment définis par le deuxième auteur. Ils comprennent une classe spéciale de groupes notée G(r,p,s,n), qui contient tous les groupes de Weyl classiques et plus généralement tous les groupes de réflexions complexes du type G(r,p,n). Dans ce papier on définit des statistiques analogues au nombre de descentes et à l'indice majeur pour les groupes G(r,p,s,n), et on calcule plusieurs fonctions génératrices. Certains aspects de la théorie des représentations de G(r,p,s,n), comme la distribution des caractères linéaires et le calcul de la série de Hilbert de quelques algèbres d'invariants, sont aussi abordés.

scholarly journals Strange Expectations and Simultaneous Cores

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Marko Thiel ◽  
Nathan Williams
Keyword(s):  
Weyl Groups ◽  
Polynomial Method ◽  
Expected Number ◽  
Ehrhart Theory ◽  
Affine Weyl Groups ◽  
De Vries ◽  
International Audience ◽  
Third Moment ◽  
Unique Core

International audience Let gcd(a, b) = 1. J. Olsson and D. Stanton proved that the maximum number of boxes in a simultaneous (a, b)-core is (a2 −1)(b2 −1) 24, and showed that this maximum is achieved by a unique core. P. Johnson combined Ehrhart theory with the polynomial method to prove D. Armstrong's conjecture that the expected number of boxes in a simultaneous (a, b)-core is (a−1)(b−1)(a+b+1) 24. We apply P. Johnson's method to compute the variance and third moment. By extending the definitions of “simultaneous cores” and “number of boxes” to affine Weyl groups, we give uniform generalizations of these formulae to simply-laced affine types. We further explain the appearance of the number 24 using the “strange formula” of H. Freudenthal and H. de Vries.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

scholarly journals Solution of tetrahedron equation and cluster algebras

2021 ◽  
Vol 2021 (5) ◽  
Author(s):  
P. Gavrylenko ◽  
M. Semenyakin ◽  
Y. Zenkevich
Keyword(s):  
Integrable System ◽  
Cluster Algebra ◽  
Newton Polygon ◽  
Cluster Algebras ◽  
Weyl Groups ◽  
Newton Polygons ◽  
Tetrahedron Equation ◽  
Affine Weyl Groups ◽  
New Formalism ◽  
Bruhat Cell

Abstract We notice a remarkable connection between the Bazhanov-Sergeev solution of Zamolodchikov tetrahedron equation and certain well-known cluster algebra expression. The tetrahedron transformation is then identified with a sequence of four mutations. As an application of the new formalism, we show how to construct an integrable system with the spectral curve with arbitrary symmetric Newton polygon. Finally, we embed this integrable system into the double Bruhat cell of a Poisson-Lie group, show how triangular decomposition can be used to extend our approach to the general non-symmetric Newton polygons, and prove the Lemma which classifies conjugacy classes in double affine Weyl groups of A-type by decorated Newton polygons.

scholarly journals Bijective projections on parabolic quotients of affine Weyl groups

2014 ◽  
Vol 41 (4) ◽  
pp. 911-948 ◽  
Author(s):  
Elizabeth Beazley ◽  
Margaret Nichols ◽  
Min Hae Park ◽  
XiaoLin Shi ◽  
Alexander Youcis
Keyword(s):  
Weyl Groups ◽  
Affine Weyl Groups

scholarly journals Tight Quotients and Double Quotients in the Bruhat Order

10.37236/1871 ◽  
2005 ◽  
Vol 11 (2) ◽  
Author(s):  
John R. Stembridge
Keyword(s):  
Coxeter Groups ◽  
Upper Bounds ◽  
Bruhat Order ◽  
Weyl Groups ◽  
Order Dimension ◽  
Parabolic Subgroups ◽  
Affine Weyl Groups ◽  
Positive Side ◽  
Maximal Parabolic Subgroups

It is a well-known theorem of Deodhar that the Bruhat ordering of a Coxeter group is the conjunction of its projections onto quotients by maximal parabolic subgroups. Similarly, the Bruhat order is also the conjunction of a larger number of simpler quotients obtained by projecting onto two-sided (i.e., "double") quotients by pairs of maximal parabolic subgroups. Each one-sided quotient may be represented as an orbit in the reflection representation, and each double quotient corresponds to the portion of an orbit on the positive side of certain hyperplanes. In some cases, these orbit representations are "tight" in the sense that the root system induces an ordering on the orbit that yields effective coordinates for the Bruhat order, and hence also provides upper bounds for the order dimension. In this paper, we (1) provide a general characterization of tightness for one-sided quotients, (2) classify all tight one-sided quotients of finite Coxeter groups, and (3) classify all tight double quotients of affine Weyl groups.

Sign in / Sign up

Export Citation Format

Share Document