Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1411.0124

An effective criterion for Eulerian multizeta values in positive characteristic

Chieh-Yu Chang·Matthew A. Papanikolas·Jing Yu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Characteristic p multizeta values were initially studied by Thakur, who defined them as analogues of classical multiple zeta values of Euler. In the present paper we establish an effective criterion for Eulerian multizeta values, which characterizes when a multizeta value is a rational multiple of a power of the Carlitz period. The resulting "t-motivic" algorithm can tell whether any given multizeta value is Eulerian or not. We also prove that if zeta_A(s_1,...,s_r) is Eulerian, then zeta_A(s_2,...,s_r) has to be Eulerian. When r=2, this was conjectured (and later on conjectured for arbitrary r) by Lara Rodriguez and Thakur for the zeta-like case from numerical data. Our methods apply equally well to values of Carlitz multiple polylogarithms at algebraic points and zeta-like multizeta values.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chieh-Yu Chang, Matthew A. Papanikolas, Jing Yu. 2015-11-02. An effective criterion for Eulerian multizeta values in positive characteristic. https://doi.org/10.4171/jems%2F840

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

KEEP EXPLORING

Related papers

arXiv2026

On properties of the generalized Davenport Expansion

We study the continuity properties of a generalized Davenport Fourier expansion we recently discovered, by imposing conditions on the coefficients. We also put our expansion into perspective from the position of Appell sequences.

math.NT↗
arXiv2026

On two Romanoff type problems of Erdős

Let $\mathcal{P}$ be the set of primes and, for $a>1$, put $\mathcal{S}_a={p+\lfloor a^k\rfloor:p\in\mathcal{P},\ k\ge1}$. Erdős recorded a question of Kalm'ar asking whether $\mathcal{S}_a$ has positive lower asymptotic density for every real $a>1$. We prove this for almost every $a>1$, with $$ \liminf_{N\to\infty}\frac{|\mathcal{S}_a\cap[1,N]|}{N} \ge \frac{1}{\log a+9C_0/π^2}, $$ where $C_0$ is an absolute constant. The dependence on $a$ has the correct order $1/\log a$ as $a\to\infty$. For almost every $a>1$ and every $η>0$, we also prove that at least $x^{1-η}$ positive integers $n\le x$ lie outside $\mathcal{S}_a$ for all sufficiently large $x$. For the golden ratio $φ=(1+\sqrt5)/2$, the corresponding sumset has positive lower asymptotic density and upper asymptotic density at most $1937/1938$. We also consider a problem of Erdős asking whether every sufficiently large odd integer is the sum of a squarefree integer and a power of two. Replacing $2^m$ by $\lfloor a^m\rfloor$, we prove for almost every $a>1$ that the exceptional set up to $x$ is $$ O_{a,\varepsilon}\!\left(\frac{x(\log\log x)^{1+\varepsilon}}{\sqrt{\log x}}\right), $$ and, allowing two distinct exponents, it is $$ O_{a,\varepsilon}\!\left(\frac{x(\log\log x)^{1+\varepsilon}}{\log x}\right). $$ The proofs use metric residue distribution and weighted pair correlation estimates for $\lfloor a^k\rfloor$, together with a congruence covering argument for the prime exceptional set.

math.NT↗
arXiv2026

Short Interval Variance and Averaged Correlations of Arithmetic Functions

In this paper, we study the average shifted sum for general arithmetic functions by applying the standard Hardy--Littlewood circle method and using short-interval variance results. As applications, we prove some nontrivial upper bounds for shifted sums involving $μ_{k}(n).$ Assuming the Riemann Hypothesis and the Pair Correlation Conjecture of Montgomery, we also prove similar results involving the von Mangoldt function.

math.NT↗