Related papers: Key-agreement based on automaton groups

Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first group signature schemes based on the conjugacy problem, decomposition problem and root problem in the braid…

We study three graph complexes related to the higher genus Grothendieck-Teichm\"uller Lie algebra and diffeomorphism groups of manifolds. We show how the cohomology of these graph complexes is related, and we compute the cohomology as the…

We consider the problem of determining the existence of a sequence of matrices driving a discrete-time consensus system to consensus. We transform this problem into one of the existence of a product of the transition (stochastic) matrices…

We describe a method for solving the conjugacy problem in a vast class of rearrangement groups of fractals, a family of Thompson-like groups introduced in 2019 by Belk and Forrest. We generalize the methods of Belk and Matucci for the…

We consider the universal Grigorchuk 2-group, i.e., the group such that every Grigorchuk 2-group is a quotient. We show that this group has a nice universal representation in the group of all functions f:{0,1,2}^N --> Aut(T_2), where T_2 is…

I present an informal overview of several recent results about Euclidean saddle points sourced by axion fields in quantum gravity (AdS/CFT), such as wormholes, their extremal "D-instanton" limits and their under-extremal singular…

We present obstruction results for self-similar groups regarding the generation of free groups. As a main consequence of our main results, we solve an open problem posed by Grigorchuk by showing that in an automaton group where a…

We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…

We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.

We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…

In this paper, we solve the conjugacy problem for Topological Full Groups of Irreducible Edge Shifts, introduced by Matui in 2015 and later recontextualized as groups of almost automorphisms of trees by Lederle in 2020. The techniques we…

We present a general framework for automatic continuity results for groups of isometries of metric spaces. In particular, we prove automatic continuity property for the group of isometries of the Urysohn space and the Urysohn sphere, i.e.…

This is a systematic exposition of recent results which completely describe the group of automorphisms and the group of autoequivalences of generic analytic K3 surfaces. These groups, hard to determine in the algebraic case, admit a good…

Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…

We study fundamental groups of clique complexes associated to random graphs. We establish thresholds for their cohomological and geometric dimension and torsion. We also show that in certain regime any aspherical subcomplex of a random…

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…

We provide descriptions of the Whitehead groups, and the algebraic $K$-theory groups, of the fundamental group of a connected, oriented, closed $3$-manifold in terms of Whitehead groups of their finite subgroups and certain Nil-groups. The…

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the "generic" lattice-ordered group Aut(R) of order automorphisms of the real line. We use these techniques in order to show…

The goal of this investigation is effective method of key exchange which based on non-commutative group $G$. The results of Ko et al. \cite{kolee} is improved and generalized. The size of a minimal generating set for the commutator subgroup…