Related papers: Grothendieck inequalities characterize converses t…

We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…

The FC-Gram algorithm approximates non-periodic functions to high order by constructing a periodic extension with controlled boundary behavior and applying trigonometric interpolation. In this paper we introduce a generalized FC-Gram…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…

We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm allows us to approximate in randomized…

Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

We use Grothendieck theorem to prove a structure theorem for multicorrelation sequences of length two, associated with two (not necessarily commuting) measure preserving actions on a probability space. We use this to deduce a multiple…

We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…

With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of…

We prove sharp $L^p-L^q$ estimates for averaging operators along general polynomial curves in two and three dimensions. These operators are translation-invariant, given by convolution with the so-called affine arclength measure of the curve…

Everettian Quantum Mechanics, or the Many Worlds Interpretation, lacks an explanation for quantum probabilities. We show that the values given by the Born rule equal projection factors, describing the contraction of Lebesgue measures in…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

Littlewood-Richardson, Kronecker and plethysm coefficients are fundamental multiplicities of interest in Representation Theory and Algebraic Combinatorics. Determining a combinatorial interpretation for the Kronecker and plethysm…

Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…

Orthogonal polynomial approximations form the foundation to a set of well-established methods for uncertainty quantification known as polynomial chaos. These approximations deliver models for emulating physical systems in a variety of…