Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSupercharacters of the Sylow p-subgroups of the finite symplectic and orthogonal groups
157
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We define and study supercharacters of the classical finite unipotent groups of symplectic and orthogonal types (over any finite field of odd characteristic). We show how supercharacters for groups of those types can be obtained by restricting the supercharacter theory of the finite unitriangular group, and prove that supercharacters are orthogonal and provide a partition of the set of all irreducible characters. We also describe all irreducible characters of maximum degree in terms of the root system, and show how they can be obtained as constituents of particular supercharacters.
rate research
Read More
We define the superclasses for a classical finite unipotent group $U$ of type $B_{n}(q)$, $C_{n}(q)$, or $D_{n}(q)$, and show that, together with the supercharacters defined in a previous paper, they form a supercharacter theory. In particular, we prove that the supercharacters take a constant value on each superclass, and evaluate this value. As a consequence, we obtain a factorization of any superclass as a product of elementary superclasses. In addition, we also define the space of superclass functions, and prove that it is spanned by the supercharacters. As as consequence, we (re)obtain the decomposition of the regular character as an orthogonal linear combination of supercharacters. Finally, we define the supercharacter table of $U$, and prove various orthogonality relations for supercharacters (similar to the well-known orthogonality relations for irreducible characters).
Denote by $ u_p(G)$ the number of Sylow $p$-subgroups of $G$. It is not difficult to see that $ u_p(H)leq u_p(G)$ for $Hleq G$, however $ u_p(H)$ does not divide $ u_p(G)$ in general. In this paper we reduce the question whether $ u_p(H)$ divides $ u_p(G)$ for every $Hleq G$ to almost simple groups. This result substantially generalizes the previous result by G. Navarro and also provides an alternative proof for the Navarro theorem.
Let $q$ be a power of a prime $p$, let $G$ be a finite Chevalley group over $mathbb{F}_q$ and let $U$ be a Sylow $p$-subgroup of $G$; we assume that $p$ is not a very bad prime for $G$. We explain a procedure of reduction of irreducible complex characters of $U$, which leads to an algorithm whose goal is to obtain a parametrization of the irreducible characters of $U$ along with a means to construct these characters as induced characters. A focus in this paper is determining the parametrization when $G$ is of type $mathrm{F}_4$, where we observe that the parametrization is uniform over good primes $p > 3$, but differs for the bad prime $p = 3$. We also explain how it has been applied for all groups of rank $4$ or less.
In this paper we measure how efficiently a finite simple group $G$ is generated by its elements of order $p$, where $p$ is a fixed prime. This measure, known as the $p$-width of $G$, is the minimal $kin mathbb{N}$ such that any $gin G$ can be written as a product of at most $k$ elements of order $p$. Using primarily character theoretic methods, we sharply bound the $p$-width of some low rank families of Lie type groups, as well as the simple alternating and sporadic groups.
Suppose that p is an odd prime and G is a finite group having no normal non-trivial p-subgroup. We show that if a is an automorphism of G of p-power order centralizing a Sylow p-group of G, then a is inner. This answers a conjecture of Gross. An easy corollary is that if p is an odd prime and P is a Sylow p-subgroup of G, then the center of P is contained in the generalized Fitting subgroup of G. We give two proofs both requiring the classification of finite simple groups. For p=2, the result fails but Glauberman in 1968 proved that the square of a is inner. This answered a problem of Kourovka posed in 1999.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
