Related papers: Linnik's problem for multiplicative functions

Horv\'ath and Kiss [Proc. Amer. Math. Soc., 2005] proved the upper bound estimate $\frac{\lambda _{n}}{\lambda _{m}}\leq \frac{n^{2}}{m^{2}}$ $ (n>m\geq 1) $ for Dirichlet eigenvalue ratios of the Schr\"odinger problem $-y''+q(x)y=\lambda…

Let $q$ be an odd prime and $k$ be a natural number. We show that a finite subset of integers $S$ that does not contain any perfect $q^{th}$ power, contains a $q^{th}$ power residue modulo almost every natural numbers $N$ with at most $k$…

A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as…

The twice-dimensionally reduced Seiberg-Witten monopole equations admit solutions depending on two real parameters (b,c) and an arbitrary analytic function f(z) determining a solution of Liouville's equation. The U(1) and manifold curvature…

In this paper we classify the nonnegative global minimizers of the functional \[ J_F(u)=\int_\Omega F(|\nabla u|^2)+\lambda^2\chi_{\{u>0\}}, \] where $F$ satisfies some structural conditions and $\chi_D$ is the characteristic function of a…

Random matrix theory has successfully modeled many systems in physics and mathematics, and often the analysis and results in one area guide development in the other. Hughes and Rudnick computed $1$-level density statistics for low-lying…

We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a "near" proof of the fact that this is the case unconditionally, and a complete conditional…

$ $The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let $g^{\Box}(p)$ be the least square-free primitive root modulo $p$. We have proven the following two theorems. Theorem 0.1. $$g^{\Box}(p) <…

Using geometric methods, we improve on the function field version of the Burgess bound, and show that, when restricted to certain special subspaces, the M\"{o}bius function over $\mathbb F_q[T]$ can be mimicked by Dirichlet characters.…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

We consider equations of the form $\Delta u +\lambda^2 V(x)e^{\,u}=\rho$ in various two dimensional settings. We assume that $V>0$ is a given function, $\lambda>0$ is a small parameter and $\rho=\mathcal O(1)$ or $\rho\to +\infty$ as…

We examine two counting problems that seem very group-theoretic on the surface but, on closer examination, turn out to concern integers with restrictions on their prime factors. First, given an odd prime $q$ and a finite abelian $q$-group…

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

For large enough (but fixed) prime powers $q$, and trace functions to squarefree moduli in $\mathbb{F}_q[u]$ with slopes at most $1$ at infinity, and no Artin--Schreier factors in their geometric global monodromy, we come close to…

Let $w$ be any word over the alphabet $\{0,1,\ldots, q-1\}$, and denote by $h$ either a polynomial of degree $d\geq 1$ or $h: n\mapsto m^n$ for a fixed $m$. Furthermore, denote by $e_q(w;h(n))$ the number of occurrences of $w$ as a subword…

In this short note we prove the following result: If a completely multiplicative function $f:\mathbb{N}\to[-1,1]$ is small on average in the sense that $\sum_{n\leq x}f(n)\ll x^{1-\delta}$, for some $\delta>0$, and if the Dirichlet series…

Let $f(n)$ be a multiplicative function satisfying $|f(n)|\leq 1$, $q$ $(\leq N^2)$ be a prime number and $a$ be an integer with $(a,\,q)=1$, $\chi$ be a non-principal Dirichlet character modulo $q$. In this paper, we shall prove that $$…

Erd\H{o}s asked whether there are infinitely many finite sets of distinct primes $p_1<\cdots<p_k$ and positive integers $m$ such that \begin{equation}\label{eq:erdos-original} \frac1{p_1}+\cdots+\frac1{p_k}=1-\frac1m. \end{equation} This is…

Let $L_1$, $L_2$ $L_3$ be integer linear functions with no fixed prime divisor. We show there are infinitely many $n$ for which the product $L_1(n)L_2(n)L_3(n)$ has at most 7 prime factors, improving a result of Porter. We do this by means…

It was recently shown in [4] that, for $L_2$-approximation of functions from a Hilbert space, function values are almost as powerful as arbitrary linear information, if the approximation numbers are square-summable. That is, we showed that…