arXiv (All)
open access
Antichains among Divisor Sums of Divisors
For a positive integer $n$, let $S(n)=\{σ(d): d\mid n\}$ be ordered by divisibility, and let $a(n)$ be its width. We study how much of the divisor lattice of $n$ survives under the map $d\mapsto σ(d)$. For every fixed prime-exponent pattern, the largest possible value of $a(n)$ is the width of a cor
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
- A New Classification of Positive Integers Via New Divisor Functions#974229
- Normal Behavior and Periodic Points of a Pseudo-Aliquot Map Associated with the Dedekind Psi Function#973913
- Divisor function and bounds in domains with enough primes#955637
- Prime-Detecting Identities from Dirichlet Inversion#1117990
- The moments of split greatest common divisors#1215335
Record · ID 1186578
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