English
Related papers

Related papers: Affine isoperimetric inequalities for piecewise li…

200 papers

In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.

Computational Geometry · Computer Science 2016-09-07 Xin Wu , Xijie Zeng , Bryan St. Amour , Asish Mukhopadhyay

The aim of this paper is to give not only an explicit upper bound of the total Q-curvature but also an induced isoperimetric deficit formula for the complete conformal metrics on $\mathbb R^n$, $n\ge 3$ with scalar curvature being…

Differential Geometry · Mathematics 2009-10-09 Cheikh Birahim Ndiaye , Jie Xiao

We explore for compact Riemannian surfaces whose boundary consists of a single closed geodesic the relationship between orthospectrum and boundary length. More precisely, we establish a uniform lower bound on the boundary length in terms of…

Differential Geometry · Mathematics 2025-03-04 Florent Balacheff , David Fisac

An embedded twisted paper cylinder of aspect ratio $\lambda$ is a smooth isometric embedding of a flat $\lambda \times 1$ cylinder into $\R^3$ such that the images of the boundary components are linked. We prove that for such an object to…

Metric Geometry · Mathematics 2025-09-24 Noah Montgomery , Richard Evan Schwartz

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

Combinatorics · Mathematics 2007-05-23 Adam Bliss , Francis Edward Su

We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained by drawings whose vertex and crossing resolution is at least…

Computational Geometry · Computer Science 2018-08-28 Philipp Kindermann , Fabrizio Montecchiani , Lena Schlipf , André Schulz

In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…

Analysis of PDEs · Mathematics 2023-10-24 Cătălin I. Cârstea , Matti Lassas , Tony Liimatainen , Leo Tzou

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…

Numerical Analysis · Mathematics 2020-07-27 Michael DiPasquale , Nelly Villamizar

We prove that there are only finitely many isoparametrically foliated closed connected Riemannian manifolds with bounded geometry, fixed dimension $n\neq5$, and finite fundamental group, up to foliated diffeomorphism. In addition, we…

Differential Geometry · Mathematics 2026-03-24 Manuel Krannich , Alexander Lytchak , Marco Radeschi

For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…

Algebraic Topology · Mathematics 2011-06-29 R. N. Karasev

We prove that at least $\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the…

Combinatorics · Mathematics 2021-02-18 Gal Yehuda , Amir Yehudayoff

Let $V$ be a smooth quasi-projective complex surface with compactification $(X,D)$ and set $\overline P_1(V):=h^0(X,K_X+D)$, $\overline q(V):=h^0(X,\Omega^1_X(\log D))$. We prove that $\overline P_1(V)\ge \overline q(V)-1$ if $V$ has…

Algebraic Geometry · Mathematics 2026-03-31 Rita Pardini , Sofia Tirabassi

In this article we consider the isoperimetric problem for partitioning the plane into three disjoint domains, one having unit area and the remaining two having infinite area. We show that the only solution, up to rigid motions of the plane,…

Analysis of PDEs · Mathematics 2023-11-29 Stan Alama , Lia Bronsard , Silas Vriend

We give a lower bound on the number of non-simple closed curves on a hyperbolic surface, given upper bounds on both length and self-intersection number. In particular, we carefully show how to construct closed geodesics on pairs of pants,…

Geometric Topology · Mathematics 2017-02-21 Jenya Sapir

We prove that any compact surface with constant positive curvature and conical singularities can be decomposed into irreducible components of standard shape, glued along geodesic arcs connecting conical singularities. This is a spherical…

Geometric Topology · Mathematics 2022-01-05 Guillaume Tahar

In this article, we study isomorphisms between complements of irreducible curves in the projective plane $\mathbb{P}^2$, over an arbitrary algebraically closed field. Of particular interest are rational unicuspidal curves. We prove that if…

Algebraic Geometry · Mathematics 2023-06-22 Mattias Hemmig

We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…

Machine Learning · Computer Science 2020-03-10 Pritish Kamath , Omar Montasser , Nathan Srebro

Consider a 2-plane $P \subset \mathbb{C}^n$ and let $D$ be a bounded region in $P$ with a piecewise-smooth boundary. Let $I(D)$ be the infimum of areas of all piecewise-smooth isotropic surfaces in $\mathbb{C}^n$ with the same boundary as…

Differential Geometry · Mathematics 2007-05-23 Edward Goldstein

We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…

Number Theory · Mathematics 2024-11-05 Johannes Schleischitz

We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of…

Combinatorics · Mathematics 2022-10-05 Zdeněk Dvořák , Sergey Norin