English
Related papers

Related papers: A Comparison of Popular Point Configurations on $\…

200 papers

We suggest efficient and provable methods to compute an approximation for imbalanced point clustering, that is, fitting $k$-centers to a set of points in $\mathbb{R}^d$, for any $d,k\geq 1$. To this end, we utilize \emph{coresets}, which,…

Machine Learning · Computer Science 2025-03-13 David Denisov , Dan Feldman , Shlomi Dolev , Michael Segal

Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…

Numerical Analysis · Mathematics 2017-09-07 Robert S. Womersley

Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…

Optimization and Control · Mathematics 2015-09-15 Fabrizio Dabbene , Didier Henrion , Constantino Lagoa

A famous result of Hausdorff states that a sphere with countably many points removed can be partitioned into three pieces A,B,C such that A is congruent to B (i.e., there is an isometry of the sphere which sends A to B), B is congruent to…

Metric Geometry · Mathematics 2021-02-09 Randall Dougherty

We investigate the set of limit points of averages of rearrangements of a given sequence. We study how the properties of the sequence determine the structure of that set and what type of sets we can expect as the set of such accessible…

Classical Analysis and ODEs · Mathematics 2024-04-09 Attila Losonczi

Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…

Optimization and Control · Mathematics 2022-03-15 Dong-hui Li , Xueli Bai , Jiefeng Xu

Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…

Probability · Mathematics 2022-07-19 Ivan Kryven , Rik Versendaal

We investigate properties of minimal $N$-point Riesz $s$-energy on fractal sets of non-integer dimension, as well as asymptotic behavior of $N$-point configurations that minimize this energy. For $s$ bigger than the dimension of the set…

Classical Analysis and ODEs · Mathematics 2018-10-04 Alexander Reznikov , Oleksandr Vlasiuk

We construct analytic surface symplectomorphisms with unstable elliptic fixed points; this solves a problem of Birkhoff (1927). More precisely, we construct analytic symplectomorphisms of the sphere and of the disk which are transitive,…

Dynamical Systems · Mathematics 2024-04-17 Pierre Berger

For any positive integer $k>1$, we classify the antipodal point arrangements on the sphere $S^k$ up to an isomorphism, by associating a finite complete set of cycle invariants.

Combinatorics · Mathematics 2020-11-25 C. P. Anil Kumar

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

Metric Geometry · Mathematics 2020-07-16 Arseniy Akopyan , Herbert Edelsbrunner , Anton Nikitenko

Periodic point sets model all solid crystalline materials (crystals) whose atoms can be considered zero-sized points with or without atomic types. This paper addresses the fundamental problem of checking whether claimed crystals are novel,…

Computational Geometry · Computer Science 2025-10-03 Daniel E Widdowson , Vitaliy A Kurlin

We construct symmetric representations of distributions over two-dimensional plane with given mean values as convex combinations of distributions with supports containing not more than three points and with the same mean values.

Probability · Mathematics 2011-03-02 Victor Domansky

We review what is known, unknown and expected about the mathematical properties of Coulomb and Riesz gases. Those describe infinite configurations of points in $\mathbb{R}^d$ interacting with the Riesz potential $\pm |x|^{-s}$ (resp.…

Mathematical Physics · Physics 2022-06-15 Mathieu Lewin

We present a dynamic programming algorithm for selecting a representative subset of size $k$ from a given set with $n$ points such that the Riesz $s$-energy is near minimized. While NP-hard in general dimensions, the one-dimensional case…

Data Structures and Algorithms · Computer Science 2025-02-11 Michael Emmerich

This paper contains a suite of results concerning the problem of adding $m$ distinct new points to a configuration of $n$ distinct points on the Riemann sphere, such that the new points depend continuously on the old. Altogether, the…

Geometric Topology · Mathematics 2020-12-16 Lei Chen , Nick Salter

We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discovering new solutions to some well-known problems in…

Discrete Mathematics · Computer Science 2025-06-03 Bernardo Subercaseaux , Ethan Mackey , Long Qian , Marijn J. H. Heule

The present paper analyzes the discrepancy of distribution of rational points on general semisimple algebraic group varieties. The results include mean-square, almost sure, and uniform discrepancy estimates with explicit error bounds, which…

Number Theory · Mathematics 2021-04-15 Alexander Gorodnik , Amos Nevo

We characterize exponential systems on sets of finite measure that form a frame or a Riesz sequence at the critical density. Namely, they are precisely those systems for which the underlying point set admits a weak limit that yields a Riesz…

Classical Analysis and ODEs · Mathematics 2025-12-03 Ulrik Enstad , Jordy Timo van Velthoven

We propose a novel model for generating graphs similar to a given example graph. Unlike standard approaches that compute features of graphs in Euclidean space, our approach obtains features on a surface of a hypersphere. We then utilize a…

Social and Information Networks · Computer Science 2011-05-20 Dalton Lunga , Sergey Kirshner
‹ Prev 1 3 4 5 6 7 10 Next ›