Irreducible representations of the group of infinite upper triangular matrices

1986 ◽  
Vol 38 (2) ◽  
pp. 226-229 ◽  
Author(s):  
V. L. Ostrovskii
10.37236/8241 ◽  
2019 ◽  
Vol 26 (2) ◽  
Author(s):  
Megan Ly

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. 


10.37236/112 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Nathaniel Thiem ◽  
Vidya Venkateswaran

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).


2006 ◽  
Vol 183 (2) ◽  
pp. 729-737 ◽  
Author(s):  
Rafael Álvarez ◽  
Francisco Ferrández ◽  
José-Francisco Vicent ◽  
Antonio Zamora

2019 ◽  
Vol 26 (1/2) ◽  
pp. 197-201
Author(s):  
Driss Aiat Hadj Ahmed

Let ℱ be a field of zero characteristic, let Nn(ℱ) denote the algebra of n×n strictly upper triangular matrices with entries in ℱ, and let f:Nn(ℱ)→Nn(ℱ) be a nonlinear Jordan centralizer of Nn(ℱ),that is, a map satisfying that f(XY+YX)=Xf(Y)+f(Y)X, for all X, Y∈Nn(ℱ). We prove that f(X)=λX+η(X) where λ∈ℱ and η is a map from Nn(ℱ) into its center 𝒵(Nn(ℱ)) satisfying that η(XY+YX)=0 for every X,Yin Nn(F).


Sign in / Sign up

Export Citation Format

Share Document