arXiv (All)
open access
Minimal Product Sets in Finite Metacyclic Groups
Minimum product-set problems ask how small a product of two subsets of prescribed cardinalities can be in a finite group. Although the problem is completely understood for finite abelian groups, exact results in the nonabelian setting are available only for particular classes. We determine the minim
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
- Minimal Product Set in Non-Abelian Metacyclic Groups of Even Order#1325009
- A rank bound for bases and circuits in binary matroids#1249109
- Ramsey Theory for Product Trees#1076554
- An Eventown Result for Multisets#1357291
- Infinitely Many Binomial Coefficients of Deficiency One#1051535
Record · ID 1327027
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