Related papers: Nonexistence of perfect $2$-error-correcting Lee c…
Consider the W-algebra $W$ attached to the smallest nilpotent orbit in a simple Lie algebra $\frak g$ over an algebraically closed field of characteristic 0. We show that if an analogue of the Gelfand-Kirillov conjecture holds for such a…
In this note we report two versions of Gilbert-Varshamov type existential bounds for asymmetric quantum error-correcting codes.
Let $X=\Lambda\backslash\mathbb{H}$ be a Schottky surface, that is, a conformally compact hyperbolic surface of infinite area. Let $\delta$ denote the Hausdorff dimension of the limit set of $\Lambda$. We prove that for any compact subset…
We shall study three subjects of the Jacobi-Perron Algorithm of dimension 2. First, we study the "ideal convergence". About the approximations (p_n/r_n, q_n/r_n) to (A, B) (where A and B are positive real numbers, r_n, p_n and q_n are…
Motivated by applications in in-vivo DNA storage, we study codes for correcting duplications. A reverse-complement duplication of length $k$ is the insertion of the reversed and complemented copy of a substring of length $k$ adjacent to its…
P\'or and Wood conjectured that for all $k,l \ge 2$ there exists $n \ge 2$ with the following property: whenever $n$ points, no $l + 1$ of which are collinear, are chosen in the plane and each of them is assigned one of $k$ colours, then…
We prove that for Bernoulli percolation on a graph $\mathbb{Z}^2\times\{0,\dots,k\}$ ($k\ge 0$), there is no infinite cluster at criticality, almost surely. The proof extends to finite range Bernoulli percolation models on $\mathbb{Z}^2$…
The performance of Reed--Solomon codes (RS codes, for short) in the presence of insertion and deletion errors has attracted growing attention in recent literature. In this work, we further study this intriguing mathematical problem,…
A simple and unifying method to show the perfect error-correcting condition is provided based on the quantum mutual information. The one-to-one parameterization of quantum operations and the properties of the quantum relative entropy are…
In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…
A classical result of Kaufman states that, for each $\tau>1,$ the set of well approximable numbers \[ E(\tau)=\{x\in\mathbb{R}: \|qx\| < |q|^{-\tau} \text{ for infinitely many integers q}\} \] is a Salem set with Hausdorff dimension…
We develop a theory of infinity properads enriched in a general symmetric monoidal infinity category. These are defined as presheaves, satisfying a Segal condition and a Rezk completeness condition, over certain categories of graphs. In…
An interesting result of Veech more than 50 years ago is a parity, or mod $2$, version of the Kronecker--Weyl equidistribution theorem concerning the irrational rotation sequence $\{q\alpha\}$, $q=0,1,2,3,\ldots.$ If $\alpha$ is badly…
Without using Gabber's theorem, the finite-dimensionality of the space of conformal blocks in the WZNW-models is proved.
In this paper, we obtain the exact blow-up profiles of solutions of the Keller-Segel-Patlak system in the space with dimensions $N\ge 3$, which solves an open problem proposed by P. Souplet and M. Winkler in 2019. To establish this…
Csisz\'ar's channel coding theorem for multiple codebooks is generalized allowing the codeword lenghts differ across codebooks. Also in this case, for each codebook an error exponent can be achieved that equals the random coding exponent…
We shall show that there is no odd perfect number of the form $2^n+1$ or $n^n+1$.
The Colmez conjecture relates the Faltings height of an abelian variety with complex multiplication by the ring of integers of a CM field $E$ to logarithmic derivatives of certain Artin $L$--functions at $s=0$. In this paper, we prove that…
Fix a prime number ell. In this paper we develop the theory of relative pro-ell completion of discrete and profinite groups -- a natural generalization of the classical notion of pro-ell completion -- and show that the pro-ell completion of…
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…