Related papers: Cayley Linear-Time Computable Groups
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$. From a…
This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
We prove that under two natural probabilistic models (studied by Cleary, Elder, Rechnitzer and Taback), the probability that a random pair of elements of Thompson's group $F$ generate the entire group is positive. We also prove that for any…
The present work determines the exact nature of {\em linear time computable} notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear 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…
Lie group method provides an efficient tool to solve nonlinear partial differential equations. This paper suggests a fractional Lie group method for fractional partial differential equations. A time-fractional Burgers equation is used as an…
In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
We find the group of equivalence transformations for equations of the form $y''= A(x)y' + F(y),$ where $A$ and $F$ are arbitrary functions. We then give a complete group classification of these families of equations, using a direct method…
We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iterable data, and one,…
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.
It is shown, that the mapping class group of a surface of the genus g > 1 admits a faithful representation into the matrix group GL (6g-6, Z). The proof is based on a categorical correspondence between the Riemann surfaces and the so-called…
In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not know the group size but can access randomly chosen elements of…
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…
This article addresses the problem of enumerating the tilings of a plane by lozenges, under the restriction that these tilings be doubly periodic. Kasteleyn's Pfaffian method is applied to compute the generating function of those…
We review Bacry and Levy-Leblond's work on possible kinematics as applied to 2-dimensional spacetimes, as well as the nine types of 2-dimensional Cayley-Klein geometries, illustrating how the Cayley-Klein geometries give homogeneous…
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63--72]. As a…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
We present an enumeration of orientably-regular maps with automorphism group isomorphic to the twisted linear fractional group $M(q^2)$ for any odd prime power $q$.