Related papers: Key-agreement based on automaton groups

We consider the two generalizations of lamplighter groups: automata groups generated by Cayley machine and cross-wired lamplighter groups. For a finite step two nilpotent group with central squares, we study its associated Cayley machine…

Bogopolski, Martino and Ventura in [BMV10] introduced a general criteria to construct groups extensions with unsolvable conjugacy problem using short exact sequences. We prove that such extensions have always solvable word problem. This…

The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such…

We completely determine the autotopism group of the (as of now) largest family of commutative semifields found by G\"olo\u{g}lu and K\"olsch. Since this family of semifields generally does not have large nuclei, this process is considerably…

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

This paper proposes a group deliberation oriented multi-agent conversational model to address the limitations of single large language models in complex reasoning tasks. The model adopts a three-level role division architecture consisting…

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…

This paper addresses the bipartite consensus-control problem in open multi-agent systems containing both cooperative and antagonistic interactions. In these systems, new agents can join and new interactions can be formed over time.…

We show that the automorphism groups of certain countable structures obtained using the Hrushovski amalgamation method are simple groups. The structures we consider are the 'uncollapsed' structures of infinite Morley rank obtained by the ab…

We study a class of gauge groups that can automatically yield a perturbatively exact Peccei-Quinn symmetry, and we outline a model in which the axion quality problem is solved at all operator dimensions. Gauge groups belonging to this class…

The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…

We introduce the $k$-peg Hanoi automorphisms and Hanoi self-similar groups, a generalization of the Hanoi Towers groups, and give conditions for them to be contractive. We analyze the limit spaces of a particular family of contracting Hanoi…

The conjugacy problem for the pseudo-Anosov automorphisms of a compact surface is studied. To each pseudo-Anosov automorphism f, we assign an AF-algebra A(f) (an operator algebra). It is proved that the assignment is functorial, i.e. every…

We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…

We consider heterotic string theories compactified on a K3 surface which lead to an unbroken perturbative gauge group of Spin(32)/Z2. All solutions obtained are combinations of two types of point-like instanton --- one ``simple type'' as…

Despite of being quite similar agreement problems, consensus and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than relatively simple…

The Donald--Flanigan problem for a finite group H and coefficient ring k asks for a deformation of the group algebra kH to a separable algebra. It is solved here for dihedral groups and for the classical Weyl groups (whose rational group…

We prove that the conjugacy problem in right-angled Artin groups (RAAGs), as well as in a large and natural class of subgroups of RAAGs, can be solved in linear-time. This class of subgroups contains, for instance, all graph braid groups…

We prove that an abelian group admits a minimally almost periodic (MinAP) group topology if and only if it is connected in its Markov-Zariski topology. In particular, every unbounded abelian group admits a MinAP group topology. This answers…