More Like this

1. Improved Bounds on a Generalization of Tuza's Conjecture

   https://doi.org/10.37236/10829  

   Basit, Abdul; McGinnis, Daniel; Simmons, Henry; Sinnwell, Matt; Zerbib, Shira (October 2022, The Electronic Journal of Combinatorics)

   For an $$r$$-uniform hypergraph $$H$$, let $$\nu^{(m)}(H)$$ denote the maximum size of a set $$M$$ of edges in $$H$$ such that every two edges in $$M$$ intersect in less than $$m$$ vertices, and let $$\tau^{(m)}(H)$$ denote the minimum size of a collection $$C$$ of $$m$$-sets of vertices such that every edge in $$H$$ contains an element of $$C$$. The fractional analogues of these parameters are denoted by $$\nu^{*(m)}(H)$$ and $$\tau^{*(m)}(H)$$, respectively. Generalizing a famous conjecture of Tuza on covering triangles in a graph, Aharoni and Zerbib conjectured that for every $$r$$-uniform hypergraph $$H$$, $$\tau^{(r-1)}(H)/\nu^{(r-1)}(H) \leq \lceil{\frac{r+1}{2}}\rceil$$. In this paper we prove bounds on the ratio between the parameters $$\tau^{(m)}$$ and $$\nu^{(m)}$$, and their fractional analogues. Our main result is that, for every $$r$$-uniform hypergraph~$$H$$,\[ \tau^{*(r-1)}(H)/\nu^{(r-1)}(H) \le \begin{cases} \frac{3}{4}r - \frac{r}{4(r+1)} &\text{for }r\text{ even,}\\\frac{3}{4}r - \frac{r}{4(r+2)} &\text{for }r\text{ odd.} \\\end{cases} \]This improves the known bound of $$r-1$.We also prove that, for every $$r$$-uniform hypergraph $$H$$, $$\tau^{(m)}(H)/\nu^{*(m)}(H) \le \operatorname{ex}_m(r, m+1)$$, where the Turán number $$\operatorname{ex}_r(n, k)$$ is the maximum number of edges in an $$r$$-uniform hypergraph on $$n$$ vertices that does not contain a copy of the complete $$r$$-uniform hypergraph on $$k$$ vertices. Finally, we prove further bounds in the special cases $(r,m)=(4,2)$ and $(r,m)=(4,3)$. 

   more » « less
2. Induced Subgraph Density. I. A loglog Step Towards Erd̋s–Hajnal

   https://doi.org/10.1093/imrn/rnae065  

   Bucić, Matija; Nguyen, Tung; Scott, Alex; Seymour, Paul (May 2024, International Mathematics Research Notices)

   Abstract In 1977, Erd̋s and Hajnal made the conjecture that, for every graph $$H$$, there exists $c>0$ such that every $$H$$-free graph $$G$$ has a clique or stable set of size at least $$|G|^{c}$$, and they proved that this is true with $$ |G|^{c}$$ replaced by $$2^{c\sqrt{\log |G|}}$$. Until now, there has been no improvement on this result (for general $$H$$). We prove a strengthening: that for every graph $$H$$, there exists $c>0$ such that every $$H$$-free graph $$G$$ with $$|G|\ge 2$$ has a clique or stable set of size at least $$ \begin{align*} &2^{c\sqrt{\log |G|\log\log|G|}}.\end{align*} $$ Indeed, we prove the corresponding strengthening of a theorem of Fox and Sudakov, which in turn was a common strengthening of theorems of Rödl, Nikiforov, and the theorem of Erd̋s and Hajnal mentioned above. 

   more » « less
