Related papers: Simultaneous visibility in the integer lattice

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

For any integers $k\geq 2$, $q\geq 1$ and any finite set $\mathcal{A}=\{{\boldsymbol{\alpha}}_1,\cdots,{\boldsymbol{\alpha}}_q\}$, where ${ \boldsymbol{\alpha}_t}=(\alpha_{t,1},\cdots,\alpha_{t,k})~(1\leq t\leq q)$ with…

In this paper, we present a complete characterization of mutual-visibility sets in trees. It is shown that a subset $S$ is a mutual-visibility set of a tree $T$ if and only if it coincides with the set of leaves of the Steiner subtree…

Let $\mathbb{Z}^2$ be the two-dimensional integer lattice. For an integer $k\geq 1$, a non-zero lattice point is $k$-free if the greatest common divisor of its coordinates is a $k$-free number. We consider the proportions of $k$-free and…

Let $\Gamma$ be an irreducible lattice in $\PSL_2(\RR)^d$ ($d\in\NN$) and $z$ a point in the $d$-fold direct product of the upper half plane. We study the discrete set of componentwise distances ${\bf D}(\Gm,z)\subset \RR^d$ defined in (1).…

We establish an asymptotic formula for the number of lattice points in the sets \[ \mathbf S_{h_1, h_2, h_3}(\lambda): =\{x\in\mathbb Z_+^3:\lfloor h_1(x_1)\rfloor+\lfloor h_2(x_2)\rfloor+\lfloor h_3(x_3)\rfloor=\lambda\} \quad…

We consider a square expanding with constant speed seen from an observer moving away with constant acceleration and study the distribution of angles between rays from the observer towards the lattice points in the square. We prove the…

In this paper we generalise the notion of visibility from a point in an integer lattice to the setting of graph theory. For a vertex $x$ of a connected graph $G$, we say that a set $S \subseteq V(G)$ is an \emph{$x$-position set} if for any…

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

We prove the density hypothesis for congruence subgroups of an irreducible uniform lattice in $\mathrm{PSL}_2(\mathbb{R})^d$, extending previous results on the spherical density hypothesis to bound multiplicities of non-tempered…

Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…

This paper presents the asymptotic analysis of random lattices in high dimensions to clarify the distance properties of the considered lattices. These properties not only indicate the asymptotic value for the distance between any pair of…

We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…

A point process on the topological space S is at most countable subset without a random accumulation point in S. In studies of the point processes, there is a problem of seeing the properties of rigidity and tolerance, and this problem is…

It was recently remarked by Lutz [{\it Phys. Rev. A} {\bf 67} (2003), 051402(R)] that the equation for the marginal Wigner distribution in an optical lattice admits a scale-free distribution corresponding to Tsallis statistics. Here we show…

We consider the possible visits to visible points of a random walker moving up and right in the integer lattice (with probability $\alpha$ and $1-\alpha$, respectively) and starting from the origin. We show that, almost surely, the…

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…

A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…

We call a system super-linearizable if it admits finite-dimensional embedding as a linear system -- known as a finite-dimensional Koopman embedding; said otherwise, if its dynamics can be linearized by adding a finite set of observables. We…