Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1905.07307

Low dimensional strongly perfect lattices IV: The dual strongly perfect lattices of dimension 16

Sihuang Hu·Gabriele Nebe
View original source ↗Read source document ↗Export metadata ↓

Abstract

We classify the dual strongly perfect lattices in dimension 16. There are four pairs of such lattices, the famous Barnes-Wall lattice $Λ_{16}$, the extremal 5-modular lattice $N_{16}$, the odd Barnes-Wall lattice $O_{16}$ and its dual, and one pair of new lattices $Γ_{16}$ and its dual. The latter pair belongs to a new infinite series of dual strongly perfect lattices, the sandwiched Barnes-Wall lattices, described by the authors in a previous paper. An updated table of all known strongly perfect lattices up to dimension 26 is available in the catalogue of lattices.

Explore related subjects

math.NTmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sihuang Hu, Gabriele Nebe. 2019-05-17. Low dimensional strongly perfect lattices IV: The dual strongly perfect lattices of dimension 16. https://doi.org/10.1016/j.jnt.2019.08.001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