Related papers: Thickness and a gap lemma in $\mathbb{R}^d$

A special type of geometric situation in ensembles of non-intersecting paths occurs when the non-intersecting trajectories are required to be nonnegative so that the limit shape becomes tangential to the hard-edge $0$. The local fluctuation…

A new proof of the classification for tensor ideal thick subcategories of the bounded derived category, and the stable category, of modular representations of a finite group is obtained. The arguments apply more generally to yield a…

We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…

Let \(G\) be a non-discrete, locally compact group with Haar measure \(m\). We prove that there exists a compact set \(K \subset G\) with \(m(K)=0\) such that \(KK^{-1}\) contains a neighborhood of the identity. Moreover, such a set may be…

We consider sets in the real line that have Littlewood--Paley properties $\mathrm{LP}(p)$ or $\mathrm{LP}$ and study the following question: How thick can these sets be?

We study some properties of smooth sets in the sense defined by Hungerford. We prove a sharp form of Hungerford's Theorem on the Hausdorff dimension of their boundaries on Euclidean spaces and show the invariance of the definition under a…

We define a new spectrum for compact length spaces and Riemannian manifolds called the "covering spectrum" which roughly measures the size of the one dimensional holes in the space. More specifically, the covering spectrum is a set of real…

This paper develops a new framework, \emph{simultaneous saturation}, designed to quantify the size of sets whose elements are simultaneously large. The framework establishes a correspondence between the magnitude of such sets and a system…

Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…

In this paper we are going to discuss compactness in Lorentz sequence spaces. Firstly, it will be shown how to define such a space, check whether a sequence belongs to it and calculate its norm. Equipped with this knowledge, we will proceed…

We introduce a class of Falconer distance problems, which we call of restricted type, lying between the classical version and its pinned variant. Prototypical restricted distance sets are the diagonal distance sets, $k$-point configuration…

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set…

This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…

We construct a family of closeness functions on the space of finite volume Lorentzian geometries using the abundance of discrete intervals in the underlying random causal sets. Although strictly weaker than a Lorentzian Gromov-Hausdorff…

We establish both sufficient and necessary conditions for weighted Hardy inequalities in metric spaces in terms of Assouad (co)dimensions. Our sufficient conditions in the case where the complement is thin are new even in Euclidean spaces,…

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

A new definition of random sets is proposed. It is based on the distance in measurable space and uses negative definite kernels for continuation from initial space to that of random sets. This approach has no connection to Hausdorff…

Let $\{c_n\}_{n=1}^\infty$ be a sequence of complex numbers. In this paper we answer when the range of $\sum_{n=1}^\infty\pm c_n$ is dense or equal to the complex plane. Some examples are given to explain our results. As its application, we…

We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…