Related papers: Sliding block codes between shift spaces over infi…
In this paper we introduce the definition of transitivity for oriented 3-hypergraphs in order to study partial and complete cyclic orders. This definition allow us to give sufficient conditions on a partial cyclic order to be totally…
Following Beurling's theorem and a study of the topology of invariant subspaces by R. Douglas and C. Pearcy description of path connected components of invariant subspace lattice for shift of multiplicity one has been given by R.Yang. This…
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
We apply tilting theory over preprojective algebras $Lambda$ to a study of moduli space of $Lambda$-modules. We define the categories of semistable modules and give an equivalence, so-called reflection functors, between them by using…
Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of…
We prove that a unital shift equivalence induces a graded isomorphism of Leavitt path algebras when the shift equivalence satisfies an alignment condition. This yields another step towards confirming the Graded Classification Conjecture.…
This article begins with an exploration of nonlinear codes ($\mathbb{F}_q$-linear subspaces of $\mathbb{F}_{q^m}^n$) which are generalizations of the familiar Reed-Solomon codes. This then leads to a wider exploration of nonlinear analogues…
A linear code over $\mathbb{F}_q$ with the Hamming metric is called $\Delta$-divisible if the weights of all codewords are divisible by $\Delta$. They have been introduced by Harold Ward a few decades ago. Applications include subspace…
Recall the classical 15-puzzle, consisting of 15 sliding blocks in a $4\times 4$ grid. Famously, the configuration space of this puzzle consists of two connected components, corresponding to the odd and even permutations of the symmetric…
The recently introduced tile codes are a promising alternative to surface codes, combining two-dimensional locality with higher encoding efficiency. While surface codes are well understood in terms of their logical operators and boundary…
We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…
General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
We introduce a new extension in symbolic dynamics on two sets of alphabets, called the zip shift space. In finite case, it represents a finite-to-1 local homeomorphism called zip shift map. Such extension, offers a conjugacy between some…
We use monadic second-order logic to define two-dimensional subshifts, or sets of colorings of the infinite plane. We present a natural family of quantifier alternation hierarchies, and show that they all collapse to the third level. In…
For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…
In this paper, we consider chaotic dynamics and variational structures of area-preserving maps. There is a lot of study on the dynamics of their maps and the works of Poincare and Birkhoff are well-known. To consider variational structures…
We discuss that there exist at least two different choices in the signs of the induced A-infinity structures in shifting the degree of objects in an A-infinity category. We show that both of these choices are naturalin the sense that they…
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and…