Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-29T23:19:32.486Z Has data issue: false hasContentIssue false

On the Hesse-Cayley Algorithm for a Plane Quartic whose Bitangents are all Real

Published online by Cambridge University Press:  24 October 2008

Patrick Du Val
Affiliation:
Trinity College

Extract

It is well known, having been pointed out in the first instance by Plücker, that a plane quartic curve consisting of four unifolia, in Zeuthen's sense, i.e. four even circuits each containing one concave portion or bay, has all its twenty-eight bitangents, and all their fifty-six points of contact, real; since each bay has a bitangent whose points of contact bound it, and each pair of circuits have four common tangents. It has not, so far as I know, been remarked that the algorithm of Hesse and Cayley, in which each of the bitangents is indicated by a pair out of the symbols 1 2 3 4 5 6 7 8, can be applied in a very simple way to such a curve.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1929

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

* Salmon, , Higher Plane Curves, 3rd ed., p. 217.Google Scholar

Math. Ann. VII (1874), p. 410.Google Scholar

Crelle's Journ. XLIX (1885), p. 279.Google ScholarSalmon, , Higher Plane Curves, 3rd ed., p. 231.Google Scholar

§ Math. Ann. I (1869), p. 129.Google Scholar

* Loc. cit.Google Scholar

Salmon, , Higher Plane Curves, 3rd ed., p. 233.Google Scholar