Zero counting for a class of univariate Pfaffian functions

DOI10.1016/J.JALGEBRA.2015.11.050zbMATH Open1354.14087arXiv1506.07406OpenAlexW2964248716MaRDI QIDQ5964515FDOQ5964515

Juan Sabia, María Laura Barbagallo, Gabriela Jeronimo

Publication date: 29 February 2016

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• Computing real roots of real polynomials
• Linear solving for sign determination
• Deciding polynomial-transcendental problems
• Complexity of cylindrical decompositions of sub-Pfaffian
• Finding irreducible components of some real transcendental varieties
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• The complexity of deciding consistency of systems of polynomials in exponent inequalities
• On the “Problem of the Last Root” for Exponential Terms
• On roots of exponential terms

Cited In (2)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Number of zeros of interval polynomials 👍 👎
• An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences 👍 👎
• Spécialisation de la suite de Sturm 👍 👎
• Consequences of Schanuel's condition for zeros of exponential terms 👍 👎
• NC algorithms for real algebraic numbers 👍 👎
• Undecidable arithmetic properties of solutions of Fredholm integral equations 👍 👎

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)