Related papers: Solving One-Variable Equations in Free Groups
We show that the class of finitely generated virtually free groups is precisely the class of demonstrable subgroups for R. Thompson's group $V$. The class of demonstrable groups for $V$ consists of all groups which can embed into $V$ with a…
Lifted probabilistic inference algorithms exploit regularities in the structure of graphical models to perform inference more efficiently. More specifically, they identify groups of interchangeable variables and perform inference once per…
Not any nonsingular equation over a metabelian group has solution in a larger metabelian group. However, any nonsingular equation over a solvable group with a subnormal series with abelian torsion-free quotients has a solution in a larger…
Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…
We adapt a proof of Lascar in order to show the simplicity of the group of automorphisms fixing pointwise all non-generic elements for a class of uncountable models of suitable theories, encompassing both strongly minimal theories as well…
We study groups, exponential groups and ordered groups equipped with valuations. We investigate algebraic and topological features of such valued structures, and apply our findings in order to solve regular equations over groups using…
We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…
We study the structure of the absolute differential Galois group of a rational function field over an algebraically closed field of characteristic zero. In particular, we relate the behavior of differential embedding problems to the…
This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…
Using the theory developed by Olga Kharlampovich, Alexei Miasnikov, and, independently, by Zlil Sela to describe the set of homomorphisms of a f.g. group G into a free group F, we describe the solutions to equations with coefficients from F…
This thesis deals with the conjugacy problem in groups and its twisted variants. We analyze recent results by Bogopolski, Martino, Maslakova and Ventura on the twisted conjugacy problem in free groups and its implication for the conjugacy…
We formalise the self-referential definition of physical laws using monotone operators on a lattice of theories, resolving the pathologies of naive set-theoretic formulations. By invoking Tarski fixed point theorem, we identify physical…
We solve two longstanding major problems in Free Probability. This is achieved by generalising the theory to one with values in arbitrary commutative algebras. We prove the existence of the multi-variable $S$-transform, and show that it is…
A direct and systematic algorithm is proposed to find one-dimensional optimal system for the group invariant solutions, which is attributed to the classification of its corresponding one-dimensional Lie algebra. Since the method is based on…
In this paper we discuss the problem of existence of so called weak Sierpi\'nski sets in groups. It is known that group $G$ has a Sierpi\'nski subset if and only if it contains a free subgroup. In their paper, Tomkowicz and Wagon…
Current theories of massless free particle assume {\sl unitary} space inversion and {\sl anti-unitary} time reversal operators. In so doing robust classes of possible theories are discarded. In the present work theories of massless systems…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
Let $H$ be an acylindrically hyperbolic group without nontrivial finite normal subgroups. We show that any finite system $S$ of equations with constants from $H$ is equivalent to a single equation. We also show that the algebraic set…
Let Gamma be a torsion-free group which is hyperbolic relative to a collection of free abelian subgroups. We construct Makanin-Razborov diagrams for Gamma. We also prove that every system of equations over Gamma is equivalent to a finite…