arXiv (OAI Expanded)
open access
Algorithms for $p$-rationality and for $p$-saturation of units
Let $K$ be a number field. We give new practical algorithms that determine whether $K$ is $p$-rational. For real cyclotomic fields $K=\mathbb{Q}(ζ_{n})^{+}$, our method avoids computing either the class number or the full unit group. We also use the notion of $p$-rationality to explain the practical
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
- Théorie algébrique des nombres. (Algebraic number theory)#490227
- Subconvexity of Short $k$-Free Exponential Sums in $\mathbb{F}_q[t]$#818984
- Subconvexity of Short $k$-Free Exponential Sums in $\mathbb{F}_q[t]$#808992
- Weil-Moore anima#999237
- Dynamical uniform boundedness for unicritical polynomials and elliptic curves of large rank#1071219
Record · ID 1109238
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