arXiv (All)
open access
Supersoluble groups and the probability of generating a supersoluble subgroup
Let $G$ be a finite group and let $\mathrm{P}_{\mathcal{U}}(G)$ denote the probability that two randomly chosen elements of $G$ generate a supersoluble subgroup. We prove that if $\mathrm{P}_{\mathcal{U}}(G) > 16/25$ then $G$ is supersoluble, and that the bound $16/25$ is sharp, being attained by th
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
- Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors#1227302
- Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors#1233986
- Residual-Weighted Randomized Jacobi: Sharpened Bounds via Residual Concentration and Asynchronous Extension#246521
- On the (In)security of Peer-to-Peer Decentralized Machine Learning#134002
- Stochastic Caching via Subset Entropy / Ravi Kumar, Roie Levin, Joseph (Seffi) Naor, Debmalya Panigrahi#1188640
Record · ID 1202142
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