Equivalence of Systematic Linear Data Structures and Matrix Rigidity

Recently, Dvir, Golovnev, and Weinstein have shown that sufficiently strong lower bounds for linear data structures would imply new bounds for rigid matrices. However, their result utilizes an algorithm that requires an $NP$ oracle, and hence, the rigid matrices are not explicit. In this work, we derive an equivalence between rigidity and the systematic linear model of data structures. For the $n$-dimensional inner product problem with $m$ queries, we prove that lower bounds on the query time imply rigidity lower bounds for the query set itself. In particular, an explicit lower bound of $\omega\left(\frac{n}{r}\log m\right)$ for $r$ redundant storage bits would yield better rigidity parameters than the best bounds due to Alon, Panigrahy, and Yekhanin. We also prove a converse result, showing that rigid matrices directly correspond to hard query sets for the systematic linear model. As an application, we prove that the set of vectors obtained from rank one binary matrices is rigid with parameters matching the known results for explicit sets. This implies that the vector-matrix-vector problem requires query time $\Omega(n^{3/2}/r)$ for redundancy $r \geq \sqrt{n}$ in the systematic linear model, improving a result of Chakraborty, Kamma, and Larsen. Finally, we prove a cell probe lower bound for the vector-matrix-vector problem in the high error regime, improving a result of Chattopadhyay, Kouck\'{y}, Loff, and Mukhopadhyay.Comment: 23 pages, 1 tabl

Random Matrix Theory and Classical Statistical Mechanics. I. Vertex Models

A connection between integrability properties and general statistical properties of the spectra of symmetric transfer matrices of the asymmetric eight-vertex model is studied using random matrix theory (eigenvalue spacing distribution and spectral rigidity). For Yang-Baxter integrable cases, including free-fermion solutions, we have found a Poissonian behavior, whereas level repulsion close to the Wigner distribution is found for non-integrable models. For the asymmetric eight-vertex model, however, the level repulsion can also disappearand the Poisson distribution be recovered on (non Yang--Baxter integrable) algebraic varieties, the so-called disorder varieties. We also present an infinite set of algebraic varieties which are stable under the action of an infinite discrete symmetry group of the parameter space. These varieties are possible loci for free parafermions. Using our numerical criterion we have tested the generic calculability of the model on these algebraic varieties.Comment: 25 pages, 7 PostScript Figure

Hopf algebras and finite tensor categories in conformal field theory

In conformal field theory the understanding of correlation functions can be divided into two distinct conceptual levels: The analytic properties of the correlators endow the representation categories of the underlying chiral symmetry algebras with additional structure, which in suitable cases is the one of a finite tensor category. The problem of specifying the correlators can then be encoded in algebraic structure internal to those categories. After reviewing results for conformal field theories for which these representation categories are semisimple, we explain what is known about representation categories of chiral symmetry algebras that are not semisimple. We focus on generalizations of the Verlinde formula, for which certain finite-dimensional complex Hopf algebras are used as a tool, and on the structural importance of the presence of a Hopf algebra internal to finite tensor categories.Comment: 46 pages, several figures. v2: missing text added after (4.5), references added, and a few minor changes. v3: typos corrected, bibliography update

Expansive Motions and the Polytope of Pointed Pseudo-Triangulations

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of the point set and whose edges are flips of interior pseudo-triangulation edges. For points in convex position we obtain a new realization of the associahedron, i.e., a geometric representation of the set of triangulations of an n-gon, or of the set of binary trees on n vertices, or of many other combinatorial objects that are counted by the Catalan numbers. By considering the 1-dimensional version of the polytope of constrained expansive motions we obtain a second distinct realization of the associahedron as a perturbation of the positive cell in a Coxeter arrangement. Our methods produce as a by-product a new proof that every simple polygon or polygonal arc in the plane has expansive motions, a key step in the proofs of the Carpenter's Rule Theorem by Connelly, Demaine and Rote (2000) and by Streinu (2000).Comment: 40 pages, 7 figures. Changes from v1: added some comments (specially to the "Further remarks" in Section 5) + changed to final book format. This version is to appear in "Discrete and Computational Geometry -- The Goodman-Pollack Festschrift" (B. Aronov, S. Basu, J. Pach, M. Sharir, eds), series "Algorithms and Combinatorics", Springer Verlag, Berli

The tensor structure on the representation category of the Wp\mathcal{W}_p triplet algebra

We study the braided monoidal structure that the fusion product induces on the abelian category $\mathcal{W}_p$-mod, the category of representations of the triplet $W$-algebra $\mathcal{W}_p$. The $\mathcal{W}_p$-algebras are a family of vertex operator algebras that form the simplest known examples of symmetry algebras of logarithmic conformal field theories. We formalise the methods for computing fusion products, developed by Nahm, Gaberdiel and Kausch, that are widely used in the physics literature and illustrate a systematic approach to calculating fusion products in non-semi-simple representation categories. We apply these methods to the braided monoidal structure of $\mathcal{W}_p$-mod, previously constructed by Huang, Lepowsky and Zhang, to prove that this braided monoidal structure is rigid. The rigidity of $\mathcal{W}_p$-mod allows us to prove explicit formulae for the fusion product on the set of all simple and all projective $\mathcal{W}_p$-modules, which were first conjectured by Fuchs, Hwang, Semikhatov and Tipunin; and Gaberdiel and Runkel.Comment: 58 pages; edit: added references and revisions according to referee reports. Version to appear on J. Phys.

Real and discrete holomorphy : Introduction to an algebraic approach

We consider spaces for which there is a notion of harmonicity for complex valued functions defined on them. For instance, this is the case of Riemannian manifolds on one hand, and (metric) graphs on the other hand. We observe that it is then possible to define an "amazing" notion of holomorphic functions on them, and show how rigid it is in some cases

Time Quasilattices in Dissipative Dynamical Systems

We establish the existence of `time quasilattices' as stable trajectories in dissipative dynamical systems. These tilings of the time axis, with two unit cells of different durations, can be generated as cuts through a periodic lattice spanned by two orthogonal directions of time. We show that there are precisely two admissible time quasilattices, which we term the infinite Pell and Clapeyron words, reached by a generalization of the period-doubling cascade. Finite Pell and Clapeyron words of increasing length provide systematic periodic approximations to time quasilattices which can be verified experimentally. The results apply to all systems featuring the universal sequence of periodic windows. We provide examples of discrete-time maps, and periodically-driven continuous-time dynamical systems. We identify quantum many-body systems in which time quasilattices develop rigidity via the interaction of many degrees of freedom, thus constituting dissipative discrete `time quasicrystals'.Comment: 38 pages, 14 figures. This version incorporates "Pell and Clapeyron Words as Stable Trajectories in Dynamical Systems", arXiv:1707.09333. Submission to SciPos