相关论文: Global residues for sparse polynomial systems

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Using Cayley trick, we define the notions of mixed toric residues and mixed Hessians associated with $r$ Laurent polynomials $f_1,...,f_r$.We conjecture that the values of mixed toric residues on the mixed Hessians are determined by mixed…

The algorithm of computing generalized Green functions of a finite reductive group contains some unkonwn scalars occuring from the F_q structure of irreducible local systems on unipotent classes on G. In this paper, we determine such…

We extend a result due to Bourgain on the uniform distribution of residues by proving that subsets of the type $f(I)\cdot H$ is equidistributed (as $p$ tends to infinity) where $f$ is a polynomial, $I$ is an interval of $\Fp$ and $H$ is an…

We study the set of common $\mathbb{F}_q$-rational solutions of "smooth" systems of multivariate symmetric polynomials with coefficients in a finite field $\mathbb{F}_q$. We show that, under certain conditions, the set of common solutions…

Sparse coding of images is traditionally done by cutting them into small patches and representing each patch individually over some dictionary given a pre-determined number of nonzero coefficients to use for each patch. In lack of a way to…

Based on the computation of a superset of the implicit support, implicitization of a parametrically given hyper-surface is reduced to computing the nullspace of a numeric matrix. Our approach exploits the sparseness of the given parametric…

We propose a fast greedy algorithm to compute sparse representations of signals from continuous dictionaries that are factorizable, i.e., with atoms that can be separated as a product of sub-atoms. Existing algorithms strongly reduce the…

Gelfond and Khovanskii found a formula for the sum of the values of a Laurent polynomial at the zeros of a system of n Laurent polynomials in the complex n-torus whose Newton polyhedra have generic mutual positions. An exponential change of…

Let $ \mathcal{A}_1, \ldots, \mathcal{A}_k $ be finite sets in $ \mathbb{Z}^n $ and let $ Y \subset (\mathbb{C}^*)^n $ be an algebraic variety defined by a system of equations \[ f_1 = \ldots = f_k = 0, \] where $ f_1, \ldots, f_k $ are…

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

Let $K$ be a finite field extension of $Q_p$ and let $G_K$ be its absolute Galois group. We construct the universal family of filtered $(\phi,N)$-modules, or (more generally) the universal family of $(\phi,N)$-modules with a Hodge-Pink…

Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…

We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that we choose the degrees randomly based on…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

In this paper, we will explicitly calculate Gauss sums for the general linear groups and the special linear groups over $\Bbb Z_n$, where $\Bbb Z_n=\Bbb Z/n \Bbb Z$ and $n>0$ is an integer. For $r$ being a positive integer, the formulae of…

In the theory of automorphic descents developed by Ginzburg, Rallis and Soudry in [GRS11], the structure of Fourier coefficients of the residual representations of certain special Eisenstein series plays important roles. Started from…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

In this paper, we study the Newton polytopes of $F$-polynomials in a TSSS cluster algebra $\mathcal A$ and generalize them to a larger set consisting of polytopes $N_{h}$ associated to vectors $h\in\Z^{n}$ as well as $\widehat{\mathcal{P}}$…