相关论文: Linear limits of irreducible characters

A character of a group is said to be super-monomial if every primitive character inducing it is linear. It is conjectured by Isaacs that every irreducible character of an odd $M$-group is super-monomial. We show that all non linear…

The goal of this paper is to establish that it remains undecidable whether a sequent is provable in two systems in which a weakening rule for an exponential modality is completely omitted from classical propositional linear logic…

We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…

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…

In 1984, Michael Aschbacher proved a seminal classification theorem for the maximal subgroups of effectively all of the classical groups. In this thesis we give a comprehensive, yet accessible description and proof of Aschbacher's theorem,…

In this note we give applications of recent results coming mostly from the third paper of this series. It is shown that the number of irreducible characters in a $p$-block of a finite group with abelian defect group $D$ is bounded by $|D|$…

I. M. Isaacs has conjectured (see \cite{isa00}) that if the product of two faithful irreducible characters of a solvable group is irreducible, then the group is cyclic. In this paper we prove a special case of the following conjecture,…

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

In representation theory of finite groups an important role is played by irreducible characters of p-defect 0, for a prime p dividing the group order. These are exactly those vanishing at the p-singular elements. In this paper we generalize…

We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…

Recently, a strong exponential character bound has been established in [3] for all elements $g \in \mathbf{G}^F$ of a finite reductive group $\mathbf{G}^F$ which satisfy the condition that the centraliser $C_{\mathbf{G}}(g)$ is contained in…

We derive a strong law of large numbers, a central limit theorem, a law of the iterated logarithm and a large deviation theorem for so-called deviation means of independent and identically distributed random variables (for the strong law of…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

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…

We prove that if the average of the degrees of the irreducible characters of a finite group $G$ is less than 16/5, then $G$ is solvable. This solves a conjecture of I.M. Isaacs, M. Loukaki, and the first author. We discuss related…

If matrices almost satisfying a group relation are close to matrices exactly satisfying the relation, then we say that a group is matricially stable. Here "almost" and "close" are in terms of the Hilbert-Schmidt norm. Using tracial 2-norm…

For a fixed prime power $q$, let $\text{GL}_\bullet(q)$ denote the family of groups $\text{GL}_N(q)$ for $N \in \mathbb{Z}_{\geq 0}$. In this paper we study the $\mathbb{C}$-algebra of "stable" class functions of $\text{GL}_\bullet(q)$, and…

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

Let $G$ be a finite group and $p$ a prime. We establish an upper bound for the derived length of a Sylow $p$-subgroup of $G$ in terms of the number of irreducible characters of $G$ whose degrees are divisible by $p$. We also prove that if…

Answering a question of J. Rosenberg, we construct the first examples of infinite characters on $GL_n(\mathbf{K})$ for a global field $\mathbf{K}$ and $n\geq 2.$ The case $n=2$ is deduced from the following more general result. Let $G$ a…