相关论文: Maximal Order of an NG-group
An $n$-ary operation $Q:S^n -> S$ is called an $n$-ary quasigroup of order $|S|$ if in the equation $x_{0}=Q(x_1,...,x_n)$ knowledge of any $n$ elements of $x_0$, ..., $x_n$ uniquely specifies the remaining one. $Q$ is permutably reducible…
Let $p$ be a prime. A $p$-group $G$ is defined to be semi-extraspecial if for every maximal subgroup $N$ in $Z(G)$ the quotient $G/N$ is a an extraspecial group. In addition, we say that $G$ is ultraspecial if $G$ is semi-extraspecial and…
Let $G$ be a finite group and let $\psi(G)$ denote the sum of element orders of $G$. It is well-known that the maximum value of $\varphi$ on the set of groups of order $n$, where $n$ is a positive integer, will occur at the cyclic group…
The same-order type $\tau_e(G)$ of a finite group $G$ is a set formed of the sizes of the equivalence classes containing the same order elements of $G$. In this paper, we study an arithmetical property of this set. More exactly, we outline…
We study $6$-transposition groups, i.e. groups generated by a normal set of involutions $D$, such that the order of the product of any two elements from $D$ does not exceed $6$. We classify most of the groups generated by $3$ elements from…
Let $A$ be an arbitrary symmetrizable Cartan matrix of rank $r$, and ${\bf n}={\bf n_+}$ be the standard maximal nilpotent subalgebra in the Kac-Moody algebra associated with $A$ (thus, ${\bf n}$ is generated by $E_1,\ldots,E_r$ subject to…
Recent investigations on the set of commutators between the elements of a finite group having relatively prime orders have prompt us to propose a variant of the Ore conjecture: For every finite non-abelian simple group and for every $g\in…
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…
A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
In this study, it is proven that the universal equivalence of general linear groups (admitting the inverse-transpose automorphism) of orders greater than $2$, over local, not necessarily commutative rings with $1/2$, is equivalent to the…
We study algebraic, combinatorial and topological properties of the set of preorders on a group, and the set of valuations on a field. We show strong analogies between these two kinds of sets and develop a dictionary for these ones. Among…
Answering a question of I. M. Isaacs, we show that the largest degree of irreducible complex representations of any finite non-abelian simple group can be bounded in terms of the smaller degrees. We also study the asymptotic behavior of…
For a positive integer $k$, a group $G$ is said to be totally $k$-closed if for each set $\Omega$ upon which $G$ acts faithfully, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ that leaves invariant each of the $G$-orbits in the…
We prove a few basic facts about the space of bi-invariant (or left-invariant) total order relations on a torsion-free, nonabelian, nilpotent group G. For instance, we show that the space of bi-invariant orders has no isolated points (so it…
The order sequence of a finite group $G$ is a non-decreasing finite sequence formed of the element orders of $G$. Several properties of order sequences were studied by P. J. Cameron and H. K. Dey in a recent paper that concludes with a list…
Let $\lambda=(\lambda_1,\lambda_2,...)$ be a \emph{partition} of $n$, a sequence of positive integers in non-increasing order with sum $n$. Let $\Omega:=\{1,...,n\}$. An ordered partition $P=(A_1,A_2,...)$ of $\Omega$ has \emph{type}…
We prove that |A^n| > c_n |A|^{[\frac{n+1}{2}]} for any finite subset A of a free group if A contains at least two noncommuting elements, where c_n>0 are constants not depending on A. Simple examples show that the order of these estimates…
A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…
Given a finite group $G$ of order $n.$ Denote the sum of the inverse-power of element orders in $G$ by $m(G).$ Let $\mathbb{Z}_n$ be the cyclic group of order $n.$ Suppose $G$ is a non-cyclic group of order $n$ then we show that $m(G)\geq…