English
Related papers

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

200 papers

For a point set of $n$ elements in the $d$-dimensional unit cube and a class of test sets we are interested in the largest volume of a test set which does not contain any point. For all natural numbers $n$, $d$ and under the assumption of a…

Computational Geometry · Computer Science 2017-10-03 Daniel Rudolf

Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of…

Computational Geometry · Computer Science 2018-03-05 Karl Bringmann , Sergio Cabello , Michael T. M. Emmerich

Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…

Computational Geometry · Computer Science 2023-11-01 Sariel Har-Peled , Elfarouk Harb

We give the first nontrivial upper and lower bounds on the maximum volume of an empty axis-parallel box inside an axis-parallel unit hypercube in $\RR^d$ containing $n$ points. For a fixed $d$, we show that the maximum volume is of the…

Computational Geometry · Computer Science 2009-11-23 Adrian Dumitrescu , Minghui Jiang

We study the isoperimetric problem in product spaces equipped with the uniform distance. Our main result is a characterization of isoperimetric inequalities which, when satisfied on a space, are still valid for the product spaces, up a to a…

Functional Analysis · Mathematics 2014-11-14 Franck Barthe , Benoit Huou

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Number Theory · Mathematics 2025-08-26 Rachel Greenfeld , Marina Iliopoulou , Sarah Peluse

The problem of bounding of the distance between the two bodies of volume $\varepsilon$ located inside the $n$-dimensional body $B$ of unit volume where $n \to \infty$ is considered. In some cases such distances are bounded by function…

Metric Geometry · Mathematics 2014-12-24 Fyodor Ivlev

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…

Metric Geometry · Mathematics 2017-12-22 Balázs Csikós

This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…

Combinatorics · Mathematics 2023-01-24 Péter Madarasi

Intrinsic volumes are fundamental geometric invariants generalizing volume, surface area, and mean width for convex bodies. We establish a unified Laplace-Grassmannian representation for intrinsic and dual volumes of convex polynomial…

Metric Geometry · Mathematics 2025-11-04 Trí Minh Lê , Khai-Hoan Nguyen-Dang

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz , Alfred Wassermann

In this note, we show that the normalized local volume of a non-closed point can be expressed in terms of the normalized local volumes of closed points.

Algebraic Geometry · Mathematics 2026-05-15 Donghyeon Kim

Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…

Probability · Mathematics 2011-12-19 Mark Huber , Sarah Schott

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Logic · Mathematics 2015-10-06 Robert Lubarsky , Fred Richman

This paper considers the problem of finding maximum volume (axis-aligned) inscribed boxes in a compact convex set, defined by a finite number of convex inequalities, and presents optimization and geometric approaches for solving them.…

Computational Geometry · Computer Science 2022-08-10 Mehdi Behroozi

We show that the maximum number of unit distances or of diameters in a set of n points in d-dimensional Euclidean space is attained only by specific types of Lenz constructions, for all d >= 4 and n sufficiently large, depending on d. As a…

Metric Geometry · Mathematics 2009-03-12 Konrad J Swanepoel

Every choice of an orthonormal frame in the d-dimensional Hilbert space of a system corresponds to one set of all mutually commuting density matrices or, equivalently, a classical statistical state space of the system; the quantum state…

Quantum Physics · Physics 2015-08-20 Rajeev Singh , Ravi Kunjwal , R. Simon

Given an ample line bundle $L$ on a geometrically reduced projective scheme defined over an arbitrary non-Archimedean field, we establish a differentiability property for the relative volume of two continuous metrics on the Berkovich…

Algebraic Geometry · Mathematics 2020-04-09 Sébastien Boucksom , Walter Gubler , Florent Martin

Let $D$ be a non-empty effective divisor on $\mathbb{P}^1$. We show that when ordered by height, any set of $(D,S)$-integral points on $\mathbb{P}^1$ of bounded degree has relative density zero. We then apply this to arithmetic dynamics:…

Number Theory · Mathematics 2016-07-29 Joseph Gunther , Wade Hindes

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

Optimization and Control · Mathematics 2023-07-26 Marius Costandin