Finite groups with large Noether number are almost cyclic
P\'al Heged\H{u}s, Attila Mar\'oti, L\'aszl\'o Pyber

TL;DR
This paper characterizes finite groups with large Noether number, showing they are nearly cyclic, and establishes bounds on the indispensable degrees of polynomial invariants for various finite simple groups.
Contribution
It extends previous results by providing an asymptotic characterization of groups with bounded ratio of order to Noether number and bounds the Noether number for simple groups of Lie type and sporadic groups.
Findings
Groups with bounded |G|/β(G) have a characteristic cyclic subgroup of bounded index.
For simple groups of Lie type and sporadic groups, β(S) ≤ |S|^{39/40}.
The ratio |G|/β(G) is bounded if and only if G has a characteristic cyclic subgroup of bounded index.
Abstract
Noether, Fleischmann and Fogarty proved that if the characteristic of the underlying field does not divide the order of a finite group , then the polynomial invariants of are generated by polynomials of degrees at most . Let denote the largest indispensable degree in such generating sets. Cziszter and Domokos recently described finite groups with at most . We prove an asymptotic extension of their result. Namely, is bounded for a finite group if and only if has a characteristic cyclic subgroup of bounded index. In the course of the proof we obtain the following surprising result. If is a finite simple group of Lie type or a sporadic group then we have . We ask a number of questions motivated by our results.
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
TopicsFinite Group Theory Research · Geometric and Algebraic Topology · Coding theory and cryptography
