Related papers: Fourier transforms of polytopes, solid angle sums,…
For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…
By using the three-term recurrence equation satisfied by a family of orthogonal polynomials, the Christoffel-Darboux-type bilinear generating function and their asymptotic expressions, we obtain quadrature formulas for integral transforms…
This article is concerned with a new method for the approximate evaluation of Fourier sine and cosine transforms. We develop and analyse a new quadrature rule for Fourier sine and cosine transforms involving transforming the integral to one…
The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
We explore a new form of DFT, which we call the Polynomial Transform. It functions over finite fields, and a size $n$ transform takes $O(n)$ operations. In the multitape Turing machine model, it allows us to multiply two $n$ bit numbers in…
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…
A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…
Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fractions of the ring of formal power series $K[[x_1,\ldots,x_r]]$, $r\geq 2$. More precisely, we view the latter as a subfield of an iterated…
This comprehensive review paper delves into the intricacies of advanced Fourier type integral transforms and their mathematical properties, with a particular focus on fractional Fourier transform (FrFT), linear canonical transform (LCT),…
Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…
This notes explains how a standard algorithm that constructs the discrete Fourier transform has been formalised and proved correct in the Coq proof assistant using the SSReflect extension.
The present paper is a continuation of our work [11], where we introduced a fractional operator calculus related to a fractional ${\psi}-$Fueter operator in the one-dimensional Riemann-Liouville derivative sense in each direction of the…
We highlight the important role of the Fourier transform in deriving inversion formulas for the integral transforms of tomographic imaging. We demonstrate this principle by deriving inversion formulas for the divergent beam transform and…
Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…
A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…
In this note we consider the Fourier expansion of the Ferrers function P of the first kind. We determine its mode of convergence.
$F$-polynomials are integer coefficient polynomials encoding the mutations of cluster variables inside a cluster algebra. In this article, we study the $F$-polynomials associated with the action of Donaldson-Thomas transformations on…
We provide and discuss complex analytic methods for overcoming the formal character of formal deformation quantization. This is a necessity for returning to physically meaningful statements, and accounts for the fact that the formal…
We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry…