Related papers: Knuth's non-associative "group" on ${\mathcal P}(\…
The article presents a method of cluster expansions for groups of operators associated with the von Neumann equations for states and the Heisenberg equations for observables, aiming to construct generating operators for nonperturbative…
Let $R$ be a ring, let $G$ be an amenable group and let $R\ast G$ be a crossed product. The goal of this paper is to construct, starting with a suitable additive function $L$ on the category of left modules over $R$, an additive function on…
An algebraic quantum group is a multiplier Hopf algebra with integrals. In this paper we will develop a theory of algebraic quantum hypergroups. It is very similar to the theory of algebraic quantum groups, except that the comultiplication…
Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…
Based on a fact that complex Clifford algebras of even dimension are isomorphic to the matrix ones, we consider bundles in Clifford algebras whose structure group is a general linear group acting on a Clifford algebra by left…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
In his book A Practical Theory of Programming, Eric Hehner proposes and applies a remarkably radical reformulation of set theory, in which the collection and packaging of elements are seen as separate activities. This provides for…
This paper presents bsort, a non-comparison-based sorting algorithm for signed and unsigned integers, and floating-point values. The algorithm unifies these cases through an approach derived from binary quicksort, achieving $O(wn)$ runtime…
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
In the paper Algebraic quantum groups and duality I, we consider a pairing $(a,b)\mapsto\langle a,b\rangle$ of regular multiplier Hopf algebras $A$ and $B$. When $A$ has integrals and when $B$ is the dual of $A$, we can describe the duality…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
Quantum information provides fundamentally different computational resources than classical information. We prove that there is no unitary protocol able to add unknown quantum states belonging to different Hilbert spaces. This is an…
Discrete circular convolution over $\mathbb{Z}/N\mathbb{Z}$ is a linear operator and can be implemented on quantum hardware within the linear-combination-of-unitaries (LCU) framework. In this work, we make this connection explicit through…
Let $K$ be a commutative ring with unit and $S$ an inverse semigroup. We show that the semigroup algebra $KS$ can be described as a convolution algebra of functions on the universal \'etale groupoid associated to $S$ by Paterson. This…
A novel implementation of a special class of Galois ring, in which the multiplication can be realized by a cyclic convolution, is applied to the construction of network codes. The primitive operations involved are byte-wise shifts and…
The dual Lie bialgebra of a certain ``quasitriangular'' Lie bialgebra structure on the Heisenberg Lie algebra determines a (non-compact) Poisson--Lie group G. The compatible Poisson bracket on G is non-linear, but it can still be realized…
Most of the work on implementing arithmetic on a quantum computer has borrowed from results in classical reversible computing (e.g. [VBE95], [BBF02], [DKR04]). These quantum networks are inherently classical, as they can be implemented with…
Quantum information is radically different from classical information in that the quantum formalism (Hilbert space) makes necessary the introduction of irreducible ``nits,'' n being an arbitrary natural number (bigger than one), not just…
We construct uncountably categorical 3-nilpotent groups of exponent p > 3. They are not one-based and do not allow the interpretation of an infinite field. Therefore they are counterexamples to Zilbers Conjecture. First 2-nilpotent new…
Suppose that a binary operation $\circ$ on a finite set $X$ is injective in each variable separately and also associative. It is easy to prove that $(X,\circ)$ must be a group. In this paper we examine what happens if one knows only that a…