SearcharxivSearch

arXiv subjects

Alexei Miasnikov

Publications and source records attributed to Alexei Miasnikov.

At least 19 recordsLinked to original sources

On the first-order genus of wreath products and their central extensions

We prove that groups of the form $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$, where $m,n \in \mathbb N$, are regularly bi-interpretable with $\mathbb Z$ and therefore are first-order rigid: every finitely generated group elementarily equivalent to $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$ is isomorphic to $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$. On the other hand, we show that $\mathbb Z^2 {\,\rm wr\,} \mathbb Z$ admits $2^{\aleph_0}$ elementarily equivalent, pairwise non-isomorphic central extensions with finite kernel.

math.GR

Nonstandard free groups

Interpretation of a structure $\mathbb A$ in $\mathbb B$ allows to produce structures elementarily equivalent to $\mathbb A$ given those elementarily equivalent to $\mathbb B$. In particular, interpretation of the free group in $\mathbb N$ enables us to introduce and study a family of elementary free groups, which we call nonstandard free groups. More generally, for a wide class of groups we introduce nonstandard models arising from interpretation in $\mathbb N$. We exploit interpretation to show that under mild assumptions, ultrapowers of a group can be viewed as nonstandard models of that group. This leads us to describe the structure of the ultrapowers in terms of structure of nonstandard models of natural numbers, offering insight into a longstanding question of Malcev. We also introduce fundamentals of nonstandard combinatorial group theory such as the notions of nonstandard subgroups, nonstandard normal subgroups, and nonstandard group presentations.

math.GR

Tensor completions of 2-nilpotent finitely generated torsion-free groups

In this paper, we study tensor completions $G \otimes_{\mathcal{N}_{2,R}} R$ of finitely generated torsion-free nilpotent groups $G$ of class $2$ in the quasivariety $\mathcal{N}_{2,R}$ of $R$-exponential 2-nilpotent groups over a binomial integral domain $R$. We show that the classical Hall completion $G\otimes_{\mathcal{H}} R$ embeds as an abstract group (the embedding is not an $R$-homomorphism) into $G \otimes_{\mathcal{N}_{2,R}} R$, such that $G\otimes_{\mathcal{N}_{2,R}} R \simeq (G \otimes_{\mathcal{H}} R) \times D$, where $D$ is an $R$-module and the direct product is a product of abstract groups (not $R$-groups!). In particular, the canonical $R$-epimorphism $\mu: G \otimes_{\mathcal{N}_{2,R}} R \to G \otimes_{\mathcal{H}} R$ is a retract on $G \otimes_{\mathcal{H}} R$ with abelian kernel $D$. Moreover, in addition to the algebraic structure, we describe precisely how raising to an $R$-exponent works in the group $G \otimes_{\mathcal{N}_{2,R}} R$. To do this, we introduce a new type of commutators, the so-called c-commutators, which are interesting in their own right. These results answer an old question of Remeslennikov about the algebraic structure of free 2-nilpotent R-groups in the quasivariety $\mathcal{N}_{2,R}$. Indeed, it was shown in \cite{AMN} that if $G$ is a free 2-nilpotent group with basis $X$ (in the variety of abstract 2-nilpotent groups), then $G \otimes_{\mathbb{N}_{2,R}} R$ is a free 2-nilpotent R-group in $\mathcal{N}_{2,R}$ with basis $X$. Note that in this case $G \otimes_{\mathcal{H}} R$ is a free 2-nilpotent Hall $R$-group with basis $X$. As an illustration, for a free 2-nilpotent group $G$ of rank 2, we describe the group $G \otimes_{\mathcal{N}_{2,R}} R$, the action of $R$ on $G \otimes_{\mathcal{H}} R$, and the module $D$ in the case where $R$ is either the polynomial ring $\mathbb{Q}[t]$ or the field of rational functions $\mathbb{Q}(t)$ with coefficients in the field of rational numbers $\mathbb{Q}$.

math.GR

The Diophantine problem in iterated wreath products of free abelian groups is undecidable

In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a finite system of group equations with coefficients in $G$ decides whether or not the system has a solution in $G$.

math.GR

U-MATH: A University-Level Benchmark for Evaluating Mathematical Skills in LLMs

The current evaluation of mathematical skills in LLMs is limited, as existing benchmarks are either relatively small, primarily focus on elementary and high-school problems, or lack diversity in topics. Additionally, the inclusion of visual elements in tasks remains largely under-explored. To address these gaps, we introduce U-MATH, a novel benchmark of 1,100 unpublished open-ended university-level problems sourced from teaching materials. It is balanced across six core subjects, with 20% of multimodal problems. Given the open-ended nature of U-MATH problems, we employ an LLM to judge the correctness of generated solutions. To this end, we release $\mu$-MATH, a dataset to evaluate the LLMs' capabilities in judging solutions. Benchmarking leading LLMs reveals marked limitations in multi-modal reasoning, with maximum accuracy reaching 93.1\% on textual tasks but only 58.5\% on visual ones. Furthermore, solution judgment proves challenging, requiring the most advanced models to achieve meaningfully high performance, even still peaking at an imperfect F1-score of 90.1\%.

