Related papers: A Comparison of Popular Point Configurations on $\…
There is a growing interest in cylindrical structures of hard and soft particles. A promising new method to assemble such structures has recently been introduced by Lee et al. [T. Lee, K. Gizynski, and B. Grzybowski, Adv. Mater. 29, 1704274…
This paper presents a fast an robust mesh generation procedure that is able to generate meshes of the earth system (ocean and continent) in matters of seconds. Our algorithm takes as input a standard shape-file i.e. geospatial vector data…
The study of random landscapes has long relied on counting stationary points: metastable states and the barriers between them. However, this method is useless for describing flat regions, common in constraint satisfaction problems. We…
Uniformly distributed point sets on the unit sphere with and without symmetry constraints have been found useful in many scientific and engineering applications. Here, a novel variant of the Thomson problem is proposed and formulated as an…
Many remarkably robust, rapid and spontaneous self-assembly phenomena in nature can be modeled geometrically starting from a collection of rigid bunches of spheres. This paper highlights the role of symmetry in sphere-based assembly…
We study expected Riesz s-energies and linear statistics of some determinantal processes on the sphere. In particular, we compute the expected Riesz and logarithmic energies of the determinantal processes given by the reproducing kernel of…
The problem of uniformly placing N points onto a sphere finds applications in many areas. For example, points on the sphere correspond to unit quaternions as well as to the group of rotations SO(3) and the online version of generating…
Combining the ideas of Riesz $s$-energy and $\log$-energy, we introduce the so-called $s,\log^t$-energy. In this paper, we investigate the asymptotic behaviors for $N,t$ fixed and $s$ varying of minimal $N$-point $s,\log^t$-energy constants…
A celebrated result of Legendre and Gauss determines which integers can be represented as a sum of three squares, and for those it is typically the case that there are many ways of doing so. These different representations give collections…
This article is divided in two parts. In the first part we review some recent results concerning the expected number of real roots of random system of polynomial equations. In the second part we deal with a different problem, namely, the…
We study "distance spheres": the set of points lying at constant distance from a fixed arbitrary subset $K$ of $[0,1]^d$. We show that, away from the regions where $K$ is "too dense" and a set of small volume, we can decompose $[0,1]^d$…
We present symbolic and numerical methods for computing Poisson brackets on the spaces of measures with positive densities of the plane, the 2-torus, and the 2-sphere. We apply our methods to compute symplectic areas of finite regions for…
This is an expanded version of [arXiv:1107.4836v1 [math.DS]]. Using techniques from [Chapter XI, The Selberg Trace Formula, in Eigenvalues in Riemannian Geometry, by Isaac Chavel], in which a differential-geometrically intrinsic treatment…
The statistical convergence is defined for sequences with the asymptotic density on the natural numbers, in general. In this paper, we introduce the statistical convergence for nets in Riesz spaces by using the finite additive measures on…
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 propose a new framework for the sampling, compression, and analysis of distributions of point sets and other geometric objects embedded in Euclidean spaces. Our approach involves constructing a tensor called the RaySense sketch, which…
Given a natural number N, one may ask what configuration of N points on the two-sphere minimizes the discrete generalized Coulomb energy. If one applies a gradient-based numerical optimization to this problem, one encounters many…
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
We consider a simple model of a growing cluster of points in $\Re^d,d\geq 2$. Beginning with a point $X_1$ located at the origin, we generate a random sequence of points $X_1,X_2,\ldots,X_i,\ldots,$. To generate $X_{i},i\geq 2$ we choose a…
We analyse several constructions of random point sets on the sphere $\mathbb{S}^{3}\subset\mathbb{R}^4$ evaluating and comparing them through their discrete logarithmic energy: \begin{equation*} E_0(\omega_N) = \sum_{\substack{i, j=1\\ i…