Related papers: Achieving the orthoplex bound and constructing wei…
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…
In rectangle packing problems we are given the task of placing axis-aligned rectangles in a given plane region, so that they do not overlap with each other. In Maximum Weight Independent Set of Rectangles (MWISR), their position is given…
We discuss some specializations of the frames of flat orthonormal frame bundles over geometries of indefinite signature, and the resulting symmetries of families of embedded Riemannian or pseudo-Riemannian geometries. The specializations…
We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…
For natural language understanding and generation, embedding concepts using an order-based representation is an essential task. Unlike traditional point vector based representation, an order-based representation imposes geometric…
An equiangular tight frame (ETF) is a type of optimal packing of lines in Euclidean space. They are often represented as the columns of a short, fat matrix. In certain applications we want this matrix to be flat, that is, have the property…
In a separable Hilbert space $\mathcal H$, two frames $\{f_i\}_{i \in I}$ and $\{g_i\}_{i \in I}$ are said to be woven if there are constants $0<A \leq B$ so that for every $\sigma \subset I$, $\{f_i\}_{i \in \sigma} \cup \{g_i\}_{i \in…
We investigate the relation between two different mathematical problems: the construction of bounds on sphere packing density using Cohn-Elkies functions and the construction of Gabor frames for signal analysis. In particular, we present a…
A new notion of dual fusion frame has been recently introduced by the authors. In this article that notion is further motivated and it is shown that it is suitable to deal with questions posed in a finite-dimensional real or complex Hilbert…
Two frames $\{\phi_{i}\}_{i \in I}$ and $\{\psi_{i}\}_{i \in I}$ for a separable Hilbert space $H$ are woven if there are positive constants $A \leq B$ such that for every subset $\sigma \subset I$, the family $\{\phi_{i}\}_{i \in \sigma}…
Evaluating Ollivier-Ricci (OR) curvature on large-scale graphs is computationally prohibitive due to the necessity of solving an optimal transport problem for every edge. We bypass this computational bottleneck by deriving explicit,…
We provide an index-theoretic proof of the bulk-boundary correspondence for two- and three-dimensional second-order topological insulators that preserve inversion symmetry, which are modeled as rectangles and rectangular prism-shaped…
We extend the framework of quantum pushforward designs to the approximate setting, where averaging is achieved only up to finite precision. Using Schatten $p$-norms and Lipschitz continuity arguments, we derive bounds on the approximation…
Comparison theorems are foundational to our understanding of the geometric features implied by various curvature constraints. This paper considers manifolds with a positive lower bound on either scalar, 2-Ricci, or Ricci curvature, and…
The possibility of defining sesquilinear forms starting from one or two sequences of elements of a Hilbert space is investigated. One can associate operators to these forms and in particular look for conditions to apply representation…
We show that every frame for a Hilbert space H can be written as a (multiple of a) sum of three orthonormal bases for H. A result of N.J. Kalton is included which shows that this is best possible in that: A frame can be represented as a…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
This paper studies the interpretability of neural network features from a Bayesian Gaussian view, where optimizing a cost is reaching a probabilistic bound; learning a model approximates a density that makes the bound tight and the cost…
Recently, Freedman [arXiv:2301.00295] introduced the idea of packing a maximal number of links into a bounded region subject to geometric constraints, and produced upper bounds on the packing number in some cases, while commenting that…
Let $n\ge 2$ be an integer. To each irreducible representation $\sigma$ of $\mathrm O(1)$, an $\mathrm {O}(1)$-Kepler problem in dimension $n$ is constructed and analyzed. This system is super integrable and when $n=2$ it is equivalent to a…