Search

The distribution of Coxeter descents and block number over the set of fully commutative elements in the hyperoctahedral group B n , FC ( B n ) , is studied in this paper. We prove that the associated Chow quasi-symmetric generating function is equal to a non-negative sum of products of two Schur functions. The proof involves a decomposition of FC ( B n ) into a disjoint union of two-sided Barbash–Vogan combinatorial cells, a type B extension of Rubey’s descent preserving involution on 321-avoiding permutations and a detailed study of the intersection of FC ( B n ) with S n -cosets which yields a new decomposition of FC ( B n ) into disjoint subsets called fibers. We also compare two different type B Schur-positivity notions, arising from works of Chow and Poirier.

Using Reiner's definition of Stirling numbers of the second kind in types $B$ and $D$, we generalize two well-known identities concerning the classical Stirling numbers of the second kind. The first identity relates them with Eulerian numbers and the second identity interprets them as entries in a transition matrix between the elements of two standard bases of the polynomial ring $R[x]$. Finally, we generalize these identities to the group of colored permutations $G_{m,n}$., 17 pages, 2 figures; submitted

An element w of a Coxeter group W is said to be fully commutative, if any reduced expression of w can be obtained from any other by transposing adjacent pairs of generators. These elements were described in 1996 by Stembridge in the case of finite irreducible groups, and more recently by Biagioli, Jouhet and Nadeau (BJN) in the affine cases. We focus here on the length enumeration of these elements. Using a recursive description, BJN established for the associated generating functions systems of non-linear q-equations. Here, we show that an alternative recursive description leads to explicit expressions for these generating functions., Comment: 37 pages, 7 figures

The depth statistic was defined by Petersen and Tenner for an element of an arbitrary Coxeter group in terms of factorizations of the element into a product of reflections. It can also be defined as the minimal cost, given certain prescribed edge weights, for a path in the Bruhat graph from the identity to an element. We present algorithms for calculating the depth of an element of a classical Coxeter group that yield simple formulas for this statistic. We use our algorithms to characterize elements having depth equal to length. These are the short-braid-avoiding elements. We also give a characterization of the elements for which the reflection length coincides with both depth and length. These are the boolean elements.

We study the complex reflection groups G(r, p, n). By considering these groups as subgroups of the wreath products Open image in new window, and by using Clifford theory, we define combinatorial parameters and descent representations of G(r, p, n), previously known for classical Weyl groups. One of these parameters is the flag major index, which also has an important role in the decomposition of these representations into irreducibles. A Carlitz type identity relating the combinatorial parameters with the degrees of the group, is presented.

An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. These elements were extensively studied by Stembridge, in particular in the finite case. They index naturally a basis of the generalized Temperley--Lieb algebra. In this work we deal with any finite or affine Coxeter group $W$, and we give explicit descriptions of fully commutative elements. Using our characterizations we then enumerate these elements according to their Coxeter length, and find in particular that the corrresponding growth sequence is ultimately periodic in each type. When the sequence is infinite, this implies that the associated Temperley--Lieb algebra has linear growth., 37 pages, 27 figures

Given a classical Weyl group $W$, that is, a Weyl group of type $A$, $B$ or $D$, one can associate with it a polynomial with integral coefficients $Z_W$ given by the ratio of the Hilbert series of the invariant algebras of the natural action of $W$ and $W^t$ on the ring of polynomials ${\bf C}[x_1, \ldots , x_n]^{\otimes t}$. We introduce and study several statistics on the classical Weyl groups of type $B$ and $D$ and show that they can be used to give an explicit formula for $Z_{D_n}$. More precisely, we define two Mahonian statistics, that is, statistics having the same distribution as the length function, $Dmaj$ and $ned$ on $D_n$. The statistic $Dmaj$, defined in a combinatorial way, has an analogous algebraic meaning to the major index for the symmetric group and the flag-major index of Adin and Roichman for $B_n$; namely, it allows us to find an explicit formula for $Z_{D_n}$. Our proof is based on the theory of $t$-partite partitions introduced by Gordon and further studied by Garsia and Gessel. Using similar ideas, we define the Mahonian statistic $ned$ also on $B_n$ and we find a new and simpler proof of the Adin?Roichman formula for $Z_{B_n}$. Finally, we define a new descent number $Ddes$ on $D_n$ so that the pair $(Ddes,Dmaj)$ gives a generalization to $D_n$ of the Carlitz identity on the Eulerian?Mahonian distribution of descent number and major index on the symmetric group.

We give explicit combinatorial product formulas for the polynomials encoding the dimensions of the spaces of extensions of ( g , p ) (g,p) -generalized Verma modules, in the cases when ( g , p ) (g,p) corresponds to an indecomposable classic Hermitian symmetric pair. The formulas imply that these dimensions are combinatorial invariants. We also discuss how these polynomials, defined by Shelton, are related to the parabolic R R -polynomials introduced by Deodhar.

Tanisaki introduced generating sets for the defining ideals of the schematic intersections of the closure of conjugacy classes of nilpotent matrices with the set of diagonal matrices. These ideals are naturally labeled by integer partitions. Given such a partition λ, we define several methods to produce a reduced generating set for the associated ideal Iλ. For particular shapes we find nice generating sets. By comparing our sets with some generating sets of Iλ arising from a work of Weyman, we find a counterexample to a related conjecture of Weyman. Natural Sciences and Engineering Research Council of Canada Ministerio de Educación y Ciencia

