Related papers: Kakeya Conjecture and Conditional Kolmogorov Compl…
This paper presents several new results related to the Kakeya problem. First, we establish a geometric inequality which says that collections of direction-separated tubes (thin neighborhoods of line segments that point in different…
We introduce a generalized Fourier ratio, the \(\ell^1/\ell^2\) norm ratio of coefficients in an \emph{arbitrary} orthonormal system, as a single, basis-invariant measure of \emph{effective dimension} that governs fundamental limits across…
Representation learning for high-dimensional, complex physical systems aims to identify a low-dimensional intrinsic latent space, which is crucial for reduced-order modeling and modal analysis. To overcome the well-known Kolmogorov barrier,…
The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discrete universal distribution. There are conditional versions referred to in several publications but as yet there exist no written proofs in…
The dimension of Kakeya sets can be bounded using sum-difference exponents $\SD(R;s)$ for various sets of rational slopes $R$ and output slope $s$; the arithmetic Kakeya conjecture, which implies the Kakeya conjecture in all dimensions,…
The ability to discriminate similar visual stimuli is an important index of memory function. This ability is widely thought to be supported by expanding the dimensionality of relevant neural codes, such that neural representations for…
In the Upper Degree-Constrained Partial Orientation problem we are given an undirected graph $G=(V,E)$, together with two degree constraint functions $d^-,d^+ : V \to \mathbb{N}$. The goal is to orient as many edges as possible, in such a…
Alice and Bob are given two correlated n-bit strings x_1 and, respectively, x_2, which they want to losslessly compress and send to Zack. They can either collaborate by sharing their strings, or work separately. We show that there is no…
Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…
Hausdorff $\Phi$-dimension is a notion of Hausdorff dimension developed using a restricted class of coverings of a set. We introduce an effective version of Hausdorff $\Phi$-dimension, which we call constructive $\Phi$-dimension. We prove a…
Robust statistical inference often faces a severe computational-statistical gap when dealing with complex parameter spaces. We investigate minimax signal detection in the Gaussian sequence model under strong $\epsilon$-contamination, where…
We prove that all bounded subsets of $\mathbb{Q}_p^n$ containing a line segment of unit length in every direction have Hausdorff and Minkowski dimension $n$. This is the analogue of the classical Kakeya conjecture with $\mathbb{R}$ replaced…
We study the Rouquier dimension of wrapped Fukaya categories of Liouville manifolds and pairs, and apply this invariant to various problems in algebraic and symplectic geometry. On the algebro-geometric side, we introduce a new method based…
Identifiability, and the closely related idea of partial smoothness, unify classical active set methods and more general notions of solution structure. Diverse optimization algorithms generate iterates in discrete time that are eventually…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
We make progress on a question of Skandera by showing that a product of Kazhdan-Lusztig basis elements indexed by maximal elements of parabolic subgroups admits a Kazhdan-Lusztig basis element as a quotient arising from operations in the…
We study several distinct but related Fourier analytic variants of the well-known Kakeya and Furstenberg set problems in the plane. For example, given $0<s,t<1$, we call a set $K \subseteq \mathbb{R}^2$ an $(s,t)$-Kakeya set if there exists…
In this manuscript we study properties of multidimensional shifts. More precisely, we study the necessary and sufficient conditions for a shift to be sofic, i.e. the boundary between sofic shifts and effective ones. To this end, we use…
In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides…
Normalized information distance (NID) uses the theoretical notion of Kolmogorov complexity, which for practical purposes is approximated by the length of the compressed version of the file involved, using a real-world compression program.…