Enumeration in convex geometries and associated polytopal subdivisions of spheres

Counting unlabelled toroidal graphs with no K33-subdivisions

We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of core graphs. Using structure theorems for toroidal and projective-planar graphs containing no K33-subdivisions, we apply these techniques to obtain their unlabelled enumeration.

The structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs

We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by two-pole networks constructed from 2-connected planar graphs. A method to enumerate these graphs in the labelled case is described. Moreover, we enumerate the homeomorphically irreducible graphs in F and homeomorphically irreducible 2-connected planar graphs. Particular use is made of two-pole directed series-parallel networks. We also show that the number m…

Oriented Interval Greedoids

We propose a definition of an "oriented interval greedoid" that simultaneously generalizes the notion of an oriented matroid and the construction on antimatroids introduced by L. J. Billera, S. K. Hsiao, and J. S. Provan in "Enumeration in convex geometries and associated polytopal subdivisions of spheres" [Discrete Comput. Geom. 39 (2008), no. 1-3, 123--137]. As for of oriented matroids, associated to each oriented interval greedoid is a spherical simplicial complex whose face enumeration depends only on the underlying interval greedoid.

Chain enumeration, partition lattices and polynomials with only real roots

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots. The real-rootedness of the chain polynomial is conjectured for all geometric lattices and is shown to be preserved by the pyramid and the prism operations on Cohen--Macaulay posets. As a result, new families of convex polytopes whose face lattices have real-rooted chain polynomials are presented. An application to the face enumeration of the second barycentri…

Toric spaces and face enumeration on simplicial manifolds

In this paper, we study the well-know $g$-conjecture for rational homology spheres in a topological way. To do this, we construct a class of topological spaces with torus actions, which can be viewed as topological generalizations of toric varieties. Along this way we prove that after doing stellar subdivision operations at some middle dimensional faces of an arbitrary rational homology sphere, the $g$-conjecture is valid. Furthermore, we give topological proofs of several fundamental algebraic results about Buchsbaum complexes and simplicial manifolds. In this process, we also get a few inter…

The complete classification of five-dimensional Dirichlet-Voronoi polyhedra of translational lattices

In this paper we report on the full classification of Dirichlet-Voronoi polyhedra and Delaunay subdivisions of five-dimensional translational lattices. We obtain a complete list of $110244$ affine types (L-types) of Delaunay subdivisions and it turns out that they are all combinatorially inequivalent, giving the same number of combinatorial types of Dirichlet-Voronoi polyhedra. Using a refinement of corresponding secondary cones, we obtain $181394$ contraction types. We report on details of our computer assisted enumeration, which we verified by three independent implementations and a topologi…

面嵌套复形与无环嵌套多面体

Facial nested complexes and acyclonestohedra

本文研究有向拟阵面格上嵌套复形的多面体实现，通过将面嵌套复形嵌入布尔嵌套复形并构造无环嵌套多面体，统一推广了偏序集关联多面体等多类嵌套多面体族。