Related papers: Rigid abelian groups and the probabilistic method

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…

The three famous problems concerning units, zero-divisors and idempotents in group rings of torsion-free groups, commonly attributed to I. Kaplansky, have been around for more than 60 years and still remain open in characteristic zero. In…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Given a compact oriented triangulated $3$-manifold we find a non-trivial condition satisfied by certain labelings of the tetrahedra by elements of an arbitrary abelian group which we call angle structures. Smoothness of the manifold is used…

A notion of degeneration of elements in groups is introduced. It is used to parametrize the orbits in a finite abelian group under its full automorphism group by a finite distributive lattice. A pictorial description of this lattice leads…

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

This is an expository work presenting in detail the proof of the structure theorem for divisible abelian groups. A divisible abelian group is an abelian group that satisfies nD=D for all natural n. The theorem states that any divisible…

We describe the main questions connected to torsion subgroups in the unit group of integral group rings of finite groups and algorithmic methods to attack these questions. We then prove the Zassenhaus Conjecture for Amitsur groups and prove…

The additivity with respect to exact sequences is notoriously a fundamental property of the algebraic entropy of group endomorphisms. It was proved for abelian groups by deeply exploiting their structure. On the other hand, a solvable…

Greither and Pareigis have established a connection between Hopf Galois structures on a Galois extension $L/K$ with Galois group $G$, and the regular subgroups of the group of permutations on $G$, which are normalized by $G$. Byott has…

The Hodge Conjecture is equivalent to a statement about conditions under which a complex vector bundle on a smooth complex projective variety admits a holomorphic structure. I advertise a class of abelian four-folds due to Mumford where…

We consider finitely generated normal algebras over an algebraically closed field of characteristic zero that come with a complexity one grading by a finitely generated abelian group such that the conditions of a UFD are satisfied for…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

Working in the soft-element (classical) viewpoint, we introduce \emph{soft bitopological groups}: soft groups endowed with two soft topologies such that the induced topologies on the set of soft elements make the soft-element group into a…

An approach to identify the normal subgroups determined by ideals in free group rings with the help of the derived functors of non-additive functors is explored. A similar approach, i.e., via derived functors, for computing limits of…

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

First we prove that any inner automorphism in the stabilizer of a graded-simple unital associative algebra whose grading group is abelian is the conjugation by a homogeneous element. Now consider a grading by an abelian group on an…