cs.CL

Decomposing Finite $\mathbb{Z}$-Algebras

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors under weak hypotheses. The method is based on constructing and decomposing a ring of scalars $S$, and then lifting the decomposition of $S$ to the bilinear map given by the multiplication of $R$, and finally to $R/{\rm Ann}(R)$. All steps of the construction are given as explicit algorithms and it is shown that the entire procedure has a probabilistic polynomial time complexity in the bit size of the input, except for the possible need to calculate the prime factorization of one integer. In particular, in the case when ${\rm Ann}(R) = 0$, these algorithms compute a direct decomposition of $R$ into directly indecomposable factors.

math.RA

Diophantine Problem in Some Metabelian Groups

In this paper we show that Diophantine problem for quadratic equations in Baumslag-Solitar groups $BS(1,k)$ and in wreath products $A \wr \mathbb{Z}$, where $A$ is a finitely generated abelian group and $\mathbb{Z}$ is an infinite cyclic group, is decidable.

math.GR

Studying the Diophantine problem in finitely generated rings and algebras via bilinear maps

We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite field extension of either $\mathbb{Q}$ or $\mathbb{F}_p(t)$, for some prime $p$ and variable $t$. This implies that the Diophantine problem (decidability of systems of polynomial equations) in $O$ is Karp-reducible to the same problem in $R$. In several cases we further obtain an interpretation by systems of equations of the ring $\mathbb{F}_p[t]$ in $R$, which implies that the Diophantine problem in $R$ is undecidable in this case. Otherwise, the ring $O$ is a ring of algebraic integers, and then the long-standing conjecture that $\mathbb{Z}$ is always interpretable by systems of equations in $O$ carries over to $R$. If true, it implies that the Diophantine problem in $R$ is also undecidable. Some of the classes of f.g. rings studied in this paper are the following: all associative, commutative, non-unitary rings (a similar statement for the unitary case was obtained by Eisentraeger); all possibly non-associative, non-commutative non-unitary rings that are f.g. as an abelian group; and several classes of f.g. non-commutative rings. Analogous statements are obtained for algebras over f.g. associative commutative unitary rings. Another contribution is the technique by which the aforementioned results are obtained: We show that given a bilinear map $f: A\times B \to C$ between f.g. abelian groups (or modules), under mild assumptions, there exists a certain ring (or algebra) $R$ with nice properties which is interpretable by systems of equations in the multi-sorted structure $(A,B,C;f)$. This result is not only relevant for rings and algebras, but also in other structures such as groups, as demonstrated previously by the authors.

math.RA

Regular completions of $\mathbb{Z}^n$-free groups

In the present paper we continue studying regular free group actions on $\mathbb{Z}^n$-trees. We show that every finitely generated $\mathbb{Z}^n$-free group $G$ can be embedded into a finitely generated $\mathbb{Z}^n$-free group $H$ acting regularly on the underlying $\mathbb{Z}^n$-tree (we call $H$ a {\em regular $\mathbb{Z}^n$-completion} of $G$) so that the action of $G$ is preserved. Moreover, if $G$ is effectively represented as a group of $\mathbb{Z}^n$-words then the construction of $H$ is effective and $H$ is also effectively represented as a group of $\mathbb{Z}^n$-words.

math.GR

The Diophantine problem in finitely generated commutative rings

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite field extension of either $\mathbb{Q}$ or $\mathbb{F}_p(t)$, for some prime $p$ and variable $t$. This implies that the Diophantine problem (decidability of systems of polynomial equations) in $O$ is reducible to the same problem in $R$. If, in particular, $R$ has positive characteristic or, more generally, if $R$ has infinite rank, then we further obtain an interpretation by systems of equations of the ring $\mathbb{F}_p[t]$ in $R$. This implies that the Diophantine problem in $R$ is undecidable in this case. In the remaining case where $R$ has finite rank and zero characteristic, we see that $O$ is a ring of algebraic integers, and then the long-standing conjecture that $\mathbb{Z}$ is always interpretable by systems of equations in a ring of algebraic integers carries over to $R$. If true, it implies that the Diophantine problem in $R$ is also undecidable. Thus, in this case the Diophantine problem in every infinite finitely generated commutative unitary ring is undecidable. The present is the first in a series of papers were we study the Diophantine problem in different types of rings and algebras.

math.NT

Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity

