English
Related papers

Related papers: On Isolating Roots in a Multiple Field Extension

200 papers

We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…

Symbolic Computation · Computer Science 2024-09-11 Hoon Hong , Jing Yang

Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…

Numerical Analysis · Mathematics 2007-05-23 Anton Leykin , Jan Verschelde , Ailing Zhao

Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…

Information Theory · Computer Science 2016-08-16 Sian-Jheng Lin , Tareq Y. Al-Naffouri , Yunghsiang S. Han

We present a symbolic-numeric method to refine an approximate isolated singular solution $\hat{\mathbf{x}}=(\hat{x}_{1}, ..., \hat{x}_{n})$ of a polynomial system $F=\{f_1, ..., f_n\}$ when the Jacobian matrix of $F$ evaluated at…

Numerical Analysis · Mathematics 2012-12-20 Nan Li , Lihong Zhi

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

Classical Analysis and ODEs · Mathematics 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…

Symbolic Computation · Computer Science 2018-01-17 Javad Doliskani

We develop a theory of extensions of hyperfields that generalizes the notion of field extensions. Since hyperfields have a multivalued addition, we must consider two kinds of extensions that we call weak hyperfield extensions and strong…

Rings and Algebras · Mathematics 2019-12-13 Steven Creech

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

Classical Analysis and ODEs · Mathematics 2022-04-12 Reuben Wheeler

We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…

Symbolic Computation · Computer Science 2014-01-21 Yacine Bouzidi , Sylvain Lazard , Marc Pouget , Fabrice Rouillier

We investigate a trivariate polynomial associated with rooted trees. It generalises a bivariate polynomial for rooted trees that was recently introduced by Liu. We show that this polynomial satisfies a deletion-contraction recursion and can…

Combinatorics · Mathematics 2022-02-15 Valisoa Razanajatovo Misanantenaina , Stephan Wagner

Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…

Algebraic Geometry · Mathematics 2013-09-03 Osbert Bastani , Christopher J. Hillar , Dimitar Popov , J. Maurice Rojas

We completely classify Laurent series converging on the unit circle over a non-Archimedean local field (of any characteristic) that map infinitely many roots of unity to roots of unity. For a given Laurent series $f$ over a field of…

Number Theory · Mathematics 2026-01-06 Christoph Pütz

It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree $d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We prove in this paper the existence of infinitely many primes $q$ so that the given…

Number Theory · Mathematics 2023-05-22 Shubham Saha

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

Data Structures and Algorithms · Computer Science 2018-07-03 Matthew P. Johnson

The isolation intervals of the real roots of the real symbolic monic cubic polynomial $p(x) = x^3 + a x^2 + b x + c\,\,$ are found in terms of simple functions of the coefficients of the polynomial (such as: $-a$, $-a/3$, $-c/b$, $\pm…

General Mathematics · Mathematics 2022-06-15 Emil M. Prodanov

We classify rooted trees which have strictly unimodal q-polynomials (plucking polynomial). We also give criteria for a trapezoidal shape of a plucking polynomial. We generalize results of Pak and Panova on strict unimodality of q-binomial…

Combinatorics · Mathematics 2016-01-15 Zhiyun Cheng , Sujoy Mukherjee , Jozef H. Przytycki , Xiao Wang , Seung Yeop Yang

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

Algebraic Geometry · Mathematics 2012-05-10 Aleksandr Pukhlikov

The bivariate difference filed $(\mathbb{F}(\alpha, \beta), \sigma)$ provides an algebraic framework for a sequence satisfying a recurrence of order two and it could transform the summation involving a sequence satisfying a recurrence of…

Combinatorics · Mathematics 2024-01-23 Yarong Wei

We call an abelian variety over a finite field $\mathbb{F}_q$ super-isolated if its ($\mathbb{F}_q$-rational) isogeny class contains a single isomorphism class. In this paper, we use the Honda-Tate theorem to characterize super-isolated…

Number Theory · Mathematics 2019-02-13 Travis Scholl

This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called…

Number Theory · Mathematics 2008-02-01 Iskander Aliev , Chris Smyth