arXiv (All)
open access
The structure of almost symmetric almost complete intersection numerical semigroups
We prove a structure theorem for numerical semigroups H that are almost symmetric and almost complete intersections. Specifically, we show that a row-factorization (RF) matrix of H must possess a highly regular structure, which we call a cascade matrix. Consequently, the defining ideal I_H of the as
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
- Spectral Deflation for Factorization-Free Matrix Filtering in Muon and Semidefinite Programming#1035072
- Connections between semidefinite relaxations of the max-cut and stable set problems#458507
- On the Subsample Size of Quantile-Based Randomized Kaczmarz#684245
- On the Subsample Size of Quantile-Based Randomized Kaczmarz#682470
- VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization#1034009
Record · ID 1051278
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