Abstract
We study Poncelet's Theorem in finite projective planes over the field GF(q), q = pm for p an odd prime and m > 0, for a particular pencil of conics. We investigate whether we can find polygons with n sides which are inscribed in one conic and circumscribed around the other, so-called Poncelet Polygons. By using suitable elements of the dihedral group for these pairs, we prove that the length n of such Poncelet Polygons is independent of the starting point. In this sense Poncelet's Theorem is valid. By using Euler's divisor sum formula for the totient function, we can make a statement about the number of different conic pairs, which carry Poncelet Polygons of length n. Moreover, we will introduce polynomials whose zeros in GF(q) yield information about the relation of a given pair of conics. In particular, we can decide for a given integer n, whether and how we can find Poncelet Polygons for pairs of conics in the plane PG(2,q).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.