Related papers: Global residues for sparse polynomial systems

In this paper we present an algorithm that computes the genus of a global function field. Let F/k be function field over a field k, and let k0 be the full constant field of F/k. By using lattices over subrings of F, we can express the genus…

A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…

Recent work has used deep learning to derive symmetry transformations, which preserve conserved quantities, and to obtain the corresponding algebras of generators. In this letter, we extend this technique to derive sparse representations of…

Given a "black box" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine…

In this paper, we develop a new Randomized Global Generalized Minimum Residual (RGlGMRES) algorithm for efficiently computing solutions to large scale linear systems with multiple right hand sides.The proposed method builds on a recently…

We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…

In this paper, the concept of sparse difference resultant for a Laurent transformally essential system of difference polynomials is introduced and a simple criterion for the existence of sparse difference resultant is given. The concept of…

Let $R_\Delta (f_1,\ldots,f_{n+1})$ be the {\it $\Delta$-resultant} (see below) of $(n+1)$-tuple of Laurent polynomials. We provide an algorithm for computing $R_\Delta$ assuming that an $n$-tuple $(f_2,\dots,f_{n+1})$ is {\it developed}…

Let $\mathbb{F}_{q}$ denote the finite field of order $q$ (a power of a prime $p$). We study the $p$-adic valuations for zeros of $L$-functions associated with exponential sums of the following family of Laurent polynomials…

This paper provides a realization of all classical and most exceptional finite groups of Lie type as Galois groups over function fields over F_q and derives explicit additive polynomials for the extensions. Our unified approach is based on…

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…

Finite element methods require the composition of the global stiffness matrix from local finite element contributions. The composition process combines the computation of element stiffness matrices and their assembly into the global…

In this paper, we derive an explicit combinatorial formula for the number of $k$-subset sums of quadratic residues over finite fields.

We associate to any convenient nondegenerate Laurent polynomial on the complex torus (C^*)^n a canonical Frobenius-Saito structure on the base space of its universal unfolding. According to the method of K. Saito (primitive forms) and of M.…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…

A positive definite matrix is called logarithmically sparse if its matrix logarithm has many zero entries. Such matrices play a significant role in high-dimensional statistics and semidefinite optimization. In this paper, logarithmically…

Multivariate residues appear in many different contexts in theoretical physics and algebraic geometry. In theoretical physics, they for example give the proper definition of generalized-unitarity cuts, and they play a central role in the…

Grothendieck local residue is considered in the context of symbolic computation. Based on the theory of holonomic D-modules, an effective method is proposed for computing Grothendieck local residues. The key is the notion of Noether…

The paper consist of two parts. In the first part we introduce flags of lattices and associated injective systems of (non-normal) cones and projective systems of (non-normal) affine toric varieties. We study the associated field of…