English
Related papers

Related papers: Higher Dimensional Spiral Delone Sets

200 papers

Two Delone sets are bounded distance equivalent to each other if there is a bijection between them such that the distance of corresponding points is uniformly bounded. Bounded distance equivalence is an equivalence relation. We show that…

Dynamical Systems · Mathematics 2021-11-09 Dirk Frettlöh , Alexey Garber , Lorenzo Sadun

Oscillons are spatially stationary, quasi-periodic solutions of nonlinear field theories seen in settings ranging from granular systems, low temperature condensates and early universe cosmology. We describe a new class of oscillon in which…

High Energy Physics - Theory · Physics 2017-01-23 Chang Liu , Richard Easther

There is a growing body of results in the theory of discrete point sets and tiling systems giving conditions under which such systems are pure point diffractive. Here we look at the opposite direction: what can we infer about a discrete…

Metric Geometry · Mathematics 2009-10-26 Jeong-Yup Lee , Robert V. Moody , Boris Solomyak

A Euclidean noncrossing Steiner $(1+\epsilon)$-spanner for a point set $P\subset\mathbb{R}^2$ is a planar straight-line graph that, for any two points $a, b \in P$, contains a path whose length is at most $1+\epsilon$ times the Euclidean…

Computational Geometry · Computer Science 2026-02-23 Sujoy Bhore , Sándor Kisfaludi-Bak , Lazar Milenković , Csaba D. Tóth , Karol Węgrzycki , Sampson Wong

We describe a set of $\Delta -1$ slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree $\Delta \geq 4$; this establishes a new upper bound of $\Delta-1$ on the 1-bend planar slope number. By universal we…

Computational Geometry · Computer Science 2017-03-14 Patrizio Angelini , Michael A. Bekos , Giuseppe Liotta , Fabrizio Montecchiani

This paper considers the problem of characterizing the simplest discrete point sets that are aperiodic, using invariants based on topological dynamics. A Delone set whose patch-counting function N(T), for radius T, is finite for all T is…

Dynamical Systems · Mathematics 2007-05-23 Jeffery C. Lagarias , Peter A. B. Pleasants

A Delaunay decomposition is a cell decomposition in R^d for which each cell is inscribed in a Euclidean ball which is empty of all other vertices. This article introduces a generalization of the Delaunay decomposition in which the Euclidean…

Computational Geometry · Computer Science 2019-08-27 Jeffrey Danciger , Sara Maloni , Jean-Marc Schlenker

An ordinary circle of a set $P$ of $n$ points in the plane is defined as a circle that contains exactly three points of $P$. We show that if $P$ is not contained in a line or a circle, then $P$ spans at least $\frac{1}{4}n^2 - O(n)$…

A matrix convex set is a set of the form $\mathcal{S} = \cup_{n\geq 1}\mathcal{S}_n$ (where each $\mathcal{S}_n$ is a set of $d$-tuples of $n \times n$ matrices) that is invariant under UCP maps from $M_n$ to $M_k$ and under formation of…

Operator Algebras · Mathematics 2025-04-15 Kenneth R. Davidson , Adam Dor-On , Orr Shalit , Baruch Solel

An ordinary hypersphere of a set of points in real $d$-space, where no $d+1$ points lie on a $(d-2)$-sphere or a $(d-2)$-flat, is a hypersphere (including the degenerate case of a hyperplane) that contains exactly $d+1$ points of the set.…

Combinatorics · Mathematics 2021-02-11 Aaron Lin , Konrad Swanepoel

This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…

Functional Analysis · Mathematics 2019-10-17 Peter G. Casazza , Tin T. Tran , Janet C. Tremain

A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\mathcal{O}(k)$-robust if…

Computational Geometry · Computer Science 2018-03-26 Kevin Buchin , Tim Hulshof , Dániel Oláh

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

We construct sphaleron solutions with discrete symmetries in Yang-Mills-Higgs theory coupled to a dilaton. Related to rational maps of degree N, these platonic sphalerons can be assigned a Chern-Simons number Q=N/2. We present sphaleron…

High Energy Physics - Theory · Physics 2010-11-19 Burkhard Kleihaus , Jutta Kunz , Kari Myklevoll

The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…

Metric Geometry · Mathematics 2008-01-08 Adrian Dumitrescu , Annette Ebbers-Baumann , Ansgar Grüne , Rolf Klein , Günter Rote

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

It is well known that almost every dilation of a sequence of real numbers, that diverges to $\infty$, is dense modulo~1. This paper studies the exceptional set of points -- those for which the dilation is not dense. Specifically, we…

Number Theory · Mathematics 2024-09-04 Daniel Berend , Michael D. Boshernitzan , Grigori Kolesnik , Rishi Kumar

We prove that sets with positive upper Banach density in sufficiently large dimensions contain congruent copies of all sufficiently large dilates of three specific higher-dimensional patterns. These patterns are: $2^n$ vertices of a fixed…

Combinatorics · Mathematics 2021-10-18 Polona Durcik , Vjekoslav Kovač

A finite set $P$ of points in the plane is $n$-universal with respect to a class $\mathcal{C}$ of planar graphs if every $n$-vertex graph in $\mathcal{C}$ admits a crossing-free straight-line drawing with vertices at points of $P$. For the…

Computational Geometry · Computer Science 2023-03-02 Stefan Felsner , Hendrik Schrezenmaier , Felix Schröder , Raphael Steiner

We construct families of one-dimensional (1D) stable solitons in two-component $\mathcal{PT}$-symmetric systems with spin-orbit coupling (SOC) and quintic nonlinearity, which plays the critical role in 1D setups. The system models light…

Optics · Physics 2022-03-02 Gennadiy Burlak , Zhaopin Chen , Boris A. Malomed