Related papers: A Note on the Size-Sensitive Packing Lemma

Let $X$ be a smooth projective variety over the complex numbers, and $\Delta \subseteq X$ a reduced divisor with normal crossings. We present a slightly simplified proof for the following theorem of Campana and P\u{a}un: If some tensor…

We prove that for all integers $2\leq m\leq d-1$, there exists doubling measures on $\mathbb{R}^d$ with full support that are $m$-rectifiable and purely $(m-1)$-unrectifiable in the sense of Federer (i.e. without assuming…

We give a purely combinatorial proof of the density Hales--Jewett Theorem that is modeled after Polymath's proof but is significantly simpler. In particular, we avoid the use of the equal-slices measure and work exclusively with the uniform…

We modify the approach to the arithmetical form of the large sieve by relying on the Parseval identity rather than on an approximate Bessel inequality and as a consequence, improve on the weighted large sieve inequality beyond what was…

The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…

We introduce two stationary versions of two discrete variants of Hammersley's process in a finite box, this allows us to recover in a unified and simple way the laws of large numbers proved by T. Sepp{\"a}l{\"a}inen for two generalized…

In this paper we establish a general form of the Mass Transference Principle for systems of linear forms conjectured in [1]. We also present a number of applications of this result to problems in Diophantine approximation. These include a…

We introduce a variant of the multiplicative Sewing Lemma in [Gerasimovi\v{c}s, Hocquet, Nilssen; J. Funct. Anal. 281 (2021)] which yields arbitrary high order weak approximations to stochastic differential equations, extending the cubature…

A Hausdorff measure version of W.M. Schmidt's inhomogeneous, linear forms theorem in metric number theory is established. The key ingredient is a `slicing' technique motivated by a standard result in geometric measure theory. In short,…

We introduce a theoretical framework for understanding and predicting the complexity of sequence classification tasks, using a novel extension of the theory of Boolean function sensitivity. The sensitivity of a function, given a…

It is discussed that Zeeman's theorem can be directly obtained from Liouville's theorem if we assume sufficient differentiability.

In this paper we give an asymptotically tight bound for the tolerated Tverberg Theorem when the dimension and the size of the partition are fixed. To achieve this we study certain partitions of order-type homogeneous sets and use a…

We study growth limited by packing for irregular objects in two dimensions. We generate packings by seeding objects randomly in time and space and allowing each object to grow until it collides with another object. The objects we consider…

The paper is devoted to the development of general theory of packing measures and dimensions via introducing the notion of <<faithfulness of a packing family for $\dim_P$ calculation>> and the packing analogues of the Billingsley dimension.…

Sensitivity is an important complexity measure of Boolean functions. In this paper we present properties of the minimal and maximal sensitivity of the simplified weighted sum function. A simple close formula of the minimal sensitivity of…

Compressive Sensing theory says that it is possible to reconstruct a measured signal if an enough sparse representation of this signal exists in comparison to the number of random measurements. This theory was applied to reconstruct signals…

Let $K \subset \mathbb{R}^{2}$ be a rotation and reflection free self-similar set satisfying the strong separation condition, with dimension $\dim K = s > 1$. Intersecting $K$ with translates of a fixed line, one can study the $(s -…

Generalization abilities of well-trained large language models (LLMs) are known to scale predictably as a function of model size. In contrast to the existence of practical scaling laws governing pre-training, the quality of LLMs after…

A lemma stated by Ke Li in [arXiv:1208.1400] has been used in e.g. [arXiv:1510.04682,arXiv:1706.04590,arXiv:1612.01464,arXiv:1308.6503,arXiv:1602.08898] for various tasks in quantum hypothesis testing, data compression with quantum side…

We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional…