Related papers: Global residues for sparse polynomial systems

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero,…

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

In this article we analyze the global diffeomorphism property of polynomial maps $F:\mathbb{R}^n\rightarrow\mathbb{R}^n$ by studying the properties of the Newton polytopes at infinity corresponding to the sum of squares polynomials…

We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the…

Generalized Fourier series with orthogonal polynomial bases have useful applications in several fields, including differential equations, pattern recognition, and image and signal processing. However, computing the generalized Fourier…

Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

In these notes, we explain residue formulae for volumes of convex polytopes, and for Ehrahrt polynomials based on the notion of total residue. We apply this method to the computation of the volume of the Chan-Robbins polytope. The final…

Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…

Let $X$ be the family of hypersurfaces in the odd-dimensional torus ${\mathbb T}^{2n+1}$ defined by a Laurent polynomial $f$ with fixed exponents and variable coefficients. We show that if $n\Delta$, the dilation of the Newton polytope…

In this note, we give explicit expressions of Gauss sums for general (resp. special) linear groups over finite fields, which involves Gauss sums (resp. Kloosterman sums). The key ingredient is averaging such sums over Borel subgroups. As…

In this survey, we give an overview of advances in the theory and computation of sparse resultants. First, we examine the construction and proof of the Canny-Emiris formula, which gives a rational determinantal formula. Second, we discuss…

We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…

We refine and extend a result by Tuitman on the supports of a Bezout identity satisfied by a finite sequence of sparse Laurent polynomials without common zeroes in the toric variety associated to their supports. When the number of these…

In our recent work \cite{StojnicCSetam09,StojnicUpper10} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a…

We investigate generalised polynomials (i.e. polynomial-like expressions involving the use of the floor function) which take the value $0$ on all integers except for a set of density $0$. Our main result is that the set of integers where a…

Complete residue systems play an integral role in abstract algebra and number theory, and a description is typically found in any number theory textbook. This note provides a concise overview of complete residue systems, including a robust…

We consider the {\it noisy polynomial interpolation problem\/} of recovering an unknown $s$-sparse polynomial $f(X)$ over the ring $\mathbb Z_{p^k}$ of residues modulo $p^k$, where $p$ is a small prime and $k$ is a large integer parameter,…

We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of…