Related papers: A Discrete Morse Theory for Digraphs
Fold maps are smooth maps at each singular point of which it is represented as the product map of a Morse function and the identity map. Round fold maps are, in short, such maps the sets of all singular points of which are embedded…
This paper is devoted to the study of special subgroups of the automorphism groups of Kronrod-Reeb graphs of a Morse functions on $2$-torus $T^2$ which arise from the action of diffeomorphisms preserving a given Morse function on $T^2$. In…
Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the…
A classical result in Morse theory is the determination of the homotopy type of the loop space of a manifold. In this paper, we study this result through the lens of discrete Morse theory. This requires a suitable simplicial model for the…
A generalisation of discrete torsion is introduced in which different discrete torsion phases are considered for the different fixed points or twist fields of a twisted sector. The constraints that arise from modular invariance are analysed…
An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…
The neighborhood complex of a graph was introduced by Lov\'asz to provide topological lower bounds on chromatic number. More general homomorphism complexes of graphs were further studied by Babson and Kozlov. Such `Hom complexes' are also…
Any two equivalent discrete curves must have the same invariants at the corresponding points under an affine transformation. In this paper, we construct the moving frame and invariants for the discrete centroaffine curves, which could be…
We study how powerful algebraic discrete Morse theory is when applied to hull resolutions. The main result describes all cases when the hull resolution of the edge ideal of the complement of a triangle-free graph can be made minimal using…
Given a planar graph derived from a spherical, euclidean or hyperbolic tessellation, one can define a discrete curvature by combinatorial properties, which after embedding the graph in a compact 2d-manifold, becomes the Gaussian curvature.
Morse functions with exactly two singular points on homotopy spheres and canonical projections of spheres are generalized as special generic maps. A special generic map is, roughly, a smooth map represented as the composition of a smooth…
In this paper, we investigate vector fields on polyhedral complexes and their associated trajectories. We study vector fields which are analogue of the gradient vector field of a function in the smooth case. Our goal is to define a nice…
We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…
We give a classification of generic coadjoint orbits for the groups of symplectomorphisms and Hamiltonian diffeomorphisms of a closed symplectic surface. We also classify simple Morse functions on symplectic surfaces with respect to actions…
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
Given a graph $G$ then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$. We say a graph $G$ is $distance\ preserving\ (dp)$ if it has an isometric subgraph of every possible order up…
In the 1950s Morse defined the analogue of Morse functions for topological manifolds. In many instances, when mathematicians are using techniques on topological manifolds that appear to be Morse-theoretic in nature, there is a topological…
In this work, we design a nearly linear time discrete Morse theory based algorithm for computing homology groups of 2-manifolds, thereby establishing the fact that computing homology groups of 2-manifolds is remarkably easy. Unlike previous…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…