English
Related papers

Related papers: Fixing a hole

200 papers

Given a finite point set $P$ in the plane, a subset $S \subseteq P$ is called an island in $P$ if $conv(S) \cap P = S$. We say that $S\subset P$ is a visible island if the points in $S$ are pairwise visible and $S$ is an island in $P$. The…

Combinatorics · Mathematics 2022-02-15 Sophie Leuchtner , Carlos M. Nicolas , Andrew Suk

Let $d\geq 2$ be a positive integer, $K$ an algebraically closed field of characteristic not dividing $d$, $n\geq d+1$ a positive integer that is prime to $d$, $f(x)\in K[x]$ a degree $n$ monic polynomial without multiple roots, $C_{f,d}:…

Algebraic Geometry · Mathematics 2025-05-14 Boris M. Bekker , Yuri G. Zarhin

Let k be a number field, let E/k be an elliptic curve, and let S be a finite set of places of k contianing the archimedean places. Let F be an algebraic closure of k. We prove that if a point P in E(F) is nontorsion, then there are only…

Number Theory · Mathematics 2016-09-07 Matthew Baker , Su-Ion Ih , Robert Rumely

Small black holes in heterotic string theory have vanishing horizon area at the supergravity level, but the horizon is stretched to the finite radius $AdS_2 \times S^{D-2}$ geometry once higher curvature corrections are turned on. This has…

High Energy Physics - Theory · Physics 2013-05-29 Chiang-Mei Chen , Dmitri V. Gal'tsov , Nobuyoshi Ohta , Dmitry G. Orlov

We show that maximal $S$-free convex sets are polyhedra when $S$ is the set of integral points in some rational polyhedron of $\mathbb{R}^n$. This result extends a theorem of Lov\'asz characterizing maximal lattice-free convex sets. Our…

Optimization and Control · Mathematics 2017-01-24 Amitabh Basu , Michele Conforti , Gerard Cornuejols , Giacomo Zambelli

Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least…

Combinatorics · Mathematics 2026-03-20 Omar Astudillo-Marbán , Oriol Solé-Pi

We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…

Functional Analysis · Mathematics 2011-11-22 Taras Banakh , Ivan Hetman

We prove (and improve) the Muir-Suffridge conjecture for holomorphic convex maps. Namely, let $F:\mathbb B^n\to \mathbb C^n$ be a univalent map from the unit ball whose image $D$ is convex. Let $\mathcal S\subset \partial \mathbb B^n$ be…

Complex Variables · Mathematics 2017-08-15 Filippo Bracci , Hervé Gaussier

Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…

Combinatorics · Mathematics 2023-06-22 Akshat Mudgal

We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but…

Combinatorics · Mathematics 2016-10-17 Adrian Dumitrescu , Minghui Jiang

Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…

Statistics Theory · Mathematics 2008-04-14 Akimichi Takemura , Ruriko Yoshida

The Erdos-Szekeres theorem states that for any natural k there is a natural number g(k) such that any set of at least g(k) points on a plane in general position contains a set of k points that are the extreme points of a convex polytope. We…

Combinatorics · Mathematics 2007-05-23 Iosif Pinelis

In this note, we give a new proof of a result of Matthew Dyer stating that in an arbitrary Coxeter group $W$, every pair $t,t'$ of distinct reflections lie in a unique maximal dihedral reflection subgroup of $W$. Our proof only relies on…

Group Theory · Mathematics 2023-08-01 Thomas Gobet

Let $ES_{d}(n)$ be the smallest integer such that any set of $ES_{d}(n)$ points in $\mathbb{R}^{d}$ in general position contains $n$ points in convex position. In 1960, Erd\H{o}s and Szekeres showed that $ES_{2}(n) \geq 2^{n-2} + 1$ holds,…

Combinatorics · Mathematics 2022-08-10 Cosmin Pohoata , Dmitrii Zakharov

We show that if A is a finite set of integers then it has a subset S of size \log^{1+c} |A| (c>0 absolute) such that s+s' is never in A when s and s' are distinct elements of S.

Classical Analysis and ODEs · Mathematics 2019-11-07 Tom Sanders

In this paper we explicitly estimate the number of points in a subset $A \subset \R^{d}$ as a function of the maximum angle $\angle A$ that any three of these points form, provided $\angle A < \theta_d := \arccos(-\frac 1 {d}) \in…

Metric Geometry · Mathematics 2022-02-03 Tongseok Lim , Robert J. McCann

For a finite non-empty set $X$, let $\mathfrak{P}(X)$ denote the set of all posets with carrier $X$, ordered by inclusion of their partial order relations. We investigate properties of posets $P \in \mathfrak{P}(X)$ for which no lower cover…

Combinatorics · Mathematics 2025-05-20 Frank a Campo

Suppose that $d \geq 2$, and that $A \subset [0,1]$ has sufficiently large dimension, $1 - \epsilon_d < \dim_H(A) < 1$. Then for any polynomial $P$ of degree $d$ with no constant term, there exists a point configuration $\{ x, x-t,x-P(t) \}…

Classical Analysis and ODEs · Mathematics 2019-05-21 Ben Krause

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

Algebraic Geometry · Mathematics 2011-11-10 J. Maurice Rojas

In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…

Number Theory · Mathematics 2014-02-26 Roland Bacher