Pith. sign in

REVIEW 1 cited by

How to count the number of zeros that a polynomial has on the unit circle?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.04231 v2 pith:OKTOF3GA submitted 2019-02-12 math.CV math.CO

classification math.CVmath.CO
keywords polynomialsproblemzeroscirclenumberpolynomialrealunit
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The classical problem of counting the number of real zeros of a real polynomial was solved a long time ago by Sturm. The analogous problem of counting the number of zeros that a polynomial has on the unit circle is, however, still an open problem. In this paper, we show that the second problem can be reduced to the first one through the use of a suitable pair of M\"obius transformations - often called Cayley transformations - that have the property of mapping the unit circle onto the real line and vice versa. Although the method applies to arbitrary complex polynomials, we discuss in detail several classes of polynomials with symmetric zeros as, for instance, the cases of self-conjugate, self-adjoint, self-inversive, self-reciprocal and skew-reciprocal polynomials. Finally, an application of this method to Salem polynomials and to polynomials with small Mahler measure is also discussed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Dragging the roots of a polynomial to the unit circle

    math.CO 2019-08 conditional novelty 8.0 of 10

    The paper defines and exactly computes threshold parameters il(p) and cn(p) governing circle-rootedness and interlacing with roots of unity, and constructs families where il/cn grows without bound.

Pith tools