Zobrazeno 1 - 10
of 9 101
pro vyhledávání: '"Distance problem"'
We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{15,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest unit-distance gra
Externí odkaz:
http://arxiv.org/abs/2412.11914
Genome rearrangement has been an active area of research in computational comparative genomics for the last three decades. While initially mostly an interesting algorithmic endeavor, now the practical application by applying rearrangement distance me
Externí odkaz:
http://arxiv.org/abs/2411.01691
Autor:
Onur, Cansu Betin
In this study, we introduce a novel zero-knowledge identification scheme based on the hardness of the subgroup distance problem in the Hamming metric. The proposed protocol, named Subgroup Distance Zero Knowledge Proof (SDZKP), employs a cryptographi
Externí odkaz:
http://arxiv.org/abs/2408.00395
Autor:
Pham, Thang, Xue, Boqing
In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly, compared to the
Externí odkaz:
http://arxiv.org/abs/2405.07325
Autor:
Lee, Tsung-Ju
In this article, we study the finite distance problem with respect to the period-map metric on the moduli of non-K\"{a}hler Calabi--Yau $\partial\bar{\partial}$-threefolds via Hodge theory. We extended C.-L. Wang's finite distance criterion for one-p
Externí odkaz:
http://arxiv.org/abs/2404.19125
Quantum error-correcting codes (QECCs) is at the heart of fault-tolerant quantum computing. As the size of quantum platforms is expected to grow, one of the open questions is to design new optimal codes of ever-increasing size. A related challenge is
Externí odkaz:
http://arxiv.org/abs/2404.17703
What distributions arise as the distribution of the distance between two typical points in some measured metric space? This seems to be a surprisingly subtle problem. We conjecture that every distribution with a density function whose support contain
Externí odkaz:
http://arxiv.org/abs/2403.10926
Autor:
BENNETT, HUCK1 huck.bennett@colorado.edu, CHERAGHCHI, MAHDI2 mahdich@umich.edu, GURUSWAMI, VENKATESAN3 venkatg@berkeley.edu, RIBEIRO, JOAO4 ribeiro@fct.unl.pt
Publikováno v:
SIAM Journal on Computing. 2024, Vol. 53 Issue 5, p1439-1475. 37p.
We study the online variant of the language distance problem for two classical formal languages, the language of palindromes and the language of squares, and for the two most fundamental distances, the Hamming distance and the edit (Levenshtein) dist
Externí odkaz:
http://arxiv.org/abs/2309.14788