English
Related papers

Related papers: Fonctions compl\`etement multiplicatives de somme …

200 papers

We focus on a sequence of functions $\{f_n\}$, defined on a compact manifold with boundary $S$, converging in the $C^k$ metric to a limit $f$. A common assumption implicitly made in the empirical sciences is that when such functions…

General Topology · Mathematics 2025-08-11 Thomas J. Maullin-Sapey , Samuel Davenport

We consider two classes of piecewise expanding maps $T$ of $[0,1]$: a class of uniformly expanding maps for which the Perron-Frobenius operator has a spectral gap in the space of bounded variation functions, and a class of expanding maps…

Probability · Mathematics 2012-01-27 Jerome Dedecker , Sébastien Gouëzel , Florence Merlevede

Let $k$ be an integer greater than or equal $4$. We show that if a multiplicative function $f$ satisfies \[ f(x_1^2 + x_2^2 + \dots + x_k^2) = f(x_1)^2 + f(x_2)^2 + \dots + f(x_k)^2 \] for all positive integers $x_i$'s, then $f$ is the…

Number Theory · Mathematics 2021-03-02 Poo-Sung Park

We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…

Number Theory · Mathematics 2021-11-15 Alexander P. Mangerel

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…

Computational Complexity · Computer Science 2009-02-10 Laurent Bienvenu , Rod Downey

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

Number Theory · Mathematics 2025-11-19 Oleksiy Klurman , Vlad Matei

Let $\mathtt{PRIMES}$ be the set of all primes. We show that a multiplicative function which satisfies \[ f(p+q-2) = f(p) + f(q) - f(2) \text{ for }p,q \in \mathtt{PRIMES} \] is one of the following: \begin{enumerate} \item $f$ is the…

Number Theory · Mathematics 2017-08-11 Poo-Sung Park

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

Classical Analysis and ODEs · Mathematics 2018-09-21 Tamás Erdélyi

Let $f: \mathbb{N}^2 \mapsto \mathbb{C}$ be an arithmetic function of two variables. We study the existence of the limit: \[\displaystyle \lim_{x \to \infty} \frac{1}{x^2 (\log x)^{k-1}} \sum_{n_1 , n_2 \le x} f (n_1, n_2) \] where $k$ is a…

Number Theory · Mathematics 2016-04-20 Noboru Ushiroya

For a transcendental entire function $f$, the property that there exists $r>0$ such that $m^n(r)\to\infty$ as $n\to\infty$, where $m(r)=\min \{|f(z)|:|z|=r\}$, is related to conjectures of Eremenko and of Baker, for both of which order…

Complex Variables · Mathematics 2021-02-04 Daniel A. Nicks , Philip J. Rippon , Gwyneth M. Stallard

If $C$ is a curve over $\mathbb{Q}$ with genus at least $2$ and $C(\mathbb{Q})$ is empty, then the class of fields $K$ of characteristic 0 such that $C(K) = \varnothing$ has a model companion, which we call $C\mathrm{XF}$. The theory…

Logic · Mathematics 2025-05-28 Will Johnson , Jinhe Ye

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

We establish an uncertainty principle for functions $f: \mathbb{Z}/p \rightarrow \mathbb{F}_q$ with constant support (where $p \mid q-1$). In particular, we show that for any constant $S > 0$, functions $f: \mathbb{Z}/p \rightarrow…

Combinatorics · Mathematics 2019-06-27 Saad Quader , Alexander Russell , Ravi Sundaram

This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by…

Logic in Computer Science · Computer Science 2019-03-14 Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio

If $f$ is a symmetric complex-valued function on the $m$-fold Cartesian product of the set of non-negative reals and $A$ is a positive semi-definite $m\times m$ matrix with eigenvalues $\lambda_j$, we set…

Functional Analysis · Mathematics 2016-12-13 Lutz Klotz , Conrad Mädler

We construct extensions of Varopolous type for functions $f \in \text{BMO}(E)$, for any uniformly rectifiable set $E$ of codimension one. More precisely, let $\Omega \subset \mathbb{R}^{n+1}$ be an open set satisfying the corkscrew…

Analysis of PDEs · Mathematics 2020-03-18 Steve Hofmann , Olli Tapiola

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…

Number Theory · Mathematics 2023-03-03 Leonardo F. Bielinski , Giuliano G. La Guardia , Jocemar Q. Chagas

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

Number Theory · Mathematics 2012-11-16 Jean Bourgain

We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…

Number Theory · Mathematics 2023-08-24 Oleksiy Klurman , Alexander P. Mangerel , Joni Teräväinen

We prove the following results solving a problem raised in [Y. Caro, R. Yuster, On zero-sum and almost zero-sum subgraphs over $\mathbb{Z}$, Graphs Combin. 32 (2016), 49--63]. For a positive integer $m\geq 2$, $m\neq 4$, there are…

Combinatorics · Mathematics 2017-09-01 Yair Caro , Adriana Hansberg , Amanda Montejano