{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:11Z","timestamp":1753893851950,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $\\lambda$ be a partition, and denote by $f^\\lambda$ the number of standard tableaux of shape $\\lambda$. The asymptotic shape of $\\lambda$ maximizing $f^\\lambda$ was determined in the classical work of Logan and Shepp and, independently, of Vershik and Kerov. The analogue problem, where the number of parts of $\\lambda$ is bounded by a fixed number, was done by Askey and Regev \u2013 though some steps in this work were assumed without a proof. Here these steps are proved rigorously. When $\\lambda$ is strict, we denote by $g^\\lambda$ the number of standard tableau of shifted shape $\\lambda$. We determine the partition $\\lambda$ maximizing $g^\\lambda$ in the strip. In addition we give a conjecture related to the maximizing of $g^\\lambda$ without any length restrictions.<\/jats:p>","DOI":"10.37236\/977","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:48:50Z","timestamp":1578700130000},"source":"Crossref","is-referenced-by-count":1,"title":["Maximal Projective Degrees for Strict Partitions"],"prefix":"10.37236","volume":"14","author":[{"given":"D.","family":"Bernstein","sequence":"first","affiliation":[]},{"given":"A.","family":"Henke","sequence":"additional","affiliation":[]},{"given":"A.","family":"Regev","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2007,8,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v14i1r59\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v14i1r59\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:01:39Z","timestamp":1579302099000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v14i1r59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,20]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2007,1,3]]}},"URL":"https:\/\/doi.org\/10.37236\/977","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2007,8,20]]},"article-number":"R59"}}