English
Related papers

Related papers: How much can heavy lines cover?

200 papers

We develop a method for proving sup-norm and H\"older estimates for $\overline{\partial}$ on wide class of finite type pseudoconvex domains in $\mathbb{C}^n$. A fundamental obstruction to proving sup-norm estimates is the possibility of…

Complex Variables · Mathematics 2020-12-10 Dusty Grundmeier , Lars Simon , Berit Stensønes

We consider the Ekst\''om-Persson conjecture concerning the value of the Hausdorff dimension of random covering sets formed by balls with radii $(k^{-\alpha})_{k=1}^\infty$ and centres chosen independently at random according to an…

Probability · Mathematics 2025-06-13 Esa Järvenpää , Markus Myllyoja , Stéphane Seuret

For integers $0 \leq m \leq l \leq n-m$, the truncated Boolean lattice ${\cal B}_n(m,l)$ is the poset of all subsets of $[n] = \{1, 2, \ldots, n\}$ which have size at least $m$ and at most $l$. ${\cal C} \subseteq {\cal B}_n(m,l)$ is a {\em…

Combinatorics · Mathematics 2015-12-10 Béla Bajnok

Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph $G$, the segment number of $G$ is the minimum number of segments that can be achieved by any planar straight-line…

Computational Geometry · Computer Science 2024-07-03 Sabine Cornelsen , Giordano Da Lozzo , Luca Grilli , Siddharth Gupta , Jan Kratochvíl , Alexander Wolff

For $e \in S^{2}$, the unit sphere in $\mathbb{R}^3$, let $\pi_{e}$ be the orthogonal projection to $e^{\perp} \subset \mathbb{R}^{3}$, and let $W \subset \mathbb{R}^{3}$ be any $2$-plane, which is not a subspace. We prove that if $K…

Classical Analysis and ODEs · Mathematics 2018-08-10 Tuomas Orponen , Laura Venieri

We obtain subelliptic estimates for the $\bar{\partial}$-problem on complex algebraic surfaces embedded in $\mathbb{C}^n$ with isolated singularities. $W^{\epsilon}$ Sobolev norms of a form, $f$, for $0< \epsilon < 1$ are estimated in terms…

Complex Variables · Mathematics 2022-02-23 Dariush Ehsani

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

Combinatorics · Mathematics 2014-07-18 Giovanni Felici , Sokol Ndreca , Aldo Procacci , Benedetto Scoppola

We study the behavior of Sobolev mappings defined on the Heisenberg groups with respect to a foliation by left cosets of a horizontal homogeneous subgroup. We quantitatively estimate, in terms of Euclidean Hausdorff dimension, the size of…

Metric Geometry · Mathematics 2013-03-29 Zoltán M. Balogh , Jeremy T. Tyson , Kevin Wildrick

Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…

Combinatorics · Mathematics 2021-11-11 Abdul Basit , Zeev Dvir , Shubhangi Saraf , Charles Wolf

A corollary of Kneser's theorem, one sees that any finite non-empty subset $A$ of an abelian group $G = (G,+)$ with $|A + A| \leq (2-\eps) |A|$ can be covered by at most $\frac{2}{\eps}-1$ translates of a finite group $H$ of cardinality at…

Combinatorics · Mathematics 2012-04-04 Terence Tao

The long root geometry $A_{n,\{1,n\}}(\mathbb{K})$ for the special linear group $\mathrm{SL}(n+1,\mathbb{K})$ admits an embedding in the (projective space of) the vector space of the traceless square matrices of order $n+1$ with entries in…

Representation Theory · Mathematics 2026-04-17 I. Cardinali , L. Giuzzi , A. Pasini

We study Frege proofs using depth-$d$ Boolean formulas for the Tseitin contradiction on $n \times n$ grids. We prove that if each line in the proof is of size $M$ then the number of lines is exponential in $n/(\log M)^{O(d)}$. This…

Computational Complexity · Computer Science 2025-10-29 Johan Håstad , Kilian Risse

For a hypergraph $H$ let $\beta(H)$ denote the minimal number of edges from $H$ covering $V(H)$. An edge $S$ of $H$ is said to represent {\em fairly} (resp. {\em almost fairly}) a partition $(V_1,V_2, \ldots, V_m)$ of $V(H)$ if $|S\cap…

Combinatorics · Mathematics 2016-11-11 Ron Aharoni , Noga Alon , Eli Berger , Maria Chudnovsky , Dani Kotlar , Martin Loebl , Ran Ziv

We present an updated Standard Model (SM) estimate of the inclusive $b\to s\bar{\ell}\ell$ rate at high dilepton invariant mass ($q^2\geq 15~{\rm GeV}^2$). We show that this estimate is in good agreement with the result obtained summing the…

High Energy Physics - Phenomenology · Physics 2023-11-02 Gino Isidori , Zachary Polonsky , Arianna Tinari

A union of an arrangement of affine hyperplanes $H$ in $R^d$ is the real algebraic variety associated to the principal ideal generated by the polynomial $p_{H}$ given as the product of the degree one polynomials which define the hyperplanes…

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 characterize observable sets for 1-dim Schr\"{o}dinger equations in $\mathbb{R}$: $i \partial_t u = (-\partial_x^2+x^{2m})u$ (with $m\in \mathbb{N}:=\{0,1,\dots\}$). More precisely, we obtain what follows: First, when $m=0$,…

Optimization and Control · Mathematics 2020-03-26 Shanlin Huang , Gengsheng Wang , Ming Wang

We show an analogue of a theorem of An, Ghosh, Guan, and Ly on weighted badly approximable vectors for totally imaginary number fields. We show that for $G=\mathrm{SL}_2(\mathbb{C})\times\dots\times\mathrm{SL}_2(\mathbb{C})$ and $\Gamma<G$…

Dynamical Systems · Mathematics 2023-10-31 Gaurav Sawant

We describe a construction of ordered algebraic structures (ordered abelian semigroups, ordered commutative semirings, etc.) and describe applications to codimension-1 laminations. For a suitable ordered semi- algebraic structure $\mathbb…

Geometric Topology · Mathematics 2016-07-28 Ulrich Oertel

Let T be a triangulation of S^3 containing a link L in its 1-skeleton. We give an explicit lower bound for the number of tetrahedra of T in terms of the bridge number of L. Our proof is based on the theory of almost normal surfaces.

Geometric Topology · Mathematics 2014-11-11 Simon A King