Search arXivSearch

arXiv · 2307.15395

On the non-commutative Iwasawa main conjecture for voltage covers of graphs

Abstract

Let $p$ be a rational prime, and let $X$ be a connected finite graph. In this article we study voltage covers $X_\infty$ of $X$ attached to a voltage assignment $α$ which takes values in some uniform $p$-adic Lie group $G$. We formulate and prove an Iwasawa main conjecture for the projective limit of the Picard groups $\text{Pic}(X_n)$ of the intermediate voltage covers $X_n$, ${n \in \mathbb{N}}$, and we prove one inclusion of a main conjecture for the projective limit of the Jacobians $J(X_n)$. Moreover, we study the $\mathfrak{M}_H(G)$-property of $\mathbb{Z}_p[[G]]$-modules and prove a necessary condition for this property which involves the $μ$-invariants of $\mathbb{Z}_p$-subcovers ${Y \subseteq X_\infty}$ of $X$. If the dimension of $G$ is equal to 2, then this condition is also sufficient.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sören Kleine, Katharina Müller. 2023-09-26. On the non-commutative Iwasawa main conjecture for voltage covers of graphs. https://arxiv.org/abs/2307.15395

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