Related papers: Critical groups of group representations
We use the structure of finite-dimensional graded algebras to develop the theory of antilinear representations of finite $C_2$-graded groups. A finite $C_2$-graded group is a finite group with a subgroup of index 2. In this theory the…
We give a presentation of a finite crystallographic reflection group in terms of an arbitrary seed in the corresponding cluster algebra of finite type and interpret the presentation in terms of companion bases in the associated root system.
Our confidence set quantifies the statistical uncertainty from data-driven group assignments in grouped panel models. It covers the true group memberships jointly for all units with pre-specified probability and is constructed by inverting…
By considering appropriate finite covering spaces of closed non-orientable surfaces, we construct linear representations of their mapping class group which have finite index image in certain big arithmetic groups.
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.
In this report we summarize this work, all finite simple groups $G$ can determined uniformly using their orders $|G|$ and the set $\pi_e(G)$ of their element orders.
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
This is a survey article on the theory of finite complex reflection groups. No proofs are given but numerous references are included.
The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. We show that every non-positive integer is the…
An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.
Arithmetical properties of a finite group are properties of the group which are defined by its arithmetical parameters such as the order of the group, the element orders and so on. In this paper, we discuss a number of results on…
We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…
In the previous paper, we proposed a practical method of constructing explicitly representation groups $R(G)$ for finite groups $G$, and apply it to certain typical finite groups $G$ with Schur multiplier $M(G)$ containing prime number 3.…
The strong symmetric genus of a finite group is the minimum genus of a compact Riemann surface on which the group acts as a group of automorphisms preserving orientation. A characterization of the infinite number of groups with strong…
Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
Motivated by the appearance of embeddings in the theory of chip firing and the critical group of a graph, we introduce a version of the critical group (or sandpile group) for combinatorial maps, that is, for graphs embedded in orientable…