相关论文: Interpreting the arithmetic in Thompson's group F

We study invertibility of $\lambda$-terms modulo $\lambda$-theories. Here a fundamental role is played by a class of $\lambda$-terms called finite hereditary permutations (FHP) and by their infinite generalisations (HP). More precisely,…

Let F be the Thompson's group. We study the structure of F-limit groups. Consider a sequence of groups marked by three elements, each isomorphic to F. Assume that the this sequence is convergent in the space of marked groups. We prove that…

In this article we prove that Thompson's group does not belong to any algebraic variety.

A group G is non-topologizable if the only Hausdorff group topology that G admits is the discrete one. Is there an infinite group G such that H/N is non-topologizable for every subgroup H <= G and every normal subgroup N <| H? We show that…

In this paper we study \emph{essential hereditary undecidability}. Theories with this property are a convenient tool to prove undecidability of other theories. The paper develops the basic facts concerning essentially hereditary…

The authors classify the finite index subgroups of R. Thompson's group $F$. All such groups that are not isomorphic to $F$ are non-split extensions of finite cyclic groups by $F$. The classification describes precisely which finite index…

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

We show that Thompson's group $F$ has a topological action on a compact metric space that is proximal and has no fixed points.

We prove that Thompson's group $F$ has a generating set with two elements such that every two powers of them generate a finite index subgroup of $F$.

For a finite group $G$ denote by $N(G)$ the set of conjugesy class sizes of $G$. We show that every finite group $G$ with the property $N(G)=N(Alt_n), n>4$ or $N(G)=N(Sym_n), n>22$ is non-solvable.

For a poset $(P,\leqslant)$ we consider the first-order theory, that is defined by set $P$ and relation $\leqslant$. The problem of undecidability of combinatorial theories attracts significant attention. Recently A. Wires proved the…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…

For any sufficiently strong theory of arithmetic, the set of Diophantine equations provably unsolvable in the theory is algorithmically undecidable, as a consequence of the MRDP theorem. In contrast, we show decidability of Diophantine…

The purpose of this article is to formulate conjectural generalizations of Hindman's Theorem and Ellis's Lemma for nonassociative binary systems and relate them to the amenability problem for Thompson's group $F$. Partial results are…

The goal of this paper is to construct quasi-isometrically embedded subgroups of Thompson's group $F$ which are isomorphic to $\fz^n$ for all $n$. A result estimating the norm of an element of Thompson's group is found. As a corollary,…

We show that pure subgroups of infinitely braided Thompson's are bi-orderable. For every finitely generated pure subgroup, we give explicit sets of generators.

One way to show that Thompson's group F is non-amenable is to exhibit an action of F on a locally compact CAT(0) space X containing no F-invariant flats and having no global fixed points in its boundary-at-infinity. We study the actions of…

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…