Related papers: Gluing and cutting cube tiling codes in dimension …
Given a sequence \( S = (s_1, s_2, \ldots, s_k) \) of positive integers satisfying \( s_1 \leq s_2 \leq \dots \leq s_k \), an \( S \)-packing coloring of a graph \( G \) is a partition of \( V(G) \) into \( k \) subsets \( V_1, V_2, \dots,…
A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e.~it has codewords with weight divisible by $2.$ The purpose of this paper is to investigate interesting properties of Type I codes of different…
The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…
An edit refers to a single insertion, deletion, or substitution. This paper aims to construct binary codes that can correct two edits. To do this, a necessary and sufficient condition for a code to be two-edit correctable is provided,…
We demonstrate by explicit calculation that the first two terms in the CIV-DV prepotential for the two-cut case satisfy the generalized WDVV equations, just as in all other known examples of hyperelliptic Seiberg-Witten models. The WDVV…
Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…
Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…
A graph $G = (V,E)$ is word-representable if there is a word $w$ over the alphabet $V$ such that $x$ and $y$ alternate in $w$ if and only if the edge $(x, y)$ is in $G$. It is known [6] that all $3$-colourable graphs are word-representable,…
We contribute to the knowledge of linear codes from special polynomials and functions, which have been studied intensively in the past few years. Such codes have several applications in secret sharing, authentication codes, association…
Combinatorial neural codes are $0/1$ vectors that are used to model the co-firing patterns of a set of place cells in the brain. One wide-open problem in this area is to determine when a given code can be algorithmically drawn in the plane…
A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is known…
A weave is the lift to the Euclidean thickened plane of a set of infinitely many planar crossed geodesics, that can be characterized by a number of sets of threads describing the organization of the non-intersecting curves, together with a…
This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number w such that any ball Q can be covered by w tiles (or curve sections) with total volume O(vol(Q)). Recursive tilings and…
A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2^\alpha\times{\mathbb{Z}}_4^\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of…
Perfect codes in the $n$-dimensio\-nal grid $\Lambda_n$ of the lattice $\mathbb{Z}^n$ ($0<n\in\mathbb{Z}$) and its quotient toroidal grids were obtained via the truncated distance in $\mathbb{Z}^n$ given between $u=(u_1,\cdots,u_n)$ and…
Haah's cubic code is the prototypical type-II fracton topological order. It instantiates the no string-like operator property that underlies the favorable scaling of its code distance and logical energy barrier. Previously, the cubic code…
Tandem duplication in DNA is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain {\em et al.} (2016) proposed the study of codes that…
The standard unitarity-cut method is applied to several massive two-dimensional models, including the world-sheet AdS$_5\times S^5$ superstring, to compute $2\to 2$ scattering S-matrices at one loop from tree level amplitudes. Evidence is…
In this paper, we propose a partitioning technique that decomposes a pair of sequences with overlapping $t$-deletion $s$-substitution balls into sub-pairs, where the $^{\leq}t$-burst-deletion balls of each sub-pair intersect. This…
Two polygons $P,Q$ are code equivalent if there are billiard orbits $u,v$ which hit the same sequence of sides and such that the projections of the orbits are dense in the boundaries $\partial P, \partial Q$. Our main results show when code…