Thesis (Ph.D.)--University of Washington, 2017-08For a $(d-1)$-dimensional simplicial complex $\Delta$, we let $f_i=f_i(\Delta)$ be the number of $i$-dimensional faces of $\Delta$ for $-1\leq i\leq d-1$. One classic problem in geometric combinatorics is the following: for a given class of simplicial complexes, find tight upper and lower bounds on the face numbers and characterize the complexes that attain these bounds. This dissertation studies these questions in various classes of simplicial complexes including balanced manifolds, flag manifolds and simplicial spheres. A $(d-1)$-dimensional simplicial complex is called balanced if its graph is $d$-colorable. In Chapter 2, we determine the minimum number of vertices needed to provide balanc...
We survey several old and new problems related to the number of simplicial spheres, the number of ne...
Some remarkable connections between commutative algebra and combinatorics have been discovered in re...
We present an algorithm for computing [X,Y], i.e., all homotopy classes of continuous maps X → Y, wh...
Thesis (Ph.D.)--University of Washington, 2017-08For a $(d-1)$-dimensional simplicial complex $\Delt...
Simplicial complexes are mathematical objects whose importance stretches from topology to commutativ...
The g-conjecture for spheres is a conjectured complete characterization of the pos-sible number of i...
A d -dimensional simplicial complex is balanced if the underlying graph is ( d + 1 ) -colora...
Thesis (Ph.D.)--University of Washington, 2022A key tool that combinatorialists use to study simplic...
AbstractKalai proved that the simplicial polytopes with g2=0 are the stacked polytopes. We character...
International audienceWe prove that among all flag 3-manifolds on n vertices, the join of two circle...
The 2-girth of a 2-dimensional simplicial complex X is the minimum size of a non-zero 2-cycle in H[s...
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general ...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
16 pagesWe give superexponential lower and upper bounds on the number of coloured $d$-dimensional tr...
Let M be a closed triangulable manifold, and let ∆ be a triangulation of M. What is the smallest num...
We survey several old and new problems related to the number of simplicial spheres, the number of ne...
Some remarkable connections between commutative algebra and combinatorics have been discovered in re...
We present an algorithm for computing [X,Y], i.e., all homotopy classes of continuous maps X → Y, wh...
Thesis (Ph.D.)--University of Washington, 2017-08For a $(d-1)$-dimensional simplicial complex $\Delt...
Simplicial complexes are mathematical objects whose importance stretches from topology to commutativ...
The g-conjecture for spheres is a conjectured complete characterization of the pos-sible number of i...
A d -dimensional simplicial complex is balanced if the underlying graph is ( d + 1 ) -colora...
Thesis (Ph.D.)--University of Washington, 2022A key tool that combinatorialists use to study simplic...
AbstractKalai proved that the simplicial polytopes with g2=0 are the stacked polytopes. We character...
International audienceWe prove that among all flag 3-manifolds on n vertices, the join of two circle...
The 2-girth of a 2-dimensional simplicial complex X is the minimum size of a non-zero 2-cycle in H[s...
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general ...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
16 pagesWe give superexponential lower and upper bounds on the number of coloured $d$-dimensional tr...
Let M be a closed triangulable manifold, and let ∆ be a triangulation of M. What is the smallest num...
We survey several old and new problems related to the number of simplicial spheres, the number of ne...
Some remarkable connections between commutative algebra and combinatorics have been discovered in re...
We present an algorithm for computing [X,Y], i.e., all homotopy classes of continuous maps X → Y, wh...