Related papers: A group-theoretical approach to Lehmer's totient p…

We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function $\varphi(n)$ and the Riemann Hypothesis. Among other things, we prove that for $1\leq q\leq 10$ and for $q=12,…

We consider groups $G$ such that the set $[G,\varphi]=\{g^{-1}g^{\varphi}|g\in G\}$ is a subgroup for every automorphism $\varphi$ of $G$, and we prove that there exists such a group $G$ that is finite and nilpotent of class $n$ for every…

In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…

A generalization of the congruent number problem is to find positive integers $n$ that appear as the areas of Heron triangles. Selmer group of a congruent number elliptic curve has been studied quite extensively. Here, we look into the…

Let $\sigma(n)$ be the sum of the divisors of $n$. Kalita and Saikia defined a number $n$ to be near superperfect if $2n+d=\sigma(\sigma(n))$ for some positive divisor $d$ of $n$. We extend some of their results about near superperfect…

We consider the Thompson-Stein group F(n_1,...,n_k) for integers n_1,...,n_k and k greater than 1. We highlight several differences between the cases k=1$ and k>1, including the fact that minimal tree-pair diagram representatives of…

Let $f$ be a normalized Hecke eigenform with rational integer Fourier coefficients. It is an interesting question to know how often an integer $n$ has a factor common with the $n$-th Fourier coefficient of $f$. The second author…

Let us denote by $\tau(n)$ and $\si(n)$ the number and the sum of the divisors of $n$ and by $\vfi$ Euler's function. We give effective upper bounds for $\frac{n}{\vfi(n)}$ in terms of $\vfi(n)$, and for $\frac{\si(n)}{n}$ in terms of…

We state and prove an equivariant version of Lehmer's conjecture on heights, generalizing papers by Zagier (1993) and Dresden (1998) which are special cases of this theorem. We also extend their three cases to a full classification of all…

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

Let N = 1 mod 4 be the negative of a prime, K=Q(sqrt{N}) and O_K its ring of integers. Let D be a prime ideal in O_K of prime norm congruent to 3 modulo 4. Under these assumptions, there exists Hecke characters $\psi_{\D}$ of K with…

Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…

The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…

By a theorem of Gordon and Hedenmalm, $\varphi$ generates a bounded composition operator on the Hilbert space $\mathscr{H}^2$ of Dirichlet series $\sum_n b_n n^{-s}$ with square-summable coefficients $b_n$ if and only if $\varphi(s)=c_0…

It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each…

The Furstenberg recurrence theorem (or equivalently, Szemer\'edi's theorem) can be formulated in the language of von Neumann algebras as follows: given an integer $k \geq 2$, an abelian finite von Neumann algebra $(\M,\tau)$ with an…

Let $\psi$ denote the Dedekind totient function defined by $ \psi(n)=\sum_{d|n}d\mu^2\l({n}/{d}\r) $ with $\mu$ being the M\"{o}bius function. We shall consider the $k$-th Riesz mean of the arithmetical function $n/\psi(n)$ for any…

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

We define $\overline{\psi}$ to be the multiplicative arithemtic function that satisfies \[\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), & \mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases}\] for all primes $p$…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…