Searcharxiv⌕ Search

arXiv · 2610.15376

Monotonicity of Coefficients of Interpolated Multiple Zeta Values

Abstract

Let $ζ^t(\boldsymbol{k})=\sum_{d=1}^{r}S_d(\boldsymbol{k})t^{r-d}$ be the interpolated multiple zeta value of an admissible index $\boldsymbol{k}$ of depth $r$. We show the monotonicity property of coefficients $S_1(\boldsymbol{k})\ge\cdots\ge S_r(\boldsymbol{k})>0$. In the proof, we represent the coefficients as integrals over a common measure space and compares the integrands pointwise. As consequences, we determine the sign and vanishing of $ζ^{-1}(\boldsymbol{k})$ and locate the zeros of $ζ^t(\boldsymbol{k})$ in the closed unit disk.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shuji Yamamoto. 2026-10-11. Monotonicity of Coefficients of Interpolated Multiple Zeta Values. https://arxiv.org/abs/2610.15376

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