Related papers: Rationalizability of square roots
We prove that hypersurfaces defined by irreducible square-free polynomials have rational singularities. As an easy consequence, we deduce that certain (possibly non-square-free) polynomials associated to pairs of square-free polynomials…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
A practical criterion for the irreducibility (with respect to integration by part identities) of a particular Feynman integral to a given set of integrals is presented. The irreducibility is shown to be related to the existence of stable…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
One-loop amplitudes are to a large extent determined by their unitarity cuts in four dimensions. We show that the remaining rational terms can be obtained from the ultraviolet behaviour of the amplitude, and determine universal form factors…
We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…
The hypergeometric function method naturally provides the analytic expressions of scalar integrals from concerned Feynman diagrams in some connected regions of independent kinematic variables, also presents the systems of homogeneous linear…
Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…
Necessary and sufficient conditions are obtained under which the numerator of the partial derivative of a rational function holomorphic in open upper poly-halfplane is the sum of squares of polynomials.
We investigate the behaviour of elliptic Feynman integrals under modular transformations. This has a practical motivation: Through a suitable modular transformation we can achieve that the nome squared is a small quantity, leading to fast…
Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…
Spinor polynomials are polynomials with coefficients in the even sub-algebra of conformal geometric algebra whose norm polynomial is real. They describe rational conformal motions. Factorizations of spinor polynomial corresponds to the…
It was observed that hyperlogarithms provide a tool to carry out Feynman integrals. So far, this method has been applied successfully to finite single-scale processes. However, it can be employed in more general situations. We give examples…