The general quasi-order algorithm in number theory
This paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2)t. Some remarks are made on relative merits of two dual algorithms called the ψ-algorithm and the ϕ-algorithm. Some illustrative examples are given.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1986-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171286000297 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832549941483929600 |
|---|---|
| author | Peter Hilton Jean Pedersen |
| author_facet | Peter Hilton Jean Pedersen |
| author_sort | Peter Hilton |
| collection | DOAJ |
| description | This paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2)t. Some remarks are made on relative merits of two dual algorithms called the ψ-algorithm and the ϕ-algorithm. Some illustrative examples are given. |
| format | Article |
| id | doaj-art-7114bc68d91a4abea2d25e08b9190dd3 |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1986-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-7114bc68d91a4abea2d25e08b9190dd32025-02-03T06:08:15ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251986-01-019224525110.1155/S0161171286000297The general quasi-order algorithm in number theoryPeter Hilton0Jean Pedersen1Department of Mathematical Sciences, State University of New York, Binghamton 13901, New York, USADepartment of Mathematics, Santa Clara University, Santa Clara 95051, California, USAThis paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2)t. Some remarks are made on relative merits of two dual algorithms called the ψ-algorithm and the ϕ-algorithm. Some illustrative examples are given.http://dx.doi.org/10.1155/S0161171286000297number theoryquasi-orderalgorithmpolygon. |
| spellingShingle | Peter Hilton Jean Pedersen The general quasi-order algorithm in number theory International Journal of Mathematics and Mathematical Sciences number theory quasi-order algorithm polygon. |
| title | The general quasi-order algorithm in number theory |
| title_full | The general quasi-order algorithm in number theory |
| title_fullStr | The general quasi-order algorithm in number theory |
| title_full_unstemmed | The general quasi-order algorithm in number theory |
| title_short | The general quasi-order algorithm in number theory |
| title_sort | general quasi order algorithm in number theory |
| topic | number theory quasi-order algorithm polygon. |
| url | http://dx.doi.org/10.1155/S0161171286000297 |
| work_keys_str_mv | AT peterhilton thegeneralquasiorderalgorithminnumbertheory AT jeanpedersen thegeneralquasiorderalgorithminnumbertheory AT peterhilton generalquasiorderalgorithminnumbertheory AT jeanpedersen generalquasiorderalgorithminnumbertheory |