Minor Posets of Functions as Quotients of Partition Lattices

We study the structure of the partially ordered set of minors of an arbitrary function of several variables. We give an abstract characterization of such “minor posets” in terms of colorings of partition lattices, and we also present infinite families of examples as well as some constructions that can be used to build new minor posets

A survey of congruences and quotients of partially ordered sets

The literature on congruences and quotients of partially ordered sets contains a large and profilerating array of approaches, but little in the way of systematic exposition and examination of the subject. We seek to rectify this by surveying the different approaches in the literature and providing philosophical discussion on requirements for notions of congruences of posets. We advocate a pluralist approach which recognises that different types of congruence arise naturally in different mathematical situations. There are some notions of congruence which are very general, whilst others capture specific structure which often appears in examples. Indeed, we finish by giving several examples where quotients of posets appear naturally in mathematics

Toward the Enumeration of Maximal Chains in the Tamari Lattices

abstract: The Tamari lattices have been intensely studied since they first appeared in Dov Tamari’s thesis around 1952. He defined the n-th Tamari lattice T(n) on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Despite their interesting aspects and the attention they have received, a formula for the number of maximal chains in the Tamari lattices is still unknown. The purpose of this thesis is to convey my results on progress toward the solution of this problem and to discuss future work. A few years ago, Bergeron and Préville-Ratelle generalized the Tamari lattices to the m-Tamari lattices. The original Tamari lattices T(n) are the case m=1. I establish a bijection between maximum length chains in the m-Tamari lattices and standard m-shifted Young tableaux. Using Thrall’s formula, I thus derive the formula for the number of maximum length chains in T(n). For each i greater or equal to -1 and for all n greater or equal to 1, I define C(i,n) to be the set of maximal chains of length n+i in T(n). I establish several properties of maximal chains (treated as tableaux) and identify a particularly special property: each maximal chain may or may not possess a plus-full-set. I show, surprisingly, that for all n greater or equal to 2i+4, each member of C(i,n) contains a plus-full-set. Utilizing this fact and a collection of maps, I obtain a recursion for the number of elements in C(i,n) and an explicit formula based on predetermined initial values. The formula is a polynomial in n of degree 3i+3. For example, the number of maximal chains of length n in T(n) is n choose 3. I discuss current work and future plans involving certain equivalence classes of maximal chains in the Tamari lattices. If a maximal chain may be obtained from another by swapping a pair of consecutive edges with another pair in the Hasse diagram, the two maximal chains are said to differ by a square move. Two maximal chains are said to be in the same equivalence class if one may be obtained from the other by making a set of square moves.Dissertation/ThesisDoctoral Dissertation Mathematics 201

Combinatorial Hopf algebras in quantum field theory I

This manuscript stands at the interface between combinatorial Hopf algebra theory and renormalization theory. Its plan is as follows: Section 1 is the introduction, and contains as well an elementary invitation to the subject. The rest of part I, comprising Sections 2-6, is devoted to the basics of Hopf algebra theory and examples, in ascending level of complexity. Part II turns around the all-important Faa di Bruno Hopf algebra. Section 7 contains a first, direct approach to it. Section 8 gives applications of the Faa di Bruno algebra to quantum field theory and Lagrange reversion. Section 9 rederives the related Connes-Moscovici algebras. In Part III we turn to the Connes-Kreimer Hopf algebras of Feynman graphs and, more generally, to incidence bialgebras. In Section10 we describe the first. Then in Section11 we give a simple derivation of (the properly combinatorial part of) Zimmermann's cancellation-free method, in its original diagrammatic form. In Section 12 general incidence algebras are introduced, and the Faa di Bruno bialgebras are described as incidence bialgebras. In Section 13, deeper lore on Rota's incidence algebras allows us to reinterpret Connes-Kreimer algebras in terms of distributive lattices. Next, the general algebraic-combinatorial proof of the cancellation-free formula for antipodes is ascertained; this is the heart of the paper. The structure results for commutative Hopf algebras are found in Sections 14 and 15. An outlook section very briefly reviews the coalgebraic aspects of quantization and the Rota-Baxter map in renormalization.Comment: 94 pages, LaTeX figures, precisions made, typos corrected, more references adde

g-elements, finite buildings and higher Cohen-Macaulay connectivity

The main result is a proof that the g-vector of a simplicial complex with a convex ear decomposition is an M-vector. This is a generalization of similar results for matroid complexes. We also show that a finite building has a convex ear decomposition. This leads to connections between higher Cohen-Macaulay connectivity and increasing h-vectors.Comment: To appear in JCT A. 20 page