scholarly journals Nonzero coefficients in restrictions and tensor products of supercharacters of $U_n(q)$ (extended abstract)

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Stephen Lewis ◽  
Nathaniel Thiem
Keyword(s):  
Tensor Product ◽  
Symmetric Group ◽  
Nonnegative Integer ◽  
Set Partitions ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Branching Rules ◽  
International Audience ◽  
Supercharacter Theory ◽  
Donne Lieu

International audience The standard supercharacter theory of the finite unipotent upper-triangular matrices $U_n(q)$ gives rise to a beautiful combinatorics based on set partitions. As with the representation theory of the symmetric group, embeddings of $U_m(q) \subseteq U_n(q)$ for $m \leq n$ lead to branching rules. Diaconis and Isaacs established that the restriction of a supercharacter of $U_n(q)$ is a nonnegative integer linear combination of supercharacters of $U_m(q)$ (in fact, it is polynomial in $q$). In a first step towards understanding the combinatorics of coefficients in the branching rules of the supercharacters of $U_n(q)$, this paper characterizes when a given coefficient is nonzero in the restriction of a supercharacter and the tensor product of two supercharacters. These conditions are given uniformly in terms of complete matchings in bipartite graphs. La théorie standard des supercaractères des matrices triangulaires supérieures unipotentes finies $U_n(q)$ donne lieu à une merveilleuse combinatoire basée sur les partitions d'ensembles. Comme avec la théorie des représentations du groupe symétrique, Les plongements $U_m(q) \subseteq U_n(q)$ pour $m \leq n$ mènent aux règles de branchement. Diaconis et Isaacs ont montré que la restriction d'un supercaractère de $U_n(q)$ est une combinaison linéaire des supercaractères de $U_m(q)$ avec des coefficients entiers non négatifs (en fait, elle est polynomiale en $q$). Dans une première étape vers la compréhension de la combinatoire des coefficients dans les règles de branchement des supercaractères de $U_n(q)$, ce texte caractérise les coefficients non nuls dans la restriction d'un supercaractère et dans le produit des tenseurs de deux supercaractères. Ces conditions sont données uniformément en termes des couplages complets dans des graphes bipartis.

scholarly journals Branching rules in the ring of superclass functions of unipotent upper-triangular matrices

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Nathaniel Thiem
Keyword(s):  
Symmetric Functions ◽  
Combinatorial Structure ◽  
Classical Representation ◽  
Set Partitions ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Branching Rules ◽  
International Audience ◽  
Structure Constants ◽  
Supercharacter Theory

International audience It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the classical representation theory of the symmetric group. This paper begins by exploring a connection to the ring of symmetric functions in non-commuting variables that mirrors the symmetric group's relationship with the ring of symmetric functions. It then also investigates some of the representation theoretic structure constants arising from the restriction, tensor products and superinduction of supercharacters.

scholarly journals Restricting Supercharacters of the Finite Group of Unipotent Uppertriangular Matrices

10.37236/112 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Nathaniel Thiem ◽  
Vidya Venkateswaran
Keyword(s):  
Finite Group ◽  
Representation Theory ◽  
Finite Field ◽  
Symmetric Group ◽  
Irreducible Representations ◽  
Combinatorial Theory ◽  
Set Partitions ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Supercharacter Theory

It is well-known that understanding the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one obtains a rich combinatorial theory analogous to that of the symmetric group, where we replace partition combinatorics with set-partitions. This paper studies the supercharacter theory of a family of subgroups that interpolate between $U_{n-1}$ and $U_n$. We supply several combinatorial indexing sets for the supercharacters, supercharacter formulas for these indexing sets, and a combinatorial rule for restricting supercharacters from one group to another. A consequence of this analysis is a Pieri-like restriction rule from $U_n$ to $U_{n-1}$ that can be described on set-partitions (analogous to the corresponding symmetric group rule on partitions).

scholarly journals Shell Tableaux: A Set Partition Analog of Vacillating Tableaux