3. Carleson’s $$\varepsilon ^{2}$$ conjecture in higher dimensions

   https://doi.org/10.1007/s00222-025-01337-w  

   Fleschler, Ian; Tolsa, Xavier; Villa, Michele (July 2025, Inventiones mathematicae)

   Abstract In this paper we prove a higher dimensional analogue of Carleson’s$$\varepsilon ^{2}$$ ${\epsilon }^2$conjecture. Given two arbitrary disjoint Borel sets$$\Omega ^{+},\Omega ^{-}\subset \mathbb{R}^{n+1}$$ ${\Omega }^{+},{\Omega }^{-}\subset R^{n+1}$, and$$x\in \mathbb{R}^{n+1}$$ $x\in R^{n+1}$,$$r>0$$ $r>0$, we denote$$ \varepsilon _{n}(x,r) := \frac{1}{r^{n}}\, \inf _{H^{+}} \mathcal{H}^{n} \left ( ((\partial B(x,r)\cap H^{+}) \setminus \Omega ^{+}) \cup (( \partial B(x,r)\cap H^{-}) \setminus \Omega ^{-})\right ), $$ ${\epsilon }_n(x,r):=\frac{1}{r^n}\underset{H^{+}}{inf}{H}^n\left(\right(\left(\partial B\right(x,r)\cap H^{+})\setminus {\Omega }^{+})\cup (\left(\partial B\right(x,r)\cap H^{-})\setminus {\Omega }^{-}\left)\right),$where the infimum is taken over all open affine half-spaces$$H^{+}$$ $H^{+}$such that$$x \in \partial H^{+}$$ $x\in \partial H^{+}$and we define$$H^{-}= \mathbb{R}^{n+1} \setminus \overline{H^{+}}$$ $H^{-}=R^{n+1}\setminus \overline{H^{+}}$. Our first main result asserts that the set of points$$x\in \mathbb{R}^{n+1}$$ $x\in R^{n+1}$where$$ \int _{0}^{1} \varepsilon _{n}(x,r)^{2} \, \frac{dr}{r}< \infty $$ ${\int }_0^1{\epsilon }_n{(x,r)}^2\frac{dr}{r}<\infty$is$$n$$ $n$-rectifiable. For our second main result we assume that$$\Omega ^{+}$$ ${\Omega }^{+}$,$$\Omega ^{-}$$ ${\Omega }^{-}$are open and that$$\Omega ^{+}\cup \Omega ^{-}$$ ${\Omega }^{+}\cup {\Omega }^{-}$satisfies the capacity density condition. For each$$x \in \partial \Omega ^{+} \cup \partial \Omega ^{-}$$ $x\in \partial {\Omega }^{+}\cup \partial {\Omega }^{-}$and$$r>0$$ $r>0$, we denote by$$\alpha ^{\pm }(x,r)$$ ${\alpha }^{\pm }(x,r)$the characteristic constant of the (spherical) open sets$$\Omega ^{\pm }\cap \partial B(x,r)$$ ${\Omega }^{\pm }\cap \partial B(x,r)$. We show that, up to a set of$$\mathcal{H}^{n}$$ $H^n$measure zero,$$x$$ $x$is a tangent point for both$$\partial \Omega ^{+}$$ $\partial {\Omega }^{+}$and$$\partial \Omega ^{-}$$ $\partial {\Omega }^{-}$if and only if$$ \int _{0}^{1} \min (1,\alpha ^{+}(x,r) + \alpha ^{-}(x,r) -2) \frac{dr}{r} < \infty . $$ ${\int }_0^{1}min(1,{\alpha }^{+}(x,r)+{\alpha }^{-}(x,r)-2)\frac{dr}{r}<\infty .$The first result is new even in the plane and the second one improves and extends to higher dimensions the$$\varepsilon ^{2}$$ ${\epsilon }^2$conjecture of Carleson. 

   more » « less
4. Primitivity rank for random elements in free groups

   https://doi.org/10.1515/jgth-2021-0150  

   Kapovich, Ilya (March 2022, Journal of Group Theory)

   Abstract For a free group F r F_{r} of finite rank r ≥ 2 r\geq 2 and a non-trivial element w ∈ F r w\in F_{r} , the primitivity rank π ⁢ ( w ) \pi(w) is the smallest rank of a subgroup H ≤ F r H\leq F_{r} such that w ∈ H w\in H and 𝑤 is not primitive in 𝐻 (if no such 𝐻 exists, one puts π ⁢ ( w ) = ∞ \pi(w)=\infty ).The set of all subgroups of F r F_{r} of rank π ⁢ ( w ) \pi(w) containing 𝑤 as a non-primitive element is denoted by Crit ⁡ ( w ) \operatorname{Crit}(w) .These notions were introduced by Puder (2014).We prove that there exists an exponentially generic subset V ⊆ F r V\subseteq F_{r} such that, for every w ∈ V w\in V , we have π ⁢ ( w ) = r \pi(w)=r and Crit ⁡ ( w ) = { F r } \operatorname{Crit}(w)=\{F_{r}\} . 

   more » « less
5. Examples of non-Dini domains with large singular sets

   https://doi.org/10.1515/ans-2022-0058  

   Kenig, Carlos; Zhao, Zihui (January 2023, Advanced Nonlinear Studies)

   Abstract Let u u be a nontrivial harmonic function in a domain D ⊂ R d D\subset {{\mathbb{R}}}^{d} , which vanishes on an open set of the boundary. In a recent article, we showed that if D D is a C 1 {C}^{1} -Dini domain, then, within the open set, the singular set of u u , defined as { X ∈ D ¯ : u ( X ) = 0 = ∣ ∇ u ( X ) ∣ } \left\{X\in \overline{D}:u\left(X)=0=| \nabla u\left(X)| \right\} , has finite ( d − 2 ) \left(d-2) -dimensional Hausdorff measure. In this article, we show that the assumption of C 1 {C}^{1} -Dini domains is sharp, by constructing a large class of non-Dini (but almost Dini) domains whose singular sets have infinite ℋ d − 2 {{\mathcal{ {\mathcal H} }}}^{d-2} -measures. 

   more » « less