English
Related papers

Related papers: On geodesic disks enclosing many points

200 papers

We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and q with the smallest diameter. We prove that for any R and B…

Computational Geometry · Computer Science 2019-02-25 Clemens Huemer , Pablo Pérez-Lantero , Carlos Seara , Rodrigo I. Silveira

Given a set $P$ of $n$ points in the plane, the unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ have an edge if their Euclidean distance is at most $1$. We consider the problem of computing a maximum…

Computational Geometry · Computer Science 2025-06-30 Anastasiia Tkachenko , Haitao Wang

We use the $4-\epsilon$ expansion to search for fixed points corresponding to $2+1$ dimensional $\mathcal{N}$=1 Wess-Zumino models of $N_{\Phi}$ scalar superfields interacting through a cubic superpotential. In the $N_{\Phi}=3$ case, we…

High Energy Physics - Theory · Physics 2021-12-22 Pedro Liendo , Junchen Rong

In this article we investigate the $N$-point min-max and the max-min polarization problems on the sphere for a large class of potentials in $\mathbb{R}^n$. We derive universal lower and upper bounds on the polarization of spherical designs…

Combinatorics · Mathematics 2022-07-20 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova

For a polygon $P$ with holes in the plane, we denote by $\varrho(P)$ the ratio between the geodesic and the Euclidean diameters of $P$. It is shown that over all convex polygons with $h$~convex holes, the supremum of $\varrho(P)$ is between…

Computational Geometry · Computer Science 2026-02-10 Adrian Dumitrescu , Csaba D. Tóth

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…

Combinatorics · Mathematics 2020-11-30 Pablo Soberón , Yaqian Tang

Our main point of focus is the set of closed geodesics on hyperbolic surfaces. For any fixed integer $k$, we are interested in the set of all closed geodesics with at least $k$ (but possibly more) self-intersections. Among these, we…

Geometric Topology · Mathematics 2016-09-02 Viveka Erlandsson , Hugo Parlier

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

Combinatorics · Mathematics 2025-07-24 Jesús A. De Loera , Gyivan Lopez-Campos , Antonio J. Torres

We consider the existence of simple closed geodesics or "geodesic knots" in finite volume orientable hyperbolic 3-manifolds. Previous results show that at least one geodesic knot always exists [Bull. London Math. Soc. 31(1) (1999) 81-86],…

Geometric Topology · Mathematics 2013-01-02 Sally M Kuhlmann

Given N points in the plane $P_1 P_2...P_N$ and a location $\Omega$, the union of discs with diameters $[\Omega P_i], i = 1, 2,...N$ covers the convex hull of the points. The location $\Omega_s$ minimizing the area covered by the union of…

Computational Geometry · Computer Science 2018-06-15 Yael Yankelevsky , Alfred M. Bruckstein

We show that every (possibly unbounded) convex polygon $P$ in $R^2$ with $m$ edges can be represented by inequalities $p_1 \ge 0,...,p_n \ge 0,$ where the $p_i$'s are products of at most $k$ affine functions each vanishing on an edge of $P$…

Metric Geometry · Mathematics 2010-02-05 Gennadiy Averkov , Christian Bey

For a positive integer $n$, let $g(n)$ denote the infimum of all real numbers $L$ such that there exists a multiplicative Sidon set $A\subseteq\{1,2,\dots,n\}$ that intersects every interval $[x,x+L]\subseteq[1,n]$. S\'ark\"ozy asked for…

Number Theory · Mathematics 2026-05-05 Wouter van Doorn , Pietro Monticone , Quanyu Tang

The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of…

Metric Geometry · Mathematics 2025-09-12 Florian Frick , Pranav Rajbhandari

There is a long standing conjecture in Hamiltonian analysis which claims that there exist at least $n$ geometrically distinct closed characteristics on every compact convex hypersurface in $\R^{2n}$ with $n\ge 2$. Besides many partial…

Symplectic Geometry · Mathematics 2007-05-23 Wei Wang , Xijun Hu , Yiming Long

In this paper we prove that for every bumpy Finsler metric $F$ on every rationally homological $n$-dimensional sphere $S^n$ with $n\ge 2$, there exist always at least two distinct prime closed geodesics.

Differential Geometry · Mathematics 2007-05-31 Huagui Duan , Yiming Long

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

Optimization and Control · Mathematics 2021-10-20 Marius Costandin

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

Optimization and Control · Mathematics 2022-12-27 Christian Bingane

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

Metric Geometry · Mathematics 2019-10-28 Jin-ichi Itoh , Costin Vîlcu , Liping Yuan , Tudor Zamfirescu

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

Algebraic Geometry · Mathematics 2015-09-22 Saugata Basu , Martin Sombra

We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…

Commutative Algebra · Mathematics 2010-03-30 Apoloniusz Tyszka
‹ Prev 1 4 5 6 7 8 10 Next ›