Recursive Statistics on Words
Jennifer Galovich
St. John's University
April 2,
4:15pm
refreshments at 3:45pm
2338
ABSTRACT

A general machine for constructing a large class
of statistics on words will be desribed. These statistics, which have a certain recursive
structure, are called {\it splittable}. The classical Mahonian statistics
major index (maj) and inversion number (inv) are examples, as are more
modern Mahonian statistics such as the "Z" statistic of Zeilberger and
Bressoud, Denert's "den" and Rawlings' interpolating statistic, "rmaj".
I will explain how, and in what sense, the entire class of splittable
Mahonian statistics is generated by the single statistic "inv". I will
also describe other nonMahonian statistics which have a similar recursive
structure and conclude with some remarks about the extension of these
ideas to other combinatorial objects.

Speaker's Contact Info: galovich(atsign)math.mit.edu
Return to seminar home page
Page loaded on March 25, 1999 at 04:09 PM.

Copyright © 199899, Sara C. Billey.
All rights reserved.

