English
Related papers

Related papers: Automorphically Equivalent Elements of Finite Abel…

200 papers

We prove that the semigroup generated by a finite state Mealy automaton $\mathcal{A}=(Q,A,\tau)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.

Group Theory · Mathematics 2018-01-31 Dominik Francoeur

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

Group Theory · Mathematics 2023-05-04 Louis Mallet-Burgues

We show that Cayley graphs of finitely generated Abelian groups are rather rigid. As a consequence we obtain that two finitely generated Abelian groups admit isomorphic Cayley graphs if and only if they have the same rank and their torsion…

Group Theory · Mathematics 2012-08-20 Clara Loeh

In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup $\mathcal{H}$ of a FATF group $\mathcal{G}$,…

Group Theory · Mathematics 2023-07-28 Mallika Roy , Enric Ventura

An endomorphisms $\varphi$ of an abelian group $A$ is said inertial if each subgroup $H$ of $A$ has finite index in $H+\varphi (H)$. We study the ring of inertial endomorphisms of an abelian group. Here we obtain a satisfactory description…

Group Theory · Mathematics 2014-07-14 Ulderico Dardano , Silvana Rinauro

Given a morphism $\varphi : G \to A \wr B$ from a finitely presented group $G$ to a wreath product $A \wr B$, we show that, if the image of $\varphi$ is a sufficiently large subgroup, then $\mathrm{ker}(\varphi)$ contains a non-abelian free…

Group Theory · Mathematics 2026-02-11 Anthony Genevois , Romain Tessera

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

Data Structures and Algorithms · Computer Science 2021-10-05 Francois Le Gall

Let $G$ be a group and let ${\mathcal G}$ be a free factor system of $G$, namely a free splitting of $G$ as $G=G_1*\dots*G_k*F_r$. In this paper, we study the set of train track points for ${\mathcal G}$-irreducible automorphisms $\phi$…

Group Theory · Mathematics 2024-04-16 Stefano Francaviglia , Armando Martino , Dionysios Syrigos

If $g\in G$ is a non-trivial element in a residually finite group, then there exists by definition a finite group $Q$ and a homomorphism $\varphi: G \to Q$ such that $\varphi(g) \neq e$. The residual finiteness growth $\text{RF}_G$ of a…

Group Theory · Mathematics 2025-10-27 Jonas Deré , Joren Matthys

Let $F_n$ be a free group of rank $n$. In this paper we discuss three algorithmic problems related to automorphisms of $F_2$. A word $u$ of $F_n$ is called positive if $u$ does not have negative exponents. A word $u$ in $F_n$ is called…

Group Theory · Mathematics 2011-05-03 Donghi Lee

For each prime $p$ we construct a family $\{G_i\}$ of finite $p$-groups such that $|\Aut (G_i)|/|G_i|$ goes to $0$, as $i$ goes to infinity. This disproves a well-known conjecture that $|G|$ divides $|\Aut(G)|$ for every non-abelian finite…

Group Theory · Mathematics 2014-06-25 Jon Gonzalez-Sanchez , Andrei Jaikin-Zapirain

Let $G$ be a finite group. We will say that $M$ and $S$ form a \textsl{complete splitting} (\textsl{splitting}) of $G$ if every element (nonzero element) $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$,…

Combinatorics · Mathematics 2020-03-31 Kevin Zhao

The power graph of a group $G$, denoted as $P(G)$, constitutes a simple undirected graph characterized by its vertex set $G$. Specifically, vertices $a,b$ exhibit adjacency exclusively if $a$ belongs to the cyclic subgroup generated by $b$…

Group Theory · Mathematics 2024-01-23 Dhawlath. G , Raja. V

We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…

Rings and Algebras · Mathematics 2022-03-08 Jason P. Bell , Peter V. Danchev

Suppose that a finite group $G$ admits an automorphism $\varphi $ of order $2^n$ such that the fixed-point subgroup $C_G(\varphi ^{2^{n-1}})$ of the involution $\varphi ^{2^{n-1}}$ is nilpotent of class $c$. Let $m=|C_G(\varphi)|$ be the…

Group Theory · Mathematics 2015-04-17 E. I. Khukhro , N. Yu. Makarenko , P. Shumyatsky

Let F be the field of two elements and G a finite abelian 2-group with an involutory automorphism. The extension of this automorphism to the group algebra FG is called an involutory involution. This determines the groups of unitary and…

Rings and Algebras · Mathematics 2019-07-10 V. A. Bovdi , A. N. Grishkov

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

Group Theory · Mathematics 2019-04-09 Marius Tărnăuceanu

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

History and Overview · Mathematics 2024-07-18 Sergey Kurapov , Maxim Davidovsky

We study the dilatation of outer automorphisms of right-angled Artin groups. Given a right-angled Artin group defined on a simplicial graph: $A(\Gamma) = \langle V | E \rangle$ and an automorphism $\phi \in Out(A(\Gamma))$ there is a…

Group Theory · Mathematics 2018-11-06 Corey Bregman , Yulan Qing

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

Combinatorics · Mathematics 2020-01-16 Rémi Bottinelli , Laura Grave de Peralta , Alexander Kolpakov
‹ Prev 1 8 9 10 Next ›