相关论文: Nonexistence of perfect $2$-error-correcting Lee c…
Stochastic optimization algorithms have become indispensable in modern machine learning. An unresolved foundational question in this area is the difference between with-replacement sampling and without-replacement sampling -- does the…
We derive the coding capacity for duplication-correcting codes capable of correcting any number of duplications. We do so both for reverse-complement duplications, as well as palindromic (reverse) duplications. We show that except for…
Lovasz and Plummer conjectured that there exists a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2^(cn) perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve…
The family of topologies that induce the Euclidean metric space on every time axis and every space axis exhibits no maximal element when partially ordered by the relation ``finer than'', as demonstrated in this article. One conclusion and…
The 2D $\mathbb{Z}_2$ toric code admits a global symmetry exchanging electric and magnetic quasiparticles, known as electromagnetic duality. Known realizations include lattice translation symmetry, an exact $\mathbb{Z}_4$ symmetry generated…
The existence of quantum error correcting codes is one of the most counterintuitive and potentially technologically important discoveries of quantum information theory. However, standard error correction refers to abstract quantum…
Zero-error coding encompasses a variety of source and channel problems where the probability of error must be exactly zero. This condition is stricter than that of the vanishing error regime, where the error probability goes to zero as the…
Quantum error correcting codes have a distance parameter, conveying the minimum number of single spin errors that could cause error correction to fail. However, the success thresholds of finite per-qubit error rate that have been proven for…
This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…
We report two analytical bounds for quantum error-correcting codes that do not have preexisting classical counterparts. Firstly the quantum Hamming and Singleton bounds are combined into a single tighter bound, and then the combined bound…
The paper concerns the Gelfand-Kirillov dimension and the generating series of nonsymmetric operads. An analogue of Bergman's gap theorem is proved, namely, no finitely generated locally finite nonsymmetric operad has Gelfand-Kirillov…
One of the many equivalent formulation of the K\"othe's conjecture is the assertion that there exists no ring which contains two nil right ideals whose sum is not nil. We discuss several consequences of an observation that if the Koethe…
We study perfect codes in the sum-rank metric, a generalization of both the Hamming and rank metrics relevant in multishot network coding and space-time coding. A perfect code attains equality in the sphere-packing bound, corresponding to a…
A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…
Let $G$ be a group which is either virtually soluble or virtually free, and let $\omega$ be a weight on $G$. We prove that, if $G$ is infinite, then there is some maximal left ideal of finite codimension in the Beurling algebra $\ell^1(G,…
The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The third cuboid conjecture is the last of the three propositions suggested as intermediate stages in proving the…
For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…
In this work we consider the focusing, energy-critical wave equation in 3D radial case. According to the soliton resolution conjecture, which has been verified in the radial case, any type II blow-up solution decomposes into a superposition…
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode $k=n-j-2$ qubits in $n=2^j$ qubits and correct $t=1$…
We prove a conjecture of Helleseth that claims that for any $n \geq 0$, a pair of binary maximal linear sequences of period $2^{2^n}-1$ can not have a three-valued cross-correlation function.