Related papers: Projectivities in Simplicial Complexes and Colorin…

In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

We propose a study of the foliations of the projective plane induced by simple derivations of the polynomial ring in two indeterminates over the complex field. These correspond to foliations which have no invariant algebraic curve nor…

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…

In this note, we investigate a mixture of combinatorial spectra and stratified simplicial sets, which would be thought of as a model of the spectrum objects of $(\infty, \infty)$-categories.

The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

Classification theory and the study of projective varieties which are covered by rational curves of minimal degrees naturally leads to the study of families of singular rational curves. Since families of arbitrarily singular curves are hard…

The paper investigates connections between abstract polytopes and properly edge colored graphs. Given any finite n-edge-colored n-regular graph G, we associate to G a simple abstract polytope P_G of rank n, called the colorful polytope of…

It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and…

We show that there is a smooth complex projective variety, of any dimension greater than or equal to two, whose automorphism group is discrete and not finitely generated. Moreover, this variety admits infinitely many real forms which are…

This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…

We construct, for each convex polytope, possibly nonrational and nonsimple, a family of compact spaces that are stratified by quasifolds, i.e. each of these spaces is a collection of quasifolds glued together in an suitable way. A quasifold…

We study smooth projective varieties with small dual variety using methods from symplectic topology. We prove the affine parts of such varieties are subcritical, and that the hyperplane class is invertible in their quantum cohomology. We…

Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…

The automorphism group of a projective bundle P(E) over a simplicial toric variety is described when the bundle E is a direct sum of line bundles. Applications to study of moduli of complete intersections on toric varieties, including…

This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…

Curve singularities are classical objects of study in algebraic geometry. The key player in their combinatorial structure is the {\it value semigroup}, or its compactification, the {\it value semiring}. One natural problem is to explicitly…

We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new…