Related papers: Spectral conditions for spherical two-distance set…
Let $G$ be a strictly pseudoconvex domain in $\mathbb{C}^2$ with $C^\infty$-smooth boundary $\partial G$. Let $S$ be a 2-dimensional sphere embedded into $\partial G$. Denote by $\mathcal{E}$ the set of all complex points on $S$. We study…
Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…
A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…
Various spectral notions have been employed to grasp the structure of point sets, in particular non-periodic ones. In this article, we present them in a unified setting and explain the relations between them. For the sake of readability, we…
A {\em faithful (unit) distance graph} in $\mathbb{R}^d$ is a graph whose set of vertices is a finite subset of the $d$-dimensional Euclidean space, where two vertices are adjacent if and only if the Euclidean distance between them is…
A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…
A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…
The topic of this paper is related to the well-known notion of unit distance graphs. Take a graph with its edges coloured red and blue such that for some $d$ it can be mapped into the plane with all vertices going to distinct points, the…
The set of primitive vectors on large spheres in the euclidean space of dimension d>2 equidistribute when projected on the unit sphere. We consider here a refinement of this problem concerning the direction of the vector together with the…
We consider point distributions in compact connected two-point homogeneous spaces (Riemannian symmetric spaces of rank one). All such spaces are known, they are the spheres in the Euclidean spaces, the real, complex and quaternionic…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…
A bounded set $\Omega \subset \mathbb{R}^d$ is called a spectral set if the space $L^2(\Omega)$ admits a complete orthogonal system of exponential functions. We prove that a cylindric set $\Omega$ is spectral if and only if its base is a…
We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.
A Hamiltonian cycle in a graph is a spanning subgraph that is homeomorphic to a circle. With this in mind, it is natural to define a Hamiltonian d-sphere in a d-dimensional simplicial complex as a spanning subcomplex that is homeomorphic to…
We develop a systematic framework for constructing spherical harmonics on the two-dimensional unit sphere as superpositions of Gaussian beams whose poles form well-separated point configurations. The distributional and analytic properties…
We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…
We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…
A set $W\subseteq V(G)$ is called a resolving set, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$…
The chromatic number of a subset of Euclidean space is the minimal number of colors sufficient for coloring all points of this subset in such a way that any two points at the distance 1 have different colors. We give new upper bounds for…