Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRestrictions of rainbow supercharacters
178
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The maximal subgroup of unipotent upper-triangular matrices of the finite general linear groups are a fundamental family of $p$-groups. Their representation theory is well-known to be wild, but there is a standard supercharacter theory, replacing irreducible representations by super-representations, that gives us some control over its representation theory. While this theory has a beautiful underlying combinatorics built on set partitions, the structure constants of restricted super-representations remain mysterious. This paper proposes a new approach to solving the restriction problem by constructing natural intermediate modules that help factor the computation of the structure constants. We illustrate the technique by solving the problem completely in the case of rainbow supercharacters (and some generalizations). Along the way we introduce a new $q$-analogue of the binomial coefficients that depend on an underlying poset.
rate research
Read More
No two rainbows are the same. Neither are two packs of Skittles. Enjoy an odd mix!. Using an interpretation via spatial random walks, we quantify the probability that two randomly selected packs of Skittles candy are identical and determine the expected number of packs one has to purchase until the first match. We believe this problem to be appealing for middle and high school students as well as undergraduate students at University.
Let $p$ be any prime. Let $P_n$ be a Sylow $p$-subgroup of the symmetric group $S_n$. Let $phi$ and $psi$ be linear characters of $P_n$ and let $N$ be the normaliser of $P_n$ in $S_n$. In this article we show that the inductions of $phi$ and $psi$ to $S_n$ are equal if, and only if, $phi$ and $psi$ are $N$--conjugate. This is an analogue for symmetric groups of a result of Navarro for $p$-solvable groups.
For $G={rm GL}(n,q)$, the proportion $P_{n,q}$ of pairs $(chi,g)$ in ${rm Irr}(G)times G$ with $chi(g) eq 0$ satisfies $P_{n,q}to 0$ as $ntoinfty$.
Let $W$ denote a simply-laced Coxeter group with $n$ generators. We construct an $n$-dimensional representation $phi$ of $W$ over the finite field $F_2$ of two elements. The action of $phi(W)$ on $F_2^n$ by left multiplication is corresponding to a combinatorial structure extracted and generalized from Vogan diagrams. In each case W of types A, D and E, we determine the orbits of $F_2^n$ under the action of $phi(W)$, and find that the kernel of $phi$ is the center $Z(W)$ of $W.$
We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type A_{n-1}, we rederive the description of the generalized exponents in terms of crystal graphs without using the combinatorics of semistandard tableaux or the charge statistic. In finite type C_n, we obtain a combinatorial description of the generalized exponents based on the so-called distinguished vertices in crystals of type A_{2n-1}, which we also connect to symplectic King tableaux. This gives a combinatorial proof of the positivity of Lusztig t-analogues associated to zero weight spaces in the irreducible representations of symplectic Lie algebras. We also present three applications of our combinatorial formula, and discuss some implications to relating two type C branching rules. Our methods are expected to extend to the orthogonal types.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
