An Euler phi function for the Eisenstein integers and some applications
Emily Gullerud, Aba Mbirika

TL;DR
This paper extends the classical Euler phi function to Eisenstein integers, explores the structure of their unit groups, and demonstrates that Euler-Fermat theorem applies in this complex integer setting, with applications to cyclicity criteria.
Contribution
It introduces a generalized Euler phi function for Eisenstein integers and proves its properties, including the applicability of Euler-Fermat theorem and criteria for cyclic unit groups.
Findings
Generalized Euler phi function for Eisenstein integers established.
Proved Euler-Fermat theorem for Eisenstein integers.
Identified conditions for cyclicity of certain unit groups.
Abstract
The Euler phi function on a given integer yields the number of positive integers less than that are relatively prime to . Equivalently, it gives the order of the group of units in the quotient ring . We generalize the Euler phi function to the Eisenstein integer ring where is the primitive third root of unity by finding the order of the group of units in the ring for any given Eisenstein integer . As one application we investigate a sufficiency criterion for when certain unit groups are cyclic where is prime in and , thereby generalizing well-known results of similar applications in the integers and some lesser known results in the Gaussian integers. As another application, we prove that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Mathematics and Applications
