SearcharxivSearch

arXiv · math/0112019

Noncommutative extensions of the Fourier transform and its logarithm

Abstract

We introduce and study noncommutative extensions of the Fourier transform and its logarithm to the algebra of functions on the free semigroup FS(2) on two generators with the convolution multiplication. These extensions are new types of moment and cumulant generating functions, respectively, the latter corresponding to the cumulants which are additive under the so-called filtered convolution on the free *-algebra on two generators. This algebra plays the role of a ``noncommutative plane'' built on the ``classical real line'' and the ``boolean real line''. The restrictions of the cumulant generating function to the commutative subsemigroups generated by single generators give the logarithm of the Fourier transform and the K-transform in the boolean case, respectively. In turn, the moment generating function is a ``semigroup interpolation'' between the Fourier transform and the Cauchy transform. Using suitable weight function $W$ on the semigroup, both generating functions become elements of the Banach algebra $l^{1}(FS(2),W)$. The main results of the paper are based on the new combinatorics developed for the cumulants, the Moebius function and the moment-cumulant formulas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Romuald Lenczewski. 2001-12-03. Noncommutative extensions of the Fourier transform and its logarithm. https://arxiv.org/abs/math/0112019

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR