Research Article · Preprint Mathematics
Exponential growth of sparse Euler products and normal graded domains
- Primary subject
- Mathematics
- Subject subfields
- Algebra · Combinatorics
- Paper type
- Research Article
- Manuscript stage
- Preprint
- Manuscript
- Archived
- Edition
- 2 · Permanent link
Overview
Abstract
Let d_i be strictly increasing positive integer degrees and let M_i be positive integers with log M_i/d_i→δ∈(0,∞). For the Euler product with M_i independent polynomial generators of degree d_i and one degree-one generator, we prove that the upper logarithmic coefficient rate is δ and the lower rate is max{δ-θ,0}, where θ=lim sup_i log(d_(i+1))/d_i. This gives an exact convergence criterion with no regularity assumption on the support gaps. We contrast it with normal connected locally finite graded domains of Krull dimension two, obtained by adapting an infinite-pole construction of Maclean. Their lower rate is δ/R, where R=lim sup_i d_(i+1)/d_i, and their upper rate is δ. In particular, normality, finite dimension and a degree-one nonzerodivisor do not jointly force convergence of the exponential Hilbert rate.
Keywords Euler products · exponential growth · Hilbert functions · graded domains · sparse degree supports
Scope of the work
Exact upper and lower exponential coefficient rates for sparse Euler products, contrasted with explicit normal graded domains of dimension two whose exponential Hilbert rates need not converge.
Reproduction notes
6-page manuscript and 5 source-package members. Compile main.tex with a compatible LaTeX engine. The Euler-product rate laws and normal-domain constructions are analytic and require no numerical supplement.
The manuscript
Read the paper
The complete manuscript, as published in this edition.
If the reader is unavailable on your device, open or download the PDF directly.
Author disclosures
AI systems assisted research exploration, literature discovery, drafting and internal checking. The author retains responsibility for the manuscript. Internal AI-assisted and computational checks are distinct from external human peer review.
References and related publications
- P. J. Cameron, Sequences realized by oligomorphic permutation groups , J. Integer Seq. 3 (2000), Article 00.1.5. https://cs.uwaterloo.ca/journals/JIS/VOL3/groups.html.
- B. L. Granovsky and D. Stark, Asymptotic enumeration and logical limit laws for expansive multisets and selections , J. London Math. Soc. (2) 73 (2006), 252–272. arXiv:math/0407322.
- B. L. Granovsky and D. Stark, Developments in the Khintchine–Meinardus probabilistic method for asymptotic enumeration , arXiv:1311.2254v2 (2015).
- E. Manstavičius and R. Skrabut ̇ enas,On analytic problems for additive arithmetical semigroups , Ann. Univ. Sci. Budapest., Sect. Comp. 22 (2003), 269–285. https://ac.inf.elte.hu/Vol_ 022_2003/doi/269_22.pdf.
- M. V. Vakhitov and D. S. Minenkov, On logarithmic asymptotics for the number of restricted partitions in the exponential case , Moscow J. Comb. Number Theory 12 (2023), 297–309. doi:10.2140/moscow.2023.12.297.
- C. Maclean, Approximable algebras and a question of H. Chen , arXiv:1703.01801v1 (2017).
- C. Maclean, Characterising approximable algebras , arXiv:1709.06945v1 (2017).
A stable scholarly record
Cite this edition
Scott Schubr. (2026). Exponential growth of sparse Euler products and normal graded domains (Version 2). Luminary Research Archive. https://research.luminaryoddities.com/exponential-growth-sparse-euler-products-normal-graded-domains/v/2
BibTeX
@techreport{luminary_exponential_growth_sparse_euler_products_normal_graded_domains_v2,
title = {Exponential growth of sparse Euler products and normal graded domains},
author = {Scott Schubr},
year = {2026},
institution = {Luminary Research Archive},
type = {Research Article},
note = {Version 2},
url = {https://research.luminaryoddities.com/exponential-growth-sparse-euler-products-normal-graded-domains/v/2}
}Loading discussion…