10.37236/8241 ◽  
2019 ◽  
Vol 26 (2) ◽  
Author(s):  
Megan Ly
Keyword(s):  
Irreducible Representations ◽  
Character Theory ◽  
Set Partition ◽  
Set Partitions ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Weyl Duality ◽  
Supercharacter Theory ◽  
Combinatorial Representation Theory ◽  
Centralizer Algebra

Schur–Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog of Schur–Weyl duality for the group of unipotent upper triangular matrices over a finite field.  In this case, the character theory of these upper triangular matrices is "wild" or unattainable. Thus we employ a generalization, known as supercharacter theory, that creates a striking variation on the character theory of the symmetric group with combinatorics built from set partitions. In this paper, we present a combinatorial formula for calculating a restriction and induction of supercharacters based on statistics of set partitions and seashell inspired diagrams. We use these formulas to create a graph that encodes the decomposition of a tensor space, and develop an analog of Young tableaux, known as shell tableaux, to index paths in this graph. 

scholarly journals Tamari Lattices for Parabolic Quotients of the Symmetric Group

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Henri Mühle ◽  
Nathan Williams
Keyword(s):  
Symmetric Group ◽  
Coxeter Groups ◽  
Weak Order ◽  
Set Partitions ◽  
Tamari Lattice ◽  
Nous Montrons ◽  
International Audience ◽  
Tamari Lattices

International audience We present a generalization of the Tamari lattice to parabolic quotients of the symmetric group. More precisely, we generalize the notions of 231-avoiding permutations, noncrossing set partitions, and nonnesting set partitions to parabolic quotients, and show bijectively that these sets are equinumerous. Furthermore, the restriction of weak order on the parabolic quotient to the parabolic 231-avoiding permutations is a lattice quotient. Lastly, we suggest how to extend these constructions to all Coxeter groups. Nous présentons une généralisation du treillis de Tamari aux quotients paraboliques du groupe symétrique. Plus précisément, nous généralisons les notions de permutations qui évitent le motif 231, les partitions non-croisées, et les partitions non-emboîtées aux quotients paraboliques, et nous montrons de façon bijective que ces ensembles sont équipotents. En restreignant l’ordre faible du quotient parabolique aux permutations paraboliques qui évitent le motif 231, on obtient un quotient de treillis d’ordre faible. Enfin, nous suggérons comment étendre ces constructions à tous les groupes de Coxeter.

scholarly journals Counting self-dual interval orders

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Vít Jelínek
Keyword(s):  
Explicit Formula ◽  
Generating Function ◽  
Interval Orders ◽  
Maximal Elements ◽  
Triangular Matrices ◽  
Bijective Correspondence ◽  
Upper Triangular Matrices ◽  
Positive Entry ◽  
International Audience ◽  
Natural Statistics

International audience In this paper, we first derive an explicit formula for the generating function that counts unlabeled interval orders (a.k.a. (2+2)-free posets) with respect to several natural statistics, including their size, magnitude, and the number of minimal and maximal elements. In the second part of the paper, we derive a generating function for the number of self-dual unlabeled interval orders, with respect to the same statistics. Our method is based on a bijective correspondence between interval orders and upper-triangular matrices in which each row and column has a positive entry. Dans cet article, on obtient une expression explicite pour la fonction génératrice du nombre des ensembles partiellement ordonnés (posets) qui évitent le motif (2+2). La fonction compte ces ensembles par rapport à plusieurs statistiques naturelles, incluant le nombre d'éléments, le nombre de niveaux, et le nombre d'éléments minimaux et maximaux. Dans la deuxième partie, on obtient une expression similaire pour la fonction génératrice des posets autoduaux évitant le motif (2+2). On obtient ces résultats à l'aide d'une bijection entre les posets évitant (2+2) et les matrices triangulaires supérieures dont chaque ligne et chaque colonne contient un élément positif.

