Search arXivSearch

arXiv · 2503.13295

Noncommutative factorizations of higher sine functions in positive characteristic

Abstract

In this paper we describe new noncommutative factorizations of functions related to $d$-th tensor powers of Carlitz's $\mathbb F_q[θ]$-module for $d\geq 1$, called higher sine functions. In recent work by the second author, factorizations of this type have been constructed for operators which are combinations of powers of a Frobenius endomorphism with coefficients ``in $\operatorname{End}(\operatorname{End}(\mathbb G_a^d))$''. In the present paper we succeed in determining factorizations with coefficients ``in $\operatorname{End}(\mathbb G_a^d)$'' which are not easily deducible from previous work. One key ingredient in obtaining this is an application of a ``motivic pairing'' that the first author introduced in recent work. Another key ingredient is the notion of ``$Δ$-matrix'' which comes into play in the analysis of the coefficients of the factorizations. Our results can be applied to explicitly describe analogues of shuffle $q^n$-powers for multiple polylogarithms at one, and to multiple zeta values of Thakur. All the identities we prove occur at the finite level.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nathan Green, Federico Pellarin. 2026-05-29. Noncommutative factorizations of higher sine functions in positive characteristic. https://arxiv.org/abs/2503.13295

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

KEEP EXPLORING

Related papers

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

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