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 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 A $\lambda$-ring Frobenius Characteristic for $G\wr S_n$

10.37236/1809 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Anthony Mendes ◽  
Jeffrey Remmel ◽  
Jennifer Wagner
Keyword(s):  
Representation Theory ◽  
Symmetric Group ◽  
Kronecker Product ◽  
Reproducing Kernel ◽  
Irreducible Representations ◽  
Inner Product ◽  
Irreducible Components ◽  
Lambda Ring

A $\lambda$-ring version of a Frobenius characteristic for groups of the form $G \wr S_n$ is given. Our methods provide natural analogs of classic results in the representation theory of the symmetric group. Included is a method decompose the Kronecker product of two irreducible representations of $G\wr S_n$ into its irreducible components along with generalizations of the Murnaghan-Nakayama rule, the Hall inner product, and the reproducing kernel for $G\wr S_n$.

Automorphisms of the total graph over upper triangular matrices

2019 ◽  
Vol 19 (08) ◽  
pp. 2050161
Author(s):  
Long Wang ◽  
Xianwen Fang ◽  
Fenglei Tian
Keyword(s):  
Finite Field ◽  
Total Graph ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Zero Divisors ◽  
Singular Matrices

Let [Formula: see text] be a finite field, [Formula: see text] the ring of all [Formula: see text] upper triangular matrices over [Formula: see text], [Formula: see text] the set of all zero-divisors of [Formula: see text], i.e. [Formula: see text] consists of all [Formula: see text] upper triangular singular matrices over [Formula: see text]. The total graph of [Formula: see text], denoted by [Formula: see text], is a graph with all elements of [Formula: see text] as vertices, and two distinct vertices [Formula: see text] are adjacent if and only if [Formula: see text]. In this paper, we determine all automorphisms of the total graph [Formula: see text] of [Formula: see text].

A Remark by Philip Hall

1958 ◽  
Vol 1 (1) ◽  
pp. 21-23 ◽  
Author(s):  
G. de B. Robinson
Keyword(s):  
Representation Theory ◽  
Symmetric Group ◽  
Linear Group ◽  
Characteristic Zero ◽  
Irreducible Representations ◽  
Young Diagrams ◽  
Linear Transformations ◽  
Modern Physics ◽  
The Right ◽  
The Relationship

The relationship between the representation theory of the full linear group GL(d) of all non-singular linear transformations of degree d over a field of characteristic zero and that of the symmetric group Sn goes back to Schur and has been expounded by Weyl in his classical groups, [4; cf also 2 and 3]. More and more, the significance of continuous groups for modern physics is being pressed on the attention of mathematicians, and it seems worth recording a remark made to the author by Philip Hall in Edmonton.As is well known, the irreducible representations of Sn are obtainable from the Young diagrams [λ]=[λ1, λ2 ,..., λr] consisting of λ1 nodes in the first row, λ2 in the second row, etc., where λ1≥λ2≥ ... ≥λr and Σ λi = n. If we denote the jth node in the ith row of [λ] by (i,j) then those nodes to the right of and below (i,j), constitute, along with the (i,j) node itself, the (i,j)-hook of length hij.

Automorphism group and fixing number of the orthogonality graph based on rank one upper triangular matrices

2020 ◽  
pp. 2250023
Author(s):  
Shikun Ou ◽  
Yanqi Fan ◽  
Fenglei Tian
Keyword(s):  
Automorphism Group ◽  
Finite Field ◽  
Canonical Form ◽  
Undirected Graph ◽  
Induced Subgraph ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Zero Divisors ◽  
Rank One ◽  
Vertex Set

The orthogonality graph [Formula: see text] of a ring [Formula: see text] is the undirected graph with vertex set consisting of all nonzero two-sided zero divisors of [Formula: see text], in which for two vertices [Formula: see text] and [Formula: see text] (needless distinct), [Formula: see text] is an edge if and only if [Formula: see text]. Let [Formula: see text], [Formula: see text] be the set of all [Formula: see text] matrices over a finite field [Formula: see text], and [Formula: see text] the subset of [Formula: see text] consisting of all rank one upper triangular matrices. In this paper, we describe the full automorphism group, and using the technique of generalized equivalent canonical form of matrices, we compute the fixing number of [Formula: see text], the induced subgraph of [Formula: see text] with vertex set [Formula: see text].

scholarly journals A Plethysm Formula on the Characteristic Map of Induced Linear Characters from $U_n(\mathbb F_q)$ to $GL(\mathbb F_q)$

10.37236/2364 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Zhi Chen
Keyword(s):  
Finite Field ◽  
Recurrence Relation ◽  
Linear Group ◽  
General Linear Group ◽  
Symmetric Functions ◽  
General Linear ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Characteristic Map

This paper gives a plethysm formula on the characteristic map of the induced linear characters from the unipotent upper-triangular matrices $U_n(\mathbb F_q)$ to $GL_n(\mathbb F_q)$, the general linear group over finite field $\mathbb F_q$. The result turns out to be a multiple of a twisted version of the Hall-Littlewood symmetric functions $\tilde{P}_n[Y;q]$. A recurrence relation is also given which makes it easy to carry out the computation.

Sign in / Sign up

Export Citation Format

Share Document