Hall-Littlewood Polynomials and Cohen-Lenstra Heuristics for Jacobians of Random Graphs

被引：0
|
作者：
Jason Fulman
机构：
[1] University of Southern California,Department of Mathematics
来源：
Annals of Combinatorics | 2016年 / 20卷
关键词：
Hall-Littlewood polynomial; Cohen-Lenstra heuristic; random graph; 05E05; 05C80;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs of properties of these random partitions. In addition, we use Markov chains to give an algorithm for generating these partitions.
引用
收藏
页码：115 / 124
页数：9
相关论文
共 50 条
12345