Related papers: Some Results on Reversible Gate Classes Over Non-B…
For each integer $m \geq 2$, a network is constructed which is solvable over an alphabet of size $m$ but is not solvable over any smaller alphabets. If $m$ is composite, then the network has no vector linear solution over any $R$-module…
The aim of this paper is to extend the structure theory for infinitely generated modules over tame hereditary algebras to the more general case of modules over concealed canonical algebras. Using tilting, we may assume that we deal with…
We study the structure of the language of binary cube-free words. Namely, we are interested in the cube-free words that cannot be infinitely extended preserving cube-freeness. We show the existence of such words with arbitrarily long finite…
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…
Deterministic 2-head finite automata which are machines that process an input word from both ends are analyzed for their ability to perform reversible computations. This implies that the automata are backward deterministic, enabling unique…
We call a finite-dimensional K-algebra A geometrically irreducible if for all d, all connected components of the affine scheme of d-dimensional A-modules are irreducible. We show that the geometrically irreducible algebras without loops…
We show that there is an order-preserving embedding of the additive group of rational numbers $\mathbb{Q}$ into a 2-generator group $G$. The group $G$ can be chosen to be a solvable group $G$ of length 3, which is a minimal result in the…
We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases.…
Inspired by the commutator and anticommutator algebras derived from algebras graded by groups, we introduce noncommutatively graded algebras. We generalize various classical graded results to the noncommutatively graded situation concerning…
This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the…
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is…
An element $g$ of a group is called {\em reversible} if it is conjugate in the group to its inverse. In this paper we review some results about the structure of groups involving the reversible elements and we pose some questions about…
In this paper, we construct a family of reductive groups, including all reductive groups up to a given rank. We also construct a similar versal family of quasi-split reductive groups. This result generalizes a former result of N.Avni and…
We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks. Such machines have been studied under a variety of additional constraints and…
It is well-known that deciding equivalence of logic circuits is a coNP-complete problem. As a corollary, the problem of deciding weak equivalence of reversible circuits, i.e. ignoring the ancilla bits, is also coNP-complete. The complexity…
Reversible logic has attracted much research interest over the last few decades, especially due to its application in quantum computing. In the construction of reversible gates from basic gates, ancilla bits are commonly used to remove…
In a recent paper, we defined twisted unitary $1$-groups and showed that they automatically induced error-detecting quantum codes. We also showed that twisted unitary $1$-groups correspond to irreducible products of characters thereby…