相关论文: Fourier and Zak transforms of multiplicative chara…

We consider a variant of the Zak transform for a finite group $G$ with respect to a fixed abelian subgroup $H$, and demonstrate a relationship with representations of $G$ induced from characters of $H$. We also show how the Zak transform…

The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…

We give a quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields. We show that the algorithm can be interpreted as a matrix factorization or as solving a deconvolution problem and give…

We study the asymptotic behaviour of the prime pair counting function $\pi_{2k}(n)$ by the means of the discrete Fourier transform on $\mathbb{Z}/ n\mathbb{Z}$. The method we develop can be viewed as a discrete analog of the…

The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…

The aim of this paper is to pursue the investigation of the phase retrieval problem for the fractional Fourier transform $\ff\_\alpha$ started by the second author. We here extend a method of A.E.J.M Janssen to show that there is a…

Using supercharacter theory, we identify the matrices that are diagonalized by the discrete cosine and discrete sine transforms, respectively. Our method affords a combinatorial interpretation for the matrix entries.

We study the Zak transform of totally positive (TP) functions. We use the convergence of the Zak transform of TP functions of finite type to prove that the Zak transforms of all TP functions without Gaussian factor in the Fourier transform…

A Fourier transform S is defined for the quantum double D(G) of a finite group G. Acting on characters of D(G), S and the central ribbon element of D(G) generate a unitary matrix representation of the group SL(2,Z). The characters form a…

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…

In this note, we investigate the paratrophic determinants attached to the multiplicative semigroup $\mathbb{Z}/N\mathbb{Z}$. We show that, via discrete Fourier, cosine, and sine transforms, these determinants factor into products of group…

By the Fourier transformations, any group-invariant functions over finite Abelian groups are transformed into group-invariant functions over the character groups. In this paper, we calculate matrix elements of this transformations under…

Two square matrices of (arbitrary) order N are introduced. They are defined in terms of N arbitrary numbers z_{n}, and of an arbitrary additional parameter (a respectively q), and provide finite-dimensional representations of the two…

We detail an explicit construction of ordinary irreducible representations for the family of finite groups $SL_2({\mathbb Z} /p^n {\mathbb Z})$ for odd primes $p$ and $n\geq 2$. For $n=2$, the construction is a complete set of irreducible…

Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…

We give explicit expressions for the Fourier coefficients of Eisenstein series twisted by Dirichlet characters and modular symbols on $\Gamma_0(N)$ in the case where $N$ is prime and equal to the conductor of the Dirichlet character. We…

This paper is a compilation of well-known results about Zadoff-Chu sequences, including all proofs with a consistent mathematical notation, for easy reference. Moreover, for a Zadoff-Chu sequence $x_u[n]$ of prime length $N_{\text{ZC}}$ and…

The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…

Let V be a finite dimensional vector space over the field with two elements with a given nondegenerate symplectic form. Let [V] be the vector space of complex valued functions on V and let [V]_Z be the subgroup of [V] consisting of integer…

Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means…