Related papers: Effective bound for singularities on toric fibrati…

In this note, we reduce various conjectures in birational geometry, including Shokurov conjecture on singularities of the base of log Calabi-Yau fibrations of Fano type and boundedness conjecture for rationally connected Calabi-Yau…

In this work we prove that given an open bounded set $\Omega \subset \mathbb{R}^2$ with a $C^2$ boundary, there exists $\epsilon := \epsilon(\Omega)$ small enough such that for all $0 < \delta < \epsilon$ the maximum of $\{\lambda_1(\Omega…

A theorem of R\"odl states that for every fixed $F$ and $\varepsilon>0$ there is $\delta=\delta_F(\varepsilon)$ so that every induced $F$-free graph contains a vertex set of size $\delta n$ whose edge density is either at most $\varepsilon$…

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

Let $X_0$ be a smooth geometrically connected variety defined over a finite field $\mathbb F_q$ and let $\mathcal E_0^{\dagger}$ be an irreducible overconvergent $F$-isocrystal on $X_0$. We show that if a subobject of minimal slope of the…

In 1976, Shlyakhter showed that the Sm data from Oklo results in the upper bound on the time-variability of the fine-structure constant: $|\dot{\alpha}/\alpha| \lsim 10^{-17}{\rm y}^{-1}$, which has ever been the most stringent bound. Since…

We study pointwise convergence of the fractional Schr\"odinger means along sequences $t_n$ which converge to zero. Our main result is that bounds on the maximal function $\sup_{n} |e^{it_n(-\Delta)^{\alpha/2}} f| $ can be deduced from those…

We give effective bounds for the uniformity of the Iitaka fibration. These bounds follow from an effective theorem on the birationality of some adjoint linear series. In particular we derive an effective version of the main theorem in [17].

We show that given $\alpha \in (0, 1)$ there is a constant $c=c(\alpha) > 0$ such that any planar $(\alpha, 2\alpha)$-Furstenberg set has Hausdorff dimension at least $2\alpha + c$. This improves several previous bounds, in particular…

In this paper, we establish upper bounds on the dimension of sets of singular-on-average and \(\omega\)-singular affine forms in singly metric settings, where either the matrix or the shift is fixed. These results partially address open…

We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…

The linear arboricity of a graph $G$, denoted by $\text{la}(G)$, is the minimum number of edge-disjoint linear forests (i.e. forests in which every connected component is a path) in $G$ whose union covers all the edges of $G$. A famous…

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…

Let $F$ be a Bedford-McMullen carpet defined by independent exponents. We prove that $\overline{\dim}_B (\ell \cap F) \leq \max \lbrace \dim^* F -1,0 \rbrace$ for all lines $\ell$ not parallel to the principal axes, where $\dim^*$ is…

Recent proofs of the convergence of the linear delta expansion in zero and in one dimensions have been limited to the analogue of the vacuum generating functional in field theory. In zero dimensions it was shown that with an appropriate,…

We consider the following conjecture (from Huang, et al): Let $\Delta^+$ denote the upper half disc in $\mathbb{C}$ and let $\gamma = ( - 1, 1)$ (viewed as an interval in the real axis in $\mathbb{C}$). Assume that $F$ is a holomorphic…

We prove that the density of any covering single-insertion code $C\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\delta_r$ for some positive real $\delta_r$ not depending on $n$. This improves the volume lower…

We improve Larman's bound on the diameter of a polytope by showing that if $\Delta$ is a normal simplicial complex, all of whose missing faces have size at most $r$, then the diameter of the facet-ridge graph of $\Delta$ is not larger than…

In FOCS 1986, Wilber proposed two combinatorial lower bounds on the operational cost of any binary search tree (BST) for a given access sequence $X \in [n]^m$. Both bounds play a central role in the ongoing pursuit of the dynamic optimality…

In this note, we show that the strong Viterbo conjecture holds true on any convex toric domain, and that the Viterbo's volume-capacity conjecture holds for the product of a $1$-unconditional convex body $A\subset\mathbb{R}^{n}$ and its…