相关论文: Classification of Element Systems over Finite Comm…

We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…

A complete classification of finitely generated involutive commutative two-valued groups is obtained. Three series of such two-valued groups are constructed: principal, unipotent and special, and it is shown that any finitely generated…

It is known that a group G definable in the field of p-adic numbers is definably locally isomorphic to the group of Q_p-points of a connected algebraic group H defined over Q_p. We show that if H is commutative then G is…

We characterize finite groups G generated by orthogonal transformations in a finite-dimensional Euclidean space V whose fixed point subspace has codimension one or two in terms of the corresponding quotient space V/G with its quotient…

We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.

We classify all finite groups with five relative commutativity degrees. Also, we give a partial answer to our previous conjecture on a lower bound of the number of relative commutativity degrees of finite groups.

For each finite classical group $G$, we classify the subgroups of $G$ which act transitively on a $G$-invariant set of subspaces of the natural module, where the subspaces are either totally isotropic or nondegenerate. Our proof uses the…

For a finite group $G$ let $\sigma(G)$ (the "sum" of $G$) be the least number of proper subgroups of $G$ whose set-theoretical union is equal to $G$, and $\sigma(G)=\infty$ if $G$ is cyclic. We say that a group $G$ is $\sigma$-elementary if…

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

We extend the usual notion of fully commutative elements from the Coxeter groups to the complex reflection groups. Then we decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties,…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

Let $ G $ be a cyclic group, in this paper, we study the Herbrand quotient and $ 1-$th cohomology group on finitely generated $ G-$modules in some cases. When $ G $ is of order $ 2, $ the order of the cohomology group is explicitly related…

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

Let $G$ be a finite group, $L_1(G)$ be its poset of cyclic subgroups and consider the quantity $\alpha(G)=\frac{|L_1(G)|}{|G|}$. The aim of this paper is to study the class $\cal{C}$ of finite nilpotent groups having…

We present a classification of finite $p$-groups $G$ with $\gamma_2(G)$, the commutator subgroup of $G$, of order $p^4$ and exponent $p$ such that not all elements of $\gamma_2(G)$ are commutators.

In this note some properties of the sum of element orders of a finite abelian group are studied.

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

Fully commutative elements in types $B$ and $D$ are completely characterized and counted by Stembridge. Recently, Feinberg-Kim-Lee-Oh have extended the study of fully commutative elements from Coxeter groups to the complex setting, giving…

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…