Related papers: Combinatorics of flag simplicial 3-polytopes
We characterize f-vectors of sufficiently large three-dimensional flag Gorenstein* complexes, essentially confirming a conjecture of Gal [Discrete Comput. Geom., 34 (2), 269--284, 2005]. In particular, this characterizes f-vectors of large…
We show that any accordion complex associated to a dissection of a convex polygon is isomorphic to the support $\tau$-tilting simplicial complex of an explicit finite dimensional algebra. To this end, we prove a property of some induced…
In this paper, we present a minimal counterexample to a conjecture of Perles that answers a question of Haase and Ziegler. The example is a simple 4-polytope that has an induced 3-connected 3-regular subgraph, whose graph complement is…
The orbit graph of a k-orbit polytope is a graph on k nodes that shows how the flag orbits are related by flag adjacency. Using orbit graphs, we classify k-orbit polytopes and determine when a k-orbit polytope is i-transitive. We then…
It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.
Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
From the homotopy groups of two cubic spherical 3-manifolds we construct the isomorphic groups of deck transformations acting on the 3-sphere. These groups become the cyclic group of order eight and the quaternion group respectively. By…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
The Flag Complex Conjecture of Charney and Davis states that for a simplicial complex $S$ which triangulates a $(2n - 1)$-generalized homology sphere as a flag complex one has $(-1)^n \sum_{\sigma \in S}…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
The purpose of this note is to define tri-moment maps for certain manifolds that carry closed non-degenerate 4-forms and an $Sp(1)^n$-action. Examples include quaternionic vector spaces and flag manifolds. We show how this map can be used…
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency…
From the homotopy groups of three distinct octahedral spherical 3-manifolds we construct the isomorphic groups H of deck transformations acting on the 3-sphere. The H-invariant polynomials on the 3-sphere constructed by representation…
Recent literature posed the problem of characterising the graph degree sequences with exactly one $3$-polytopal (i.e. planar, $3$-connected) realisation. This seems to be a difficult problem in full generality. In this paper, we…
We give a decomposition of the suspension of a polyhedral join in terms of the polyhedral smash product of the suspension of the family of pairs, and study some cases in which the formula can be desuspended, particularly for polyhedral…
It is proven that the partition function of 3-dimensional simplicial gravity has an exponential upper bound with the following assumption: any three dimensional sphere $S^3$ is constructed by repeated identification of neighboring links and…
Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…
Most applications of the hard Lefschetz theorem related to combinatorial properties of simplicial complexes involve their $h$-vectors. In the context of positivity properties involving $h$-vectors of flag spheres, $f$-vectors with a…