Related papers: Cayley Linear-Time Computable Groups

We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…

It is a long standing open problem whether the Thompson group $F$ is an amenable group. In this paper we show that if $A$, $B$, $C$ denote the standard generators of Thompson group $T$ and $D:=C B A^{-1}$ then…

We study some combinatorial properties of the word metric of Thompson's group F in the standard two generator finite presentation. We explore connections between the tree pair diagram representing an element w of F, its normal form in the…

In a previous work we introduced Dual Light Affine Logic (DLAL) ([BaillotTerui04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms: all typable terms can be evaluated in polynomial…

Suppose that $F$ is a free group and $k$ is a natural number. We show that the fully compressed membership problem for $k$-generated subgroups of $F$ is solvable in polynomial time. In order to do this, we adapt the theory of Stallings'…

A linear algebraic group G is over a field K is called a Cayley K-group if it admits a Cayley map, i.e., a G-equivariant K-birational isomorphism between the group variety G and its Lie algebra. We classify real reductive algebraic groups…

This thesis contains a collection of algorithms for working with the twisted groups of Lie type known as Suzuki groups, and small and large Ree groups. The two main problems under consideration are constructive recognition and constructive…

A linear algebraic group G over a field k is called a Cayley group if it admits a Cayley map, i.e., a G-equivariant birational isomorphism over k between the group variety G and the Lie algebra Lie(G). A Cayley map can be thought of as a…

In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism,…

The Thompson group F has a natural unitary representation on $H=L^2[0,1]$. With some projections, we construct a family of projective unitary representations on a Fermionic Fock space associated with $H$. It comes from the representation of…

We describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult…

In this short note, we show that R. Thompson's group $F$ admits a normalish amenable subgroup, and that the standard copy of $F$ in R. Thompson's group $T$ is normalish in $T$. We further conjecture that if $F$ is non-amenable, then $T$…

We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a…

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

Straight-line programs are a central tool in several areas of computer science, including data compression, algebraic complexity theory, and the algorithmic solution of algebraic equations. In the algebraic setting, where straight-line…

In this paper, we describe a regular representation given by Cayley theorem for 2-crossed modules of groups and their associated Gray 3-group groupoids with a single 0-cell and equivalently cat2-groups.

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…

The classical Cayley transform is a birational map between a quadratic matrix group and its Lie algebra, which was first discovered by Cayley in 1846. Because of its essential role in both pure and applied mathematics, the classical Cayley…

We show that the sum of a sequence of integers can be computed in linear time on a Turing machine. In particular, the most obvious algorithm for this problem, which appears to require quadratic time due to carry propagation, actually runs…

Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21;…