Factoring polynomials in finite fields: an application of Lang-Weil to a problem in graph theory.

Nicholas M. Katz

Displaying similar documents to “Factoring polynomials in finite fields: an application of Lang-Weil to a problem in graph theory.”

A Note on B-Complete Spaces and the Closed Graph Theorem.

S.O. Iyahen (1988)

Mathematische Annalen

Similarity:

B (J)-spaces and the Closed Graph Theorem.

T. HUSAIN (1964)

Mathematische Annalen

Similarity:

B(T)-Spaces and the Closed Graph Theorem II.

T. HUSAIN (1964)

Mathematische Annalen

Similarity:

Connectivity, Line-Connectivity and J-Connection of the Total Graph.

J.M.S.Simoes Pereira (1972)

Mathematische Annalen

Similarity:

A Generalization of Faber's Polynomials.

J.L. Walsh (1958)

Mathematische Annalen

Similarity:

On rational radii coin representations of the wheel graph

Geir Agnarsson, Jill Bigley Dunham (2013)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

A flower is a coin graph representation of the wheel graph. A petal of a flower is an outer coin connected to the center coin. The results of this paper are twofold. First we derive a parametrization of all the rational (and hence integer) radii coins of the 3-petal flower, also known as Apollonian circles or Soddy circles. Secondly we consider a general n-petal flower and show there is a unique irreducible polynomial Pₙ in n variables over the rationals ℚ, the affine variety of which...