\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf D. Bernstein, A. Henke and A. Regev}
%
%
\medskip
\noindent
%
%
{\bf Maximal Projective Degrees for Strict Partitions}
%
%
\vskip 5mm
\noindent
%
%
%
%
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 -- 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.
\bye