We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency $|A| - |R| $ is at least $2$ then the group $G$ is virtually free nilpotent, it is quasi finitely axiomatizable (in particular, first-order rigid), and it is almost (up to finite factors) directly indecomposable. One of the main results of the paper is that the Diophantine problem in nilpotent groups given by full rank finite presentations $\langle A \mid R\rangle$ is undecidable if $|A| - |R| \geq 2$ and decidable otherwise. We show that this class of groups is rather large since finite presentations asymptotically almost surely have full rank, so a random nilpotent group in the few relators model has a full rank presentation asymptotically almost surely. Full rank presentations give one a useful tool to approach random nilpotent groups and study their properties. Note, that the results above significantly improve our understanding of the Diophantine problem in finitely generated nilpotent groups: from a few special examples of groups with undecidable Diophantine problem we got to the place where we know that the Diophantine problem in all "typical" nilpotent groups is also undecidable.

math.GR

Metabelian groups: full-rank presentations, randomness and Diophantine problems

We study metabelian groups $G$ given by full rank finite presentations $\langle A \mid R \rangle_{\mathcal{M}}$ in the variety $\mathcal{M}$ of metabelian groups. We prove that $G$ is a product of a free metabelian subgroup of rank $\max\{0, |A|-|R|\}$ and a virtually abelian normal subgroup, and that if $|R| \leq |A|-2$ then the Diophantine problem of $G$ is undecidable, while it is decidable if $|R|\geq |A|$. We further prove that if $|R| \leq |A|-1$ then in any direct decomposition of $G$ all, but one, factors are virtually abelian. Since finite presentations have full rank asymptotically almost surely, finitely presented metabelian groups satisfy all the aforementioned properties asymptotically almost surely.

math.GR

Diophantine problems in solvable groups

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural "non-commutativity" conditions. For each group $G$ in one of these classes, we prove that there exists a ring of algebraic integers $O$ that is interpretable in $G$ by finite systems of equations (e-interpretable), and hence that the Diophantine problem in $O$ is polynomial time reducible to the Diophantine problem in $G$. One of the major open conjectures in number theory states that the Diophantine problem in any such $O$ is undecidable. If true this would imply that the Diophantine problem in any such $G$ is also undecidable. Furthermore, we show that for many particular groups $G$ as above, the ring $O$ is isomorphic to the ring of integers $\mathbb{Z}$, so the Diophantine problem in $G$ is, indeed, undecidable. This holds, in particular, for free nilpotent or free solvable non-abelian groups, as well as for non-abelian generalized Heisenberg groups and uni-triangular groups $UT(n,\mathbb{Z}), n \geq 3$. Then we apply these results to non-solvable groups that contain non-virtually abelian maximal finitely generated nilpotent subgroups. For instance, we show that the Diophantine problem is undecidable in the groups $GL(3,\mathbb{Z}), SL(3,\mathbb{Z}), T(3,\mathbb{Z})$.

math.GR

The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$

We show that the conjugacy problem in a wreath product $A \wr B$ is uniform-$\mathsf{TC}^0$-Turing-reducible to the conjugacy problem in the factors $A$ and $B$ and the power problem in $B$. If $B$ is torsion free, the power problem for $B$ can be replaced by the slightly weaker cyclic submonoid membership problem for $B$. Moreover, if $A$ is abelian, the cyclic subgroup membership problem suffices, which itself is uniform-$\mathsf{AC}^0$-many-one-reducible to the conjugacy problem in $A \wr B$. Furthermore, under certain natural conditions, we give a uniform $\mathsf{TC}^0$ Turing reduction from the power problem in $A \wr B$ to the power problems of $A$ and $B$. Together with our first result, this yields a uniform $\mathsf{TC}^0$ solution to the conjugacy problem in iterated wreath products of abelian groups - and, by the Magnus embedding, also in free solvable groups.

cs.CC

Low-complexity computations for nilpotent subgroup problems

We solve the following algorithmic problems using TC0 circuits, or in logspace and quasilinear time, uniformly in the class of nilpotent groups with bounded nilpotency class and rank: subgroup conjugacy, computing the normalizer and isolator of a subgroup, coset intersection, and computing the torsion subgroup. Additionally, if any input words are provided in compressed form as straight-line programs or in Mal'cev coordinates the algorithms run in quartic time.

math.GR

Stallings graphs for quasi-convex subgroups

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are canonically associated with the corresponding subgroups. We show that this notion of Stallings graphs allows a unified approach to many algorithmic problems: some which had already been solved like the generalized membership problem or the computation of a quasi-convexity constant (Kapovich, 1996); and others such as the computation of intersections, the conjugacy or the almost malnormality problems. Our results extend earlier algorithmic results for the more restricted class of virtually free groups. We also extend our construction to relatively quasi-convex subgroups of relatively hyperbolic groups, under certain additional conditions.

math.GR