Related papers: Max-Plus Algebra for Complex Variables and Its App…
We control a broad class of singular (or "rough") Fourier multipliers by geometrically-defined maximal operators via general weighted $L^2(\mathbb{R})$ norm inequalities. The multipliers involved are related to those of Coifman--Rubio de…
Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of…
A system of commutative complex numbers in 5 dimensions of the form u=x_0+h_1x_1+h_2x_2+h_3x_3+h_4x_4 is described in this paper, the variables x_0, x_1, x_2, x_3, x_4 being real numbers. The operations of addition and multiplication of the…
In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…
In this paper we introduce a novel quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to…
Derivatives play a critical role in computational statistics, examples being Bayesian inference using Hamiltonian Monte Carlo sampling and the training of neural networks. Automatic differentiation is a powerful tool to automate the…
This is the first part of a work devoted to the study of linear Mahler systems in several variables from the perspective of transcendence and algebraic independence. We prove two main results concerning systems that are regular singular at…
The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…
We explore some aspects of phase transitions in cellular automata. We start recalling the standard formulation of statistical mechanics of discrete systems (Ising model), illustrating the Monte Carlo approach as Markov chains and stochastic…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
Auxiliary matrix exponential method is used to derive simple and numerically efficient general expressions for the following, historically rather cumbersome and hard to compute, theoretical methods: (1) average Hamiltonian theory following…
The derivatives of a Boolean function are defined up to any order. The Taylor and MacLaurin expansions of a Boolean function are thus obtained. The last corresponds to the ring sum expansion (RSE) of a Boolean function, and is a more…
We introduce a novel framework for simulating finite automata using representation-theoretic semidirect products and Fourier modules, achieving more efficient Transformer-based implementations.
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…
We construct a quadratic basis of generators of matrix-extended $\mathcal{W}_{1+\infty}$ using a generalization of the Miura transformation. This makes it possible to conjecture a closed-form formula for the operator product expansions…
Based on the definition of the Fourier transform in terms of the number operator of the quantum harmonic oscillator and in the corresponding definition of the fractional Fourier transform, we have obtained the discrete fractional Fourier…
Integro-differential methods, currently exploited in calculus, provide an inexhaustible source of tools to be applied to a wide class of problems, involving the theory of special functions and other subjects. The use of integral transforms…
In our recent publication [1] we presented an exponential series approximation suitable for highly accurate computation of the complex error function in a rapid algorithm. In this Short Communication we describe how a simplified…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…