Related papers: Sequences of $m$-term deviations in Hilbert space
Dependency distance minimization (DDm) is a word order principle favouring the placement of syntactically related words close to each other in sentences. Massive evidence of the principle has been reported for more than a decade with the…
The denominator of the Hilbert series of a finitely generated R-module M does not always divide the denominator of the Hilbert series of R. For this reason, we define the universal denominator. The universal denominator of a module M is the…
We study Hilbert spaces $H$ interpreted, in an appropriate sense, in a first-order theory. Under a new finiteness hypothesis that we call {\em scatteredness} we prove that $H$ is a direct sum of {\em asymptotically free} components, where…
Consider a Hilbert space obtained as the completion of the polynomials C[z} in m-variables for which the mnonomials are orthogonal. If the commuting weighted shifts defined by the coordinate functions are essentially normal, then the same…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
Contraction theory for dynamical systems on Euclidean spaces is well-established. For contractive (resp. semi-contractive) systems, the distance (resp. semi-distance) between any two trajectories decreases exponentially fast. For partially…
Our main theorem is in the generality of the axioms of Hilbert space, and the theory of unbounded operators. Consider two Hilbert spaces such that their intersection contains a fixed vector space D. It is of interest to make a precise…
Given a set of vectors (the data) in a Hilbert space H, we prove the existence of an optimal collection of subspaces minimizing the sum of the square of the distances between each vector and its closest subspace in the collection. This…
A lower semi-definite self-adjoint linear operator in a Hilbert space is taken whose discrete spectrum is not empty and comprises at least several eigenvalues $\lambda_{min}=\lambda_1\leqslant\ldots\leqslant\lambda_m<\sigma_{ess}$. The…
Quantum speed-ups for dynamical simulation usually demand unitary time-evolution, whereas the large ODE/PDE systems encountered in realistic physical models are generically non-unitary. We present a universal moment-fulfilling dilation that…
Let $H$ be an infinite-dimensional complex Hilbert space and let ${\mathcal G}_{\infty}(H)$ be the set of all closed subspaces of $H$ whose dimension and codimension both are infinite. We investigate (not necessarily surjective)…
Field theories place one or more degrees of freedom at every point in space. Hilbert spaces describing quantum field theories, or their finite-dimensional discretizations on lattices, therefore have large amounts of structure: they are…
The combined universal probability M(D) of strings x in sets D is close to max_{x \in D} M({x}): their ~ logs differ by at most D's information j = I(D:H) about the halting sequence H. Thus if all x have complexity K(x) > k, D carries > i…
For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…
In any infinite dimensional Hilbert space H, a sequence P_n...P_1 x diverges in norm for some x \in H and orthogonal projections P_n \in {Q_1,..., Q_5}.
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams…
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
Let $H$ be an infinite-dimensional separable Hilbert space and let $(X,d,\mu)$ be a metric measure space satisfying the doubling and upper Alhfors regularity conditions at small scale. We prove that every bounded continuous tight frame…
We consider a range of simply stated dynamic data structure problems on strings. An update changes one symbol in the input and a query asks us to compute some function of the pattern of length $m$ and a substring of a longer text. We give…