Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.08257

Density and holes of the visible points in certain cut-and-project sets

Hayim David Shamir
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the set of visible points from the origin in certain cut-and-project sets, specifically the density of the set. We generalize to all real quadratic number fields the formulas for the density found by G. Hammarhjelm, and the corresponding error bounds proved by I. Gringlaz, R. Kumar, B. Weiss. We also find the possible densities of the set of visible points in the cut-and-project set, with a constant generic lattice, and a changing window with constant volume. We also study bounds for the distance of large holes in the set of visible points of certain cut-and-project sets, generalizing theorems originally proved by P. Erdős for $\mathbb{Z}^2$.

Explore related subjects

math.NTmath.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hayim David Shamir. 2026-11-05. Density and holes of the visible points in certain cut-and-project sets. https://arxiv.org/abs/2611.08257

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

KEEP EXPLORING

Related papers

arXiv2026

Qin's Algorithm, Continued Fractions and 2-dimensional Lattices

In his ``Mathematical Treatise in Nine Sections''(1247), Jiushao Qin introduced ``the Dayan method of deriving unity'' for computing modular inverses, an essential component of his treatment of the Chinese remainder theorem. A distinctive feature of Qin's algorithm is its use of a state consisting of four nonnegative integers arranged in a matrix. In this paper, we investigate the mathematical structure of these states and their connections with continued fractions and two-dimensional lattices. By introducing a signed version of the state, we obtain a natural matrix representation that reveals the convergents of continued fractions and gives direct derivations of several classical results. We then show that the signed states form bases of a family of two-dimensional lattices arising from modular congruences. In particular, we prove that a shortest lattice vector can be obtained from the rows of a signed state or their sum or difference. We also study the monotonicity of the inner products of the state vectors and discuss a subsequent result that locates a shortest vector in one of two consecutive states. It is surprising that a shortest lattice vector is found in a highly structure sequence of states. These results demonstrate that the state structure of Qin's algorithm provides a unified framework for understanding modular inversion, continued fractions, and shortest vectors in two-dimensional lattices.

math.NT↗
arXiv2026

The symmetrized sum of finite $q$-multiple harmonic sums with one exceptional index

In this paper, we give explicit expressions for $q$-harmonic sums on $1-\cdots-1,A,1-\cdots-1$ indices. The case $A=1$ has been extensively studied, and a variety of identities, explicit evaluations, and structural properties are known. Likewise, numerous explicit evaluations are available for $q$-multiple zeta values and $q$-harmonic sums with uniform indices $A-\cdots-A$. Although several methods are available for treating non-uniform indices, explicit evaluations for the pattern $1-\cdots-1,A,1-\cdots-1$ remain comparatively scarce. The case $A=2$ was settled only recently. In this paper, we extend this framework to the general case $A\ge3$ as the total sum with the theory of the elementary symmetric functions, though we do not generally evaluate each summand at a prescribed position of $A$. We obtain explicit formulas in terms of binomial coefficients and degenerate Bernoulli numbers. Some expressions about $2-\cdots-2,A,2-\cdots-2$ are also shown.

math.NT↗