Hall-Littlewood Polynomials and Cohen-Lenstra Heuristics for Jacobians of Random Graphs |
| |
Authors: | Jason Fulman |
| |
Institution: | 1.Department of Mathematics,University of Southern California,Los Angeles,USA |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|