The general quasi-order algorithm in number theory

DOI10.1155/S0161171286000297MaRDI QIDQ1075347zbMATH OpenOpenAlexFDO

Authors Jean Pedersen, Peter Hilton

Publication date 1986

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46055

zbMATH Keywords

algorithmpaper foldingpolygonquasi-order

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Radix representation; digital problems (11A63)

Review text

Summary: This paper deals with a generalization of the binary quasi-order theorem. This generalization involves a more complicated algorithm than in the previous papers [Publ., Secc. Mat., Univ. Autòn. Barc. 29, No.1, 31-64 (1985; Zbl 0583.51017); No.2/3, 123-144 (1985; see the preceding review)]. Some remarks are made on relative merits of two dual algorithms called the \(\psi\)-algorithm and the \(\phi\)-algorithm. Some illustrative examples are given.

Recommendations

• scientific article; zbMATH DE number 4132307
• scientific article; zbMATH DE number 733559
• Algorithms for the Quillen-Suslin theorem
• Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
• On Zeilberger's algorithm and its \(q\)-analogue
• A new algorithm for the Quillen-Suslin theorem
• Quasi-gcd computations
• Algorithms for generalized numerical semigroups
• Algorithms in Algebraic Number Theory

Cited in

(5)

• The order of Appel's algorithm
• A new algorithm for the Quillen-Suslin theorem
• scientific article; zbMATH DE number 3950604 (Why is no real title available?)
• Calculating the mislin genus for a certain family of nilpotent groups
• On the computing of the generalized order-k Pell numbers in log time

This page was built for publication: The general quasi-order algorithm in number theory

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