English
Related papers

Related papers: Fixing and almost fixing a planar convex body

200 papers

Let $C$ be a convex subset of a locally convex space. We provide optimal approximate fixed point results for sequentially continuous maps $f\colon C\to\bar{C}$. First we prove that if $f(C)$ is totally bounded, then it has an approximate…

Functional Analysis · Mathematics 2013-02-27 Cleon S. Barroso , Ondřej F. K. Kalenda , Michel P. Rebouças

A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds…

Combinatorics · Mathematics 2009-11-24 Aart Blokhuis , Francesco Mazzocca

If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with…

Metric Geometry · Mathematics 2012-05-04 Don Coppersmith , Gyozo Nagy , Alex Ravsky

The Reifenberg theorem \cite{reif_orig} tells us that if a set $S\subseteq B_2\subseteq \mathbb R^n$ is uniformly close on all points and scales to a $k$-dimensional subspace, then $S$ is H\"older homeomorphic to a $k$-dimensional Euclidean…

Analysis of PDEs · Mathematics 2024-05-07 Nicholas Edelen , Aaron Naber , Daniele Valtorta

We prove area bounds for planar convex bodies in terms of their number of interior integral points and their lattice width data. As an application, we obtain sharp area bounds for rational polygons with a fixed number of interior integral…

Metric Geometry · Mathematics 2025-07-03 Martin Bohnert

The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…

Optimization and Control · Mathematics 2018-06-27 Carlo Alberto De Bernardi , Enrico Miglierina , Elena Molho

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

We prove sharp inequalities for the average number of affine diameters through the points of a convex body $K$ in ${\mathbb R}^n$. These inequalities hold if $K$ is either a polytope or of dimension two. An example shows that the proof…

Metric Geometry · Mathematics 2014-05-08 Imre Barany , Daniel Hug , Rolf Schneider

A solution of the n-body problem in R^d is a relative equilibrium if all of the mutual distance between the bodies are constant. In other words, the bodies undergo a rigid motion. Here we investigate the possibility of partially rigid…

Dynamical Systems · Mathematics 2025-06-17 Richard Moeckel

Answering Tarski's plank problem, Bang showed in 1951 that it is impossible to cover a convex body $K \subset \mathbb{R}^d$ with $d \geq 1$ by planks whose total width is less than the minimal width $w(K)$ of $K$. In 2003, A. Bezdek asked…

Metric Geometry · Mathematics 2025-11-24 Gergely Ambrus , Julian Huddell , Maggie Lai , Matthew Quirk , Elias Williams

Theorem A. Let $x_1,...,x_{2k+1}$ be unit vectors in a normed plane. Then there exist signs $\epsi_1,...,\epsi_{2k+1}\in\{\pm 1\}$ such that $\norm{\sum_{i=1}^{2k+1}\epsi_i x_i}\leq 1$. We use the method of proof of the above theorem to…

Metric Geometry · Mathematics 2008-03-05 Konrad J. Swanepoel

In this paper, we discuss automorphism related parameters of a graph associated to a finite vector space. The fixing neighborhood of a pair $(u,v)$ of vertices of a graph $G$ is the set of all those vertices $w$ of $G$, such that the orbits…

Combinatorics · Mathematics 2018-05-31 Hira Benish , Imran Javaid , M. Murtaza

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

Computational Geometry · Computer Science 2012-03-28 Sergio Cabello , Bojan Mohar

Approximate integer programming is the following: For a convex body $K \subseteq \mathbb{R}^n$, either determine whether $K \cap \mathbb{Z}^n$ is empty, or find an integer point in the convex body scaled by $2$ from its center of gravity…

Optimization and Control · Mathematics 2024-04-10 Daniel Dadush , Friedrich Eisenbrand , Thomas Rothvoss

The convex body isoperimetric conjecture in the plane asserts that the least perimeter to enclose given area inside a unit disk is greater than inside any other convex set of area $\pi$. In this note we confirm two cases of the conjecture:…

Differential Geometry · Mathematics 2021-04-13 Bo-Hshiung Wang , Ye-Kai Wang

For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…

Metric Geometry · Mathematics 2024-01-29 René Brandenberg , Katherina von Dichter , Bernardo González Merino

For a dynamic system consisting of $n$ point vortices in an ideal plane fluid with a steady, incompressible and} irrotational background flow, a more physically significant definition of a fixed equilibrium configuration is suggested. Under…

Complex Variables · Mathematics 2014-09-09 Pak-Leong Cheung , Tuen Wai Ng

We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…

Functional Analysis · Mathematics 2018-07-19 Omer Friedland , Pierre Youssef

Consider a point on a convex surface in $\mathbb{R}^d$, $d \ge 2$ and a plane of support $\Pi$ to the surface at this point. Draw a plane parallel to $\Pi$ cutting a part of the surface. We study the limiting behavior of this part of…

Metric Geometry · Mathematics 2022-06-22 Alexander Plakhov

Let $H$ be a composition of an $\mathbb{R}$-linear planar mapping and $z\mapsto z^n$. We classify the dynamics of $H$ in terms of the parameters of the $\mathbb{R}$-linear mapping and the degree by associating a certain finite Blaschke…

Dynamical Systems · Mathematics 2015-04-22 Alastair Fletcher