English
Related papers

Related papers: A Stability Version of the Jones Opaque Set Inequa…

200 papers

For a given domain $\Omega \subset \Bbb{R}^n$, we consider the variational problem of minimizing the $L^1$-norm of the gradient on $\Omega$ of a function $u$ with prescribed continuous boundary values and satisfying a continuous lower…

Analysis of PDEs · Mathematics 2007-05-23 William P. Ziemer , Kevin Zumbrun

Fix a subset $I\subseteq \mathbb R_{>0}$ such that $\gamma=\inf\{ \sum_{i}n_ib_i-1>0 \mid n_i\in \mathbb Z_{\geq 0}, b_i\in I \}>0$. We give a explicit upper bound $\ell(\gamma)\in O(1/\gamma^2)$ as $\gamma\to 0$, such that for any smooth…

Algebraic Geometry · Mathematics 2023-07-31 Bingyi Chen

This paper proves the minimum size of a supersequence over a set of eight elements is 52. This disproves a conjecture that the lower bound of the supersequence is the partial sum of the geometric Connell sequence. By studying the internal…

Combinatorics · Mathematics 2025-01-22 Oliver Tan

We prove that an open set $\Omega \subset \mathbb{R}^n$ can be approximated by smooth sets of uniformly bounded perimeter from the interior if and only if the open set $\Omega$ satisfies \begin{align*} &\qquad…

Functional Analysis · Mathematics 2020-03-10 Gui-Qiang G. Chen , Qinfeng Li , Monica Torres

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

Discrete Mathematics · Computer Science 2025-10-14 Pasin Manurangsi , Raghu Meka

We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…

Metric Geometry · Mathematics 2020-05-05 Simon Larson

For a domain $\Omega \subset \mathbb{R}^n$ and a small number $\frak{T} > 0$, let \[ \mathcal{E}_0(\Omega) = \lambda_1(\Omega) + {\frak{T}} {\text{tor}}(\Omega) = \inf_{u, w \in H^1_0(\Omega)\setminus \{0\}} \frac{\int |\nabla u|^2}{\int…

Analysis of PDEs · Mathematics 2022-07-22 Mark Allen , Dennis Kriventsov , Robin Neumayer

We consider the following problem: minimize the functional $\int_\Omega f(\nabla u(x))\, dx$ in the class of concave functions $u: \Omega \to [0,M]$, where $\Omega \subset \mathbb{R}^2$ is a convex body and $M > 0$. If $f(x) = 1/(1 +…

Optimization and Control · Mathematics 2019-10-03 Alexander Plakhov

The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\partial A$ of a set $A \subset \{0,1\}^n$, as a function of $|A|$. A weaker (but…

Combinatorics · Mathematics 2018-03-05 David Ellis , Nathan Keller , Noam Lifshitz

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…

Combinatorics · Mathematics 2013-03-25 Boris Bukh , Jiří Matoušek , Gabriel Nivasch

A set $\Omega \subset \mathbb{R}^d$ is said to be spectral if the space $L^2(\Omega)$ admits an orthogonal basis of exponential functions. Fuglede (1974) conjectured that $\Omega$ is spectral if and only if it can tile the space by…

Classical Analysis and ODEs · Mathematics 2023-10-24 Mihail N. Kolountzakis , Nir Lev , Máté Matolcsi

For minimally $k$-connected graphs on $n$ vertices, Mader proved a tight lower bound for the number $|V_k|$ of vertices of degree $k$ in dependence on $n$ and $k$. Oxley observed 1981 that in many cases a considerably better bound can be…

Combinatorics · Mathematics 2016-03-31 Jens M. Schmidt

We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\times n$~grid such that every grid point lies on a common line…

Computational Geometry · Computer Science 2023-09-29 Oswin Aichholzer , David Eppstein , Eva-Maria Hainzl

We study the two dimensional least gradient problem in convex polygonal sets in the plane, $\Omega$. We show the existence of solutions when the boundary data $f$ are attained in the trace sense. The main difficulty here is a possible…

Analysis of PDEs · Mathematics 2020-07-14 Piotr Rybka , Ahmad Sabra

Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$…

Data Structures and Algorithms · Computer Science 2018-10-09 Nikhil Bansal , Raghu Meka

Let $\Omega \subset \mathbb{R}^{d}$ be a convex body with everywhere positive curvature except at the origin and with the boundary $\partial \Omega$ as the graph of the function $y=|x|^{\gamma}$ in a neighborhood of the origin with $\gamma…

Number Theory · Mathematics 2019-04-08 Bianca Gariboldi

In March 1999, the first named author (Binder) posed the problem of showing that a ``good direction'' $\psi\in [0,2]$ exists, for any Green's mapping $T:H\rightarrow\tilde \Omega$, i.e., \begin{equation}\label{binder}…

Complex Variables · Mathematics 2025-08-07 Ilia Binder , Paul F. X. Müller , Peter Yuditskii

This paper examines the relationship between shadowing phenomena and the continuity properties of $\omega$-limit sets in dynamical systems. We give a necessary and sufficient condition for a shadowable point to be an upper (resp. a lower)…

Dynamical Systems · Mathematics 2026-01-14 Noriaki Kawaguchi

Given a bounded open set $\Omega$ in $\mathbb{R}^n$ (or a compact Riemannian manifold with boundary), and a partition of $\Omega$ by $k$ open sets $\omega_j$, we consider the quantity $\max_j \lambda(\omega_j)$, where $\lambda(\omega_j)$ is…

Spectral Theory · Mathematics 2019-10-07 Pierre Bérard , Bernard Helffer

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