Related papers: Cayley Linear-Time Computable Groups

In order to define the exceptional compact Lie groups $G_2,F_4,E_6,E_7,E_8$, we usually use the Cayley algebra $\mathfrak{C}$ or its complexification $\mathfrak{C}^C$. In the present article, we consider replacing the Cayley algebra…

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

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…

Permutations on a set, endowed with function composition, build a group called a symmetric group. In addition to their algebraic structure, symmetric groups have two metrics that are of particular interest to us here: the Cayley distance…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

For a wide family of formations $\mathfrak{F}$ it is proved that the $ \mathfrak{F}$-residual of a permutation finite group can be computed in a polynomial time. Moreover, if in the previous case $\mathfrak{F}$ is hereditary, then an…

The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation…

In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…

We prove that every element of the special linear group can be represented as the product of at most six block unitriangular matrices, and that there exist matrices for which six products are necessary, independent of indexing. We present…

Let G be a finitely generated group and M_n(G) the number of its normal subgroup subgroups of index at most n. For linear groups G we show that M_n(G) can grow polynomially in n only if the semisimple part of the Zariski closure of G has…

By considering a discrete tape where each cell corresponds to an integer, thus to a possible sum, a pseudo-polynomial solution can be given to subset sum problem, which is an NP-complete problem and a cornerstone application for this study,…

In this paper we prove that any finite group of order $n$ can be viewed as the group of the solutions of a certain matrix equation $XB=BY$, where the unknowns $X,Y$ are two permutation matrices of order $n$ and $(1+k)n+2 $ respectively and…

In this paper, we investigate the complexity of computing minimal faithful permutation representations for groups without abelian normal subgroups (a.k.a. Fitting-free groups). When our groups are given as quotients of permutation groups,…

A Turing machine with faults, failures and recovery (TMF) is described. TMF is (weakly) non-deterministic Turing machine consisting of five semi-infinite tapes (Master Tape, Synchro Tape, Backup Tape, Backup Synchro Tape, User Tape) and…

We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…

Put $R=\F[[t_1, \ldots, t_d]])$. We estimate the number of normal subgroups of $\mathrm{SL}_2^1(\F[[t_1, \ldots, t_d]])$ for $p>2$, the number of ideals in the Lie algebra $\Lie(R)$, and the number of ideals in the associative algebra $R$.

The usual coherence theorem of MacLane for categories with multiplication assumes that a certain pentagonal diagram commutes in order to conclude that associativity isomorphisms are well defined in a certain practical sense. The practical…

In a recent paper Uffe Haagerup and Kristian Knudsen Olesen show that for Richard Thompson's group $T$, if there exists a finite set $H$ which can be decomposed as disjoint union of sets $H_1$ and $H_2$ with $\sum_{g\in…

The goal of this article is to clarify the relationship between the topos of triads and the neo-Riemannian PLR-group. To do this, we first develop some theory of generalized interval systems: 1) we prove the well known fact that every pair…

We clarify the structure of nilpotent Lie groups which are multiplication groups of $3$-dimensional simply connected topological loops and prove that non-solvable Lie groups acting minimally on $3$-dimensional manifolds cannot be the…