Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0501245

Supertopes

Robert Erdahl·Konstantin Rybnikov
View original source ↗Read source document ↗Export metadata ↓

Abstract

A perfect (Delaunay) ellipsoid is an ellipsoid in n-dimensional Euclidean space that does not contain integral points in its interior, but is uniquely defined by integral points that lie on its surface. A perfect Delaunay polytope with respect to a positive quadratic form f() is a polytope with integral vertices that is circumscribed by a perfect Delaunay ellipsoid with an equation whose quadratic part is f(). This document has been corrected on January 15, 2005. Note that it represents the state of the area as of the end of 2002. For recent research on perfect Delaunay polytopes see my recent preprint, with Erdahl and Ordine, math.NT/0408122 on ArXiv.org .

Explore related subjects

math.NTmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert Erdahl, Konstantin Rybnikov. 2005-01-16. Supertopes. https://arxiv.org/abs/math/0501245

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↗