arXiv (All)
open access
Exploring the unleaved tree of numerical semigroups up to a given genus
We present a new algorithm for exploring or counting the numerical semigroups of a given genus that uses the unleaved version of the tree of numerical semigroups. In the unleaved tree there are no leaves rather than the ones at depth equal to the genus in consideration. For exploring the unleaved tr
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
- Beyond odd characteristic: Faster isomorphism testing of 2-groups of Frattini class 2#1155809
- A Pressure-Free Virtual Element Method for the Surface Stokes Problem#1145163
- Almost Tight Bounds for Isomorphism Testing and Basis Construction in Finite Abelian Groups#1218015
- The Landis Conjecture For Nonlocal Elliptic Operators: Polynomial Decay#662351
- The Landis Conjecture For Nonlocal Elliptic Operators: Polynomial Decay#661301
Record · ID 1354783
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