Related papers: On Euler's totient function of polynomials over fi…
The image of Euler's totient function is composed of the number 1 and even numbers. However, many even numbers are not in the image. We consider the problem of finding those even numbers which are in the image and those which are not. If an…
We study a finite analogue of Dobi\'{n}ski's formula, which is related to the Napier constant $e$, and its Bessel-type generalizations. Furthermore, using Gregory polynomials, we extend the results of Kaneko--Matsusaka--Seki on finite…
In this paper we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.
In this note we generalize and prove a recent conjecture of Varchenko concerning the number of critical points of a (multivalued) meromorphic function $\phi$ on an algebraic manifold. Under certain conditions, this number turns out to…
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
The Euler's totient function $ \varphi(n) $ counts the positive integers up to a given integer $ n$ that are relatively prime to $ n $. We solve a problem due to Lehmer that there is no composite number $ n $ such that $ \varphi(n)\mid n-1…
For $N \in \mathbb{N}$, let $T_{N}$ be the Chebyshev polynomial of the first kind. Expressions for the sequence of numbers $p_{\ell}^{(N)}$, defined as the coefficients in the expansion of $1/T_{N}(1/z)$, are provided. These coefficients…
We use spectral theory and algebraic geometry to establish a higher-degree analogue of a Szemer\'edi--Trotter-type theorem over finite fields, with an application to polynomial expansion.
In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…
Inspired by Lehmer's and Deaconescu's conjectures, as well as various analogue problems concerning Euler's totient function $\varphi(n)$, Schemmel's totient function $S_{2}(n)$, Jordan totient function $J_k$, and the unitary totient…
Functional analogs of the Euler characteristic and volume together with a new analog of the polar volume are characterized as non-negative, continuous, $\operatorname{SL}(n)$ and translation invariant valuations on the space of finite,…
We formulate and prove the analogue of the Ramanujan Conjectures for modular forms of half-integral weight subject to some ramification restriction in the setting of a polynomial ring over a finite field. This is applied to give an…
An important unsolved question in number theory is the Lehmer's totient problem that asks whether there exists any composite number $n$ such that $\varphi(n)\mid n-1$, where $\varphi$ is the Euler's totient function. It is known that if any…
We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. We focus on the case where the escape is degenerate in the sense that points from…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
Two inequalities involving the Euler totient function and the sum of the $k$-th powers of the divisors of balancing numbers are explored.
Euler totient function $\phi(n)$ plays a central role in number theory and is applied in areas such as cryptography. In this paper, we study iterations of the totient function. We first prove that for any integer $n>2$, iteratively applying…
We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…
The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…
Historically, the polylogarithm has attracted specialists and non-specialists alike with its lovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in…