SearcharxivSearch

arXiv subjects

Alexei Myasnikov

Publications and source records attributed to Alexei Myasnikov.

At least 19 recordsLinked to original sources

Theory of Interpretations II. Categorical equivalence of projective logical geometries

We introduce projective logical geometry and prove that two algebraic structures are strongly bi-interpretable if and only if their categories of projective logical sets are equivalent relative to the class of interpretation functors, which is also equivalent to their categories of projective definable sets being equivalent relative to the class of translation functors. These constructions generalize two ideas of Boris Plotkin: the concept of geometric equivalence in universal algebraic geometry and the transition from universal algebraic geometry to logical geometry. Furthermore, our categorical approach offers a fresh perspective on the theory of interpretations, enabling us to establish a series of fundamental results using categorical methods.

math.LO

Theory of Interpretations I. Foundations

This is the first paper in a series in which we lay down the foundations of the theory of interpretations. We systematically study different types of interpretations and their properties. Some of these interpretations are known, while others are new. Each of them serves different purposes. In the last section, we describe applications of interpretations to Diophantine problems, first-order classification, isotypeness, definability of structures by types, elimination of imaginaries, richness, logical categories, and bi-interpretations with Z or N. Additionally, throughout the text, we pose some open questions that naturally arise in this context and provide the most typical examples, usually from algebra. The current literature is plagued by discrepancies and inconsistencies in definitions, concepts, and fundamental applications of interpretations. To address this, we thoroughly examine various principal notions, definitions, and arguments, bringing order to the existing theory. Simultaneously, we develop several key concepts, such as regular interpretations, regular bi-interpretations, and invertible interpretations, and outline their main applications.

math.LO

Nonstandard polynomials: algebraic properties and elementary equivalence

We solve the first-order classification problem for rings $R$ of polynomials $F[x_1, \ldots,x_n]$ and Laurent polynomials $F[x_1,x_1^{-1}, \ldots,x_n,x_n^{-1}]$ with coefficients in an infinite field $F$ or the ring of integers $\mathbb Z$, that is, we describe the algebraic structure of all rings $S$ that are first-order equivalent to $R$. Our approach is based on a new and very powerful method of regular bi-interpretations, or more precisely, regular invertible interpretations. Namely, we prove that $F[x_1, \ldots,x_n]$ and $F[x_1,x_1^{-1}, \ldots,x_n,x_n^{-1}]$ are regularly bi-interpretable with the list superstructure $\mathbb S(F,\mathbb N)$ of $F$, which is equivalent to regular bi-interpretation with the superstructure $HF(F)$ of hereditary finite sets over $F$. The expressive power of $\mathbb S(F,\mathbb N)$ is the same as that of the weak second-order logic over $F$. Hence, the first-order logic in $R = F[x_1, \ldots,x_n]$ or $R = F[x_1,x_1^{-1}, \ldots,x_n,x_n^{-1}]$ is equivalent to the weak second-order logic in $F$ (following the terminology of Kharlampovich, Myasnikov, and Sohrabi [16], such structures are necessarily rich), which allows one to describe the algebraic structure of all rings $S$ with $S\equiv R$. In fact, these rings $S$ are precisely the ``non-standard'' models of $R$, like in non-standard arithmetic or non-standard analysis. This is particularly straightforward when $F$ is regularly bi-interpretable with $\mathbb N$, in this case the ring $R$ is also bi-interpretable with $\mathbb N$. Using our approach, we describe various, sometimes rather surprising, algebraic and model-theoretic properties of the non-standard models of $R$.

math.LO

Rich groups, weak second order logic, and applications

In this paper we initiate a study of first-order rich groups, i.e., groups where the first-order logic has the same power as the weak second order logic. Surprisingly, there are quite a lot of finitely generated rich groups, they are somewhere in between hyperbolic and nilpotent groups (these ones are not rich). We provide some methods to prove that groups (and other structures) are rich and describe some of their properties. As corollaries we look at Malcev's problems in various groups.

math.LO

Logspace and compressed-word computations in nilpotent groups

For finitely generated nilpotent groups, we employ Mal'cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership problem, the conjugacy problem, and computation of presentations for subgroups are solved using only logarithmic space and quasilinear time. Logarithmic space presentation-uniform versions of these algorithms are provided. Compressed-word versions of the same problems, in which each input word is provided as a straight-line program, are solved in polynomial time.

math.GR

Hierarchy for groups acting on hyperbolic $\mathbf{Z}^n$-spaces

In their first article, the authors initiated a systematic study of hyperbolic $Λ$-metric spaces, where $Λ$ is an ordered abelian group, and groups acting on such spaces. The present paper concentrates on the case $Λ= \mathbf{Z}^n$ taken with the right lexicographic order and studies the structure of finitely generated groups acting on hyperbolic $\mathbf{Z}^n$-metric spaces. Under certain constraints, the structure of such groups is described in terms of a {\em hierarchy} similar to the one established for $\mathbf{Z}^n$-free groups by Kharlampovich, Myasnikov, Remeslennikov and Serbin.

