English
Related papers

Related papers: A Conditional Upper Bound for the Moving Sofa Prob…

200 papers

Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…

Metric Geometry · Mathematics 2007-05-23 S. Torquato , F. H. Stillinger

We study the existence of surfaces with constant or prescribed Gauss curvature in certain Lorentzian spacetimes. We prove in particular that every (non-elementary) 3-dimensional maximal globally hyperbolic spatially compact spacetime with…

General Relativity and Quantum Cosmology · Physics 2013-01-18 Thierry Barbot , François Béguin , Abdelghani Zeghib

It is proved that a convex hypersurface in a Riemannian manifold of sectional curvature at least k is an Alexandrov's space of curvature at least k. This theorem provides an optimal lower curvature bound for an older theorem of Buyalo.

Differential Geometry · Mathematics 2013-03-26 Stephanie Alexander , Vitali Kapovitch , Anton Petrunin

Let A be a bounded subset of IR^d. We give an upper bound on the volume of the symmetric difference of A and f(A) where f is a translation, a rotation, or the composition of both, a rigid motion. The volume is measured by the d-dimensional…

Metric Geometry · Mathematics 2010-10-13 Daria Schymura

A two-dimensional steady problem of a potential free-surface flow of an ideal incompressible fluid caused by a singular sink is considered. The sink is placed at the horizontal bottom of the fluid layer. With the help of the Levi-Civita…

Analysis of PDEs · Mathematics 2018-07-11 Anastasia A. Mestnikova , Victor N. Starovoitov

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

Combinatorics · Mathematics 2018-01-23 Lihang Hou , Bo Hou , Suogang Gao , Wei-Hsuan Yu

The notions of the Euclidean surface area measure and the spherical surface area measure of $\alpha$-concave functions in $\mathbb{R}^n$, with $-\frac{1}{n}<\alpha<0$, are introduced via a first variation of the total mass functional with…

Functional Analysis · Mathematics 2025-07-01 Xiao Li , Nguyen Dac Khoi Nguyen , Deping Ye

In this paper, we consider the problem of minimizing a difference-of-convex objective over a nonlinear conic constraint, where the cone is closed, convex, pointed and has a nonempty interior. We assume that the support function of a compact…

Optimization and Control · Mathematics 2026-04-13 Jiefeng Xu , Ting Kei Pong , Nung-sing Sze

We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i.e. graphs with maximum vertex degree three, and prove that the problem for an $n$-vertex graph can be solved in $O(1.2553^n)$ time and in linear space. We…

Data Structures and Algorithms · Computer Science 2012-12-03 Maciej Liskiewicz , Martin R. Schuster

In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…

Metric Geometry · Mathematics 2019-05-01 Galyna V. Livshyts

We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\min_x\max_y f(x) + \langle y,\mathbf{B} x\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine…

Optimization and Control · Mathematics 2024-11-25 Dmitry Kovalev , Ekaterina Borodich

In this paper we use min-max theory to study the existence free boundary minimal hypersurfaces (FBMHs) in compact manifolds with boundary $(M^{n+1}, \partial M, g)$, where $2\leq n\leq 6$. Under the assumption that $g$ is a local maximizer…

Differential Geometry · Mathematics 2020-12-03 Yucheng Tu

A generalization of pairwise intersecting Minkowski arrangement of centrally symmetric convex bodies is the pairwise intersecting Minkowski arrangement of order $\mu$. Here, the homothetic copies of a centrally symmetric convex body are so…

Metric Geometry · Mathematics 2020-02-20 Viktória Földvári

We study two fundamental problems in computational geometry: finding the maximum inscribed ball (MaxIB) inside a bounded polyhedron defined by $m$ hyperplanes, and the minimum enclosing ball (MinEB) of a set of $n$ points, both in…

Computational Geometry · Computer Science 2016-05-09 Zeyuan Allen-Zhu , Zhenyu Liao , Yang Yuan

We analyse the maximum achievable rate of sustained computation for a given convex region of three dimensional space subject to geometric constraints on power delivery and heat dissipation. We find a universal upper bound across both…

Statistical Mechanics · Physics 2021-12-02 Hannah Earley

We study sequences of oriented Riemannian manifolds with boundary and, more generally, integral current spaces and metric spaces with boundary. {\color{blue}For a metric space, we define its boundary to be the completion of the space minus…

Metric Geometry · Mathematics 2021-08-18 Raquel Perales

We show that for a very general and natural class of curvature functions (for example the curvature quotients $(\sigma_n/\sigma_l)^{\frac{1}{n-l}}$) the problem of finding a complete spacelike strictly convex hypersurface in de Sitter space…

Differential Geometry · Mathematics 2012-03-27 Joel Spruck , Ling Xiao

In this paper, we are interested in the analysis of a well-known free boundary/shape optimization problem motivated by some issues arising in population dynamics. The question is to determine optimal spatial arrangements of favorable and…

Analysis of PDEs · Mathematics 2016-11-15 Jimmy Lamboley , Antoine Laurain , Grégoire Nadin , Yannick Privat

A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of $n \Delta$ on the proximity of optimal solutions of an Integer Linear Programming problem and its standard linear relaxation. In this bound, $n$ is the…

Optimization and Control · Mathematics 2021-04-16 Alberto Del Pia , Mingchen Ma

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Metric Geometry · Mathematics 2022-07-12 Han Huang , Boaz A. Slomka , Tomasz Tkocz , Beatrice-Helen Vritsiou