arXiv (OAI Expanded)
open access
Finite-tower bounds for Skolem functions
We bound the eventual order types of Skolem functions below finite exponential towers. Writing $E_0(u)=u$, $E_{n+1}(u)=2^{E_n(u)}$, and $ω_0=1$, $ω_{k+1}=ω^{ω_k}$, the argument gives \[ |\Sk_{<E_n(x^m)}|<ω_{r_n},\qquad r_n=2+\frac{n(n+3)}2\quad(n\ge1,\ m\ge2\text{ fixed}). \] For triple towers w
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
- Sparse Kahane--Salem--Zygmund Forms and Weighted Hardy--Littlewood Inequalities Across the Critical Endpoint#1156772
- A Tight Erdős-Stone Bound for All Graph Densities#821533
- Spectrum of Johnson graphs#985298
- Unbalanced spectral Turán problem for color-critical graphs with prescribed large maximum degree#821087
- Explicit height bounds on modular polynomials for the elliptic $j$-invariant, cube root of $j$, and Weber modular function $\mathfrak f$#1052249
Record · ID 1070211
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