Related papers: Linear complexity and trace representation of quat…
The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…
We take the trace of Von-Neumann's ergodic theorem and get a trace formula of a unitary matrix family. It is an extension of Poisson summation formula in higher dimension. We also construct a family of crystalline measure with complex…
We study Fourier transforms of holonomic D-modules on the complex affine line and show that their enhanced solution complexes are described by a twisted Morse theory. We thus recover and even strengthen the well-known formula for their…
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…
In this paper, we give an explicit expression for a certain family of ternary cyclotomic polynomials: specifically $\Phi_{p_{1}p_{2}p_{3}}$, where $p_{1}<p_{2}<p_{3}$ are odd primes such that $p_{2} \equiv1 \mod p_{1}$ and $p_{3} \equiv1…
Casually introduced thirty years ago, a simple algebraic equation of degree 4, with coefficients in Fp[T], has a solution in the field of power series in 1/T, over the finite field Fp. For each prime p > 3, the continued fraction expansion…
The quadratic phase Fourier transform QPFT is a neoteric addition to the class of Fourier transforms and embodies a variety of signal processing tools including the Fourier, fractional Fourier, linear canonical, and special affine Fourier…
Quaternionic automorphic representations are one attempt to generalize to other groups the special place holomorphic modular forms have among automorphic representations of $\mathrm{GL}_2$. Here, we use "hyperendoscopy" techniques to…
This summary of the doctoral thesis provides a comprehensive formulation of the Extended Discrete Fourier Transform (EDFT), derived directly from the Fourier integral and its orthogonality properties. The method is obtained by solving…
We study certain polynomial trace identities in the group $SL(2,\IC)$ and their application in the theory of discrete groups. We obtain canonical representations for two generator groups in \S 4 and then in \S 5 we give a new proof for…
In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear…
We determine the structure of the cyclotomic Hecke algebra corresponding to the complex reflection group $G_{25}$ also when it is not semisimple, as long as the generators are diagonalizable. In particular, we classify all simple…
Using Watson's terminating $_8\phi_7$ transformation formula, we prove a family of $q$-congruences modulo the square of a cyclotomic polynomial, which were originally conjectured by the author and Zudilin [J. Math. Anal. Appl. 475 (2019),…
A cyclotomic polynomial \Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Here we…
Given an $n$-length input signal $\mbf{x}$, it is well known that its Discrete Fourier Transform (DFT), $\mbf{X}$, can be computed in $O(n \log n)$ complexity using a Fast Fourier Transform (FFT). If the spectrum $\mbf{X}$ is exactly…
An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of…
We treat the quaternionic Fourier transform (QFT) applied to quaternion fields and investigate QFT properties useful for applications. Different forms of the QFT lead us to different Plancherel theorems. We relate the QFT computation for…
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic…
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…
Using Hecke characters, we construct two infinite families of newforms with complex multiplication, one by $\mathbb{Q}(\sqrt{-3})$ and the other by $\mathbb{Q}(\sqrt{-2})$. The values of the $p$-th Fourier coefficients of all the forms in…