Some Observations Along the Road to “National Information Power”

This thesis consist of the following three papers. Convex hull of face vectors of colored complexes. In this paper we verify a conjecture by Kozlov (Discrete ComputGeom18(1997) 421–431), which describes the convex hull of theset of face vectors ofr-colorable complexes onnvertices. As partof the proof we derive a generalization of Turán’s graph theorem. Cellular structure for the Herzog–Takayama Resolution. Herzog and Takayama constructed explicit resolution for the ide-als in the class of so called ideals with a regular linear quotient.This class contains all matroidal and stable ideals. The resolu-tions of matroidal and stable ideals are known to be cellular. Inthis note we show that the Herzog–Takayama resolution is alsocellular. Clique Vectors ofk-Connected Chordal Graphs. The clique vectorc(G)of a graphGis the sequence(c1,c2,...,cd)inNd, whereciis the number of cliques inGwithivertices anddis the largest cardinality of a clique inG. In this note, we usetools from commutative algebra to characterize all possible cliquevectors ofk-connected chordal graphs.QC 20140513</p

Upper bound theorem for odd-dimensional flag triangulations of manifolds

We prove that among all flag triangulations of manifolds of odd dimension 2r-1 with sufficiently many vertices the unique maximizer of the entries of the f-, h-, g- and gamma-vector is the balanced join of r cycles. Our proof uses methods from extremal graph theory.Comment: Clarifications and new references, title has change

Convex hull of face vectors of colored complexes

In this paper we verify a conjecture by Kozlov [D.N. Kozlov, Convex Hulls of f- and beta-vectors, Discrete Comput. Geom. 18 (1997) 421-431], which describes the convex hull of the set of face vectors of r-colorable complexes on n vertices. As part of the proof we derive a generalization of Turn's graph theorem.QC 20140514</p

On Face Vectors and Resolutions

This thesis consist of the following three papers. Convex hull of face vectors of colored complexes. In this paper we verify a conjecture by Kozlov (Discrete ComputGeom18(1997) 421–431), which describes the convex hull of theset of face vectors ofr-colorable complexes onnvertices. As partof the proof we derive a generalization of Turán’s graph theorem. Cellular structure for the Herzog–Takayama Resolution. Herzog and Takayama constructed explicit resolution for the ide-als in the class of so called ideals with a regular linear quotient.This class contains all matroidal and stable ideals. The resolu-tions of matroidal and stable ideals are known to be cellular. Inthis note we show that the Herzog–Takayama resolution is alsocellular. Clique Vectors ofk-Connected Chordal Graphs. The clique vectorc(G)of a graphGis the sequence(c1,c2,...,cd)inNd, whereciis the number of cliques inGwithivertices anddis the largest cardinality of a clique inG. In this note, we usetools from commutative algebra to characterize all possible cliquevectors ofk-connected chordal graphs.QC 20140513</p