English
Related papers

Related papers: A New Approach Towards the Golomb-Welch Conjecture

200 papers

We study perfect error-correcting codes in $\mathbb{Z}^n$ for the symmetric limited-magnitude error channel, where at most $e$ coordinates of an integer vector may be altered by a value whose magnitude is at most $s$. Geometrically, such…

Information Theory · Computer Science 2026-01-21 Zhihao Guan , Hengjia Wei

We study the Lane-Emden conjecture, which asserts the non-existence of non-trivial, non-negative solutions to the Lane-Emden system \[ -\Delta u = v^p, \quad -\Delta v = u^q, \quad x \in \mathbb{R}^n\] in the subcritical regime. By…

Analysis of PDEs · Mathematics 2025-10-09 Kui Li , Mingxiang Li , Juncheng Wei

A tight criterion under which the abstract version Lov\'asz Local Lemma (abstract-LLL) holds was given by Shearer decades ago. However, little is known about that of the variable version LLL (variable-LLL) where events are generated by…

Discrete Mathematics · Computer Science 2017-09-18 Kun He , Liang Li , Xingwu Liu , Yuyi Wang , Mingji Xia

A long-standing conjecture of Podewski states that every minimal field is algebraically closed. It was proved by Wagner for fields of positive characteristic, but it remains wide open in the zero-characteristic case. We reduce Podewski's…

Logic · Mathematics 2013-12-03 Krzysztof Krupiński , Predrag Tanović , Frank O. Wagner

Pudl\'ak [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are: - $\mathsf{DisjNP}$: The class of all disjoint…

Computational Complexity · Computer Science 2020-01-10 Titus Dose

Let A be an abelian variety defined over a number field F. For a prime number $\ell$, we consider the field extension of F generated by the $\ell$-powered torsion points of A. According to a conjecture made by Rasmussen and Tamagawa, if we…

Number Theory · Mathematics 2013-05-23 Abbey Bourdon

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Discrete Mathematics · Computer Science 2018-04-26 David Avis , David Bremner , Hans Raj Tiwary , Osamu Watanabe

Lattice tilings of $\mathbb{Z}^n$ by limited-magnitude error balls correspond to linear perfect codes under such error models and play a crucial role in flash memory applications. In this work, we establish three main results. First, we…

Combinatorics · Mathematics 2025-05-14 Ka Hin Leung , Ran Tao , Daohua Wang , Tao Zhang

Weber's conjecture (1886) governs three aspects of lattice-based cryptography: the solvability of the Principal Ideal Problem, the freeness of modules over rings of integers, and the tightness of worst-case-to-average-case reductions in…

Cryptography and Security · Computer Science 2026-05-08 Ming-Xing Luo

The Bogomolov conjecture for a curve claims finiteness of algebraic points on the curve which are small with respect to the canonical height. Ullmo has established this conjecture over number fields, and Moriwaki generalized it to the…

Algebraic Geometry · Mathematics 2017-08-10 Kazuhiko Yamaki

Tate's theorem (Invent. Math. 1966)implies that the Tate conjecture holds for any abelian variety over a finite field whose Q_l-algebra of Tate classes is generated by those of degree 1. We construct families of abelian varieties over…

Number Theory · Mathematics 2021-01-27 J. S. Milne

Bollob\'{a}s and Nikiforov (J. Combin. Theory Ser. B. 97 (2007) 859-865) conjectured that for a graph $G$ with $e(G)$ edges and the clique number $\omega(G)$, then $ \lambda_{1}^{2}+\lambda_{2}^{2}\leq…

Combinatorics · Mathematics 2025-01-14 Chunmeng Liu , Changjiang Bu

We consider the following feasibility problem: given an integer $n \geq 1$ and an integer $m$ such that $0 \leq m \leq \binom{n}{2}$, does there exist a line graph $L = L(G)$ with exactly $n$ vertices and $m$ edges ? We say that a pair…

Combinatorics · Mathematics 2022-05-20 Yair Caro , Josef Lauri , Christina Zarb

A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such…

Combinatorics · Mathematics 2007-05-23 Gérard Cornuéjols

Deligne's weight-monodromy conjecture gives control over the poles of local factors of L-functions of varieties at places of bad reduction. His proof in characteristic p was a step in his proof of the generalized Weil conjectures. Scholze…

Algebraic Geometry · Mathematics 2023-03-13 Peter Wear

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…

Information Theory · Computer Science 2021-01-11 Serge Kas Hanna , Salim El Rouayheb

We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$.

Number Theory · Mathematics 2023-01-09 Sarah Peluse

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…

Functional Analysis · Mathematics 2024-07-19 Aris Daniilidis , Carlo de Bernardi , Enrico Miglierina

Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here we study the compatibility of these two…

Ternary constant weight codes of length $n=2^m$, weight $n-1$, cardinality $2^n$ and distance $5$ are known to exist for every $m$ for which there exists an APN permutation of order $2^m$, that is, at least for all odd $m \geq 3$ and for…

Information Theory · Computer Science 2016-05-10 Denis S. Krotov , Patric R. J. Östergård , Olli Pottonen
‹ Prev 1 8 9 10 Next ›