On Pisot Units and the Fundamental Domain of Galois Extensions of $\mathbb{Q}$
Christian Porter, Alexandre Bali, Alar Leibak

TL;DR
This paper investigates the structure of Galois number fields, providing bounds on the fundamental domain's facets, an efficient reduction algorithm for totally positive forms, and bounds on the Weil height of Pisot units, with implications for cryptography.
Contribution
It introduces bounds on the fundamental domain facets, a linear-time reduction algorithm for positive forms, and height bounds for Pisot units in Galois extensions, advancing number theory and cryptography.
Findings
Bound on the number of facets of the fundamental domain.
Linear time algorithm for reducing totally positive unary forms.
Upper bound on the Weil height of the shortest Pisot unit.
Abstract
In this paper, we present two main results. Let be a number field that is Galois over with degree , where is the number of real embeddings and is the number of pairs of complex embeddings. The first result states that the number of facets of the reduction domain (and therefore the fundamental domain) of is no greater than , where if or otherwise. The second result states that there exists a linear time algorithm to reduce a totally positive unary form , such that the new totally positive element that is equivalent to has trace no greater than a constant multiplied by the integer minimum of the trace-form , where the constant is determined by…
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
TopicsCryptography and Residue Arithmetic · Coding theory and cryptography · Cryptography and Data Security
