Related papers: Sliding block codes between shift spaces over infi…
Cluster variables have recently revolutionized numerical work in certain models involving fermionic variables. This novel representation of fermionic partition functions is continuing to find new applications. After describing results from…
We study shift spaces over a finite alphabet that can be approximated by mixing shifts of finite type in the sense of (pseudo)metrics connected to Ornstein's $\bar{d}$ metric ($\bar{d}$-approachable shift spaces). The class of…
Castello $\textit{et al}$. [J. Comb. Theory Ser. A, 212, 106005 (2025)] provided a complete classification for full weight spectrum (FWS) one-orbit cyclic subspace codes. In this paper, we determine the weight distributions of a family of…
Super-strong Wilf equivalence classes of the symmetric group ${\mathcal S}_n$ on $n$ letters, with respect to the generalized factor order, were shown by Hadjiloucas, Michos and Savvidou (2018) to be in bijection with pyramidal sequences of…
Given a factor code $\pi$ from a shift of finite type $X$ onto a sofic shift $Y$, the class degree of $\pi$ is defined to be the minimal number of transition classes over points of $Y$. In this paper we investigate structure of transition…
In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all…
Inspired by a recent article \cite[JFAA, 28(2):1-34, (2022)]{Skrettingland2022JoFAaA}, this paper is devoted to the study of suitable window class in the framework of bounded linear operators on $L^2(\rd)$. We establish a natural and…
We give a generalization of subspace codes by means of codes of modules over finite commutative chain rings. We define a new class of Sperner codes and use results from extremal combinatorics to prove the optimality of such codes in…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…
Necessary conditions for asymptotically optimal sliding-block or stationary codes for source coding and rate-constrained simulation of memoryless sources are presented and used to motivate a design technique for trellis-encoded source…
We introduce a class of 2D lattice models that describe the dynamics of intertwiners, or, in a condensed matter interpretation, the fusion and splitting of anyons. We identify different families and instances of triangulation invariant,…
Starting with the Heisenberg-Weyl algebra, fundamental to quantum physics, we first show how the ordering of the non-commuting operators intrinsic to that algebra gives rise to generalizations of the classical Stirling Numbers of…
We systematically classify all possible poles of superconformal blocks as a function of the scaling dimension of intermediate operators, for all superconformal algebras in dimensions three and higher. This is done by working out the…
It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal…
A code is said to be equidistant if the distance between any two distinct codewords of the code is the same. In this paper, we have studied equidistant single-orbit cyclic and quasi-cyclic subspace codes. The orbit code generated by a…
Variable-length splittable codes are derived from encoding sequences of ordered integer pairs, where one of the pair's components is upper bounded by some constant, and the other one is any positive integer. Each pair is encoded by the…
We define "sliding functors", which are exact endofunctors of the category of multi-graded modules over a polynomial ring. They preserve several invariants of modules, especially the (usual) depth and Stanley depth. In a similar way, we can…
Following up on the construction of Bridgeland stability condition on $\mathbb{P}^3$ by Macr\`i, we develop techniques to study concrete wall crossing behavior for the first time on a threefold. In some cases, such as complete intersections…
We give a reduction technique for silting intervals in extriangulated categories, which we call "silting interval reduction". It provides a reduction technique for tilting subcategories when the extriangulated categories are exact…
Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…