English
Related papers

Related papers: Word automatic groups of nilpotency class 2

200 papers

An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…

Discrete Mathematics · Computer Science 2011-09-29 Anna Frid , Luca Zamboni

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…

Group Theory · Mathematics 2017-03-29 Matthew Cordes , Moon Duchin , Yen Duong , Meng-Che Ho , Andrew P. Sánchez

We examine the existence of universal elements in classes of infinite abelian groups. The main method is using group invariants which are defined relative to club guessing sequences. We prove, for example: Theorem: For $n\ge 2$, there is a…

Logic · Mathematics 2016-09-06 Menachem Kojman , Saharon Shelah

We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.

Group Theory · Mathematics 2025-04-30 Olga Kharlampovich , Alexei Miasnikov

Let $A$ be an infinitely generated free abelian group. We prove that the automorphism group $\aut A$ first-order interprets the full second-order theory of the set $|A|$ with no structure. In particular, this implies that the automorphism…

Logic · Mathematics 2007-05-23 Vladimir Tolstykh

Two elements in a group $G$ are said to $z$-equivalent or to be in the same $z$-class if their centralizers are conjugate in $G$. In \cite{kkj}, it was proved that a non-abelian $p$-group $G$ can have at most $\frac{p^k-1}{p-1} +1$ number…

Group Theory · Mathematics 2016-05-05 Shivam Arora , Krishnendu Gongopadhyay

The automaticity $A(x)$ of a set $\mathcal{X}$ is the size of the smallest automaton that recognizes $\mathcal{X}$ on all words of length $\leq x$. We show that the automaticity of the set of primes is at least $x\exp\left(-c(\log\log…

Number Theory · Mathematics 2024-09-09 Thomas Dubbe

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

Group Theory · Mathematics 2015-10-09 Tara Brough

We estimate the asymptotic growth of reciprocal conjugacy classes in Hecke groups using their free product structure and word lengths of reciprocal elements. Our approach is different from other works in this direction and uses tools from…

Group Theory · Mathematics 2025-06-11 Debattam Das , Krishnendu Gongopadhyay

It is proved that, for a prime $p>2$ and integer $n\geq 1$, finite $p$-groups of nilpotency class $3$ and having only two conjugacy class sizes $1$ and $p^n$ exist if and only if $n$ is even; moreover, for a given even positive integer,…

Group Theory · Mathematics 2017-08-15 Tushar Kanta Naik , Rahul Dattatraya Kitture , Manoj K. Yadav

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

Group Theory · Mathematics 2014-01-14 Moon Duchin , Hao Liang , Michael Shapiro

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov

Considering a particular case of a problem posed by Saharon Shelah, we prove that the automorphism group of an infinitely generated free nilpotent group N first-order interprets the full second-order theory of the set rank(N) in the empty…

Logic · Mathematics 2011-12-13 Vladimir Tolstykh

We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…

Discrete Mathematics · Computer Science 2017-01-11 Bakhadyr Khoussainov , Andre Nies , Sasha Rubin , Frank Stephan

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

Group Theory · Mathematics 2014-11-12 Benjamin Baumslag , James Wiegold

We show, that groups, defined by wide class of automata, including all polynomial ones, act on the set of infinite words not paradoxical

Group Theory · Mathematics 2018-11-27 Victoriia Korchemna

We show, in particular, that, if a finite group $H$ is a retract of any finite group containing $H$ as a verbally closed subgroup, then the centre of $H$ is a direct factor of $H$.

Group Theory · Mathematics 2023-07-17 Anton A. Klyachko , Veronika Yu. Miroshnichenko , Alexander Yu. Olshanskii

We enumerate the fibres of commutator word maps over p-groups of nilpotency class less than p with exponent p. We also give some examples and enumerate the fibre sizes of all word maps over p-groups of class 2 with exponent p.

Group Theory · Mathematics 2016-02-15 Matthew Levy

We construct, for every prime p, a function field K of characteristic p and an ordinary abelian variety A over K, with no isotrivial factors, that admits an etale self-isogeny of p-power degree. As a consequence, we deduce that there exist…

Algebraic Geometry · Mathematics 2021-07-28 David Helm

A connected Lie group admitting an expansive automorphism is known to be nilpotent, but all nilpotent Lie groups do not admit expansive automorphism. In this article, we find sufficient conditions for a class of nilpotent Lie groups to…

Group Theory · Mathematics 2019-09-10 Manoj Choudhuri , C. R. E. Raja