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

This 1964 paper developed as an off-shoot to the foundational query: Do we discover the natural numbers (Platonically), or do we construct them linguistically? The paper also assumes computational significance in the light of Agrawal, Kayal…

We propose a method to determine the solvability of the diophantine equation $x^2-Dy^2=n$ for the following two cases: $(1)$ $D=pq$, where $p,q\equiv 1 \mod 4$ are distinct primes with $(\frac{q}{p})=1$ and…

We develop a theory of $p$-adic continued fractions for a quaternion algebra $B$ over $\mathbb Q$ ramified at a rational prime $p$. Many properties holding in the commutative case can be proven also in this setting. In particular, we focus…

For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…

We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…

Consider the semisimple mod p reduction of the Galois representation associated to a Hilbert newform f by Carayol and Taylor. This paper discusses how, under certain conditions on f, the universal ring for deformations of this residual…

This tutorial aims to establish connections between polynomial modular multiplication over a ring to circular convolution and discrete Fourier transform (DFT). The main goal is to extend the well-known theory of DFT in signal processing…

A recent result by Barrera and Peligrad shows that the quenched Central Limit Theorem holds for the discrete Fourier transforms (DFT) of a stationary process in $L^2$ if a "random" centering is used. In this note we show that this is a…

Using Pathak and Pathak techniques, the basic function $D^\alpha(u,v,w)$ associated with general novel fractional wavelet transform (GNFrWT)is defined and its properties are investigated. By using basic function $D^\alpha(u,v,w)$…

We show that for primes $N, p \geq 5$ with $N \equiv -1 \bmod p$, the class number of $\mathbb{Q}(N^{1/p})$ is divisible by $p$. Our methods are via congruences between Eisenstein series and cusp forms. In particular, we show that when $N…

Lower Bound for the Canonical Height for Drinfeld Modules with Complex Multiplication. Let K be a fi nite extension of Fq(T), let L=K be a Galois extension with Galois group G and let E be the sub eld of L fixed by the center of G. Assume…

Let $p$ be a sufficiently large prime number, $r$ be any given positive integer. Suppose that $a_1,\,\dots,\,a_r$ are pairwise distinct and not zero modulo $p$. Let $N(a_1,\,\dots,\,a_r;\,p)$ denote the number of…

Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in error correction coding. Hence, reducing the computational complexities of DFTs is of great significance, especially for long DFTs as increasingly longer…

The purpose of the present article is to demonstrate the calibration of photomultipliers with a gaussian single photoelectron response using a numerical method based on the Discrete Fourier Transform (DFT). Conventional techniques, commonly…

The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…

The inversion theorem and convolution theorem of the conformable fractional Laplace transforms are developed. All the elementary properties of the classical Laplace transform are extended to the conformable fractional transform, and using…

A set of generalized superalgebras containing arbitrary tensor p-form operators is considered in dimensions $D=2n+1$ for $n=1,4 mod 4$ and the general conditions for its existence expressed in the form of generalized Jacobi identities is…

Given an odd prime number p, we describe a continued fraction in the field F(p) of power series in 1/T with coefficients in the finite field F_p, where T is a formal indeterminate. This continued fraction satisfies an algebraic equation of…

In this work, we present the \emph{twiddless fast Fourier transform (TFFT)}, a novel algorithm for computing the $N$-point discrete Fourier transform (DFT). The TFFT's divide strategy builds on recent results that decimate an $N$-point…

Let p be a prime number. In this paper we use an old technique of Ore, based on Newton polygons, to construct in an efficient way p-integral bases of number fields defined by a p-regular equation. To illustrate the potential applications of…