An algebraic method for computing N^(f)

DOI10.1016/J.TOPOL.2013.09.014zbMATH Open1281.55003OpenAlexW314177331MaRDI QIDQ386170FDOQ386170

Authors: Fida Moh'D 

Publication date: 9 December 2013

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.topol.2013.09.014

Recommendations

• On the Computation of An
• An algorithm of computing \(b\)-functions
• scientific article; zbMATH DE number 1380820
• An algebraic approach to the vector \(\varepsilon\)-algorithm
• The epsilon algorithm in a noncommutative algebra
• Algebraic methods to compute Mathieu functions
• An algorithm for computing an integral basis in an algebraic function field
• Newton's method and the computational complexity of the fundamental theorem of algebra
• scientific article; zbMATH DE number 1273654
• On the approximation to algebraic numbers by algebraic numbers

zbMATH Keywords

Riemannian manifoldcovering mapReidemeister representatives\(\epsilon\)-Nielsen theory

Mathematics Subject Classification ID

Coverings of curves, fundamental group (14H30) Fixed points and coincidences in algebraic topology (55M20)

Cites Work

• Title not available (Why is that?)
• Coincidence Nielsen numbers for covering maps for smooth manifolds
• Nielsen number of a covering map
• Lectures on Nielsen fixed point theory
• Title not available (Why is that?)
• Epsilon Nielsen fixed point theory
• Title not available (Why is that?)

Cited In (6)

• Why does the F_N-method work?
• The covering coincidence index and the covering Nielsen number
• Title not available (Why is that?)
• An algorithm to prove algebraic relations involving eta quotients
• Title not available (Why is that?)
• Epsilon Nielsen coincidence theory

This page was built for publication: An algebraic method for computing \(N^\epsilon(f)\)

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