نتایج جستجو برای: the plancherel theorem

تعداد نتایج: 16070228  

D. R. McDonald,

The local limit theorem describes how the density of a sum of random variables follows the normal curve. However the local limit theorem is often seen as a curiosity of no particular importance when compared with the central limit theorem. Nevertheless the local limit theorem came first and is in fact associated with the foundation of probability theory by Blaise Pascal and Pierre de Fer...

Journal: :international journal of group theory 2012
azam kaheni rasoul hatamian saeed kayvanfar

a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$‎ ‎implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some‎ ‎authors‎. ‎recently‎, ‎podoski and szegedy proved the truth of the converse of schur's theorem for capable groups‎. ‎they also established an explicit bound for the index of the center of such...

Journal: :Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 2007

Journal: :Journal of the American Mathematical Society 2000

2012
Paul Garrett

We show that the map from minimal-parabolic pseudo-Eisenstein series to their decomposition coefficients against minimal-parabolic Eisenstein series is an isometry to its image. The argument characterizing the image is sketched, but is incomplete without characterizing the other, less-continuous parts of the spectral decomposition. Thus, we do not quite prove Plancherel for this part of the spe...

2009
JASON FULMAN

We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n steps are necessary and suffice for convergence to the stationary distribution.

Journal: :Electr. J. Comb. 2009
Jason E. Fulman

We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n2 steps are necessary and suffice for convergence to the stationary distribution.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید