Theses most similar to Antichains of interval orders and semiorders, and Dilworth lattices of maximum size antichains (Engel Shaposhnik, Efrat; 2016) read it

The combinatorics of reduced decompositions

Tenner, Bridget Eileen (2006)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Semi-primary lattices and tableau algorithms

Tesler, Glenn Paul (1995)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Symmetric function generalizations of graph polynomials

Chow, Timothy Yi-Chung (1995)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Generalized straightening laws for products of determinants

Taylor, Brian David (1997)

  • Advisor: Gian-Carlo Rota
  • Department of Mathematics
Read it

Two interactions between combinatorics and representation theory : monomial immanants and Hochschild cohomology

Wolfgang, Harry Lewis (1997)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

A minimal reduction class for the Entscheidungsproblem

Kahr, Andrew Seth (1962)

  • Advisor: Hartley Rogers, Jr.
  • Department of Mathematics
Read it

Pattern-avoidance in binary fillings of grid shapes

Spiridonov, Alexey (2009)

  • Advisor: Alexander Postnikov
  • Department of Mathematics
Read it

Studies in partitions and permutations.

Doubilet, Peter Michael (1973)

  • Advisor: Gian-Carlo Rota
  • Department of Mathematics
Read it

Decomposition and enumeration in partially ordered sets

Hersh, Patricia (Patricia Lynn), 1973- (1999)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Combinatorics of permutation patterns, interlacing networks, and Schur functions

Trongsiriwat, Wuttisak (2015)

  • Advisor: Alexander Postnikov
  • Department of Mathematics
Read it