Related papers: Bottom complexes
To a homotopy algebra one may associate its deformation complex, which is naturally a differential graded Lie algebra. We show that infinity quasi-isomorphic homotopy algebras have L-infinity quasi-isomorphic deformation complexes by an…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
For an arbitrary rational polyhedron we consider its decompositions into Minkowski summands and, dual to this, the free extensions of the associated pair of semigroups. Being free for the pair of semigroups is equivalent to flatness for the…
I extend the definitions of schemes relative to monoids with zero - and therefore, toric geometry - to the world of formal schemes. This expands the usual framework to include, for instance, models for Mumford's degenerating Abelian…
In this paper, we present upper bounds for the depth of some classes of polyhedra, including: polyhedra with finite fundamental group, polyhedra $P$ with abelian or free $\pi_1(P)$ and finitely generated $H_i(tilde{P};\mathbb{Z}$,…
It is well-known that every polyhedral cone is finitely generated (i.e. polytopal), and vice versa. Surprisingly, the two notions differ almost always for non-commutative versions of such cones. This was obtained as a byproduct in an…
We introduce toric complexes as polyhedral complexes consisting of rational cones together with a set of integral generators for each cone, and we define their associated face rings. Abstract simplicial complexes and rational fans can be…
For two general polytopal complexes the set of face-wise affine maps between them is shown to be a polytopal complex in an algorithmic way. The resulting algorithm for the affine hom-complex is analyzed in detail. There is also a natural…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
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…
We investigate graded retracts of polytopal algebras (essentially the homogeneous rings of affine cones over projective toric varieties) as polytopal analogues of vector spaces. In many cases we show that these retracts are again polytopal…
Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…
First we solve the problem of finding minimal degree families on toric surfaces by reducing it to lattice geometry. Then we describe how to find minimal degree families on, more generally, rational complex projective surfaces.
In various articles, it is said that the class of all soft topologies on a common universe forms a complete lattice, but in this paper, we prove that it is a complete lattice. Some soft topologies are maximal and some are minimal with…
Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…
Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…