Gr\"obner methods for representations of combinatorial categories

Given a category C of a combinatorial nature, we study the following fundamental question: how does the combinatorial behavior of C affect the algebraic behavior of representations of C? We prove two general results. The first gives a combinatorial criterion for representations of C to admit a theory of Gr\"obner bases. From this, we obtain a criterion for noetherianity of representations. The second gives a combinatorial criterion for a general "rationality" result for Hilbert series of representations of C. This criterion connects to the theory of formal languages, and makes essential use of results on the generating functions of languages, such as the transfer-matrix method and the Chomsky-Sch\"utzenberger theorem. Our work is motivated by recent work in the literature on representations of various specific categories. Our general criteria recover many of the results on these categories that had been proved by ad hoc means, and often yield cleaner proofs and stronger statements. For example: we give a new, more robust, proof that FI-modules (originally introduced by Church-Ellenberg-Farb), and a family of natural generalizations, are noetherian; we give an easy proof of a generalization of the Lannes-Schwartz artinian conjecture from the study of generic representation theory of finite fields; we significantly improve the theory of $\Delta$-modules, introduced by Snowden in connection to syzygies of Segre embeddings; and we establish fundamental properties of twisted commutative algebras in positive characteristic.Comment: 41 pages; v2: Moved old Sections 3.4, 10, 11, 13.2 and connected text to arxiv:1410.6054v1, Section 13.1 removed and will appear elsewhere; v3: substantial revision and reorganization of section

Move-minimizing puzzles, diamond-colored modular and distributive lattices, and poset models for Weyl group symmetric functions

The move-minimizing puzzles presented here are certain types of one-player combinatorial games that are shown to have explicit solutions whenever they can be encoded in a certain way as diamond-colored modular and distributive lattices. Such lattices can also arise naturally as models for certain algebraic objects, namely Weyl group symmetric functions and their companion semisimple Lie algebra representations. The motivation for this paper is therefore both diversional and algebraic: To show how some recreational move-minimizing puzzles can be solved explicitly within an order-theoretic context and also to realize some such puzzles as combinatorial models for symmetric functions associated with certain fundamental representations of the symplectic and odd orthogonal Lie algebras

Diagonal invariants and the refined multimahonian distribution

Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are a pure combinatorial algorithm to describe the irreducible decomposition of the tensor product of two irreducible representations of the symmetric group, and new symmetry results on permutation enumeration with respect to descent sets.Comment: 18 page