Related papers: Complex and Hypercomplex Discrete Fourier Transfor…
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for…
This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and…
We propose a quadrature-based formula for computing the exponential function of matrices with a non-oscillatory integral on an infinite interval and an oscillatory integral on a finite interval. In the literature, existing quadrature-based…
The explicit construction of direct and inverse Fourier's vector transform with discontinuous coefficients is presented. The technique of applying Fourier's vector transform with discontinuous coefficients for solving problems of…
Motivated by decompositions of spaces that arise in continuous and discrete Morse theory, we describe a so called fibrous decomposition Z = X_0(Y_1)X_1 ... X_{n-1}(Y_n)X_n of a space Z. Among the applications is a succinct formula for the…
The Euler Characteristic Transform (ECT) has proven to be a powerful representation, combining geometrical and topological characteristics of shapes and graphs. However, the ECT was hitherto unable to learn task-specific representations. We…
The explicit matrix realizations of the reversion anti-automorphism and the spin group depend on the set of matrices chosen to represent a basis of 1 -vectors for a given Clifford algebra. On the other hand, there are iterative procedures…
Let (G, V) be a prehomogeneous vector space, let O be any G(F_q)-invariant subset of V(F_q), and let f be the characteristic function of O. In this paper we develop a method for explicitly and efficiently evaluating the Fourier transform of…
Quantum theory (QT), namely in terms of Schr\"odinger's 1926 wave functions in general requires complex numbers to be formulated. However, it soon turned out to even require some hypercomplex algebra. Incorporating Special Relativity leads…
Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…
We compute Fourier transforms of functions expressed as a ratio of one of the Jacobi elliptic functions divided by $\sinh(\pi x)$ or $\cosh(\pi x)$. In many cases, the resulting Fourier transform remains within the same class of functions.…
We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…
Analytic expressions for the Fourier transforms of the Chebyshev and Legendre polynomials are derived, and the latter is used to find a new representation for the half-order Bessel functions. The numerical implementation of the so-called…
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…
This paper introduces a new functional expansion framework that extends classical ideas beyond the Taylor series. Unlike traditional Taylor expansions based on local polynomial approximations, the proposed approach arises from exact…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…
We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…
The Hurwitz-type Euler zeta function is defined as a deformation of the Hurwitz zeta function: \begin{equation*} \zeta_E(s,x)=\sum_{n=0}^\infty\frac{(-1)^n}{(n+x)^s}. \end{equation*} In this paper, by using the method of Fourier expansions,…
A product of two hypergeometric series is generally not hypergeometric. However, there are a few cases when such product does reduce to a single hypergeometric series. The oldest result of this type, beyond the obvious…