English
Related papers

Related papers: Low rank approximation of polynomials

200 papers

In the first part of this paper we give a precise description of all the minimal decompositions of any bi-homogeneous polynomial $p$ (i.e. a partially symmetric tensor of $S^{d_1}V_1\otimes S^{d_2}V_2$ where $V_1,V_2$ are two complex,…

Algebraic Geometry · Mathematics 2016-06-14 Edoardo Ballico , Alessandra Bernardi

Let $p$ be a homogeneous polynomial of degree $n$ in $n$ variables, $p(z_1,...,z_n) = p(Z)$, $Z \in C^{n}$. We call such a polynomial $p$ {\bf H-Stable} if $p(z_1,...,z_n) \neq 0$ provided the real parts $Re(z_i) > 0, 1 \leq i \leq n$. This…

Combinatorics · Mathematics 2008-05-14 Leonid Gurvits

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

Number Theory · Mathematics 2018-04-05 Kevin Chen , Jianqiang Zhao

We introduce and study the problem of consistent low-rank approximation, in which rows of an input matrix $\mathbf{A}\in\mathbb{R}^{n\times d}$ arrive sequentially and the goal is to provide a sequence of subspaces that well-approximate the…

Data Structures and Algorithms · Computer Science 2026-03-03 David P. Woodruff , Samson Zhou

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

Symbolic Computation · Computer Science 2017-12-13 Mark Giesbrecht , Joseph Haraldson , George Labahn

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

Classical Analysis and ODEs · Mathematics 2009-10-23 F. Balogh , M. Bertola

Let $X$ be an isotropic random vector in $R^d$ that satisfies that for every $v \in S^{d-1}$, $\|<X,v>\|_{L_q} \leq L \|<X,v>\|_{L_p}$ for some $q \geq 2p$. We show that for $0<\varepsilon<1$, a set of $N = c(p,q,\varepsilon) d$ random…

Probability · Mathematics 2020-08-20 Shahar Mendelson

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

Combinatorics · Mathematics 2007-05-23 Thomas W. Cusick , Yuan Li , Pantelimon Stanica

The first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev $p$-norm ($1<p<\infty$) for the case $p=1$. Some relevant examples are indicated. The second part deals…

Complex Variables · Mathematics 2021-12-17 Abel Díaz-González , Héctor Pijeira-Cabrera , Javier Quintero-Roba

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…

Metric Geometry · Mathematics 2007-09-14 Gennadiy Averkov , Martin Henk

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

Algebraic Geometry · Mathematics 2009-06-25 Gabriela Jeronimo , Daniel Perrucci

Low-rank approximations of data matrices are an important dimensionality reduction tool in machine learning and regression analysis. We consider the case of categorical variables, where it can be formulated as the problem of finding…

Machine Learning · Computer Science 2018-03-14 Reka Kovacs , Oktay Gunluk , Raphael Hauser

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

Combinatorics · Mathematics 2007-05-23 Leonid Gurvits

Let $p(x_1,...,x_n) =\sum_{(r_1,...,r_n) \in I_{n,n}} a_{(r_1,...,r_n)} \prod_{1 \leq i \leq n} x_{i}^{r_{i}}$ be homogeneous polynomial of degree $n$ in $n$ real variables with integer nonnegative coefficients. The support of such…

Combinatorics · Mathematics 2007-05-23 Leonid Gurvits

An $(n,k)$-Poisson Multinomial Distribution (PMD) is the distribution of the sum of $n$ independent random vectors supported on the set ${\cal B}_k=\{e_1,\ldots,e_k\}$ of standard basis vectors in $\mathbb{R}^k$. We prove a structural…

Data Structures and Algorithms · Computer Science 2015-11-24 Constantinos Daskalakis , Gautam Kamath , Christos Tzamos

Let $K$ be a closed polydisc or ball in $\C^n$, and let $Y$ be a quasi projective algebraic manifold which is Zariski locally equivalent to $\C^p$, or a complement of an algebraic subvariety of codimension $\ge 2$ in such manifold. If $r$…

Complex Variables · Mathematics 2007-05-23 Kolarič Dejan

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

Probability · Mathematics 2023-07-13 Brett Leroux

Let F be any field. Let p(F) be the characteristic of F if F is not of characteristic zero, and let p(F)=+\infty otherwise. Let A_1,...,A_n be finite nonempty subsets of F, and let $$f(x_1,...,x_n)=a_1x_1^k+...+a_nx_n^k+g(x_1,...,x_n)\in…

Number Theory · Mathematics 2008-04-02 Zhi-Wei Sun