Displaying 101 – 120 of 318

Showing per page

Groups in which the prime graph is a tree

Maria Silvia Lucido (2002)

Bollettino dell'Unione Matematica Italiana

The prime graph Γ G of a finite group G is defined as follows: the set of vertices is π G , the set of primes dividing the order of G , and two vertices p , q are joined by an edge (we write p q ) if and only if there exists an element in G of order p q . We study the groups G such that the prime graph Γ G is a tree, proving that, in this case, π G 8 .

Inverse zero-sum problems in finite Abelian p-groups

Benjamin Girard (2010)

Colloquium Mathematicae

We study the minimal number of elements of maximal order occurring in a zero-sumfree sequence over a finite Abelian p-group. For this purpose, and in the general context of finite Abelian groups, we introduce a new number, for which lower and upper bounds are proved in the case of finite Abelian p-groups. Among other consequences, our method implies that, if we denote by exp(G) the exponent of the finite Abelian p-group G considered, every zero-sumfree sequence S with maximal possible length over...

Currently displaying 101 – 120 of 318