13,676 research outputs found
Using Elimination Theory to construct Rigid Matrices
The rigidity of a matrix A for target rank r is the minimum number of entries
of A that must be changed to ensure that the rank of the altered matrix is at
most r. Since its introduction by Valiant (1977), rigidity and similar
rank-robustness functions of matrices have found numerous applications in
circuit complexity, communication complexity, and learning complexity. Almost
all nxn matrices over an infinite field have a rigidity of (n-r)^2. It is a
long-standing open question to construct infinite families of explicit matrices
even with superlinear rigidity when r = Omega(n).
In this paper, we construct an infinite family of complex matrices with the
largest possible, i.e., (n-r)^2, rigidity. The entries of an n x n matrix in
this family are distinct primitive roots of unity of orders roughly exp(n^2 log
n). To the best of our knowledge, this is the first family of concrete (but not
entirely explicit) matrices having maximal rigidity and a succinct algebraic
description.
Our construction is based on elimination theory of polynomial ideals. In
particular, we use results on the existence of polynomials in elimination
ideals with effective degree upper bounds (effective Nullstellensatz). Using
elementary algebraic geometry, we prove that the dimension of the affine
variety of matrices of rigidity at most k is exactly n^2-(n-r)^2+k. Finally, we
use elimination theory to examine whether the rigidity function is
semi-continuous.Comment: 25 Pages, minor typos correcte
Learning Algebraic Varieties from Samples
We seek to determine a real algebraic variety from a fixed finite subset of
points. Existing methods are studied and new methods are developed. Our focus
lies on aspects of topology and algebraic geometry, such as dimension and
defining polynomials. All algorithms are tested on a range of datasets and made
available in a Julia package
Learning probability distributions generated by finite-state machines
We review methods for inference of probability distributions generated by probabilistic automata and related models for sequence generation. We focus on methods that can be proved to learn in the inference
in the limit and PAC formal models. The methods we review are state merging and state splitting methods for probabilistic deterministic automata and the recently developed spectral method for nondeterministic probabilistic automata. In both cases, we derive them from a high-level algorithm described in terms of the Hankel matrix of the distribution to be learned, given as an oracle, and then describe how to adapt that algorithm to account for the error introduced by a finite sample.Peer ReviewedPostprint (author's final draft
Locality for quantum systems on graphs depends on the number field
Adapting a definition of Aaronson and Ambainis [Theory Comput. 1 (2005),
47--79], we call a quantum dynamics on a digraph "saturated Z-local" if the
nonzero transition amplitudes specifying the unitary evolution are in exact
correspondence with the directed edges (including loops) of the digraph. This
idea appears recurrently in a variety of contexts including angular momentum,
quantum chaos, and combinatorial matrix theory. Complete characterization of
the digraph properties that allow such a process to exist is a long-standing
open question that can also be formulated in terms of minimum rank problems. We
prove that saturated Z-local dynamics involving complex amplitudes occur on a
proper superset of the digraphs that allow restriction to the real numbers or,
even further, the rationals. Consequently, among these fields, complex numbers
guarantee the largest possible choice of topologies supporting a discrete
quantum evolution. A similar construction separates complex numbers from the
skew field of quaternions. The result proposes a concrete ground for
distinguishing between complex and quaternionic quantum mechanics.Comment: 9 page
- …