Related papers: Sliding block codes between shift spaces over infi…
A homshift is a $d$-dimensional shift of finite type which arises as the space of graph homomorphisms from the grid graph $\mathbb Z^d$ to a finite connected undirected graph $G$. While shifts of finite type are known to be mired by the…
Two new classes of skew codes over a finite field $\F$ are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew…
We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…
The Stirling numbers of the second kind are related to normal orderings in the Weyl algebra, while the unsigned Stirling numbers of the first kind are related to normal orderings in the shift algebra. Kim-Kim introduced a {\lambda}-analogue…
In this work we characterize shift spaces over infinite countable alphabets that can be endowed with an inverse semigroup operation. We give sufficient conditions under which zero-dimensional inverse semigroups can be recoded as shift…
In this paper, we extend the scope of symbolic dynamics to encompass a specific class of ideal polyhedrons in the 3-dimensional hyperbolic space, marking an important step forward in the exploration of dynamical systems in non-Euclidean…
This paper extends sliding-mode control theory to nonlinear systems evolving on smooth manifolds. Building on differential geometric methods, we reformulate Filippov's notion of solutions, characterize well-defined vector fields on quotient…
Cyclic orbit codes are constant dimension subspace codes that arise as the orbit of a cyclic subgroup of the general linear group acting on subspaces in the given ambient space. With the aid of the largest subfield over which the given…
We prove that if T is an operator on an infinite-dimensional Hilbert space whose spectrum and essential spectrum are both connected and whose Fredholm index is only 0 or 1, then the only nontrivial norm-stable invariant subspaces of T are…
In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…
The infinite tumbling block graph is a bipartite graph, where each vertex in one partite set is of degree 3 and each vertex in the other partite set is of degree 6. It is a 2-dimensional array of blocks of seven vertices and nine edges, a…
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…
In this article, we prove that for all pairs of primitive Pisot or uniform substitutions with the same dominating eigenvalue, there exists a finite set of block maps such that every block map between the corresponding subshifts is an…
Support $\tau$-tilting modules correspond to some classes of categorical objects bijectively, such as two-term tilting complexes for any finite dimensional symmetric algebra. This fact motivates us to classify support $\tau$-tilting modules…
We study complementary information set codes of length $tn$ and dimension $n$ of order $t$ called ($t-$CIS code for short). Quasi-cyclic and quasi-twisted $t$-CIS codes are enumerated by using their concatenated structure. Asymptotic…
We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable…
In this work we characterize those shift spaces which can support a 1-block quasi-group operation and show the analogous of Kitchens result: any such shift is conjugated to a product of a full shift with a finite shift. Moreover, we prove…
Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…