Related papers: Algorithmically distinguishing irreducible charact…

We give new evidences to the fact that the structure of a solvable group can be controlled by irreducible monomial characters. In particular we inspect the role of monomial characters in Isaacs-Navarro-Wolf's conjecture and in Gluck's…

Given a set of integers containing no 3-term arithmetic progressions, one constructs a Stanley sequence by choosing integers greedily without forming such a progression. Independent Stanley sequences are a "well-structured" class of Stanley…

Given a prime number $p$, every irreducible character $\chi$ of a finite group $G$ determines a unique conjugacy class of $p$-subgroups of $G$ which we will call the anchors of $\chi$. This invariant has been considered by L. Barker in the…

Let J be a finite-dimensional nilpotent algebra over a finite field F_q. We formulate a procedure for analysing characters of the group 1+J. In particular, we study characters of the group $U_n (q)$ of unipotent triangular $n\times n$…

We prove a closed character formula for the symmetric powers $S^N V(\lambda)$ of a fixed irreducible representation $V(\lambda)$ of a complex semi-simple Lie algebra $\mathfrak{g}$ by means of partial fraction decomposition. The formula…

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

Let $k$ be a field of characteristic two. We prove that a non constant monic polynomial $f\in k[X]$ of degree $n$ is the minimal/characteristic polynomial of a symmetric matrix with entries in $k$ if and only if it is not the product of…

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

We produce an algorithm that, given $\phi\in Out(F_N)$, where $N\ge 2$, decides wether or not $\phi$ is an iwip ("fully irreducible") automorphism.

System F, the polymorphic lambda calculus, features the principle of impredicativity: polymorphic types may be (explicitly) instantiated at other types, enabling many powerful idioms such as Church encoding and data abstraction.…

For a root system R, a field K and an invertible element q in K let U be the associated quantum group, defined via Lusztig's divided powers construction. We study the irreducible characters of this algebra with integral (but not necessarily…

We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}_n(\mathbb{C})$, ${\rm SO}_{2n+1}(\mathbb{C})$, ${\rm Sp}_{2n}(\mathbb{C})$, ${\rm SO}_{2n}(\mathbb{C})$ and the "non-classical" odd…

A study is carried out of the elementary theory of quotients of symmetric groups in a similar spirit to [Sh:24]. Apart from the trivial and alternating subgroups, the normal subgroups of the full symmetric group S(mu) on an infinite…

We obtain nontrivial estimates of quadratic character sums of division polynomials $\Psi_n(P)$, $n=1,2, ...$, evaluated at a given point $P$ on an elliptic curve over a finite field of $q$ elements. Our bounds are nontrivial if the order of…

This paper studies irreducible characters of the $q$-rook monoid algebra $R_n(q)$ using the vertex algebraic method. Based on the Frobenius formula for $R_n(q)$, a new iterative character formula is derived with the help of the vertex…

Isaacs has defined a character to be super monomial if every primitive character inducing it is linear. Isaacs has conjectured that if $G$ is an $M$-group with odd order, then every irreducible character is super monomial. We prove that the…

Let $G$ be a finite group and $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is defined as $\chi^c(1) =\frac{|G: \ker\chi|}{\chi(1)}$. In a paper by Gao, Wang, and Chen, it was shown that $G$ cannot satisfy the condition…

We will describe the relationship between the indecomposable characters of the finitary symmetric group and its ergodic invariant random subgroups; and we will interpret each Thoma character as an asymptotic limit of a naturally associated…

We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…

We classify the irreducible complex characters of the symplectic groups $Sp_{2n}(q)$ and the orthogonal groups $Spin_{2n}^\pm(q)$, $Spin_{2n+1}(q)$ of degrees up to the bound D, where $D=(q^n-1)q^{4n-10}/2$ for symplectic groups,…