Related papers: Cayley Linear-Time Computable Groups

This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…

The fast multipole method (FMM) performs fast approximate kernel summation to a specified tolerance $\epsilon$ by using a hierarchical division of the domain, which groups source and receiver points into regions that satisfy local…

Graph polynomials which are definable in Monadic Second Order Logic (MSOL) on the vocabulary of graphs are Fixed-Parameter Tractable (FPT) with respect to clique-width. In contrast, graph polynomials which are definable in MSOL on the…

We investigate the correspondence between the time and space recognition complexity of languages. For this purpose, we will code the long-continued computations of deterministic two-tape Turing machines by the relatively short-length…

We consider the problem of computing the relative Brauer group of a torsor of period 2 under an elliptic curve E. We show how this problem can be reduced to finding a set of generators for the group of rational points on E. This extends…

We exhibit a Cayley-Hamilton trace identity for $2\times2$ matrices with entries in a ring $R$ satisfying $[[x,y],[x,z]]=0$ and 1/2 \in R$.

We employ techniques of machine-learning, exemplified by support vector machines and neural classifiers, to initiate the study of whether AI can "learn" algebraic structures. Using finite groups and finite rings as a concrete playground, we…

Main theorems of the article concern the problem of M. Atiyah on possible values of l^2-Betti numbers. It is shown that all non-negative real numbers are l^2-Betti numbers, and that "many" (for example all non-negative algebraic) real…

We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines…

We give sufficient conditions for left- and bi-orderability of fundamental groups of Ore categories in terms of indirect factors, including Thompson groups and many of their generalizations. Besides recovering known results, we prove that…

We discuss metric and combinatorial properties of Thompson's group T, including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson's group F when possible, and highlight…

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

This document is a practical guide to computations using an automatic structure for the mapping class group of a once-punctured, oriented surface $S$. We describe a quadratic time algorithm for the word problem in this group, which can be…

The automorphism groups for the groups of orders $8p$ and $8p^2$ are given. The calculations were done using the programming language CAYLEY. Explicit presentations for both the groups of these orders and their automorphism groups are…

For an affine double plane defined by an equation of the form z^2 = f, we study the divisor class group and the Brauer group. Two cases are considered. In the first case, f is a product of n linear forms in k[x,y] and X is birational to a…

This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…

We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

If a black box group is known to be isomorphic to an exceptional simple group of Lie type of (twisted) rank $>1$, other than any $^2F_4(q)$, over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism.…