Search arXivSearch

arXiv · 2409.05629

Weak almost monomial groups and Artin's conjecture

Abstract

We introduce a new class of finite groups, called weak almost monomial, which generalize two different notions of "almost monomial" groups, and we prove it is closed under taking factor groups and direct products. Let $K/\mathbb Q$ be a finite Galois extension with a weak almost monomial Galois group $G$ and $s_0\in \mathbb C\setminus \{1\}$. We prove that Artin conjecture's is true at $s_0$ if and only if the monoid of holomorphic Artin $L$-functions at $s_0$ is factorial. Also, we show that if $s_0$ is a simple zero for some Artin $L$-function associated to an irreducible character of $G$ and it is not a zero for any other $L$-function associated to an irreducible character, then Artin conjecture's is true at $s_0$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mircea Cimpoeas. 2024-09-09. Weak almost monomial groups and Artin's conjecture. https://arxiv.org/abs/2409.05629

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