Quasisymmetric functions from combinatorial Hopf monoids and Ehrhart Theory

@article{White2016QuasisymmetricFF,
  title={Quasisymmetric functions from combinatorial Hopf monoids and Ehrhart Theory},
  author={Jacob Aaron White},
  journal={arXiv: Combinatorics},
  year={2016}
}
  • J. White
  • Published 31 March 2016
  • Mathematics
  • arXiv: Combinatorics
We investigate quasisymmetric functions coming from combinatorial Hopf monoids. We show that these invariants arise naturally in Ehrhart theory, and that some of their specializations are Hilbert functions for relative simplicial complexes. This class of complexes, called forbidden composition complexes, also forms a Hopf monoid, thus demonstrating a link between Hopf algebras, Ehrhart theory, and commutative algebra. We also study various specializations of quasisymmetric functions. 

Figures from this paper

On Cohen-Macaulay Hopf monoids in species.
We study Cohen-Macaulay Hopf monoids in the category of species. The goal is to apply techniques from topological combinatorics to the study of polynomial invariants arising from combinatorial HopfExpand
The Hopf monoid of coloring problems
We study coloring problems, which are induced subposets P of a Boolean lattice, paired with an order ideal I from the poset of intervals, ordered by inclusion. We study a quasisymmetric functionExpand
Bimonoids for Hyperplane Arrangements
theory is less important than a thorough and concrete exploration of the implications and applications. Books in the Encyclopedia of Mathematics and Its Applications cover their subjectsExpand

References

SHOWING 1-10 OF 24 REFERENCES
Viewing counting polynomials as Hilbert functions via Ehrhart theory
Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of Ehrhart theory andExpand
HOPF MONOIDS IN THE CATEGORY OF SPECIES
A Hopf monoid (in Joyal's category of species) is an algebraic structure akin to that of a Hopf algebra. We provide a self-contained intro- duction to the theory of Hopf monoids in the category ofExpand
Combinatorial Hopf algebras and generalized Dehn–Sommerville relations
A combinatorial Hopf algebra is a graded connected Hopf algebra over a field $\Bbbk$ equipped with a character (multiplicative linear functional) $\zeta\colon{\mathcal H}\to \Bbbk$. We show that theExpand
An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics
  • Felix Breuer
  • Mathematics, Computer Science
  • Computer Algebra and Polynomials
  • 2015
In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. TopicsExpand
Hopf Algebras in Combinatorics
These notes -- originating from a one-semester class by their second author at the University of Minnesota -- survey some of the most important Hopf algebras appearing in combinatorics. AfterExpand
Une théorie combinatoire des séries formelles
Abstract This paper presents a combinatorial theory of formal power series. The combinatorial interpretation of formal power series is based on the concept of species of structures. A categoricalExpand
Monoidal Functors, Species, and Hopf Algebras
This research monograph integrates ideas from category theory, algebra and combinatorics. It is organised in three parts. Part I belongs to the realm of category theory. It reviews some of theExpand
Incidence Hopf algebras
This is a brief introduction to incidence algebras and Möbius inversion, starting with the classical theory, passing through the seminal work of Rota, and the generalisation to categories by Leroux,Expand
A Symmetric Function Generalization of the Chromatic Polynomial of a Graph
Abstract For a finite graph G with d vertices we define a homogeneous symmetric function XG of degree d in the variables x1, x2, ... . If we set x1 = ... = xn= 1 and all other xi = 0, then we obtainExpand
Inside-out polytopes
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagicExpand
...
1
2
3
...