Some applications of algebra to combinatorics (Q1182324)

The author gives a very interesting survey of the application of algebraic methods in combinatorics, in the setting of (graded) partially ordered sets and lattices. Major themes are provided by the Sperner property, rank symmetry and rank unimodality. The algebraic methods employed range from linear algebra via group actions to Lie algebras. Topics discussed include the classical Sperner theorem, subspace lattices, the subgroup lattices of Abelian \(p\)-groups, graphs, integer partitions, \(q\)-binomial coefficients, 3-dimensional Ferrers diagrams, the Erdős-Moser conjecture on partial sums, permutation statistics and polytopes (upper bound conjecture). The final section discusses some open problems.