Related papers: Generalized Transforms and Special Functions
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
This paper presents some properties and applications of "transversal operators". Two transversal operators are presented: a "translation" operator T and a "dilation" operator D. Such operators are used in common analysis systems including…
When writing programs, people have the ability to tackle a new complex task by decomposing it into smaller and more familiar subtasks. While it is difficult to measure whether neural program synthesis methods have similar capabilities, what…
Transformer networks have seen great success in natural language processing and machine vision, where task objectives such as next word prediction and image classification benefit from nuanced context sensitivity across high-dimensional…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
In the present paper, we use a generalised shift operator in order to define a generalised modulus of smoothness. By its means, we define generalised Lipschitz classes of functions, and we give their constructive characteristics.…
By using methods of umbral nature, we discuss new rules concerning the operator ordering. We apply the technique of formal power series to take advantage from the wealth of properties of the exponential operators. The usefulness of the…
The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their…
We continue the studies of Moutard-type transform for generalized analytic functions started in our previous paper: arXiv:1510.08764. In particular, we suggest an interpretation of generalized analytic functions as spinor fields and show…
We prove an inversion theorem for the Fourier transform defined for normal functions, in the case when such functions are of moderate decrease, and in dimensions 2 and 3. This improves on Carleson's general almost everywhere convergence…
We observe a large number of functions differing from each other only by a translation parameter. While the main pattern is unknown, we propose to estimate the shift parameters using $M$-estimators. Fourier transform enables to transform…
The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…
In this paper we introduce new generalizations of the zeta function, the Tricomi functions; their main properties are studied. This opens the way to a deeper, better application of these functions both in the theory of special functions,…
Using the character expansion method, we generalize several well-known integrals over the unitary group to the case where general complex matrices appear in the integrand. These integrals are of interest in the theory of random matrices and…
In this note we explore the relationship between the operation of convolution of functions and the Eulerian integrals. This approach allow us to obtain some expressions for the convolution of a certain class of functions in terms of the…
A general construction of transmutation operators is developed for selfadjoint operators in Gelfand triples. Theorems regarding analyticity of generalized eigenfunctions and Paley-Wiener properties are proved.
We consider the $1$- and $2$-d bicomplex analogs of the classical Fourier--Wigner transform. Their basic properties, including Moyal's identity and characterization of their ranges giving rise to new bicomplex--polyanalytic functional…
The article contents suggestions on how to perform the Fast Fourier Transform over Large Finite Fields. The technique is to use the fact that the multiplicative groups of specific prime fields are surprisingly composite.
In literature, it is common to find problems which require a way to encode a finite set of information into a single data; usually means are used for that. An important generalization of means are the so called Aggregation Functions, with a…
We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations when the input scanner is deterministic. Alternatively, one…