Related papers: An algorithmic Polynomial Freiman-Ruzsa theorem

We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let $\mathfrak{C}$ be a class of polynomial-size concepts, and suppose that $\mathfrak{C}$ can be PAC-learned with…

We present a new framework for the analysis and design of randomized algorithms for solving various types of linear systems, including consistent or inconsistent, full rank or rank-deficient. Our method is formulated with four randomized…

In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Using the Riesz-Feller fractional derivative, we apply the factorization algorithm to the fractional quantum harmonic oscillator along the lines previously proposed by Olivar-Romero and Rosas-Ortiz, extending their results. We solve the…

Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular…

Let $F(n,k)$ be a hypergeometric function that may be expressed so that $n$ appears within initial arguments of inverted Pochhammer symbols, as in factors of the form $\frac{1}{(n)_{k}}$. Only in exceptional cases is $F(n, k)$ such that…

We give reconstruction algorithms for subclasses of depth-3 arithmetic circuits. In particular, we obtain the first efficient algorithm for finding tensor rank, and an optimal tensor decomposition as a sum of rank-one tensors, when given…

We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…

In this paper we continue to study so called ``inverse Born's rule problem'': to construct representation of probabilistic data of any origin by a complex probability amplitude which matches Born's rule. The corresponding algorithm --…

For a Fermat quasi-homogeneous polynomial, we study the associated weighted Fan-Jarvis-Ruan-Witten theory with narrow insertions. We prove a wall-crossing formula in all genera via localization on a master space, which is constructed by…

A 2009 article of Allcock and Vaaler examined the vector space $\mathcal G := \overline{\mathbb Q}^\times/\overline{\mathbb Q}^\times_{\mathrm{tors}}$ over $\mathbb Q$, describing its completion with respect to the Weil height as a certain…

We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…

We study efficient algorithms for linear regression and covariance estimation in the absence of Gaussian assumptions on the underlying distributions of samples, making assumptions instead about only finitely-many moments. We focus on how…

We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Let K be a field of any characteristic and let R be an algebra generated by two elements satisfying quadratic equations. Then R is a homomorphic image of F=K<x,y | x^2+ax+b=0,y^2+cy+d=0> for suitable a,b,c,d in K. We establish that F can be…

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

An important objective in scheduling literature is to minimize the sum of weighted flow times. We are given a set of jobs where each job is characterized by a release time, a processing time, and a weight. Our goal is to find a preemptive…