Related papers: Linear limits of irreducible characters

We present a strong upper bound on the number k(B) of irreducible characters of a p-block B of a finite group G in terms of local invariants. More precisely, the bound depends on a chosen major B-subsection (u,b), its normalizer N_G(\langle…

In the first chapters, this paper contains a survey on the theory of ordinary characters of finite reductive groups with non-connected centre. The last chapters are devoted to the proof of Lusztig's conjecture on characteristic functions of…

For a fixed number field and an elliptic curve defined and semi-stable over this number field, we consider the set of prime numbers p such that the Galois representation attached to the p-torsion points of the elliptic curve is reducible.…

Possible forms of obstructed atomic limits in quasi-one-dimensional systems are studied using line group symmetry. This is accomplished by revisiting the standard theory with an emphasis on its group-theoretical background, synthesizing the…

The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…

The object of this short note is to prove a theorem and present a conjecture for the number of even entries in the character table of the symmetric group.

Let $G$ be a nonabelian finite group and let $d$ be an irreducible character degree of $G$. Then there is a positive integer $e$ so that $|G| = d(d+e)$. Snyder has shown that if $e > 1$, then $|G|$ is bounded by a function of $e$. This…

Understanding how systems respond to external perturbations is fundamental to statistical physics. For systems far from equilibrium, a general framework for response remains elusive. While progress has been made on the linear response of…

A classical theorem of Paley asserts the existence of an infinite family of quadratic characters whose character sums become exceptionally large. In this paper, we establish an analogous result for characters of any fixed even order.…

In this paper we prove that a recent condition of Lyons--Mart\'inez--Navarro--Tiep, regarding the field of values of extensions of characters in principal blocks, is satisfied for all finite simple groups, which when combined with their…

In this paper, we prove Lusztig's conjecture for finite special linear groups, i.e., we show that characteristic functions of character sheaves coincide with almost characters up to scalar constants, under the condition that the…

We investigate the number of prime factors of individual entries for matrices in the special linear group over the integers. We show that, when properly normalised, it satisfies a central limit theorem of Erd\H{o}s-Kac-type. To do so, we…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

We give a new proof of the classical Central Limit Theorem, in the Mallows ($L^r$-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality…

We generalize the definition of pseudo monomial characters and $M$-groups to the Brauer character and Isaacs' $\pi$-partial character settings. We prove an analogs of Isaacs's generalization of Taketa's theorem in those settings. We…

Slattery has generalized Brauer's theory of p-blocks of finite groups to pi-blocks of pi-separable groups where pi is a set of primes. In this setting we show that the order of a defect group of a pi-block B is bounded in terms of the…

We study rationality properties of irreducible characters of finite groups. We show that the continuity of $2$-rationality is a phenomenon that can be detected in the principal $2$-block, thus refining a recent result of N. N. Hung. We also…

In 1985, Yu. V. Nesterenko produced a criterion for linear independence, which is a variant of Siegel's. While Siegel uses upper bounds on full systems of forms, Nesterenko uses upper and lower bounds on sufficiently dense sequences of…

Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…

Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role in various analyses and applications of logically constrained…