相关论文: Additive uniqueness of $\mathtt{PRIMES}-1$ for mul…

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…

In this paper, we introduce the notion of $q$-quasiadditivity of arithmetic functions, as well as the related concept of $q$-quasimultiplicativity, which generalise strong $q$-additivity and -multiplicativity, respectively. We show that…

Given a prime power $q$ and an integer $n\geq2$, we establish a sufficient condition for the existence of a primitive pair $(\alpha,f(\alpha))$ where $\alpha \in \mathbb{F}_q$ and $f(x) \in \mathbb{F}_q(x)$ is a rational function of degree…

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

We show that for any $\varepsilon > 0$, prime $q$ sufficiently large with respect to $1 / \varepsilon$ and residue class $(a,q) = 1$, there exist two integers $m, n \leq q^{5/2 + \varepsilon}$ with $m \equiv n \equiv a \pmod{q}$ such that…

I develop a function that, for any integer $n \geq 2$, takes a value of 1 if $n$ is prime, 0 if $n$ is composite. I also discuss two applications: First, the characteristic function provides a new expression for the prime counting function.…

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

We prove several power series identities involving the refined generating function of interval orders, as well as the refined generating function of the self-dual interval orders. These identities may be expressed as $\sum_{n\ge…

The $q$-analogue of an integer $m$ is given by $[m]_q=(1-q^m)/(1-q)$. Let $a$ be an integer, and let $n$ be a positive odd integer. Via discrete Fourier transforms, we establish the following two identities:…

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…

We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant…

Let $p$ be a prime, $q=p^n$, and $D \subset \mathbb{F}_q^*$. A celebrated result of McConnel states that if $D$ is a proper subgroup of $\mathbb{F}_q^*$, and $f:\mathbb{F}_q \to \mathbb{F}_q$ is a function such that $(f(x)-f(y))/(x-y) \in…

We describe a purely-multiplicative method for extending an analytic function. It calculates the value of an analytic function at a point, merely by multiplying together function values and reciprocals of function values at other points…

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

Let $f$ be a real-valued $1$-bounded multiplicative function. Suppose that the mean-value of $f^{2}$ exists, and $$\int_{0}^{1} \Big | \sum_{n \leq N} f(n)e^{2\pi i n \alpha} \Big | d \alpha\leq N^{o(1)}$$ as $N \rightarrow \infty$, then…

A real arithmetic function f is multiplicatively monotonous if f (mn) -- f (m) has constant sign for m, n positive integers. Properties and examples of such functions are discussed, with applications to positive hermitian…

The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

We prove that a multiplicative function $f:\mathbb{N}\to\mathbb{C}$ is Toeplitz if and only if there are a Dirichlet character $\chi$ and a finite subset $F$ of prime numbers such that $f(n)=\chi(n)$ for each $n$ which is coprime to all…