English
Related papers

Related papers: Higher Dimensional Spiral Delone Sets

200 papers

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

Combinatorics · Mathematics 2020-07-28 Hiroshi Nozaki , Masashi Shinohara

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson

Singletons are those unitary irreducible modules of the Poincare or (anti) de Sitter group that can be lifted to unitary modules of the conformal group. Higher-spin algebras are the corresponding realizations of the universal enveloping…

Mathematical Physics · Physics 2023-06-13 Xavier Bekaert

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

Computational Geometry · Computer Science 2018-04-05 Vincent Despré , Olivier Devillers , Hugo Parlier , Jean-Marc Schlenker

For a locally finite set in $\mathbb{R}^2$, the order-$k$ Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of…

Combinatorics · Mathematics 2024-08-26 Herbert Edelsbrunner , Alexey Garber , Mohadese Ghafari , Teresa Heiss , Morteza Saghafian

Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…

Metric Geometry · Mathematics 2018-05-22 Ilya Dumer

This paper proves a conjecture by Solomon about Steiner shallow-light trees (SLT) in Euclidean $d$-space: It is shown that for any finite point set $\mathbb{R}^d$, any root, and any $\epsilon>0$, there is a Euclidean Steiner…

Computational Geometry · Computer Science 2026-05-27 Devin Frost , Kimberly Kokado , Csaba D. Tóth

A planar point set of $n$ points is called {\em $\gamma$-dense} if the ratio of the largest and smallest distances among the points is at most $\gamma\sqrt{n}$. We construct a dense set of $n$ points in the plane with…

Combinatorics · Mathematics 2019-04-01 István Kovács , Géza Tóth

In these expository notes we focus on selected topics around the themes: Delone sets as models for quasicrystals, inflation symmetries and expansion constants, substitution Delone sets and tilings, and associated dynamical systems.

Dynamical Systems · Mathematics 2018-02-08 Boris Solomyak

This paper addresses the problem of describing aperiodic discrete structures that have a self-similar or self-affine structure. Substitution Delone set families are families of Delone sets (X_1, ..., X_n) in R^d that satisfy an inflation…

Metric Geometry · Mathematics 2007-05-23 Jeffrey C. Lagarias , Yang Wang

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…

Metric Geometry · Mathematics 2016-12-01 Alexey Glazyrin , Wei-Hsuan Yu

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

Combinatorics · Mathematics 2025-09-03 Wei-Chun Chen , Wei-Hsuan Yu

A sunflower is a collection of sets $\{U_1,\ldots, U_n\}$ such that the pairwise intersection $U_i\cap U_j$ is the same for all choices of distinct $i$ and $j$. We study sunflowers of convex open sets in $\mathbb R^d$, and provide a…

Combinatorics · Mathematics 2022-07-19 R. Amzi Jeffs

We construct examples of Delone sets of the plane (that is, discrete subsets that are uniformly separated and coarsely dense) that are repetitive (each patch of the set appears in every large-enough ball) though non-rectifiable (i.e. non…

Metric Geometry · Mathematics 2016-09-21 María Isabel Cortez , Andrés Navas

Non-periodic systems have become more important in recent years, both theoretically and practically. Their description via Delone sets requires the extension of many standard concepts of crystallography. Here, we summarise some useful…

Metric Geometry · Mathematics 2012-10-15 Michael Baake , Uwe Grimm

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

Computational Geometry · Computer Science 2020-03-10 Man-Kwun Chiu , Stefan Felsner , Manfred Scheucher , Patrick Schnider , Raphael Steiner , Pavel Valtr

The paper establishes an equivalence between pure point diffraction and certain types of model sets, called inter model sets, in the context of substitution point sets and substitution tilings. The key ingredients are a new type of…

Metric Geometry · Mathematics 2009-10-23 Jeong-Yup Lee

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

Combinatorics · Mathematics 2016-12-16 Ariel Bruner , Micha Sharir

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…

Combinatorics · Mathematics 2025-12-16 N. N. Avdeev , E. A. Lushina