Related papers: Rationalizability of square roots
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…
Landau's work on the singularities of Feynman diagrams suggests that they can only be of three types: either poles, logarithmic divergences, or the roots of quadratic polynomials. On the other hand, many Feynman integrals exist whose…
In multicentric calculus one takes a polynomial $p$ with distinct roots as a new variable and represents complex valued functions by $\mathbb C^d$-valued functions, where $d$ is the degree of $p$. An application is e.g. the possibility to…
The Fast Reciprocal Square Root Algorithm is a well-established approximation technique consisting of two stages: first, a coarse approximation is obtained by manipulating the bit pattern of the floating point argument using integer…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
We describe a strategy to solve differential equations for Feynman integrals by powers series expansions near singular points and to obtain high precision results for the corresponding master integrals. We consider Feynman integrals with…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We give two elementary proofs, at a level understandable by students with only pre-calculus knowledge of Algebra, of the well known fact that an irreducible irrational n-th root of a positive rational number cannot be solution of a…
The standard procedure when evaluating integrals of a given family of Feynman integrals, corresponding to some Feynman graph, is to construct an algorithm which provides the possibility to write any particular integral as a linear…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…
The classical approach of solvability using group theory is well known and one original motivation is to solve polynomials by radicals. Radicals are square, cube, square root, cube root etc of the original coefficients for the polynomial. A…
The Zippel algorithm performs a rational reconstruction of multivariate polynomials and aims specifically at the sparse case. It is applied in different fields of science, lately becoming an important step in Feynman integral reduction in…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…
We clarify the question whether for a smooth curve of polynomials one can choose the roots smoothly and related questions. Applications to perturbation theory of operators are given.
We show that direct Feynman-parametric loop integration is possible for a large class of planar multi-loop integrals. Much of this follows from the existence of manifestly dual-conformal Feynman-parametric representations of planar loop…
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…
This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that…
The mathematical formalism necessary for the diagramatic evaluation of quantum corrections to a conformally invariant field theory for a self-interacting scalar field on a curved manifold with boundary is considered. The evaluation of…