相关论文: Basic sets for unipotent blocks of finite reductiv…

We provide an example of a finite group with a conjugacy class of average size on which fewer than half of the irreducible characters are either zero or a root of unity.

Let $p$ be a prime. We classify the finite groups having exactly two irreducible $p$-Brauer characters of degree larger than one. The case, where the finite groups have orders not divisible by $p$, was done by P. P\'alfy in 1981.

We construct a supercharacter theory for the group of invertible elements of a reduced algebra. For the case of the triangular group, we obtain the formula for values of supercharacters on superclasses.

We present a method to explicitly compute a complete set of orthogonal primitive idempotents in a simple component with Schur index 1 of a rational group algebra $\mathbb{Q}G$ for $G$ a finite generalized strongly monomial group. For the…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

We give a uniform description of the decomposition of the unipotent variety of a classical group in arbitrary characteristic into pieces (considered in a non-uniform way in the earlier parts of this paper).

We describe the primitive central idempotents of the group algebra over a number field of finite monomial groups. We give also a description of the Wedderburn decomposition of the group algebra over a number field for finite strongly…

Let $k$ be an arbitrary field. We classify the maximal reductive subgroups of maximal rank in any classical simple algebraic $k$-group in terms of combinatorial data associated to their indices. This result complements [S, 2022], which does…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

In this paper, we formulate the notion of split elements of a unipotent class in a connected reductive group $G$. Generalized Green functions of $G$ can be computed by using Lusztig's algorithm, if split elements exist for any unipotent…

It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one…

In order to tackle the problem of generically determining the character tables of the finite groups of Lie type $\mathbf{G}(q)$ associated to a connected reductive group $\mathbf{G}$ over $\overline{\mathbb F}_p$, Lusztig developed the…

Finite groups with very few character values are characterized. The following is the main result of this article: a finite non-abelian group has precisely four character values if and only if it is the generalized dihedral group of a…

We prove that the number of irreducible ordinary characters in the principal $p$-block of a finite group $G$ of order divisible by $p$ is always at least $2\sqrt{p-1}$. This confirms a conjecture of H\'{e}thelyi and K\"{u}lshammer for…

We present a method to compute the Euler characteristic of an algebraic subset of $\bc^n$. This method relies on clasical tools such as Gr\"obner basis and primary decomposition. The existence of this method allows us to define a new…

Eaton and Moret\'o proposed an extension of Brauer's famous height zero conjecture on blocks of finite groups to the case of non-abelian defect groups, which predicts the smallest non-zero height in such blocks in terms of local data. We…

A connected algebraic group in characteristic 0 is uniquely determined by its Lie algebra. In this paper an algorithm is given for constructing an algebraic group in characteristic 0, given its Lie algebra. Using this an algorithm is…

Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p > 0$. We consider connected reductive subgroups $X$ of $G$ that contain a given distinguished unipotent element $u$ of $G$. A result of…

We consider the variety of nilpotent elements in the dual of the Lie algebra of a reductive algebraic group over an algebraically closed field. We propose a definition of a partition of this variety into smooth locally closed smooth…