Search arXivSearch

arXiv · 2203.16232

Massey products in Galois cohomology and the Elementary Type Conjecture

Abstract

Let $p$ be a prime. We prove that a positive solution to Efrat's Elementary Type Conjecture implies a positive solution to the strengthened version of Minač--Tân's Massey Vanishing Conjecture in the case of finitely generated maximal pro-$p$ Galois groups whose pro-$p$ cyclotomic character has torsion-free image. Consequently, the maximal pro-$p$ Galois group of a field $\mathbb{K}$ containing a root of 1 of order $p$ (and also \sqrt{-1} if $p=2$) satisfies the strong $n$-Massey vanishing property for every $n>2$ (which is equivalent to the cup-defining $n$-Massey product property for every $n>2$, as defined by Minač--Tân) in several relevant cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Claudio Quadrelli. 2024-02-08. Massey products in Galois cohomology and the Elementary Type Conjecture. https://doi.org/10.1016/j.jnt.2023.11.002

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