‎let $v$ be a vector space over a field $f$ of characteristic $pgeq 0$ and let‎ ‎$t$ be a regular subgroup of the affine group $agl(v)$‎. ‎in the finite dimensional case we show that‎, ‎if $t$ is abelian or $p>0$‎, ‎then $t$ is unipotent‎. ‎for $t$ abelian‎, ‎pushing forward some ideas used in [a‎. ‎caranti‎, ‎f‎. ‎dalla volta and m‎. ‎sala‎, ‎abelian regular subgroups of the affine group and r...

In this paper we give an elementary argument about the atoms and coatoms of the latticeof all subgroups of a group. It is proved that an abelian group of finite exponent is strongly coatomic.

a $p$-group $g$ is $p$-central if $g^{p}le z(g)$‎, ‎and $g$ is‎ ‎$p^{2}$-abelian if $(xy)^{p^{2}}=x^{p^{2}}y^{p^{2}}$ for all $x,yin‎ ‎g$‎. ‎we prove that for $g$ a finite $p^{2}$-abelian $p$-central ‎$p$-group‎, ‎excluding certain cases‎, ‎the order of $g$ divides the ‎order of $text{aut}(g)$‎.

the textit{commutativity degree}, $pr(g)$, of a finite group $g$ (i.e. the probability that two (randomly chosen) elements of $g$ commute with respect to its operation)) has been studied well by many authors. it is well-known that the best upper bound for $pr(g)$ is $frac{5}{8}$ for a finite non--abelian group $g$. in this paper, we will define the same concept for a finite non--abelian textit{...

given a non-abelian finite group $g$, let $pi(g)$ denote the set of prime divisors of the order of $g$ and denote by $z(g)$ the center of $g$. thetextit{ prime graph} of $g$ is the graph with vertex set $pi(g)$ where two distinct primes $p$ and $q$ are joined by an edge if and only if $g$ contains an element of order $pq$ and the textit{non-commuting graph} of $g$ is the graph with the vertex s...

A group is small if it has countably many complete n-types over the empty set for each natural number n. More generally, a group G is weakly small if it has countably many complete 1-types over every finite subset of G. We show here that in a weakly small group, subgroups which are definable with parameters lying in a finitely generated algebraic closure satisfy the descending chain conditions ...

‎the number of factorizations of a finite abelian group as the product of two subgroups is computed in two different ways and a combinatorial identity involving gaussian binomial coefficients is presented‎.