Related papers: The Finitary Andrews-Curtis Conjecture
We give criteria for a graph of groups to have finite stature with respect to its collection of vertex groups, in the sense of Huang-Wise. We apply it to the triangle Artin groups that were previously shown to split as a graph of groups.…
We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
We prove a converse theorem for the case of quasi-split non-split even special orthogonal groups over finite fields. There are two main difficulties which arise from the outer automorphism and non-split part of the torus. The outer…
The Frankl conjecture (called also union-closed sets conjecture) is one of the famous unsolved conjectures in combinatorics of finite sets. In this short note, we introduce and to some extent justify some variants of the Frankl conjecture.
In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…
We report on recent progress concerning the relationship that exists between the algebraic structure of a finite group and certain features of its class-size prime graph.
Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…
In this article we study a coarse version of the $K$-theoretic Farrell--Jones conjecture we call coarse or bounded isomorphism conjecture. Using controlled category theory we are able to translate this conjecture for asymptotically faithful…
We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…
We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product…
By means of a digit function that has been introduced in a recent formulation of classical and quantum mechanics, we provide a new construction of some infinite families of finite groups, both abelian and nonabelian, of importance for…
The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…
We prove that the genus of a finite-dimensional division algebra is finite whenever the center is a finitely generated field of any characteristic. We also discuss potential applications of our method to other problems, including the…
The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
The Surface Group Conjectures are statements about recognising surface groups among one-relator groups, using either the structure of their finite-index subgroups, or all subgroups. We resolve these conjectures in the two generator case.…
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor…
Motivated by problems in topology, we explore the complexity of balanced group presentations. We obtain large lower bounds on the complexity of Andrews-Curtis trivialisations, beginning in rank 4. Our results are based on a new…