RECORD
Symbolic computation of the roots of any polynomial with integer coefficients
General Mathematics · Submitted 26 Jan 2000
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive' operations like replacement of sequences and counting of symbols. No calculations using 'advanced' operations like multiplication, division, logarithms etc. are needed. The method can be implemented as a geometric construction of roots of polynomials to arbitrary accuracy using only a straight edge, a compass, and pencils of 2m different colors. In particular, the ancient problem of the "doubling of cube" is soluble asymptotically by the above-mentioned construction. This method, by which a cube can be doubled, albeit, in infinite steps, is probably the closest to the original problem of construction using only a straight edge and compass in a finite number of steps. Moreover, to every polynomial of degree m over the field of rationals, can be associated an m-term recurrence relation for generating integer sequences. A set of m such sequences, which together exhibit interesting properties related to the roots of the polynomial, can be obtained if the m initial terms of each of these m sequences is chosen in a special way using a matrix associated with the polynomial. Only two of these integer sequences need to be computed to obtain the real root having the largest absolute value. Since this method involves only integers, it is faster than the conventional methods using floating-point arithmetic.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. | contribution 0.72 | 0.72 | 0.81 | asserted 0.99 |
| s1 | This method requires only 'primitive' operations like replacement of sequences and counting of symbols. | method 0.95 | 0.56 | 0.08 | asserted 1.00 |
| s2 | No calculations using 'advanced' operations like multiplication, division, logarithms etc. are needed. | method 0.78 | 0.54 | 0.09 | asserted 1.00 |
| s3 | The method can be implemented as a geometric construction of roots of polynomials to arbitrary accuracy using only a straight edge, a compass, and pencils of 2m different colors. | method 0.50 | 0.64 | 0.18 | asserted 0.80 |
| s4 | In particular, the ancient problem of the "doubling of cube" is soluble asymptotically by the above-mentioned construction. | result 0.60 | 0.56 | 0.09 | asserted 0.89 |
| s5 | This method, by which a cube can be doubled, albeit, in infinite steps, is probably the closest to the original problem of construction using only a straight edge and compass in a finite number of steps. | interpretation 0.95 | 0.46 | 0.09 | hedged possibility 0.93 |
| s6 | Moreover, to every polynomial of degree m over the field of rationals, can be associated an m-term recurrence relation for generating integer sequences. | contribution 0.62 | 0.71 | 0.13 | asserted 0.99 |
| s7 | A set of m such sequences, which together exhibit interesting properties related to the roots of the polynomial, can be obtained if the m initial terms of each of these m sequences is chosen in a special way using a matrix associated with the polynomial. | method 0.92 | 0.73 | 0.07 | asserted 0.93 |
| s8 | Only two of these integer sequences need to be computed to obtain the real root having the largest absolute value. | method 0.58 | 0.72 | 0.08 | asserted 1.00 |
| s9 | Since this method involves only integers, it is faster than the conventional methods using floating-point arithmetic. | interpretation 0.84 | 0.47 | 0.08 | asserted 0.99 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive' operations like replacement of sequences and counting of symbols. No calculations using 'advanced' operations like multiplication, division, logarithms etc. are needed. The method can be implemented as a geometric construction of roots of polynomials to arbitrary accuracy using only a straight edge, a compass, and pencils of 2m different colors. In particular, the ancient problem of the "doubling of cube" is soluble asymptotically by the above-mentioned construction. This method, by which a cube can be doubled, albeit, in infinite steps, is probably the closest to the original problem of construction using only a straight edge and compass in a finite number of steps. Moreover, to every polynomial of degree m over the field of rationals, can be associated an m-term recurrence relation for generating integer sequences. A set of m such sequences, which together exhibit interesting properties related to the roots of the polynomial, can be obtained if the m initial terms of each of these m sequences is chosen in a special way using a matrix associated with the polynomial. Only two of these integer sequences need to be computed to obtain the real root having the largest absolute value. Since this method involves only integers, it is faster than the conventional methods using floating-point arithmetic.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.