Related papers: The falsification by fellow traveler property impl…
We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…
The automorphism groups of certain factorial complex affine threefolds admitting locally trivial actions of the additive group are determined. As a consequence new counterexamples to a generalized cancellation problem are obtained.
Consider a graph with vertex set S. A word in the alphabet S has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph neighbours. For a Coxeter graph, words represent group elements.…
A regular set of words is ($k$-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length $k$. In this article we study groups for which the set of all geodesic words with respect…
We prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements…
In this survey, we address the worst-case, average-case, and generic-case time complexity of the word problem and some other algorithmic problems in several classes of groups and show that it is often the case that the average-case…
It is well known that if $G$ admits a f.g. subgroup $H$ with a weaklyaperiodic SFT (resp. an undecidable domino problem), then $G$itself has a weakly aperiodic SFT (resp. an undecidable domino problem).We prove that we can replace the…
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…
We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is…
For an arbitrary Euclidean building we define a certain combing, which satisfies the `fellow traveller property' and admits a recursive definition. Using this combing we prove that any group acting freely, cocompactly and by order…
We show that for a finite group $G$, the commuting probability of $G$ can be explicitly bounded from below in a nontrivial way by a function in the maximum fraction of elements inverted resp. squared by an automorphism of $G$. Using these…
Pseudo-automorphisms are birational transformations acting as regular automorphisms in codimension 1. We import ideas from geometric group theory to prove that a group of birational transformations that satisfies a fixed point property on…
We prove two conjectures on the automorphism group of a one-dimensional formal group law defined over a field of positive characteristic. The first is that if a series commutes with a nontorsion automorphism of the formal group law, then…
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…
An automorphism $\alpha$ of a group $G$ is called a commuting automorphism if each element $x$ in $G$ commutes with its image $\alpha(x)$ under $\alpha$. Let $A(G)$ denote the set of all commuting automorphisms of $G$. Rai [Proc. Japan…
Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…
A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems, which generalize similar classes on words. Our aim is to…
We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…