相关论文: On the Fourier transform of the greatest common di…

The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…

An arithmetical function $f$ is said to be even (mod r) if f(n)=f((n,r)) for all n\in\Z^+, where (n, r) is the greatest common divisor of n and r. We adopt a linear algebraic approach to show that the Discrete Fourier Transform of an even…

We give a detailed study of the discrete Fourier transform (DFT) of $r$-even arithmetic functions, which form a subspace of the space of $r$-periodic arithmetic functions. We consider the DFT of sequences of $r$-even functions, their mean…

Let $\gcd(k,j)$ denote the greatest common divisor of the integers $k$ and $j$, and let $r$ be any fixed positive integer. Define $$ M_r(x; f) := \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) $$ for any large real number…

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…

A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…

In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of…

Let $f$ be an arithmetical function. The matrix $[f(i,j)]_{n\times n}$ given by the value of $f$ in greatest common divisor of $(i,j)$, $f\big((i,j)\big)$ as its $i,\; j$ entry is called the greatest common divisor (GCD) matrix. We consider…

An $(r,s)$-even function is a special type of periodic function mod $r^s$. These functions were defined and studied for the the first time by McCarthy. An important example for such a function is a generalization of Ramanujan sum defined by…

Fourier transformations of several functions of one and two variables are evaluated and then used to derive some integral and series identities. It is shown that certain double Mordell integrals can be reduced to a sum of products of…

A remarkable discrete counterpart of the Gaussian function of one continuous variable can be defined by using a Jacobi theta function, that is, as the sum of a convergent series. We extend this approach to Gaussian functions of two…

The Fourier transform of a bounded measurable function, $f$, on the real line is shown to be the second distributional derivative of a H\"older continuous function. The Fourier transform is written as the difference of $\int_{-1}^1…

Let $\gcd(d_{1},\ldots,d_{k})$ be the greatest common divisor of the positive integers $d_{1},\ldots,d_{k}$, for any integer $k\geq 2$, and let $\tau$ and $\mu$ denote the divisor function and the M\"{o}bius function, respectively. For an…

The $k$-dimensional generalized Euler function $\varphi_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$…

We survey general properties of multiplicative arithmetic functions of several variables and related convolutions, including the Dirichlet convolution and the unitary convolution. We introduce and investigate a new convolution, called gcd…

The classical Menon's identity [7] states that \begin{equation*}\label{oldbegin1} \sum_{\substack{a\in\Bbb Z_n^\ast }}\gcd(a -1,n)=\varphi(n) \sigma_{0} (n), \end{equation*} where for a positive integer $n$, $\Bbb Z_n^\ast$ is the group of…

This is a sequel to math.AG/0003009. Here we study identities for the Fourier transform of "elementary functions" over finite field containing "exponents" of monomial rational functions. It turns out that these identities are governed by…

In this paper, we provide a solution to the open problem of computing the Fourier transform of a binary function defined over $n$-bit vectors taking $m$-bit vector values. In particular, we introduce the two-modular Fourier transform (TMFT)…

We extend A.B. Mingarelli's method for constructing generalized factorials. Our extension uses a pair of arithmetic functions $(x, y)$, where $x$ is superadditive. When $x$ is the identity function, our generalized factorial reduces to…

The $j$th divisor function $d_j$, which counts the ordered factorisations of a positive integer into $j$ positive integer factors, is a very well-known arithmetic function; in particular, $d_2(n)$ gives the number of divisors of $n$.…