{"paper":{"title":"Expectations of hook products on large partitions","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Alexei Borodin, Mark Adler, Pierre van Moerbeke","submitted_at":"2004-09-28T15:39:48Z","abstract_excerpt":"Given uniform probability on words of length M=Np+k, from an alphabet of size p, consider the probability that a word\n (i) contains a subsequence of letters (p, p-1,...,1) in that order and\n (ii) that the maximal length of the disjoint union of p-1 increasing subsequences of the word is \\leq M-N . A generating function for this probability has the form of an integral over the Grassmannian of p-planes in complex C^n. The present paper shows that the asymptotics of this probability, when N tends to infinity, is related to the kth moment of the chi^2-distribution of parameter 2p^2. This is relate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0409554","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}