Related papers: Morse Matchings on a Hypersimplex
We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this…
We show how to construct homology bases for certain CW complexes in terms of discrete Morse theory and cellular homology. We apply this technique to study certain subcomplexes of the half cube polytope studied in previous works. This…
We construct Morse homology groups associated with any regular function on a smooth complex algebraic variety, allowing singular and non-compact critical loci. These groups are generated by critical points of a certain large pertubation of…
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The…
We give combinatorial models for the homotopy type of complements of elliptic arrangements (i.e., certain sets of abelian subvarieties in a product of elliptic curves). We give a presentation of the fundamental group of such spaces and, as…
In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
Given a compact smooth manifold $M$ with non-empty boundary and a Morse function, a pseudo-gradient Morse-Smale vector field adapted to the boundary allows one to build a Morse complex whose homology is isomorphic to the (absolute or…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
We introduce a novel combinatorial method to study $Q^{**}$-transformations of group presentations or, equivalently, 3-deformations of CW-complexes of dimension 2. Our procedure is based on a refinement of discrete Morse theory that gives a…
We construct an equivariant version of discrete Morse theory for simplicial complexes endowed with group actions. The key ingredient is a 2-categorical criterion for making acyclic partial matchings on the quotient space compatible with an…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider…
We construct a new class of maximal acyclic matchings on the Salvetti complex of a locally finite hyperplane arrangement. Using discrete Morse theory, we then obtain an explicit proof of the minimality of the complement. Our construction…
We study Morse theory on noncompact manifolds equipped with exhaustions by compact pieces, defining the Morse homology of a pair which consists of the manifold and related geometric/homotopy data. We construct a collection of Morse data…
Equifacetal simplices, all of whose codimension one faces are congruent to one another, are studied. It is shown that the isometry group of such a simplex acts transitively on its set of vertices, and, as an application, equifacetal…
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…
We present a Morse-theoretic characterization of collapsibility for 2-dimensional acyclic simplicial complexes by means of the values of normalized optimal combinatorial Morse functions.
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…