Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.21695

Higher Labute-Serre duality and Lyndon words

Ido Efrat·Levav Ferber Tas
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $S$ be a free profinite group on a finite ordered basis $X$, and let $S^{(n,p)}$, $n=1,2,\ldots,$ denote its lower $p$-central filtration. There is a natural duality between $S^{(n,p)}/S^{(n+1,p)}$ and $H^2(S/S^{(n,p)},\mathbb{F}_p)$. These $\mathbb{F}_p$-linear spaces admit natural bases indexed by Lyndon words of length $\leq n$ in the alphabet $X$. These bases are known to be unitriangularly dual. We prove that they are much closer to being fully dual, by showing that the pairing between two basis elements vanishes unless the corresponding Lyndon words are permutations of one another. We further show that the value of the pairing is essentially independent of $n$.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ido Efrat, Levav Ferber Tas. 2026-09-18. Higher Labute-Serre duality and Lyndon words. https://arxiv.org/abs/2609.21695

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

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↗