arXiv (OAI Expanded)
open access
Finite groups that are the product of every pair of non-conjugate maximal subgroups are soluble
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
- Finite groups that are the product of every pair of non-conjugate maximal subgroups are soluble#684568
- On second maximal subgroups of finite groups#926779
- Perfect Matching in Product Graphs and in their Random Subgraphs#821390
- Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection#1011893
- The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups#1110386
Record · ID 682793
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