On the number of generators of a separable algebra over a finite field
Uriya First, Zinovy Reichstein, Santiago Salazar

TL;DR
This paper investigates the minimal number of generators needed for separable algebras over finite fields, providing explicit formulas and bounds, especially highlighting differences from the classical primitive element theorem.
Contribution
It derives a formula for the minimal number of generators of separable algebras over finite fields and establishes bounds for non-commutative cases, extending classical results.
Findings
Provides a formula for the minimal number of generators over finite fields.
Establishes upper and lower bounds for generators of separable algebras.
Highlights the failure of the primitive element theorem for multiple components over finite fields.
Abstract
Let be a field and let be an \'etale algebra over , that is, a finite product of finite separable field extensions . The classical primitive element theorem asserts that if , then is generated by one element as an -algebra. The same is true for any , provided that is infinite. However, if is a finite field and , the primitive element theorem fails in general. In this paper we give a formula for the minimal number of generators of when is finite. We also obtain upper and lower bounds on the number of generators of a (not necessarily commutative) separable algebra over a finite field.
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
TopicsAdvanced Topics in Algebra · Coding theory and cryptography · Algebraic structures and combinatorial models
