Related papers: The Finitary Andrews-Curtis Conjecture

The generalized Andrews-Curtis Conjecture expects that finite PLCW 2-complexes which are simple-homotopy equivalent, can be 3-deformed into each other. If in addition subcomplexes are required to be kept fix during the deformation, this is…

This expository article revolves around the question to find short presentations of finite simple groups. This subject is one of the most active research areas of group theory in recent times. We bring together several known results on…

We prove that the Steinberg representation of a connected reductive group over an infinite field is irreducible. For finite fields, this is a classical theorem of Steinberg and Curtis.

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

In \cite[Problem 72]{Fuchs60} Fuchs asked the following question: which groups can be the group of units of a commutative ring? In the following years, some partial answers have been given to this question in particular cases. The aim of…

Using algebraic transformations and equivalent reformulations we derive a number of new results from some earlier ones (by the author) in more accepted terms closely related to well-known conjectures of Bondy and Jung including a number of…

The Andrews-Curtis conjecture states that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of the elementary Nielsen transformations and conjugations. In this paper we describe all balanced…

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

We discuss some new results concerning Gap Conjecture on group growth and present a reduction of it (and its *-version) to several special classes of groups. Namely we show that its validity for the classes of simple groups and residually…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

The Andrews-Curtis conjecture asserts that, for a free group $F_n$ of rank $n$ and a free basis $(x_1,...,x_n)$, any normally generating tuple $(y_1,...,y_n)$ is Andrews-Curtis equivalent to $(x_1,...,x_n)$. This equivalence corresponds to…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

These notes are devoted to lattices in products of trees and related topics. They provide an introduction to the construction, by M. Burger and S. Mozes, of examples of such lattices that are simple as abstract groups. Two features of that…

We clarify the confusion, misunderstanding and misconception that the physical finiteness of the universe, if the universe is indeed finite, would rule out all hypercomputation, the kind of computation that exceeds the Turing computability,…

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…

We prove that Matui's AH conjecture holds for graph groupoids of infinite graphs. This is a conjecture which relates the topological full group of an ample groupoid with the homology of the groupoid. Our main result complements Matui's…

We continue our investigation on denominator conjecture of Fomin and Zelevinsky for cluster algebras via geometric models initialed in \cite{FG22}. In this paper, we confirm the denominator conjecture for cluster algebras of finite type.…