Related papers: The Noether numbers for cyclic groups of prime ord…

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

For a Grothendieck category having a noetherian generator, we prove that there are only finitely many minimal atoms. This is a noncommutative analogue of the fact that every noetherian scheme has only finitely many irreducible components.…

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

We investigate the occurrence of elements of order $p$ in the upper central series of a finite $p$-group.

We construct a family of finitely generated infinite periodic groups. The basic example is a 2-group, called the tetrahedron group. We generalize the construction by suggesting a family of infinite finitely generated dice groups. We provide…

We prove that the degree $r(2p-3)$ cohomology of any finite group of Lie type over $\mathbb{F}_{p^r}$, with coefficients in characteristic $p$, is nonzero as long as its Coxeter number is at most $p$. We do this by providing a simple…

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

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…

We generalize the notion of length to an ordinal-valued invariant defined on the class of finitely generated modules over a Noetherian ring. A key property of this invariant is its semi-additivity on short exact sequences. As an…

Let $G=\Sp(2g,\mathbb{Z})$ be the symplectic group over the integers. Given $m\in \mathbb{N}$, it is natural to ask if there exists a non-trivial matrix $A\in G$ such that $A^{m}=I$, where $I$ is the identity matrix in $G$. In this paper,…

We prove that for any toric ideal of a graph the degree of any element of Graver basis is bounded above by an exponential function of the maximal degree of a circuit.

We show that a nonempty family of $n$-generated subgroups of a pro-$p$ group has a maximal element. This suggests that 'Noetherian Induction' can be used to discover new features of finitely generated subgroups of pro-$p$ groups. To…

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

In Part I it was shown that if G is a p-group of class k, generated by elements of orders 1<p^{alpha_1} <= ... <= p^{alpha_r}, then a necessary condition for the capability of G is that r>1 and alpha_r <= alpha_{r-1} + [(k-1)/(p-1)]. It was…

We found a regularity of the behavior of primes that allows to represent both prime and natural numbers as infinite matrices with a common formation rule of their rows. This regularity determines a new class of infinite cyclic groups that…

For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…

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…

A vertex subset S of a graph G is said to 2-dominate the graph if each vertex not in S has at least two neighbors in it. As usual, the associated parameter is the minimum cardinal of a 2-dominating set, which is called the 2-domination…