Related papers: Unambiguously coded shifts
Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of deterministic automata whilst maintaining some of their desirable…
We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows…
We introduce the notion of non commutative truncated polynomial extension of an algebra A. We study two families of these extensions. For the first one we obtain a complete classification and for the second one, which we call upper…
In their 2002 article, Ghirardi, Marinatto and Weber have proposed a formal analysis of the entanglement properties for a system consisting of N distinguishable particles. Their analysis leads to the differentiation of three possible…
Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A…
We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…
Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $n$ and a prime power $q$. Based on Pascal's triangle we give an…
We prove the Bianchi permutability (existence of superposition principle) of B\"acklund transformations for asymmetric quad-equations. Such equations and there B\"acklund transformations form 3D consistent systems of a priori different…
This work classifies stabilizer codes by the set of diagonal Clifford gates that can be implemented transversally on them. We show that, for any stabilizer code, its group of diagonal transversal Clifford gates on $\ell$ code blocks must be…
We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…
In a 1937 paper B.H. Neumann constructed an uncountable family of $2$-generated groups. We prove that all of his groups are permutation stable by analyzing the structure of their invariant random subgroups.
A logarithm representation of operators is introduced as well as a concept of pre-infinitesimal generator. Generators of invertible evolution families are represented by the logarithm representation, and a set of operators represented by…
We unravel the algebraic structure which controls the various ways of computing the word ((xy)(zt)) and its siblings. We show that it gives rise to a new type of operads, that we call permutads. It turns out that this notion is equivalent…
This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…
We consider systems of ODEs with the right hand side being Laurent polynomials in several non-commutative unknowns. In particular, these unknowns could be matrices of arbitrary size. An important example of such a system was proposed by M.…
A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…
Recently a generalization of shifts of finite type to the infinite alphabet case was proposed, in connection with the theory of ultragraph C*-algebras. In this work we characterize the class of continuous shift commuting maps between these…
We give an inductive construction for irreducible Clifford systems on Euclidean vector spaces. We then discuss how this notion can be adapted to Riemannian manifolds, and outline some developments in octonionic geometry.
We give a numerical characterization of weighted hyperplane arrangements arising from Dunkl systems.
We consider switched systems on Banach and Hilbert spaces governed by strongly continuous one-parameter semigroups of linear evolution operators. We provide necessary and sufficient conditions for their global exponential stability, uniform…