Related papers: On the Oscillations of Multiplicative Functions Ta…

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Then for any given $K\geq 2$, small $\epsilon>0$ and sufficiently large (only depending on $K$ and $\epsilon$) $x$, there exist at least $x^{1-\epsilon}$ integers…

In this article, we study the behavior of consecutive values of random completely multiplicative functions $(X_n)_{n \geq 1}$ whose values are i.i.d. at primes. We prove that for $X_2$ uniform on the unit circle, or uniform on the set of…

Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we study the asymptotic growth of finite difference of logarithm of $\sqrt[n]{\overline{p}(n)/n^{\alpha}}$ for $\alpha$ being a non-negative real number, namely…

Let $F$ be an entire function of exponential type represented by the Taylor series \[ F(z) = \sum_{n\ge 0} \omega_n \frac{z^n}{n!} \] with unimodular coefficients $|\omega_n|=1$. We show that either the counting function $n_F(r)$ of zeroes…

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…

We show that for any polynomial $f$ from the integers to the integers, with positive leading coefficient and irreducible over the rationals, if $x$ is large enough then there is a string of $(\log x)(\log\log x)^{1/835}$ consecutive…

A "practical number" is a positive integer $n$ such that every positive integer less than $n$ can be written as a sum of distinct divisors of $n$. We prove that most of the binomial coefficients are practical numbers. Precisely, letting…

We study divide-and-conquer recurrences of the form \begin{equation*} f(n) = \alpha f(\lfloor \tfrac n2\rfloor) + \beta f(\lceil \tfrac n2\rceil) + g(n) \qquad(n\ge2), \end{equation*} with $g(n)$ and $f(1)$ given, where $\alpha,\beta\ge0$…

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

Let $\theta(x) = \sum_{p\leq x} \log p$. We show that $\theta(x)<x$ for $2<x< 1.39\cdot 10^{17}$. We also show that there is an $x<\exp(727.951332668)$ for which $\theta(x) >x.$

In this article, we illustrate the asymptotic behaviour of exponential functions of nabla fractional calculus. For this purpose, we propose a novel matrix technique to compute these functions numerically.

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

For a polynomial P, we consider the sequence of iterated integrals of ln P(x). This sequence is expressed in terms of the zeros of P(x). In the special case of ln(1 + x^2), arithmetic properties of certain coefficients arising are…

For any irrational $\alpha > 0$ and any initial value $z_{-1} \in \mathbb{C}$, we define a sequence of complex numbers $(z_n)_{n=0}^{\infty}$ as follows: $z_n$ is $z_{n-1} + e^{2 \pi i \alpha n}$ or $z_{n-1} - e^{2 \pi i \alpha n}$,…

We explore a new form of DFT, which we call the Polynomial Transform. It functions over finite fields, and a size $n$ transform takes $O(n)$ operations. In the multitape Turing machine model, it allows us to multiply two $n$ bit numbers in…

We study the 2-adic behavior of the number of domino tilings of a 2n-by-2n square as nvaries. It was previously known that this number was of the form 2^n f(n)^2, where f(n) is an odd, positive integer. We show that the function f is…

In the asymptotic analysis of regular sequences as defined by Allouche and Shallit, it is usually advisable to study their summatory function because the original sequence has a too fluctuating behaviour. It might be that the process of…

Let $\lambda$ be the Liouville function, defined as $\lambda(n) := (-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime factors of $n$ with multiplicity. In 2021, Helfgott and Radziwi{\l}{\l} proved that $$\sum_{n\leq x} \frac{1}{n}…