math.GR

Effective construction of covers of canonical Hom-diagrams for equations over torsion-free hyperbolic groups

We show that, given a finitely generated group $G$ as the coordinate group of a finite system of equations over a torsion-free hyperbolic group $Γ$, there is an algorithm which constructs a cover of a canonical solution diagram. The diagram encodes all homomorphisms from $G$ to $Γ$ as compositions of factorizations through $Γ$-NTQ groups and canonical automorphisms of the corresponding NTQ-subgroups. We also give another characterization of $Γ$-limit groups as iterated generalized doubles over $Γ$.

math.GR

Quantifier elimination algorithm to boolean combination of $\exists\forall$-formulas in the theory of a free group

It was proved by Sela and by the authors that every formula in the theory of a free group $F$ is equivalent to a boolean combination of $\exists\forall$-formulas. We also proved that the elementary theory of a free group is decidable (there is an algorithm given a sentence to decide whether this sentence belongs to $Th(F)$). In this paper we give an algorithm for reduction of a first order formula over a free group to an equivalent boolean combination of $\exists\forall$-formulas.

math.GR

Fraïssé limits of limit groups

We modify the notion of a Fraïssé class and show that various interesting classes of groups, notably the class of nonabelian limit groups and the class of finitely generated elementary free groups, admit Fraïssé limits. Furthermore, we rediscover Lyndon's $\Z[t]$-exponential completions of countable torsion-free CSA groups, as Fraïssé limits with respect to extensions of centralizers. Dedicated to the memory of Charles Sims.

math.LO

Undecidability of Equations in Free Lie Algebras

In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in such free Lie algebras over a field of characteristic zero.

math.LO

TC^0 circuits for algorithmic problems in nilpotent groups

Recently, Macdonald et. al. showed that many algorithmic problems for finitely generated nilpotent groups including computation of normal forms, the subgroup membership problem, the conjugacy problem, and computation of subgroup presentations can be done in Logspace. Here we follow their approach and show that all these problems are complete for the uniform circuit class TC^0 - uniformly for all r-generated nilpotent groups of class at most c for fixed r and c. In order to solve these problems in TC^0, we show that the unary version of the extended gcd problem (compute greatest common divisors and express them as linear combinations) is in TC^0. Moreover, if we allow a certain binary representation of the inputs, then the word problem and computation of normal forms is still in uniform TC^0, while all the other problems we examine are shown to be TC^0-Turing reducible to the binary extended gcd problem.

math.GR

Undecidability of the first order theories of free non-commutative Lie algebras

Let $R$ be a commutative integral unital domain and $L$ a free non-commutative Lie algebra over $R$. In this paper we show that the ring $R$ and its action on $L$ are 0-interpretable in $L$, viewed as a ring with the standard ring language $+, \cdot,0$. Furthermore, if $R$ has characteristic zero then we prove that the elementary theory $Th(L)$ of $L$ in the standard ring language is undecidable. To do so we show that the arithmetic ${\bf N} = \langle{\bf N}, +,\cdot,0 \rangle$ is 0-interpretable in $L$. This implies that the theory of $Th(L)$ has the independence property. These results answer some old questions on model theory of free Lie algebras.

math.LO

Equations in Algebras

We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups, including toral relatively hyperbolic groups, right angled Artin groups, commutative transitive groups, the fundamental groups of various graph groups, etc.

math.LO

Tarski-type problems for free associative algebras

In this paper we study fundamental model-theoretic questions for free associative algebras, namely, first-order classification, decidability of the first-order theory, and definability of the set of free bases. We show that two free associative algebras of finite rank over fields are elementarily equivalent if and only if their ranks are the same and the fields are equivalent in the weak second order logic. In particular, two free associative algebras of finite rank over the same field are elementarily equivalent if and only if they are isomorphic. We prove that if an arbitrary ring $B$ with at least one Noetherian proper centralizer is first-order equivalent to a free associative algebra of finite rank over an infinite field then $B$ is also a free associative algebra of finite rank over a field. This solves the elementary classification problem for free associative algebras in a wide class of rings. Finally, we present a formula of the ring language which defines the set of free bases in a free associative algebra of finite rank.

math.LO

Non-commutative lattice problems

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup element closest to a given group element, or finding a shortest non-trivial element of a subgroup in the case of nilpotent groups, and a large class of surface groups and Coxeter groups. We also provide polynomial time algorithm to compute geodesics in given generators of a subgroup of a free group.

math.GR

A linear decomposition attack

We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm that recovers the secret shared key from the public data in all this schemes under consideration. Furthemore, we show that in this case, contrary to the common opinion, the typical computational security assumptions are not very relevant to the security of the schemes, i.e., one can break the schemes without solving the algorithmic problems on which the assumptions are based. The efficacy of the attack depends on the platform group, so it requires a more thorough analysis in each particular case.

math.GR