Related papers: Global residues for sparse polynomial systems
The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…
We compute the $\delta$-invariant of a curve singularity parameterized by generic sparse polynomials. We apply this to describe topological types of generic singularities of sparse resultants and ``algebraic knot diagrams'' (i.e. generic…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
Let $G$ be a split reductive group over a number field $F$. We consider the computation of the inner product of two $K$-spherical pseudo Eisenstein series of $G$ supported in $[T,\mathcal{O}(1)]$ by means of residues, following a classical…
Grothendieck point residue is considered in the context of computational complex analysis. A new effective method is proposed for computing Grothendieck point residues mappings and residues. Basic ideas of our approach are the use of…
In this paper, we propose two new deterministic interpolation algorithms for a sparse multivariate polynomial given as a standard black-box by introducing new Kronecker type substitutions. Let $f\in \RB[x_1,\dots,x_n]$ be a sparse black-box…
We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…
Using the general framework of polynomial representations defined by Doty and generalizing the definition given by Doty, Nakano and Peters for $G = \mathrm{GL}_n$, we consider polynomial representations of $G_r T$ for an arbitrary closed…
We show a residues formula for maps generically transversal to regular holomorphic distributions.
The sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis, and sparse canonical correlation analysis.…
Given a zero-dimensional ideal I in K[x1,...,xn] of degree D, the transformation of the ordering of its Groebner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…
In this paper, we study iterative methods on the coefficients of the rational univariate representation (RUR) of a given algebraic set, called global Newton iteration. We compare two natural approaches to define locally quadratically…
In this note, we derive explicitly the local relative trace formula for the symmetric space F*\SL(2,F) at the level of Lie algebras, where F is a p-adic field of residue characteristic greater than two and F* is the set of invertible…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
This paper investigates the cost of solving systems of sparse polynomial equations by homotopy continuation. First, a space of systems of $n$-variate polynomial equations is specified through $n$ monomial bases. The natural locus for the…
A level graph is the data of a pair $(G,\pi)$ consisting of a finite graph $G$ and an ordered partition $\pi$ on the set of vertices of $G$. To each level graph on $n$ vertices we associate a polytope in $\mathbb R^n$ called its residue…
We first present a filtration on the ring L of Laurent polynomials such that the direct sum decomposition of its associated graded ring gr L agrees with the direct sum decomposition of gr L, as a module over the complex general linear Lie…
We give formal normal forms for parabolic logarithmic transseries $f=z+\cdots \, $, with respect to parabolic logarithmic normalizations. Normalizations are given algorithmically, using fixed point theorems, as limits of Picard's sequences…
We present a novel, general, and unifying point of view on sparse approaches to polynomial optimization. Solving polynomial optimization problems to global optimality is a ubiquitous challenge in many areas of science and engineering.…