An Explicit Expression for MZVs in Terms of Symmetric MZVs

Katsumi Kina

Home/Archive/arXiv

arXiv · 2607.05795

An Explicit Expression for MZVs in Terms of Symmetric MZVs

Katsumi Kina

View original source ↗Read source document ↗Export metadata ↓

Abstract

We provide a simpler proof of the fact, originally proved by Seidai Yasuda, that symmetric multiple zeta values generate the entire space of multiple zeta values. Furthermore, based on this argument, we present an algorithm for expressing multiple zeta values in terms of symmetric multiple zeta values and products of multiple zeta values. Moreover, we give some results on symmetric and finite multiple zeta values of depth three.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Katsumi Kina. 2026-09-14. An Explicit Expression for MZVs in Terms of Symmetric MZVs. https://arxiv.org/abs/2607.05795

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

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗

arXiv2026

Integers for Simple Radical Extensions

The ring of integers and the discriminant are determined for number fields which are simple radical extensions.

math.NT↗

arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