arXiv (OAI Expanded)
open access
The number of distinct element orders in a finite group
For a finite group $G$ let $ω(G)$ denote its spectrum, the set of orders of its elements, and set $η(G)=|ω(G)|$, the number of distinct element orders. The set $ω(G)$ has been studied intensively, but its cardinality has received little systematic attention as an invariant in its own right. We devel
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Representations and characters of finite groups#997881
- On inversion sets of joins in weak Bruhat order#1051888
- An Upper Bound on the Number of Distinct Composition Series in Finite Groups and Extremal Behavior in Group Isomorphism#609720
- Enumeration of certain permutation group polynomials#784875
- Enumeration of certain permutation group polynomials#783285
Record · ID 1070524
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive