Related papers: An improved lower bound for star-shaped Kakeya set…

Searches for lepton number violating $K^+\to\pi^-e^+e^+$ and $K^+\to\pi^-\pi^0e^+e^+$ decays have been performed using the complete dataset collected by the NA62 experiment at CERN in 2016-2018. Upper limits of $5.3\times 10^{-11}$ and…

In [5] Soare and Stob prove that if $A$ is an r.e. set which isn't computable then there is a set of the form $A \oplus W^A_e$ which isn't of r.e. Turing degree. If we define a properly $n+1$-REA set to be an $n+1$-REA set which isn't…

Katz and Zahl used a planebrush argument to prove that Kakeya sets in $\mathbb{R}^4$ have Hausdorff dimension at least 3.059. In the special case when the Kakeya set is plany, their argument gives a better lower bound of 10/3. We give a…

The minimum error entropy (MEE) criterion has been successfully used in fields such as parameter estimation, system identification and the supervised machine learning. There is in general no explicit expression for the optimal MEE estimate…

Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this paper, we provide a new upper bound on…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

We establish new estimates on the Minkowski and Hausdorff dimensions of Besicovitch sets and obtain new bounds on the Kakeya maximal operator.

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

In this short note we study two questions about the existence of subgraphs of the hypercube $Q_n$ with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree…

We derive a lower bound to the spectral threshold of the Dirichlet Laplacian in tubular neighbourhoods of constant radius about complete surfaces. This lower bound is given by the lowest eigenvalue of a one-dimensional operator depending on…

It is proved that a convex hypersurface in a Riemannian manifold of sectional curvature at least k is an Alexandrov's space of curvature at least k. This theorem provides an optimal lower curvature bound for an older theorem of Buyalo.

If Bekenstein's conjectured bound on the microcanonical entropy, S < 2 pi E R, is applied to a closed subsystem of maximal linear size R and excitation energy up through E, it can be violated by an arbitrarily large factor by a scalar field…

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

Let $\lambda(G)$ be the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. Let $\lambda_{\rm e}(G)$ be the smallest number of edges that can be removed from…

If S is a smooth compact surface in $\mathbb{R}^{3}$ with strictly positive second fundamental form, and $E_S$ is the corresponding extension operator, then we prove that for all $p > 3$, $\left\|E_S f\right\|_{L^p\left(\mathbb{R}^3\right)}…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

We study the Steklov problem on a subgraph with boundary $(\Omega,B)$ of a polynomial growth Cayley graph $\Gamma$. We prove that for each $k \in \mathbb{N}$, the $k^{\mbox{th}}$ eigenvalue tends to $0$ proportionally to…

We prove that the Zakharov-Kuznetsov equation on cylindrical spaces is globally well-posed below the energy norm. As is known, local well-posedness below energy space was obtained by the first author. We adapt I-method to extend the…

We provide sharp upper bounds for the number of symmetrizations required to transform a star shaped set in ${\mathbb R}^n$ arbitrarily close (in the Hausdorff metric) to the Euclidean ball.

Constructing small-sized coresets for various clustering problems in different metric spaces has attracted significant attention for the past decade. A central problem in the coreset literature is to understand what is the best possible…