Optimal approximate matrix product in terms of stable rank

We prove, using the subspace embedding guarantee in a black box way, that one can achieve the spectral norm guarantee for approximate matrix multiplication with a dimensionality-reducing map having $m = O(\tilde{r}/\varepsilon^2)$ rows. Here $\tilde{r}$ is the maximum stable rank, i.e. squared ratio of Frobenius and operator norms, of the two matrices being multiplied. This is a quantitative improvement over previous work of [MZ11, KVZ14], and is also optimal for any oblivious dimensionality-reducing map. Furthermore, due to the black box reliance on the subspace embedding property in our proofs, our theorem can be applied to a much more general class of sketching matrices than what was known before, in addition to achieving better bounds. For example, one can apply our theorem to efficient subspace embeddings such as the Subsampled Randomized Hadamard Transform or sparse subspace embeddings, or even with subspace embedding constructions that may be developed in the future. Our main theorem, via connections with spectral error matrix multiplication shown in prior work, implies quantitative improvements for approximate least squares regression and low rank approximation. Our main result has also already been applied to improve dimensionality reduction guarantees for $k$-means clustering [CEMMP14], and implies new results for nonparametric regression [YPW15]. We also separately point out that the proof of the "BSS" deterministic row-sampling result of [BSS12] can be modified to show that for any matrices $A, B$ of stable rank at most $\tilde{r}$, one can achieve the spectral norm guarantee for approximate matrix multiplication of $A^T B$ by deterministically sampling $O(\tilde{r}/\varepsilon^2)$ rows that can be found in polynomial time. The original result of [BSS12] was for rank instead of stable rank. Our observation leads to a stronger version of a main theorem of [KMST10].Comment: v3: minor edits; v2: fixed one step in proof of Theorem 9 which was wrong by a constant factor (see the new Lemma 5 and its use; final theorem unaffected

Chameleons with Field Dependent Couplings

Certain scalar-tensor theories exhibit the so-called chameleon mechanism, whereby observational signatures of scalar fields are hidden by a combination of self-interactions and interactions with ambient matter. Not all scalar-tensor theories exhibit such a chameleon mechanism, which has been originally found in models with inverse power run-away potentials and field independent couplings to matter. In this paper we investigate field-theories with field-dependent couplings and a power-law potential for the scalar field. We show that the theory indeed is a chameleon field theory. We find the thin-shell solution for a spherical body and investigate the consequences for E\"ot-Wash experiments, fifth-force searches and Casimir force experiments. Requiring that the scalar-field evades gravitational tests, we find that the coupling is sensitive to a mass-scale which is of order of the Hubble scale today.Comment: 17 pages, 20 figure

Free Energies of Isolated 5- and 7-fold Disclinations in Hexatic Membranes

We examine the shapes and energies of 5- and 7-fold disclinations in low-temperature hexatic membranes. These defects buckle at different values of the ratio of the bending rigidity, $\kappa$, to the hexatic stiffness constant, $K_A$, suggesting {\em two} distinct Kosterlitz-Thouless defect proliferation temperatures. Seven-fold disclinations are studied in detail numerically for arbitrary $\kappa/K_A$. We argue that thermal fluctuations always drive $\kappa/K_A$ into an ``unbuckled'' regime at long wavelengths, so that disclinations should, in fact, proliferate at the {\em same} critical temperature. We show analytically that both types of defects have power law shapes with continuously variable exponents in the ``unbuckled'' regime. Thermal fluctuations then lock in specific power laws at long wavelengths, which we calculate for 5- and 7-fold defects at low temperatures.Comment: LaTeX format. 17 pages. To appear in Phys. Rev.

On the Exact Space Complexity of Sketching and Streaming Small Norms

We settle the 1-pass space complexity of $(1 \pm \epsilon)$-approximating the $L_p$ norm, for real p with 1 ≤ p ≤ 2, of a length-n vector updated in a length-m stream with updates to its coordinates. We assume the updates are integers in the range [–M, M]. In particular, we show the space required is $\Theta(\epsilon^{−2} log(mM) + log log(n))$ bits. Our result also holds for 0 < p < 1; although $L_p$ is not a norm in this case, it remains a well-defined function. Our upper bound improves upon previous algorithms of [Indyk, JACM ‘06] and [Li, SODA ‘08]. This improvement comes from showing an improved derandomization of the $L_p$ sketch of Indyk by using k-wise independence for small k, as opposed to using the heavy hammer of a generic pseudorandom generator against space-bounded computation such as Nisan's PRG. Our lower bound improves upon previous work of [Alon-Matias-Szegedy, JCSS ‘99] and [Woodruff, SODA ‘04], and is based on showing a direct sum property for the 1-way communication of the gap-Hamming problem.Engineering and Applied Science

Unzipping Vortices in Type-II Superconductors

The unzipping of vortex lines using magnetic-force microscopy from extended defects is studied theoretically. We study both the unzipping isolated vortex from common defects, such as columnar pins and twin-planes, and the unzipping of a vortex from a plane in the presence of other vortices. We show, using analytic and numerical methods, that the universal properties of the unzipping transition of a single vortex depend only on the dimensionality of the defect in the presence and absence of disorder. For the unzipping of a vortex from a plane populated with many vortices is shown to be very sensitive to the properties of the vortices in the two-dimensional plane. In particular such unzipping experiments can be used to measure the ``Luttinger liquid parameter'' of the vortices in the plane. In addition we suggest a method for measuring the line tension of the vortex directly using the experiments.Comment: 19 pages 15 figure

Entropy of Folding of the Triangular Lattice

The problem of counting the different ways of folding the planar triangular lattice is shown to be equivalent to that of counting the possible 3-colorings of its bonds, a dual version of the 3-coloring problem of the hexagonal lattice solved by Baxter. The folding entropy Log q per triangle is thus given by Baxter's formula q=sqrt(3)(Gamma[1/3])^(3/2)/2pi =1.2087...Comment: 9 pages, harvmac, epsf, uuencoded, 5 figures included, Saclay preprint T/9401

Anomalous coupling between topological defects and curvature

We investigate a counterintuitive geometric interaction between defects and curvature in thin layers of superfluids, superconductors and liquid crystals deposited on curved surfaces. Each defect feels a geometric potential whose functional form is determined only by the shape of the surface, but whose sign and strength depend on the transformation properties of the order parameter. For superfluids and superconductors, the strength of this interaction is proportional to the square of the charge and causes all defects to be repelled (attracted) by regions of positive (negative) Gaussian curvature. For liquid crystals in the one elastic constant approximation, charges between 0 and $4\pi$ are attracted by regions of positive curvature while all other charges are repelled.Comment: 5 pages, 4 figures, minor changes, accepted for publication in Phys. Rev. Let

Patterned Geometries and Hydrodynamics at the Vortex Bose Glass Transition

Patterned irradiation of cuprate superconductors with columnar defects allows a new generation of experiments which can probe the properties of vortex liquids by confining them to controlled geometries. Here we show that an analysis of such experiments that combines an inhomogeneous Bose glass scaling theory with the hydrodynamic description of viscous flow of vortex liquids can be used to infer the critical behavior near the Bose glass transition. The shear viscosity is predicted to diverge as $|T-T_{BG}|^{-z}$ at the Bose glass transition, with $z\simeq 6$ the dynamical critical exponent.Comment: 5 pages, 4 figure

Longitudinal Current Dissipation in Bose-glass Superconductors

A scaling theory of vortex motion in Bose glass superconductors with currents parallel to the common direction of the magnetic field and columnar defects is presented. Above the Bose-glass transition the longitudinal DC resistivity $\rho_{||}(T)\sim (T-T_{BG})^{\nu' z'}$ vanishes much faster than the corresponding transverse resistivity $\rho_{\perp}(T)\sim (T-T_{BG})^{\nu' (z'-2)}$, thus {\it reversing} the usual anisotropy of electrical transport in the normal state of layered superconductors. In the presence of a current $\bf J$ at an angle $\theta_J$ with the common field and columnar defect axis, the electric field angle $\theta_E$ approaches $\pi/2$ as $T\rightarrow T_{BG}^+$. Scaling also predicts the behavior of penetration depths for the AC currents as $T\rightarrow T_{BG}^-$, and implies a {\it jump discontinuity} at $T_{BG}$ in the superfluid density describing transport parallel to the columns.Comment: 5 pages, revte

Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams

