Related papers: Circuits, coNP-completeness, and the groups of Ric…

We continue with the functional approach to the P-versus-NP problem, begun in [2, 3]. We previously constructed a monoid RM^P that is non-regular iff NP is not P. We now construct homomorphic images of RM^P with interesting properties. In…

We show that the class of finitely generated virtually free groups is precisely the class of demonstrable subgroups for R. Thompson's group $V$. The class of demonstrable groups for $V$ consists of all groups which can embed into $V$ with a…

An introduction to the universal algebra approach to Higman-Thompson groups (including Thompson's group $V$) is given, following a series of lectures by Graham Higman in 1973. In these talks, Higman outlined an algorithm for the conjugacy…

A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group $G$ has solvable word problem if and only if $G$ can be embedded into a finitely presented simple group. We comment on the history of this conjecture…

We investigate the complexity of the Boolean clone membership problem (CMP): given a set of Boolean functions $F$ and a Boolean function $f$, determine if $f$ is in the clone generated by $F$, i.e., if it can be expressed by a circuit with…

We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

A triangle group is denoted by $\Delta(p,q,r)$ and has finite presentation $$ \Delta(p,q,r)=\langle x,y | x^p=y^q=(xy)^r=1 \rangle .$$ We examine a method for composition of permutation representations of a triangle group $\Delta(p,q,r)$…

We construct rearrangement groups for edge replacement systems, an infinite class of groups that generalize Richard Thompson's groups F, T, and V . Rearrangement groups act by piecewise-defined homeomorphisms on many self-similar…

Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element of $G$ belongs to a generating pair of $G$. Thompson's group $V$ was proved to be $\frac{3}{2}$-generated by Donoven and Harper in 2019. It was the…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…

Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established protocols based on numeric computation. Notably, the protocols…

The Thompson-Higman groups G_{k,i} have a natural generalization to monoids M_{k,i}, and inverse monoids Inv_{k,i}. We study some structural features of M_{k,i} and Inv_{k,i} and investigate the computational complexity of decision…

We define various monoid versions of the R. Thompson group $V$, and prove connections with monoids of acyclic digital circuits. We show that the monoid $M_{2,1}$ (based on partial functions) is not embeddable into Thompson's monoid ${\sf…

Fix a finite semigroup $S$ and let $a_1, \ldots, a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1, \ldots, a_k$. For combinatorial Rees matrix semigroups we…

Let G be a reductive linear algebraic group over a field k. Let A be a finitely generated commutative k-algebra on which G acts rationally by k-algebra automorphisms. Invariant theory tells that the ring of invariants A^G=H^0(G,A) is…

This is a survey of two papers joint with A. Borisov and a paper joint with I. Spakulova. It is based on my lectures at the conference "Groups St. Andrews 2009", Bath (August 2009). We prove that almost all 1-related groups with at least 3…

The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural…