Search arXivSearch

arXiv · 2603.16332

Simultaneous visibility in the algebraic lattice

Abstract

Let $K$ be a number field with ring of integers $\mathcal{O}$. Two lattice points ${\bf x, y}\in \mathcal{O}^m$ with $m\geq 2$ are said to be visible from one another if $\gcd((x_i-y_i),\ldots, (x_m-y_m))=\mathcal{O}$, where $(x_i-y_i)$ is the ideal generated by $x_i-y_i$. Let $S\subset \mathcal{O}^m$ be a finite set. For $K=\mathbb{Q}$, the asymptotic density of the set of lattice points, visible from all points of $S$, was studied by several authors. For general number fields $K$, however, the asymptotic density has been studied only in the special case $S=\{(0,\ldots,0)\}$. Our main result establishes the corresponding density formula for a number field $K$ whose ring of integers $\mathcal{O}$ is a principal ideal domain, for all finite sets $S$ with $|S|\geq 2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rishi Kumar, Wataru Takeda. 2026-03-17. Simultaneous visibility in the algebraic lattice. https://arxiv.org/abs/2603.16332

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

KEEP EXPLORING

Related papers

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

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