AI 中文总结
本文改进了华林问题实指数模拟的均值估计界，将求解对应丢番图方程所需最小变量数的渐近阶界提升4倍，还探讨了证明中产生的具潜在应用的丢番图方程组。
AI 中文摘要
对于非整数θ>3和κ≥1，本文证明：使均值估计∫_{-κ}^{κ}|∑_{X<x≤2X}e(αx^θ)|^{2r}dα≪_ε κ X^{2r−θ+ε}对所有整数r≥r₀成立的最小r₀满足2r₀≤θ²(1+O(θ^{-1/2}))，该结果改进了此前Poulias给出的2r₀≤(⌊2θ⌋+1)(⌊2θ⌋+2)的界。作为推论，求解丢番图方程⌊x₁^θ⌋+⋯+⌊x_s^θ⌋=N的解(x₁,…,x_s)∈ℕ^s的数量R_{s,θ}(N)时，证明预期渐近公式所需最小变量数的渐近阶界被改进了4倍。本文还讨论了证明过程中自然产生的某一丢番图方程组，该方程组或可应用于其他计数问题，也可能具有独立研究价值。
英文摘要
For non-integer $θ> 3$ and $κ\geq 1$, we show that the smallest $r_0$ such that the mean value estimate \[ \int_{-κ}^κ \Big| \sum_{X < x \leq 2X} e(αx^θ) \Big|^{2r} dα\ll_ε κX^{2r - θ+ε} \] holds for all integers $r \geq r_0$ satisfies $2r_0 \leq θ^2(1+O(θ^{-1/2}))$. This is an improvement over the previous bound by Poulias of $2r_0 \leq (\lfloor 2θ\rfloor + 1)(\lfloor 2θ\rfloor + 2)$. As a consequence, the bound on the asymptotic order of the minimum number of variables required to prove the expected asymptotic formula for the number $R_{s,θ}(N)$ of solutions $(x_1,\ldots,x_s) \in \mathbb{N}^s$ to the Diophantine equation \[ \lfloor x_1^θ \rfloor+\cdots+\lfloor x_s^θ \rfloor = N \] is improved by a factor of $4$. We also discuss a certain Diophantine system which arises naturally from our proof, which may have applications to other counting problems and may be of independent interest.
Comments20 pages
