相关论文: A Note on the Diagonalization of the Discrete Four…

Let p denote an odd prime. For all p-admissible conductors c over a quadratic number field \(K=\mathbb{Q}(\sqrt{d})\), p-ring spaces \(V_p(c)\) modulo c are introduced by defining a morphism \(\psi:\,f\mapsto V_p(f)\) from the divisor…

Let $[x]$ denote the integral part of the real number $x$, and $N$ be a sufficiently large integer. In this paper, it is proved that, for $1<c<\frac{4109054}{1999527}, c\not=2$, the Diophantine equation…

In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\mathbf{\hat{f}} \in \mathbb{C}^N$ of any given input vector…

Very recently the most general ensemble of qubits are identified using the notion of linearity; any of these qubits gets accepted by a Hadamard gate to generate the equal superposition of the qubit and its orthogonal. Towards more…

The $ (k, a) $-generalized Fourier transform $ \mathscr{F}_{k, a} $ introduced by Ben Sa\"id--Kobayashi--{\O}rsted is a deformation family of the classical Fourier transform with a Dunkl parameter $ k $ and a parameter $ a > 0 $ that…

We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.

We consider the operator of taking the $2p$th derivative of a function with zero boundary conditions for the function and its first $p-1$ derivatives at two distinct points. Our main result provides an asymptotic formula for the eigenvalues…

This paper presents a PDE-based approach to finding an optimal canonical basis with which to represent a nearly integrable Hamiltonian. The idea behind the method is to continuously deform the initial canonical basis in such a way that 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…

The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…

The search for a canonical set of eigenvectors of the discrete Fourier transform has been ongoing for more than three decades. The goal is to find an orthogonal basis of eigenvectors which would approximate Hermite functions -- the…

We give upper bounds on the size of the gap between the constant term and the next non-zero Fourier coefficient of an entire modular form of given weight for \Gamma_0(2). Numerical evidence indicates that a sharper bound holds for the…

An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…

This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transformation (NFT). The theoretical underpinnings of this generalization of the conventional…

Fourier transform (FT) plays a crucial role in a broad range of applications, from enhancement, restoration and analysis through to security, compression and manipulation. The Fourier transform (FT) is a process that converts a function…

We show how to transform the problem of finding d+1 mutually unbiased bases in the d-dimensional Hilbert space into the one of finding d(d+1) vectors in the N-dimensional Hilbert space with N=d**2. The transformation formulas admit a…

Let $\mathfrak{p}$ be a monic irreducible polynomial in $A:=\mathbb{F}_q[\theta]$, the ring of polynomials in the indeterminate $\theta$ over the finite field $\mathbb{F}_q$, and let $\zeta$ be a root of $\mathfrak{p}$ in an algebraic…

For a rational prime $p \geq 3$ we consider $p$-ordinary, Hilbert modular newforms $f$ of weight $k\geq 2$ with associated $p$-adic Galois representations $\rho_f$ and $\mod{p^n}$ reductions $\rho_{f,n}$. Under suitable hypotheses on the…

The one-dimensional (1D) fractional Fourier transform (FRFT) generalizes the Fourier transform, offering significant advantages in the time-frequency analysis of non-stationary signals. While various 2D extensions exist, such as the 2D…

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…