In the communication problem $\mathbf{UR}$ (universal relation) [KRW95], Alice and Bob respectively receive $x, y \in\{0,1\}^n$ with the promise that $x\neq y$. The last player to receive a message must output an index $i$ such that $x_i\neq y_i$. We prove that the randomized one-way communication complexity of this problem in the public coin model is exactly $\Theta(\min\{n,\log(1/\delta)\log^2(\frac n{\log(1/\delta)})\})$ for failure probability $\delta$. Our lower bound holds even if promised $\mathop{support}(y)\subset \mathop{support}(x)$. As a corollary, we obtain optimal lower bounds for $\ell_p$-sampling in strict turnstile streams for $0\le p < 2$, as well as for the problem of finding duplicates in a stream. Our lower bounds do not need to use large weights, and hold even if promised $x\in\{0,1\}^n$ at all points in the stream. We give two different proofs of our main result. The first proof demonstrates that any algorithm $\mathcal A$ solving sampling problems in turnstile streams in low memory can be used to encode subsets of $[n]$ of certain sizes into a number of bits below the information theoretic minimum. Our encoder makes adaptive queries to $\mathcal A$ throughout its execution, but done carefully so as to not violate correctness. This is accomplished by injecting random noise into the encoder's interactions with $\mathcal A$, which is loosely motivated by techniques in differential privacy. Our second proof is via a novel randomized reduction from Augmented Indexing [MNSW98] which needs to interact with $\mathcal A$ adaptively. To handle the adaptivity we identify certain likely interaction patterns and union bound over them to guarantee correct interaction on all of them. To guarantee correctness, it is important that the interaction hides some of its randomness from $\mathcal A$ in the reduction.Comment: merge of arXiv:1703.08139 and of work of Kapralov, Woodruff, and Yahyazade