Harnack's Theorems

Harnack's first theorem states that a real irreducible curve of order cannot have more than

Harnack's second theorem states that there exists a curve of every order with the maximum number of circuits compatible withthat order and with a certain number of double points, provided that number is not permissible for a curve of lower order(Coolidge 1959, p. 61).

References

Coolidge, J. L. A Treatise on Algebraic Plane Curves. New York: Dover, 1959.

• k-Matrix
• Knapsack Problem
• Kneser-Sommerfeld Formula
• Knights of the Round Table
• Knights Problem
• Knight's Tour
• Knot
• Knot Complement
• Knot Curve
• Knot Determinant
• Knot Diagram
• Knot Exterior
• Knot Linking
• Knot Polynomial
• Knot Problem
• Knot Shadow
• Knot Sum
• Knot Theory
• Knot Vector
• Knödel Numbers
• Kochansky's Approximation
• Koch Antisnowflake
• Koch Island
• Koch Snowflake
• Koebe Function