74 research outputs found
Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration
We consider the enumeration of pattern-avoiding involutions, focusing in
particular on sets defined by avoiding a single pattern of length 4. As we
demonstrate, the numerical data for these problems demonstrates some surprising
behavior. This strange behavior even provides some very unexpected data related
to the number of 1324-avoiding permutations
q-analog of tableau containment
We prove a -analog of the following result due to McKay, Morse and Wilf:
the probability that a random standard Young tableau of size contains a
fixed standard Young tableau of shape tends to
in the large limit, where is the number of
standard Young tableaux of shape . We also consider the probability
that a random pair of standard Young tableaux of the same shape
contains a fixed pair of standard Young tableaux.Comment: 20 pages, to appear J. Combin. Theory. Ser.
A combinatorial proof that Schubert vs. Schur coefficients are nonnegative
We give a combinatorial proof that the product of a Schubert polynomial by a
Schur polynomial is a nonnegative sum of Schubert polynomials. Our proof uses
Assaf's theory of dual equivalence to show that a quasisymmetric function of
Bergeron and Sottile is Schur-positive. By a geometric comparison theorem of
Buch and Mihalcea, this implies the nonnegativity of Gromov-Witten invariants
of the Grassmannian.Comment: 26 pages, several colored figure
Asymptotic distribution of fixed points of pattern-avoiding involutions
For a variety of pattern-avoiding classes, we describe the limiting
distribution for the number of fixed points for involutions chosen uniformly at
random from that class. In particular we consider monotone patterns of
arbitrary length as well as all patterns of length 3. For monotone patterns we
utilize the connection with standard Young tableaux with at most rows and
involutions avoiding a monotone pattern of length . For every pattern of
length 3 we give the bivariate generating function with respect to fixed points
for the involutions that avoid that pattern, and where applicable apply tools
from analytic combinatorics to extract information about the limiting
distribution from the generating function. Many well-known distributions
appear.Comment: 16 page
- …