English
Related papers

Related papers: Locating diametral points

200 papers

It is conjectured since long that for any convex body $K \subset \mathbb{R}^n$ there exists a point in the interior of $K$ which belongs to at least $2n$ normals from different points on the boundary of $K$. The conjecture is known to be…

Geometric Topology · Mathematics 2024-02-14 Gaiane Panina , Dirk Siersma

Given an endomorphism u of a finite-dimensional vector space over an arbitrary field K, we give necessary and sufficient conditions for the existence of a regular quadratic form (resp. a symplectic form) for which u is orthogonal (resp.…

Rings and Algebras · Mathematics 2012-01-17 Clément de Seguins Pazzis

We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.

Number Theory · Mathematics 2018-10-03 Jean-Marc Deshouillers , Adrián Ubis

The main goal of this paper is to present a series of inequalities connecting the surface area measure of a convex body and surface area measure of its projections and sections. We present a solution of a question from S. Campi, P.…

Metric Geometry · Mathematics 2017-08-29 Alexander Koldobsky , Christos Saroglou , Artem Zvavitch

Let $\mathcal{S}$ be a set of $n$ points in real four-dimensional space, no four coplanar and spanning the whole space. We prove that if the number of solids incident with exactly four points of $\mathcal{S}$ is less than $Kn^3$ for some…

Metric Geometry · Mathematics 2020-10-21 Simeon Ball , Enrique Jimenez

We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…

Analysis of PDEs · Mathematics 2014-12-09 Gershon Kresin , Vladimir Maz'ya

Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…

Combinatorics · Mathematics 2017-06-08 Andreas F. Holmsen , Jan Kynčl , Claudiu Valculescu

Given a $k$-point configuration $x\in (\mathbb{R}^d)^k$, we consider the $\binom{k}{d}$-vector of volumes determined by choosing any $d$ points of $x$. We prove that a compact set $E\subset \R^d$ determines a positive measure of such volume…

Classical Analysis and ODEs · Mathematics 2021-02-05 Belmiro Galo , Alex McDonald

Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…

Number Theory · Mathematics 2007-05-23 D. R. Heath-Brown , J. -L. Colliot-Thélène

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

Combinatorics · Mathematics 2018-10-15 Jozsef Balogh , Jozsef Solymosi

Let $k$ be any field. Let $X \subset \mathbb{P}_k^N$ be a degree $d \geq 2$ hypersurface. Under some conditions, we prove that if $X(K) \neq \emptyset$ for some extension $K/k$ with $n:=[K:k] \geq 2$ and $\gcd(n,d)=1$, then $X(L) \neq…

Number Theory · Mathematics 2023-07-24 Francesca Balestrieri

In this note we introduce a pseudometric on convex planar curves based on distances between normal lines and show its basic properties. Then we use this pseudometric to give a short proof of the theorem by Pinchasi that the sum of…

Metric Geometry · Mathematics 2023-09-01 Arseniy Akopyan , Alexey Glazyrin

The illumination number $I(K)$ of a convex body $K$ in Euclidean space $\mathbb{E}^d$ is the smallest number of directions that completely illuminate the boundary of a convex body. A cap body $K_c$ of a ball is the convex hull of a…

Metric Geometry · Mathematics 2026-05-01 Ilya Ivanov , Cameron Strachan

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

Combinatorics · Mathematics 2023-10-24 Herbert Edelsbrunner , János Pach

We consider systems of linear partial differential equations, which contain only second and first derivatives in the $x$ variables and which are uniformly parabolic in the sense of Petrovski\v{\i} in the layer ${\mathbb R}^n\times [0,T]$.…

Analysis of PDEs · Mathematics 2014-03-10 Gershon Kresin , Vladimir Maz'ya

According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…

Metric Geometry · Mathematics 2015-04-20 Imre Bárány , Edgardo Roldán-Pensado , Géza Tóth

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

Optimization and Control · Mathematics 2017-10-27 Anatoly Dymarsky

In this paper, we provide evidence to support a positive answer to a question of Hassett and Tschinkel. In particular, if an algebraic variety V has a dense set of rational points, they ask whether or not the set of D-integral points is…

Algebraic Geometry · Mathematics 2018-06-11 David McKinnon , Yi Zhu

We characterize the extreme points of the set of incentive-compatible mechanisms for screening problems with linear utility. Our framework subsumes problems with and without transfers, such as monopoly pricing, principal-optimal bilateral…

Theoretical Economics · Economics 2025-10-24 Patrick Lahr , Axel Niemeyer

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

Computational Geometry · Computer Science 2023-03-16 Sunil Arya , Guilherme D. da Fonseca , David M. Mount