English
Related papers

Related papers: (Non)Automaticity of number theoretic functions

200 papers

In 2023, the first author and Vandehey proved that the largest $k$ for which the string of equalities $\lambda(n+1)=\lambda(n+2)=\cdots=\lambda(n+k)$ holds for some $n\leq x$, where $\lambda$ is the Carmichael $\lambda$ function, is bounded…

Number Theory · Mathematics 2024-06-11 Noah Lebowitz-Lockard , J. C. Saunders

We improve bounds on the degree and sparsity of Boolean functions representing the Legendre symbol as well as on the $N$th linear complexity of the Legendre sequence. We also prove similar results for both the Liouville function for…

Number Theory · Mathematics 2024-11-11 Johannes Grünberger , Arne Winterhof

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + \epsilon}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-\epsilon}$. We show there exists a subset…

Number Theory · Mathematics 2021-04-14 Harald Andrés Helfgott , Maksym Radziwiłł

We introduce a general result relating "short averages" of a multiplicative function to "long averages" which are well understood. This result has several consequences. First, for the M\"obius function we show that there are cancellations…

Number Theory · Mathematics 2017-10-17 Kaisa Matomäki , Maksym Radziwiłł

We derive Vorono\"{\dotlessi} summation formulas for the Liouville function $\lambda(n)$, the M\"{o}bius function $\mu(n)$, and for $d^{2}(n)$, where $d(n)$ is the divisor function. The formula for $\lambda(n)$ requires explicit evaluation…

Number Theory · Mathematics 2024-10-08 Shashank Charge , Atul Dixit

Let $\lambda$ and $\mu$ denote the Liouville and M\"obius functions respectively. Hildebrand showed that all eight possible sign patterns for $(\lambda(n), \lambda(n+1), \lambda(n+2))$ occur infinitely often. By using the recent result of…

Number Theory · Mathematics 2015-09-24 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

General Mathematics · Mathematics 2026-01-12 Yasuo Nishii

In this article we study some properties of the discrete convolution of Liouville function $S(n):=\sum_{m_{1}+m_{2}=n}\lambda\left(m_{1}\right)\lambda\left(m_{2}\right)$, which is a Goldbach-type counting function of representations. In…

Number Theory · Mathematics 2026-03-12 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

Let $\Omega(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N…

Number Theory · Mathematics 2025-02-19 Dimitrios Charamaras , Florian K. Richter

In this article, we prove that for a completely multiplicative function $f$ from $\mathbb{N}^*$ to a field $K$ such that the set $$\{p \;|\; f(p)\neq 1_K \;\mbox{and }p \mbox{ is prime}\}$$ is finite, the asymptotic subword complexity of…

Combinatorics · Mathematics 2016-06-01 Yining Hu

Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…

Number Theory · Mathematics 2014-05-30 Andrew V. Lelechenko

We show that a certain weighted mean of the Liouville function lambda(n) is negative. In this sense, we can say that the Liouville function is negative "on average".

Number Theory · Mathematics 2013-04-30 Richard P. Brent , Jan van de Lune

The {\em Liouville function} is defined by $\gl(n):=(-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime divisors of $n$ counting multiplicity. Let $\z_m:=e^{2\pi i/m}$ be a primitive $m$--th root of unity. As a generalization of…

Number Theory · Mathematics 2009-06-08 Michael Coons , Sander R. Dahmen

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

Number Theory · Mathematics 2026-05-08 Luan Alberto Ferreira

Recently, by the Riordan's identity related to tree enumerations, \begin{eqnarray*} \sum_{k=0}^{n}\binom{n}{k}(k+1)!(n+1)^{n-k} &=& (n+1)^{n+1}, \end{eqnarray*} Sun and Xu derived another analogous one, \begin{eqnarray*}…

Combinatorics · Mathematics 2010-07-09 Yidong Sun , Jujuan Zhuang

The Dirichlet lambda function $\lambda(s)$ is defined for $\mathrm{Re}(s) > 1$ by \[ \lambda(s) = \sum_{n=0}^{\infty} \frac{1}{(2n+1)^s}. \] This function was initially studied by Euler on the real line, where he denoted it by $N(s)$. In…

Number Theory · Mathematics 2025-07-15 Su Hu , Min-Soo Kim

Let $\Pi$ be the fundamental group of a smooth variety X over $F_p$. Given a non-Archimedean place $\lambda$ of the field of algebraic numbers which is prime to p, consider the $\lambda$-adic pro-semisimple completion of $\Pi$ as an object…

Number Theory · Mathematics 2018-01-19 Vladimir Drinfeld

Let $\Lambda\left(n\right)$ be the von Mangoldt function and $r_{SP}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)\Lambda\left(m_{2}\right)\Lambda\left(m_{3}\right)$ be the counting function for the numbers that…

Number Theory · Mathematics 2017-08-24 Marco Cantarini

This paper is concerned with the constancy in the sign of $L(X, \alpha) = \sum_{1}^{X} \frac{\lambda(n)}{n^{\alpha}}$, where $\lambda(n)$ the Liouville function. The non-positivity of $L(X, 0)$ is the P\'{o}lya conjecture, and the…

Number Theory · Mathematics 2013-10-10 T. S. Trudgian

It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…

General Mathematics · Mathematics 2010-07-27 Yuan-You Fu-Rui Cheng