English
Related papers

Related papers: A Generalisation of Euler Totient Function

200 papers

We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erd\H os-Hooley $\Delta$-function, we derive lower bounds for the…

Number Theory · Mathematics 2026-01-14 Régis de la Bretèche , Gérald Tenenbaum

Let $U_{k,N}$ denote the Boolean function which takes as input $k$ strings of $N$ bits each, representing $k$ numbers $a^{(1)},\dots,a^{(k)}$ in $\{0,1,\dots,2^{N}-1\}$, and outputs 1 if and only if $a^{(1)} + \cdots + a^{(k)} \geq 2^N.$…

Computational Complexity · Computer Science 2015-08-14 Xi Chen , Igor C. Oliveira , Rocco A. Servedio

In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $\varphi$, Dedekind function $\Psi$, sum-of-divisors function $\sigma$ or the alternating sum-of-divisors function…

Number Theory · Mathematics 2021-09-08 Jing Ma , Huayan Sun

We determine new bounds on the entries of Gorenstein Hilbert functions, both in any fixed codimension and asymptotically. Our first main theorem is a lower bound for the degree $i+1$ entry of a Gorenstein $h$-vector, in terms of its entry…

Commutative Algebra · Mathematics 2009-03-10 Juan C. Migliore , Uwe Nagel , Fabrizio Zanello

After the work of Bordell\`{e}s, Dai, Heyman, Pan and Shparlinki (2018) and Heyman (2019), several authors studied the averages of arithmetic functions over the sequence $[x/n]$ and the integers of the form $[x/n]$. In this paper, we give…

Number Theory · Mathematics 2025-06-30 Kota Saito , Yuta Suzuki , Wataru Takeda , Yuuya Yoshida

Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…

Number Theory · Mathematics 2025-11-18 Diego Marques , Pavel Trojovsky

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Combinatorics · Mathematics 2023-06-22 David Dong

A classical result by R. Rochberg says that every bounded Toeplitz operator $T$ on the Hilbert Paley-Wiener space $\mathrm{PW}_a^2$ admits a bounded symbol $\varphi$. We generalize this result to Toeplitz operators on the Banach…

Functional Analysis · Mathematics 2025-10-07 Petr Kulikov

We continue the study initiated by H. S. Shapiro on Fischer decompositions of entire functions, showing that such decomposition exist in a weak sense (we do not prove uniqueness) under hypotheses regarding the order of the entire function…

Analysis of PDEs · Mathematics 2024-03-18 J. M. Aldaz , H. Render

In this note, we prove a sharp lower bound for the log canonical threshold of a plurisubharmonic function $\varphi$ with an isolated singularity at $0$ in an open subset of ${\mathbb C}^n$. This threshold is defined as the supremum of…

Complex Variables · Mathematics 2014-02-17 Jean-Pierre Demailly , Hoang Hiep Pham

Let $I(n):=\int_0^1 [x^n+(1-x)^n]^\frac1n dx.$ In this paper, we show that $I(n)= \sum_0^\infty \frac{I_i}{n^i},n\rightarrow \infty$ and we compute $I_i, i =0..5$, obtained by polylog functions and Euler sums. As a corollary, we obtain…

Combinatorics · Mathematics 2017-10-03 Guy Louchard

The height $H(n)$ of $n$, introduced by Pillai in 1929, is the smallest positive integer $i$ such that the $i$th iterate of Euler's totient function at $n$ is $1$. H. N. Shapiro (1943) studied the structure of the set of all numbers at a…

Number Theory · Mathematics 2020-03-03 Hartosh Singh Bal , Gaurav Bhatnagar

A pair of numbers is amicable if each number equals the sum of the proper divisors of the other. This paper after exploring the history and evolution of amicable numbers, introduces a novel characterization of amicable pairs whose greatest…

History and Overview · Mathematics 2025-12-30 Ali Reza Mavaddat , Saeid Alikhani

We compare the asymptotic behavior of Carmichael's lambda function composed with Euler's totient function to the asymptotic behavior of Carmichael's lambda function composed with itself. We establish the normal order of the logarithm of the…

Number Theory · Mathematics 2012-06-04 Vishaal Kapoor

We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function $f : G \to \{-1,+1\}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. We introduce a general notion of granularity of…

Computational Complexity · Computer Science 2026-02-03 Sourav Chakraborty , Swarnalipa Datta , Pranjal Dutta , Arijit Ghosh , Swagato Sanyal

We add an analytic trans-exponential function $\varphi$ to $\mathbb{R}_{an,\exp}$. We reduce the o-minimality of $\mathbb{R}_{an,\exp,\varphi}$ to the existence of "many" regular values for some definable systems of functions, which is a…

Logic · Mathematics 2026-04-07 Yayi Fu

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

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

Number Theory · Mathematics 2025-12-09 Zhen Chen , Junrong Luo

This paper, first, we consider the Volterra integral equation for the remainder term in the asymptotic formula for the associated Euler totient function. Secondly, we solve the Volterra integral equation and we split the error term in the…

Number Theory · Mathematics 2022-05-13 Hideto Iwata

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

Combinatorics · Mathematics 2025-07-15 Vuong Bui
‹ Prev 1 8 9 10 Next ›