Related papers: A combinatorial-topological shape category for pol…

We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…

We introduce a new category of coefficients for p-adic cohomology called constructible isocrystals. Conjecturally, the category of constructible isocrystals endowed with a Frobenius structure is equivalent to the category of perverse…

This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…

We construct injective hulls and projective covers in categories of generalized uniform hypergraphs which generalizes the constructions in the category of quivers and the category of undirected graphs. While the constructions are not…

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

This article introduces a finite piecewise Euclidean cell complex homeomorphic to the space of monic centered complex polynomials of degree $d$ whose critical values lie in a fixed closed rectangular region. We call this the branched…

For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…

We study the homotopy theory of a certain type of diagram categories whose vertices are in variable categories with a functorial path, leading to a good calculation of the homotopy category in terms of cofibrant objects. The theory is…

For a locally presentable abelian category $\mathsf B$ with a projective generator, we construct the projective derived and contraderived model structures on the category of complexes, proving in particular the existence of enough homotopy…

Motivated by strong desire to understand the natural geometry of moduli spaces of hyperbolic monopoles, we introduce and study a new type of geometry: pluricomplex geometry. It is a generalisation of hypercomplex geometry: we still have a…

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…

We give a simple algebraic description of opetopes in terms of chain complexes, and we show how this description is related to combinatorial descriptions in terms of treelike structures. More generally, we show that the chain complexes…

Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

A combinatorial polytope $P$ is said to be projectively unique if it has a single realization up to projective transformations. Projective uniqueness is a geometrically compelling property but is difficult to verify. In this paper, we merge…

Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…

Programmable self-assembly enables the construction of complex molecular, supramolecular, and crystalline architectures from well-designed building blocks. We introduce a hypergraph-based formalism, Blocks & Bonds (B&B), that generalizes…

Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…

A Coxeter polytope is a convex polytope in a real projective space equipped with linear reflections in its facets, such that the orbits of the polytope under the action of the group generated by the linear reflections tessellate a convex…