English
Related papers

Related papers: Large-volume open sets in normed spaces without in…

200 papers

A planar integral point set is a set of non-collinear points in plane such that for any pair of the points the Euclidean distance between the points is integral. We discuss the classification of planar integral point sets and provide…

Combinatorics · Mathematics 2021-03-30 Nikolai Avdeev , Ekaterina Momot , Aleksandr Zvolinskiy

We study homogeneity aspects of metric spaces in which all triples of distinct points admit pairwise different distances; such spaces are called isosceles-free. In particular, we characterize all homogeneous isosceles-free spaces up to…

Logic · Mathematics 2024-05-28 Christian Bargetz , Adam Bartoš , Wiesław Kubiś , Franz Luggin

The midpoint set M(S) of a set S of points is the set of all midpoints of pairs of points in S. We study the largest cardinality of a midpoint set M(S) in a finite-dimensional normed space, such that M(S) is contained in the unit sphere,…

Metric Geometry · Mathematics 2011-08-26 Konrad J. Swanepoel

We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…

Metric Geometry · Mathematics 2020-05-22 Florian Besau , Daniel Rosen , Christoph Thäle

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

Metric Geometry · Mathematics 2015-02-25 Imre Bárány , Ferenc Fodor , Viktor Vígh

The Lie point symmetries of a coupled system of two nonlinear differential-difference equations are investigated. It is shown that in special cases the symmetry group can be infinite dimensional, in other cases up to 10 dimensional. The…

solv-int · Physics 2009-10-31 D. Gomez-Ullate , S. Lafortune , P. Winternitz

Volumetric objectives for exploration and perception tasks seek to capture a sense of value (or reward) for hypothetical observations at one or more camera views for robots operating in unknown environments. For example, a volumetric…

Robotics · Computer Science 2021-03-29 Micah Corah , Nathan Michael

Many real objects are modeled as discrete sets of points, such as corners or other salient features. For our main applications in chemistry, points represent atomic centers in a molecule or a solid material. We study the problem of…

Computational Geometry · Computer Science 2026-01-01 Daniel Widdowson , Vitaliy Kurlin

We provide a systematic deterministic numerical scheme to approximate the volume (i.e. the Lebesgue measure) of a basic semi-algebraic set whose description follows a sparsity pattern. As in previous works (without sparsity), the underlying…

Optimization and Control · Mathematics 2020-07-28 Matteo Tacchi , Tillmann Weisser , Jean-Bernard Lasserre , Didier Henrion

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…

Combinatorics · Mathematics 2009-07-15 Alexander Barvinok , John Hartigan

We consider the problem of comparing the volumes of two star bodies in an even-dimensional euclidean space $\mathbb R^{2n} = \mathbb C^n$ by comparing their cross sectional areas along complex lines (special 2-dimensional real planes)…

Metric Geometry · Mathematics 2018-03-23 Eric L. Grinberg

We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…

Data Structures and Algorithms · Computer Science 2010-07-02 Neal E. Young

This is an expository paper on the largest size of equilateral sets in finite-dimensional normed spaces.

Metric Geometry · Mathematics 2007-05-23 Konrad J. Swanepoel

We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…

Functional Analysis · Mathematics 2021-03-26 Vladyslav Babenko , Vira Babenko , Oleg Kovalenko

We study the problem of contextual search, a multidimensional generalization of binary search that captures many problems in contextual decision-making. In contextual search, a learner is trying to learn the value of a hidden vector $v \in…

Data Structures and Algorithms · Computer Science 2018-05-18 Renato Paes Leme , Jon Schneider

We consider a multidimensional search problem that is motivated by questions in contextual decision-making, such as dynamic pricing and personalized medicine. Nature selects a state from a $d$-dimensional unit ball and then generates a…

Data Structures and Algorithms · Computer Science 2017-04-27 Ilan Lobel , Renato Paes Leme , Adrian Vladu

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$…

Classical Analysis and ODEs · Mathematics 2021-07-21 Guy C. David , McKenna Kaczanowski , Dallas Pinkerton

We study the double obstacle problem for p-harmonic functions on arbitrary bounded nonopen sets E in quite general metric spaces. The Dirichlet and single obstacle problems are included as special cases. We obtain Adams' criterion for the…

Analysis of PDEs · Mathematics 2015-03-10 Anders Björn , Jana Björn

Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$, distributed according to the so-called beta or beta-prime distribution, respectively. We establish threshold phenomena for the volume, intrinsic volumes, or more…

Metric Geometry · Mathematics 2018-06-15 Gilles Bonnet , Giorgos Chasapis , Julian Grote , Daniel Temesvari , Nicola Turchi

We present fully dynamic approximation algorithms for the Maximum Independent Set problem on several types of geometric objects: intervals on the real line, arbitrary axis-aligned squares in the plane and axis-aligned $d$-dimensional…

Data Structures and Algorithms · Computer Science 2020-07-20 Sujoy Bhore , Jean Cardinal , John Iacono , Grigorios Koumoutsos