Zero counting for a class of univariate Pfaffian functions

DOI10.1016/J.JALGEBRA.2015.11.050MaRDI QIDQ5964515zbMATH OpenOpenAlexFDO

Authors María Laura Barbagallo, Gabriela Jeronimo, Juan Sabia

Publication date 29 February 2016

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.07406

zbMATH Keywords

complexitySturm sequencesPfaffian functionszero counting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Rationally connected varieties (14M22) Derivations and commutative rings (13N15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Abstract: We present a new procedure to count the number of real zeros of a class of univariate Pfaffian functions of order $1$. The procedure is based on the construction of Sturm sequences for these functions and relies on an oracle for sign determination. In the particular case of $E$-polynomials, we design an oracle-free effective algorithm solving this task within exponential complexity. In addition, we give an explicit upper bound for the absolute value of the real zeros of an $E$-polynomial.

Recommendations

• An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences
• Publication:3201649
• NC algorithms for real algebraic numbers
• scientific article; zbMATH DE number 1767709
• scientific article; zbMATH DE number 3882548
• Number of zeros of interval polynomials
• Spécialisation de la suite de Sturm
• Consequences of Schanuel's condition for zeros of exponential terms
• scientific article; zbMATH DE number 177885
• Undecidable arithmetic properties of solutions of Fredholm integral equations

Cites work

• scientific article; zbMATH DE number 3908819 (Why is no real title available?)
• scientific article; zbMATH DE number 49991 (Why is no real title available?)
• scientific article; zbMATH DE number 3603368 (Why is no real title available?)
• scientific article; zbMATH DE number 1262451 (Why is no real title available?)
• scientific article; zbMATH DE number 1273671 (Why is no real title available?)
• scientific article; zbMATH DE number 1296286 (Why is no real title available?)
• scientific article; zbMATH DE number 1169378 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 3999284 (Why is no real title available?)
• Algorithms in real algebraic geometry
• Complexity of cylindrical decompositions of sub-Pfaffian
• Computing real roots of real polynomials
• Deciding polynomial-transcendental problems
• Finding irreducible components of some real transcendental varieties
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• Linear solving for sign determination
• On roots of exponential terms
• On the “Problem of the Last Root” for Exponential Terms
• The complexity of deciding consistency of systems of polynomials in exponent inequalities

Cited in

(2)

• Decision problem for a class of univariate Pfaffian functions
• On the zeros of univariate E-polynomials

This page was built for publication: Zero counting for a class of univariate Pfaffian functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964515)