Related papers: Weak approximation for linear systems of quadrics
We propose new approximate alternating projection methods, based on randomized sketching, for the low-rank nonnegative matrix approximation problem: find a low-rank approximation of a nonnegative matrix that is nonnegative, but whose…
We provide sufficient conditions for a Banach space Y to be weakly sequentially complete. These conditions are expressed in terms of the existence of directional derivatives for cone convex mappings with values in Y .
Restricted non-linear approximation is a type of N-term approximation where a measure $\nu$ on the index set (rather than the counting measure) is used to control the number of terms in the approximation. We show that embeddings for…
Certain quasi-exactly solvable systems exhibit an energy reflection property that relates the energy levels of a potential or of a pair of potentials. We investigate two sister potentials and show the existence of this energy reflection…
We establish sufficient conditions for finite convergence of the alternating projections method for two non-intersecting and potentially nonconvex sets. Our results are based on a generalization of the concept of intrinsic transversality,…
Approximation in this paper is of vectors on the unit $d$-cube by the projection of integer lattice points onto the same cube. We define badly approximable vectors on a rational quadratic variety and show that sets of these vectors, which…
Let $k$ be a field of characteristic not 2 or 3. We establish polynomial lower bounds on the ambient dimension $N$ for an intersection $X\subset\mathbb{P}^N$ of quadrics, cubics and quartics to have a dense collection of solvable points,…
These lectures contain an introduction to the theory and practice of weak-scale supersymmetry. They begin with a discussion of the hierarchy problem and the motivation for weak-scale supersymmetry. They continue by developing the coset…
We investigate four key issues with using a nonzero weak value of the spatial projection operator to infer the past path of an individual quantum particle. First, we note that weak measurements disturb a system, so any approach relying on…
We prove some new relations between weak approximation and some rational equivalence relations (Brauer and R-equivalence) in algebraic groups over arithmetical fields. By using weak approximation and local - global approach, we compute…
Given a redundant dictionary $\Phi$, represented by an $M \times N$ matrix ($\Phi \in \mathbb{R}^{M \times N}$) and a target signal $y \in \mathbb{R}^M$, the \emph{sparse approximation problem} asks to find an approximate representation of…
In this work we prove that weak solutions constructed by a variational multiscale method are suitable in the sense of Scheffer. In order to prove this result, we consider a subgrid model that enforces orthogonality between subgrid and…
In the Sparse Linear Regression (SLR) problem, given a $d \times n$ matrix $M$ and a $d$-dimensional query $q$, the goal is to compute a $k$-sparse $n$-dimensional vector $\tau$ such that the error $||M \tau-q||$ is minimized. This problem…
Weak measurement is a new technique which allows one to describe the evolution of postselected quantum systems. It appears to be useful for resolving a variety of thorny quantum paradoxes, particularly when used to study properties of pairs…
We employ some techniques involving projections in a von Neumann algebra to establish some maximal inequalities such as the strong and weak symmetrization, Levy, Levy-Skorohod, and Ottaviani inequalities in the realm of the quantum…
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…
Inspired by the problem of Planckian scattering we describe a classical effective field theory for weak ultra relativistic scattering in which field propagation is instantaneous and transverse and the particles' equations of motion localize…
Any collection of $n$ compact convex planar sets $K_1,\dots, K_n$ defines a vector of ${n\choose 2}$ mixed areas $V(K_i,K_j)$ for $1\leq i<j\leq n$. We show that for $n\geq 4$ these numbers satisfy certain Pl\"ucker-type inequalities.…
We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…
On a weakly Blackwell space we show how to define a Markov chain approximating problem, for the target problem. The approximating problem is proved to converge to the optimal reduced problem under different pseudometrics. A computational…