Guba and Sapir asked if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give a solution to the latter question using elementary techniques which rely purely on the description of F as the group of piecewise linear orientation-preserving homeomorphisms of the unit interval. The techniques we develop extend the ones used by Brin and Squier allowing us to compute roots and centralizers as well. Moreover, these techniques can be generalized to solve the same question in larger groups of piecewise-linear homeomorphisms.
Monod introduced in [14] a family of Thompson-like groups which provides natural counterexamples to the von Neumann-Day conjecture. We construct a characterization of conjugacy and invariant and use them to compute centralizers in one group of this family.
We complete the program begun by Brin and Squier of characterising conjugacy in Thompson's group $F$ using the standard action of $F$ as a group of piecewise linear homeomorphisms of the unit interval.
We describe the relation between two characterizations of conjugacy in groups of piecewise-linear homeomorphisms, discovered by Brin and Squier in [2] and Kassabov and Matucci in [5]. Thanks to the interplay between the techniques, we produce a simplified point of view of conjugacy that allows us to easily recover centralizers and lends itself to generalization.
For a finite group $G$, we consider the problem of counting simultaneous conjugacy classes of $n$-tuples and simultaneous conjugacy classes of commuting $n$-tuples in $G$. Let $α_{G,n}$ denote the number of simultaneous conjugacy classes of $n$-tuples, and $β_{G,n}$ the number of simultaneous conjugacy classes of commuting $n$-tuples in $G$. The generating functions $A_G(t) = \sum_{n\geq 0} α_{G,n}t^n,$ and $B_G(t) = \sum_{n\geq 0} β_{G,n}t^n$ are rational functions of $t$. This paper concern studied of normalized functions $A_G(t/|G|)$ and $B_G(t/|G|)$ for finite $p$-groups of rank at most $5…
Let $G$ be a finite group. This expository article explores the subject of commuting probability in the group $G$ and its relation with simultaneous conjugacy classes of commuting tuples in $G$. We also point out the relevance of this topic in context of topology where similar problems are studied when $G$ is a Lie group.
Let $G$ be a finite group. We consider the problem of counting simultaneous conjugacy classes of $n$-tuples and simultaneous conjugacy classes of commuting $n$-tuples in $G$. Let $α_{G,n}$ denote the number of simultaneous conjugacy classes of $n$-tuples, and $β_{G,n}$ the number of simultaneous conjugacy classes of commuting $n$-tuples in $G$. The generating functions $A_G(t) = \sum_{n\geq 0} α_{G,n}t^n,$ and $B_G(t) = \sum_{n\geq 0} β_{G,n}t^n$ are rational functions of $t$. We show that $A_G(t)$ determines and is completely determined by the class equation of $G$. We show that $α_{G,n}$ gro…
We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand diagrams are closely related to piecewise-linear functions for elements of Thompson's groups, and we use this correspondence to investigate the dynamics of elements of F. Though many of the results in this paper are known, our approach is new, and it yields elegant proofs of several old results.
There are recent cryptographic protocols that are based on Multiple Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a method developed by the author and Nuno Franco, originally intended to solve the Conjugacy Search Problem in braid groups.
Centro de Investigação em Matemática e Aplicações (CIMA) Departamento de Matemática, Escola de Ciências e Tecnologia da Universidade de Évora（埃武拉大学科学与技术学院数学系数学与应用数学研究中心）；Center for Mathematics and Applications (NOVA Math), NOVA School of Science and Technology (NOVA FCT)（诺瓦科学技术学院）
It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed form. As a consequence it follows that the word problem for the outer automorphism group of a graph group can be solved in polynomial time.
This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's group F and suitable larger groups of piecewise-linear homeomorphisms of the unit interval. We determine algorithms to compute roots and centralizers in these groups and to detect periodic points and their behavior by looking at a particular diagram associated to an element. In the second part, we describe the structure of subgroups of the group of all homeomor…
We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the orbit-signalizer, two finite-state automorphisms are conjugate in $Aut(T)$ if and only if they are conjugate in $FAut(T)$, and that this problem is decidable. We prove that both these conditions are satisfied by bounded automorphisms and establish that the (simultaneous) conjugacy problem in the group of bounded automata is decidable.
We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super summit set to arbitrary dimensions. One key ingredient in our solution is the introduction of a provable high-dimensional version of the Birman--Ko--Lee cycling theorem. The complexity of this solution is a small degree polynomial in the cardinalities of our generalized super summit sets and the input parameters. Computer experiments suggest that the cardinalit…
The Algebraic Eraser (AE) is a cryptographic primitive that can be used to obscure information in certain algebraic cryptosystems. The Colored Burau Key Agreement Protocol (CBKAP), which is built on the AE, was introduced by I. Anshel, M. Anshel, D. Goldfeld, and S. Lemieux in 2006 as a protocol suitable for use on platforms with constrained computational resources, such as RFID and wireless sensors. In 2009 A. Myasnikov and A. Ushnakov proposed an attack on CBKAP that attempts to defeat the generalized simultaneous conjugacy search problem, which is the public-key computational problem underl…
A closed subgroup $H$ of a locally compact group $G$ is confined if the closure of the conjugacy class of $H$ in the Chabauty space of $G$ does not contain the trivial subgroup. We establish a dynamical criterion on the action of a totally disconnected locally compact group $G$ on a compact space $X$ ensuring that no relatively amenable subgroup of $G$ can be confined. This property is equivalent to the fact that the action of $G$ on its Furstenberg boundary is free. Our criterion applies to the Neretin groups. We deduce that each Neretin group has two inequivalent irreducible unitary represen…
We construct new non-associative key establishment protocols for all left self-distributive (LD), multi-LD-, and mutual LD-systems. The hardness of these protocols relies on variations of the (simultaneous) iterated LD-problem and its generalizations. We discuss instantiations of these protocols using generalized shifted conjugacy in braid groups and their quotients, LD-conjugacy and $f$-symmetric conjugacy in groups. We suggest parameter choices for instantiations in braid groups, symmetric groups and several matrix groups.
We describe an explicit relationship between strand diagrams and piecewise-linear functions for elements of Thompson's group F. Using this correspondence, we investigate the dynamics of elements of F, and we show that conjugacy of one-bump functions can be described by a Mather-type invariant.
Let H be a reductive subgroup of a reductive group G over an algebraically closed field k. We consider the action of H on G^n, the n-fold Cartesian product of G with itself, by simultaneous conjugation. We give a purely algebraic characterization of the closed H-orbits in G^n, generalizing work of Richardson which treats the case H = G. This characterization turns out to be a natural generalization of Serre's notion of G-complete reducibility. This concept appears to be new, even in characteristic zero. We discuss how to extend some key results on G-complete reducibility in this framework. We …
The Lodha-Moore group $G$ first arose as a finitely presented counterexample to von Neumann's conjecture. The group $G$ acts on the unit interval via piecewise projective homemorphisms. A result of Lodha shows that $G$ in fact has type $F_{\infty}$. Here we will describe $G$ as a group that is "locally determined" by an inverse semigroup $S_{2}$, in the sense of the author's joint work with Hughes. The semigroup $S_{2}$ is generated by three linear fractional transformations $A$, $B$, and $C_{2}$, where $A$ and $B$ are elliptical transformations of the hyperbolic plane and $C_{2}$ is a hyperbo…
This paper concerns the enumeration of simultaneous conjugacy classes of tuples of commuting unitary matrices and of commuting symplectic matrices over a finite field $\mathbf{F}_q$ of odd size. For any given conjugacy class, the orbits for the action of its centralizer group on itself by conjugation are called branches. We determine the branching rules for the unitary groups $U_2(\mathbf{F}_q), U_3(\mathbf{F}_q)$, and for the symplectic groups $Sp_2(\mathbf{F}_q), Sp_4(\mathbf{F}_q)$.
We prove that Thompson's group $F$ has a subgroup $H$ such that the conjugacy problem in $H$ is undecidable and the membership problem in $H$ is easily decidable. The subgroup $H$ of $F$ is a closed subgroup of $F$. That is, every function in $F$ which is a piecewise-$H$ function belongs to $H$. Other interesting examples of closed subgroups of $F$ include Jones' subgroups $\overrightarrow{F}_n$ and Jones' $3$-colorable subgroup $\mathcal F$. By a recent result of the first author, all maximal subgroups of $F$ of infinite index are closed. In this paper we prove that if $K\leq F$ is finitely g…
We prove that if a quasi-isometry of warped cones is induced by a map between the base spaces of the cones, the actions must be conjugate by this map. The converse is false in general, conjugacy of actions is not sufficient for quasi-isometry of the respective warped cones. For a general quasi-isometry of warped cones, using the asymptotically faithful covering constructed in a previous work with Jianchao Wu, we deduce that the two groups are quasi-isometric after taking Cartesian products with suitable powers of the integers. Secondly, we characterise geometric properties of a group (coarse e…
Contracting Self-similar Groups in Group-Based Cryptography
The City University of New York, Queens College, CUNY（纽约市立大学皇后学院）；The Initiative for the Theoretical Sciences, CUNY Graduate Center（纽约市立大学研究生中心理论科学倡议）；Department of Computer Science, University of York (UK)（约克大学计算机系）；Department of Computer Science and Engineering, Tandon School of Engineering, New York University（纽约大学坦顿工程学院计算机科学工程系）；Department of Mathematical Sciences Indiana University South Bend（印第安纳大学南本德分校数学科学系）；Department of Mathematics and Statistics University of South Florida（南佛罗里达大学数学与统计系）
