Homological combinatorics and extensions of the cd-index

TL;DR

This paper employs coalgebra techniques to streamline inductive proofs in graded poset theory, enabling more manageable computations of invariants and revealing combinatorial interpretations of constants.

Contribution

It introduces coalgebra methods to simplify proofs and compute invariants in poset and arrangement theory, providing new structure theorems.

Findings

Coalgebra reduces proof complexity in graded poset theory

Computed invariants for toric and affine arrangements

Proved structure theorems for graph orientations and critical groups

Abstract

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to comprehensible size. As a bonus, the visual form of the resulting recursive proofs suggests combinatorial interpretations for constants appearing in the longer arguments. We use the techniques of coalgebras to compute invariants of toric and affine arrangements as well as of poset products. In additional chapters we prove structure theorems for acyclic orientations and critical groups of graphs.