Related papers: Nonexistence of perfect $2$-error-correcting Lee c…

We present an asymptotic limit between correctable and uncor-rectable errors on the Reed-Muller codes of any order. This limit is theoretical and does not depend of any decoding algorithm.

We study Liouville-type theorem for polyharmonic H\'enon-Lane-Emden system $(-\Delta)^mu=|x|^av^p,\; (-\Delta)^mv=|x|^bu^q$ when $m,p,q\geq 1, pq\ne 1$, and $a,b\geq 0$. It is a natural conjecture that the nonexistence of positive solutions…

Quantum error correction is essential for the development of any scalable quantum computer. In this work we introduce a generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting…

We prove that a certain binary linear code associated with the incidence matrix of a quasi-symmetric 2-(37,9,8) design with intersection numbers 1 and 3 must be contained in an extremal doubly even self-dual code of length 40. Using the…

Let $q=p^m$ be a prime power and $e$ be an integer with $0\leq e\leq m-1$. $e$-Galois self-dual codes are generalizations of Euclidean $(e=0)$ and Hermitian ($e=\frac{m}{2}$ with even $m$) self-dual codes. In this paper, for a linear code…

Euler showed that if an odd perfect number exists, it must be of the form $N = p^\alpha q_{1}^{2\beta_{1}}$ $\ldots$ $q_{k}^{2\beta_{k}}$, where $p, q_{1}, \ldots, q_k$ are distinct odd primes, $\alpha$, $\beta_{i} \geq 1$, for $1 \leq i…

The Coleman-Oort conjecture says that for large $g$ there are no positive-dimensional Shimura subvarieties of $\mathsf{A}_g$ generically contained in the Jacobian locus. Counterexamples are known for $g\leq 7$. They can all be constructed…

A binary 1-error-correcting code can always be embedded in a 1-perfect code of some larger length

We show there is an uncountable number of parallel total perfect codes in the integer lattice graph ${\Lambda}$ of $\R^2$. In contrast, there is just one 1-perfect code in ${\Lambda}$ and one total perfect code in ${\Lambda}$ restricting to…

A locally correctable code (LCC) is an error correcting code that allows correction of any arbitrary coordinate of a corrupted codeword by querying only a few coordinates. We show that any {\em zero-error} $2$-query locally correctable code…

We show that for every length of form $4^k-1$, there exists a binary $1$-perfect code that does not include any Preparata-like code.

Gurevich (1988) conjectured that there is no logic for $\textsf{P}$ or for $\textsf{NP}\cap \textsf{coNP}$. For the latter complexity class, he also showed that the existence of a logic would imply that $\textsf{NP} \cap \textsf{coNP}$ has…

A conjecture of Erd\H{o}s states that for any infinite set $A \subseteq \mathbb R$, there exists $E \subseteq \mathbb R$ of positive Lebesgue measure that does not contain any nontrivial affine copy of $A$. The conjecture remains open for…

Building on the genus-3 reduction $C_A : w^2 = \lambda^8 + A \lambda^4 + 1$ established in our companion paper (arXiv:2604.09328), we give an unconditional proof of the perfect-cuboid conjecture ("Conjecture B") on $1{,}072$ explicit…

We solve the problem of the classification of perfect quantum codes. We prove that the only nontrivial perfect quantum codes are those with the parameters . There exist no other nontrivial perfect quantum codes.

We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we study is when $\delta \leq w$ deletions are localized in a…

The long standing Lech's conjecture in commutative algebra states that for a flat local extension $(R,\mathfrak{m})\to (S,\mathfrak{n})$ of Noetherian local rings, we have an inequality on the Hilbert--Samuel multiplicities: $e(R)\leq…

We construct a weakly compact convex subset of $\ell^2$ with nonempty interior that has an isolated maximal element, with respect to the lattice order $\ell _+^2$. Moreover, the maximal point cannot be supported by any strictly positive…

We show that for any $\Delta \geq 3$, there is no bound computable from $(\varepsilon, r)$ on the size of a graph required to approximate a graph of maximum degree at most $\Delta$ up to $\varepsilon$ error in $r$-neighborhood statistics.…

Quantum error-correcting codes are essential to the implementation of fault-tolerant quantum computation. Homological products of classical codes offer a versatile framework for constructing quantum error-correcting codes with desirable…