๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Coset Poset and Probabilistic Zeta Function of a Finite Group

โœ Scribed by Kenneth S. Brown

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
175 KB
Volume
225
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

โœฆ Synopsis

We investigate the topological properties of the poset of proper cosets xH in a finite group G. Of particular interest is the reduced Euler characteristic, which is closely related to the value at -1 of the probabilistic zeta function of G. Our main result gives divisibility properties of this reduced Euler characteristic.

๐Ÿ“œ SIMILAR VOLUMES

A Probabilistic Interpretation of the Hu
A Probabilistic Interpretation of the Hurwitz Zeta Function
โœ R.A. Lippert ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 154 KB

Presented in a continuous extension of a measure used by Sol Golomb to define a probability on the sample space of natural numbers. The extension is a probability measure which holds several characteristic in common with Golomb's measure but on the set \((1, \infty)\). I have proven a theorem which

A Probabilistic Approach to Conjugacy Cl
A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups
โœ Jason Fulman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 135 KB

Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods, one obtains a probabilistic proof of Steinberg's count of unipotent matrices and generalizations of

A Probabilistic Approach Toward Conjugac
A Probabilistic Approach Toward Conjugacy Classes in the Finite General Linear and Unitary Groups
โœ Jason Fulman ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

The conjugacy classes of the finite general linear and unitary groups are used to define probability measures on the set of all partitions of all natural numbers. Probabilistic algorithms for growing random partitions according to these measures are obtained. These algorithms are applied to prove gr