Related papers: Character stacks are PORC count
Let $\mathbf{G}$ be a connected reductive group with connected center defined over $\mathbb{F}_q$, with Frobenius morphism F. Given an irreducible complex character $\chi$ of $\mathbf{G}^F$ with its Jordan decomposition, and a Galois…
We study the intermediate extension of the character sheaves on an adjoint group to the semi-stable locus of its wonderful compactification. We show that the intermediate extension can be described by a direct image construction. As a…
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
In the first section we study a functor of Bezrukavnikov, Finkelberg and Ostrik defined on character sheaves; we compute it in a Grothendieck group taking weights into account. In the second section we enlarge the class of character sheaves…
This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…
Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for…
We find a simple product formula for the characteristic polynomial of the permutations with a fixed descent set under the weak order. As a corollary we obtain a simple product formula for the characteristic polynomial of alternating…
We establish a polynomial ergodic theorem for actions of the affine group of a countable field $K$. As an application, we deduce--via a variant of Furstenberg's correspondence principle--that for fields of characteristic zero, any "large"…
Let $G$ be a finite group and $\mathrm{Irr}(G)$ the set of all irreducible complex characters of $G$. Define the codegree of $\chi \in \mathrm{Irr}(G)$ as $\mathrm{cod}(\chi):=\frac{|G:\mathrm{ker}(\chi) |}{\chi(1)}$ and denote by…
The computation of the characters of supercuspidal representations of a p-adic group involves some 4th roots of unity whose values are defined in terms of orbits of the Galois group of a p-field on a root system. The part of the definition…
We prove that there is a one-one correspondence between sets of irreducible representations of a polyadic group and its Post's cover. Using this correspondence, we generalize some well-known properties of irreducible characters in finite…
We investigate a conjecture to describe the characters of large families of RCFT's in terms of contour integrals of Feigin-Fuchs type. We provide a simple algorithm to determine the modular S-matrix for arbitrary numbers of characters as a…
We prove a broad generalization of a theorem of W. Burnside on real characters using permutation characters. Under a necessary hypothesis, We can give some control on multiplicities (a result that needs the Classification of Finite Simple…
We study a spectral problem related to the finite-dimensional characters of the groups $Sp(2N)$, $SO(2N+1)$, and $SO(2N)$, which form the classical series $C$, $B$, and $D$, respectively. The irreducible characters of these three series are…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.
We prove the multiplicity one case of Lusztig's conjecture on the irreducible characters of reductive algebraic groups for all fields with characteristic above the Coxeter number.
Let $F$ be a number field. Given a quadratic polynomial $f_c(z) = z^2 + c \in F[z]$, we can construct a directed graph $Preper(f_c, F)$ (also called a portrait), whose vertices are $F$-rational preperiodic points for $f_c$, with an edge…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…