We generalize some identities and q-identities previously known for the symmetric group to Coxeter groups of type B and D. The extended results include theorems of Foata and Sch\"utzenberger, Gessel, and Roselle on various distributions of inversion number, major index, and descent number. In order to show our results we provide caracterizations of the systems of minimal coset representatives of Coxeter groups of type B and D., Comment: 18 pages, 2 figures

We find a minimal generating set for the defining ideal of the schematic intersection of the set of diagonal matrices with the closure of the conjugacy class of a nilpotent matrix indexed by a hook partition. The structure of this ideal allows us to compute its minimal free resolution and give an explicit description of the graded Betti numbers, and study its Hilbert series and regularity.

The purpose of this paper is to give an explicit description of the trivial and alternating components of the irreducible representation decomposition of the bigraded module obtained as the tensor square of the coinvariant space for hyperoctahedral groups., Comment: 27 pages

Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way., Comment: 16 pages, 6 figures

A monomial basis for the coinvariant algebra of type D is introduced. This basis naturally leads to the definition of a new family of representations that decompose the homogeneous components of the coinvariant algebra. Furthermore, the multiplicity of the irreducible characters within the characters of these representations is described in terms of tableaux. This algebraic setting is then applied to generalize various combinatorial identities and find new ones.

Weak order on a Coxeter group W is a partial order on W appearing in many areas of algebraic combinatorics. In this thesis, we propose a new general model for the study of the weak order and other related partially ordered sets (also called “posets”) and we explore various algebraic and combinatorial consequences of this construction. We begin with studying a restricted version of this model in Chapter 3. More precisely, we explain how one can associate a poset to any simple acyclic digraph together with a valuation on its vertices (also called “valued digraph”). We then prove that these posets are complete meet semi-lattices in general, complete lattices when the underlying digraph is finite, and we give an explicit formula to compute the value of their Möbius functions. Then, we show that the weak order on Coxeter groups of type A, B and A, the flag weak order, and the up-set (resp. down-set) lattices of any finite poset can be described within this theory. This description naturally leads to associate a quasi-symmetric function to any element of An And An, and we demonstrate that this function is in fact the corresponding Stanley symmetric function. In Chapter 4 we introduce the main results of this thesis. Indeed, we introduce in this chapter the generalization of the construction made in Chapter 3 to the case of any valued digraph, that is without the simplicity and acyclicity condition. Furthermore, this new definition allows us to get rid of some constraints of the definition of Chapter 3, allowing us to associate a complete lattice to each valued digraph. In particular, the meet semi-lattices of Chapter 3 are naturally extended into complete lattices. This leads us to the study of some conjectures of Dyer about the properties of an extension of the weak order having a lot of the properties conjecturally attached to Dyer’s extensions, and we prove that each one of our extensions contains Dyer’s extension as a sub-poset. We make the conjecture that one of this extension coincide with the one of Dyer, and we provide tools in order to test this conjecture. Finally, we study various consequences of out theory : we provide extensions of Cambrian semi-lattices into complete lattices (end of Chapter 4), we construct a new combinatorial model for Tamari and m-Tamari lattices (Chapter 5), and we finish with an application to tableaux combinatorics (Chapter 6), L'ordre faible sur un groupe de Coxeter W est un ordre partiel sur les éléments de W, intervenant dans de nombreux domaines de la combinatoire algébrique. Dans cette thèse, on propose un nouveau modèle général pour l'étude de cet ordre ainsi que d'autres ensembles ordonnés affiliés, et on explore diverses conséquences aussi bien algébriques que combinatoires de cette construction. On commence, dans le chapitre 3, par étudier une version restreinte de ce modèle. Plus précisément, on explique comment on peut associer un ensemble ordonné (aussi appelé « poset » à tout graphe orienté, simple, acyclique et muni d'une valutation sur ses sommets (aussi appelé « graphe valué »). On montre ensuite que ces posets sont en général des semi-treillis inférieurs, des treillis quand le graphe est fini, et on donne une formule explicite pour les valeurs de leurs fonctions de Möbius. On prouve ensuite que l'ordre faible sur les groupes de Coxeter de type A, B et A, le « flag weak order », ainsi que le treillis des idéaux supérieurs et inférieurs de tout poset fini peuvent être décrit avec notre modèle. Cette description amène naturellement à associer une série quasi-symétrique à chaque élément de An et An et on montre que cette série est en fait la série de Stanley associée. On présente dans le chapitre 4 les résultats centraux de la thèse, en effet on y introduit la généralisation de la construction faite au chapitre précédent au cas de tout graphe valué, c'est-à-dire sans condition s'acyclicité et de simplicité. On s'affranchit également de certaines contraintes imposées par la définition du chapitre 3, ce qui nous permet d'associer à tout graphe valué un treillis complet, et non plus un semi-treillis. En particulier, les semi-treillis du chapitre 3 se retrouvent naturellement plongés dans un treillis complet. Ceci nous amène à nous intéresser à des conjectures de Dyer portant sur l'étude d'une extension de l'ordre faible sur tout groupe de Coxeter (entre autres, il est conjecturé que ces extensions sont des treillis complets). On construit alors, à l'aide de notre formalisme, des extensions de l'ordre faible ayant beaucoup des propriétés conjecturalement attachées aux extensions de Dyer, et contenant ces dernières comme sous-poset. On conjecture que l'une de ces extensions coïncide avec celle de Dyer, et on fournit des outils pour le tester. Finalement, on étudie diverses conséquences de notre théorie : la construction d'extensions des semi-treillis cambriens (fin du chapitre 4), la construction d'un nouveau modèle combinatoire pour le treillis de Tamari et m-Tamari (chapitre 5), et enfin on propose une application à la combinatoire des tableaux (chapitre 6)