ﻻ يوجد ملخص باللغة العربية
We study a natural Markov chain on ${0,1,cdots,n}$ with eigenvectors the Hahn polynomials. This explicit diagonalization makes it possible to get sharp rates of convergence to stationarity. The process, the Burnside process, is a special case of the celebrated `Swendsen-Wang or `data augmentation algorithm. The description involves the beta-binomial distribution and Mallows model on permutations. It introduces a useful generalization of the Burnside process.
An algebra denoted $mmathfrak{H}$ with three generators is introduced and shown to admit embeddings of the Hahn algebra and the rational Hahn algebra. It has a real version of the deformed Jordan plane as a subalgebra whose connection with Hahn polyn
A classical result by Schoenberg (1942) identifies all real-valued functions that preserve positive semidefiniteness (psd) when applied entrywise to matrices of arbitrary dimension. Schoenbergs work has continued to attract significant interest, incl
Relative $t$-designs in the $n$-dimensional hypercube $mathcal{Q}_n$ are equivalent to weighted regular $t$-wise balanced designs, which generalize combinatorial $t$-$(n,k,lambda)$ designs by allowing multiple block sizes as well as weights. Partly m
Polynomials in this paper are defined starting from a compact semisimple Lie group. A known classification of maximal, semisimple subgroups of simple Lie groups is used to select the cases to be considered here. A general method is presented and all