Related papers: Global residues for sparse polynomial systems

The ring R of real-exponent polynomials in n variables over any field has global dimension n+1 and flat dimension n. In particular, the residue field k = R/m of R modulo its maximal graded ideal m has flat dimension n via a Koszul-like…

Using Bochner-Martinelli type residual currents we prove some generalizations of Jacobi's Residue Formula, which allow proper polynomial maps to have `common zeroes at infinity', in projective or toric situations.

One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…

In this paper, we consider an extension of Jacobi's symbol, the so called rational $2^k$-th power residue symbol. In Section 3, we prove a novel generalization of Zolotarev's lemma. In Sections 4, 5 and 6, we show that several hard…

The concept of scattered polynomials is generalized to those of exceptional scattered sequences which are shown to be the natural algebraic counterpart of $\mathbb{F}_{q^n}$-linear MRD codes. The first infinite family in the first…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

A fast algorithm for the approximation of a low rank LU decomposition is presented. In order to achieve a low complexity, the algorithm uses sparse random projections combined with FFT-based random projections. The asymptotic approximation…

We prove that the monodromy group of a reduced irreducible square system of general polynomial equations equals the symmetric group. This is a natural first step towards the Galois theory of general systems of polynomial equations, because…

We introduce a universal weight system (a function on chord diagrams satisfying the $4$-term relation) taking values in the ring of polynomials in infinitely many variables whose particular specializations are weight systems associated with…

We propose a novel method for establishing the sparsity of the coefficients of the Laguerre generalized polynomial chaos expansion of solutions to parametric elliptic PDEs with log-gamma inputs on $\mathbb{R}_+^\infty$. The established…

We examine maximal unitarity in the nonplanar case and derive remarkably compact analytic expressions for coefficients of master integrals with two-loop crossed box topology in massless four-point amplitudes in any gauge theory, thereby…

We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem and Eigenvector…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

We prove that every mapping torus of any free group endomorphism is residually finite. We show how to use a not yet published result of E. Hrushovski to extend our result to arbitrary linear groups. The proof uses algebraic self-maps of…

We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral…

In this paper we investigate the intrinsic sequential time complexity of universal elimination procedures for arbitrary continuous data structures encoding input and output objects of elimination theory (i.e. polynomial equation systems)…

In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for…

In this paper we consider the following sparse recovery problem. We have query access to a vector $\vx \in \R^N$ such that $\vhx = \vF \vx$ is $k$-sparse (or nearly $k$-sparse) for some orthogonal transform $\vF$. The goal is to output an…

In the present paper, the simplest scalar ODE case is studied for polynomials $$ \dot{w}=f(w)=(w-e_0)\cdot\ldots\cdot(w-e_{d-1}) $$ of degree $d$ with $d$ simple complex zeros. The explicit solution by separation of variables and explicit…

A new summation method is introduced to convert a relatively wide family of infinite sums and local expansions into integrals. The integral representations yield global information such as analytic continuability, position of singularities,…