scholarly journals Invariant and coinvariant spaces for the algebra of symmetric polynomials in non-commuting variables

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
François Bergeron ◽  
Aaron Lauve
Keyword(s):  
Tensor Product ◽  
Symmetric Group ◽  
Hopf Algebras ◽  
Symmetric Polynomials ◽  
Reflection Groups ◽  
Invariant Polynomials ◽  
Product Decomposition ◽  
Combinatorial Hopf Algebras ◽  
Produit Tensoriel ◽  
International Audience

International audience We analyze the structure of the algebra $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ of symmetric polynomials in non-commuting variables in so far as it relates to $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$, its commutative counterpart. Using the "place-action'' of the symmetric group, we are able to realize the latter as the invariant polynomials inside the former. We discover a tensor product decomposition of $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ analogous to the classical theorems of Chevalley, Shephard-Todd on finite reflection groups. In the case $|\mathbf{x}|= \infty$, our techniques simplify to a form readily generalized to many other familiar pairs of combinatorial Hopf algebras. Nous analysons la structure de l'algèbre $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ des polynômes symétriques en des variables non-commutatives pour obtenir des analogues des résultats classiques concernant la structure de l'anneau $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$ des polynômes symétriques en des variables commutatives. Plus précisément, au moyen de "l'action par positions'', on réalise $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$ comme sous-module de $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$. On découvre alors une nouvelle décomposition de $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ comme produit tensoriel, obtenant ainsi un analogue des théorèmes classiques de Chevalley et Shephard-Todd. Dans le cas $|\mathbf{x}|= \infty$, nos techniques se simplifient en une forme aisément généralisables à beaucoup d'autres paires d'algèbres de Hopf familières.

scholarly journals The topology of restricted partition posets

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Richard Ehrenborg ◽  
JiYoon Jung
Keyword(s):  
Symmetric Group ◽  
Homotopy Type ◽  
Integer Partitions ◽  
Order Complex ◽  
Specht Module ◽  
Set Partitions ◽  
Nous Montrons ◽  
Restricted Partition ◽  
International Audience ◽  
Border Strip

International audience For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $Π ^• _{\vec{c}}$ is a wedge of $β\vec{c}$ spheres of the same dimensions, where $β\vec{c}$ is the number of permutations with descent composition ^$\vec{c}$. Furthermore, the action of the symmetric group on the top homology is isomorphic to the Specht module $S^B$ where $B$ is a border strip associated to the composition $\vec{c}$. We also study the filter of pointed set partitions generated by a knapsack integer partitions and show the analogous results on homotopy type and action on the top homology. Pour chaque composition $\vec{c}$ nous montrons que le complexe simplicial des chaînes de l'ensemble ordonné $Π ^• _{\vec{c}}$ des partitions pointées d'un ensemble est un bouquet de $β\vec{c}$ sphères de même dimension, où $β\vec{c}$ est le nombre de permutations ayant la composition de descentes $\vec{c}$. De plus, l'action du groupe symétrique sur le groupe d'homologie de degré maximum est isomorphe au module de Specht $S^B$ où $B$ est la bande frontalière associée à la composition $\vec{c}$. Nous étudions aussi le filtre des partitions pointées d'un ensemble, engendré par des partitions d'entiers de type "sac à dos'' et nous démontrons des résultats analogues pour le type d'homotopie et pour l'action sur le groupe d'homologie de degré maximum.

scholarly journals Ascent Sequences and Upper Triangular Matrices Containing Non-Negative Integers

10.37236/325 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Mark Dukes ◽  
Robert Parviainen
Keyword(s):  
Simple Condition ◽  
Set Partitions ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Classes Of Matrices ◽  
Zero Entry ◽  
Binary Matrices ◽  
Ascent Sequences ◽  
Natural Statistics ◽  
Special Classes

This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics on these structures under this bijection and prove that some of these statistics are equidistributed. Several special classes of matrices are shown to have simple formulations in terms of ascent sequences. Binary matrices are shown to correspond to ascent sequences with no two adjacent entries the same. Bidiagonal matrices are shown to be related to order-consecutive set partitions and a simple condition on the ascent sequences generate this class.

Sign in / Sign up

Export Citation Format

Share Document