Related papers: Reconstructing a shellable sphere from its facet-r…
We define the notion of a twisted topological graph algebra associated to a topological graph and a $1$-cocycle on its edge set. We prove a stronger version of a Vasselli's result. We expand Katsura's results to study twisted topological…
Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…
In this work, we construct a new data type for hadronic jets in which the traditional point-cloud representation is transformed into a simplicial complex consisting of vertices, or 0-simplexes. An angular resolution scale, $r$, is then…
We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…
We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…
Adapting the ideas of L. Keen and C. Series used in their study of the Riley slice of Schottky groups generated by two parabolics, we explicitly identify `half-space' neighbourhoods of pleating rays which lie completely in the Riley slice.…
We prove a relatively simple combinatorial characterization of simplicial $d$-spheres on $d+4$ vertices. Our criteria are given in terms of the intersection patterns of a simplicial complex's family of minimal non-faces. Namely, let…
We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…
A {\em solvable} cover of a graph is a regular cover whose covering transformation group is solvable. In this paper, we show that a solvable cover of a graph can be decomposed into layers of abelian covers, and also, a lift of a given…
Suppose a group $G$ acts properly on a simplicial complex $\Gamma$. Let $l$ be the number of $G$-invariant vertices and $p_1, p_2, ... p_m$ be the sizes of the $G$-orbits having size greater than 1. Then $\Gamma$ must be a subcomplex of…
To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…
Akbulut has recently shown that an infinite family of Cappell-Shaneson homotopy 4-spheres is diffeomorphic to the standard 4-sphere. In the present paper, a strictly larger family is shown to be standard by a simpler method. This new…
We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…
Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…
We describe a construction that takes as input a graph and a basis for its first homology, and returns a triangulation of a 3-dimensional homology sphere. This makes precise an idea of M. Gromov and A. Nabutovski. The immediate application,…
We give construction of singular K3 surfaces with discriminant 3 and 4 as double coverings over the projective plane. Focusing on the similarities in their branching loci, we can generalize this construction, and obtain a three dimensional…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
A well-known conjecture of McMullen, proved by Billera, Lee and Stanley, describes the face numbers of simple polytopes. The necessary and sufficient condition is that the toric g-vector of the polytope is an M-vector, that is, the vector…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…