Related papers: Reversible k-valued logic circuits are finitely ge…
We give some optimal size generating sets for the group generated by shifts and local permutations on the binary full shift. We show that a single generator, namely the fully asynchronous application of the elementary cellular automaton 57…
Drawing inspiration from a recent paper of Heuberger, Krenn, and Lipnik, we define the class of strongly k-recursive sequences. We show that every k-automatic sequence is strongly $k$-recursive, therefore k-recursive, and discuss that the…
Closed classes of three-valued logic generated by symmetric funtions that equal $1$ in almost all tuples from $\{1,2\}^n$ and equal $0$ on the rest tuples are considered. Criteria for bases existence for these classes is obtained.
A rooted network consists of a connected, locally finite graph G, equipped with edge conductances and a distinguished vertex o. A nonnegative function on the vertices of G which vanishes at o, has Laplacian 1 at o, and is harmonic at all…
In SGA 2, Grothendieck conjectures that the \'etale fundamental group of the punctured spectrum of a complete noetherian local domain of dimension at least two with algebraically closed residue field is topologically finitely generated. In…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…
Let $A$ be an associative algebra over a field of characteristic $\neq 2$ that is generated by a finite collection of nilpotent elements. We prove that all Lie derived powers of $A$ are finitely generated Lie algebras.
The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
We study two-dimensional cyclic quotient singularities defined by $k$-Wahl chains, a class of Hirzebruch--Jung continued fractions obtained inductively starting from $[k+2]$. This class includes the classical Wahl singularities in the case…
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…
We continue the work by Aschbacher, Kinyon and Phillips [AKP] as well as of Glauberman [Glaub1,2] by describing the structure of the finite Bruck loops. We show essentially that a finite Bruck loop $X$ is the direct product of a Bruck loop…
Reversible computing has emerged as a possible low cost alternative to conventional computing in terms of speed, power consumption and computing capability. In order to achieve reliable circuits in reversible computing, provision for fault…
We study twisted modules for (weak) quantum vertex algebras and we give a conceptual construction of (weak) quantum vertex algebras and their twisted modules. As an application we construct and classify irreducible twisted modules for a…
The K\"unneth Theorem for equivariant (complex) K-theory K^*_G, in the form developed by Hodgkin and others, fails dramatically when G is a finite group, and even when G is cyclic of order 2. We remedy this situation in this very simplest…
The Fibonacci groups $F(n)$ are known to exhibit significantly different behaviour depending on the parity of $n$. We extend known results for $F(n)$ for odd $n$ to the family of Fractional Fibonacci groups $F^{k/l}(n)$. We show that for…
In this paper we present an algorithm to find the discrete Lagrangian for an autonomous recurrence relation of arbitrary even order $2k$ with $k>1$. The method is based on the existence of a set of differential operators called annihilation…
A differential algebra of finite type over a field k is a filtered algebra A, such that the associated graded algebra is finite over its center, and the center is a finitely generated k-algebra. The prototypical example is the algebra of…
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…
Inspired by Solomonoffs theory of inductive inference, we propose a prior based on circuit complexity. There are several advantages to this approach. First, it relies on a complexity measure that does not depend on the choice of UTM. There…