English
Related papers

Related papers: A Discrete Morse Theory for Digraphs

200 papers

To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…

Data Structures and Algorithms · Computer Science 2018-02-13 Anatoly D. Plotnikov

Many "good" topologies for interconnection networks are based on line digraphs of regular digraphs. These digraphs support unitary matrices. We propose the property "being the digraph of a unitary matrix" as additional criterion for the…

Discrete Mathematics · Computer Science 2007-05-23 Simone Severini

This paper develops a discrete theory of real Riemann surfaces based on quadrilateral cellular decompositions (quad-graphs) and a linear discretization of the Cauchy-Riemann equations. We construct a discrete analogue of an antiholomorphic…

Complex Variables · Mathematics 2026-01-01 Johanna Düntsch , Felix Günther

In this paper, we determine the homotopy type of the Morse complex of certain collections of simplicial complexes by studying dominating vertices or strong collapses. We show that if $K$ contains two leaves that share a common vertex, then…

Algebraic Topology · Mathematics 2021-07-19 Connor Donovan , Maxwell Lin , Nicholas A. Scoville

Given any digraph $D$ on $n$ vertices, let $\mathcal{P}(D)$ be the family of all directed paths in $D$, and let $H$ be a digraph with the arc set $A(H)=\{a_1, \ldots, a_k\}$. The digraph $D$ is called arbitrary Hamiltonian $H$-linked if for…

Combinatorics · Mathematics 2025-03-27 Yangyang Cheng , Zhilan Wang , Jin Yan

The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…

Discrete Mathematics · Computer Science 2014-02-19 V. Bino Sebastian , A Unnikrishnan , Kannan Balakrishnan , P. B Ramkumar

Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…

Algebraic Topology · Mathematics 2023-11-17 Jian Liu , Ran Liu , Jie Wu

We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to…

Discrete Mathematics · Computer Science 2014-04-25 M. Drew LaMar

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…

Geometric Topology · Mathematics 2025-09-26 Aleksander Doan , Juan Muñoz-Echániz

To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…

Combinatorics · Mathematics 2014-09-23 An Huang , Shing-Tung Yau

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

Classical Analysis and ODEs · Mathematics 2021-04-02 Liangpan Li

This paper presents a discrete homotopy theory and a discrete homology theory for finite posets. In particular, the discrete and classical homotopy groups of finite posets are always isomorphic. Moreover, this discrete homology theory is…

Combinatorics · Mathematics 2026-03-05 Jing-Wen Gao , Xiao-Song Yang

If a complex analytic function, $f$, has a stratified isolated critical point, then it is known that the cohomology of the Milnor fibre of $f$ has a direct sum decomposition in terms of the normal Morse data to the strata. We use microlocal…

Algebraic Geometry · Mathematics 2007-05-23 David B. Massey

We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…

Discrete Mathematics · Computer Science 2018-06-28 Pavol Hell , Jing Huang , Ross M. McConnell , Arash Rafiey

There are many approaches to the classification of Morse functions and their gradient fields (Morse Fields) on 2-surfaces. This paper studies the gluings of quadrilaterals and the classification of topological surfaces obtained by gluing…

Geometric Topology · Mathematics 2023-08-04 Kostiantyn Cherkashyn

Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs…

Probability · Mathematics 2010-12-16 Cédric Boutillier , Béatrice De Tilière

This paper develops an invariant--geometric interpretation of the canonization problem for simple undirected weighted graphs based on the {discrete moving frame method} for finite groups. We consider the action of the {pair group}…

Combinatorics · Mathematics 2026-01-27 Leonid Bedratyuk

A vertex transitive graph $\Gamma$ is said to be $2$-distance transitive if for each vertex $u$, the group of automorphisms of $\Gamma$ fixing the vertex $u$ acts transitively on the set of vertices at distance $1$ and $2$ from $u$, while…

Combinatorics · Mathematics 2024-03-05 Jun-Jie Huang , Yan-Quan Feng , Jin-Xin Zhou , Fu-Gang Yin

To investigate the topological structure of Morse flows on the 2-disk we use the planar graphs as destinguished graph of the flow. We assume, that the flow is transversal to the boundary of the 2-disk. We give a list of all planar graph…

Combinatorics · Mathematics 2023-05-02 Oleksandr Pryshliak

Let $T$ be a digraph with vertices $u_1, \dots, u_t$ ($t\ge 2$) and let $H_1, \dots, H_t$ be digraphs such that $H_i$ has vertices $u_{i,j_i},\ 1\le j_i\le n_i.$ Then the composition $Q=T[H_1, \dots, H_t]$ is a digraph with vertex set…

Combinatorics · Mathematics 2020-05-05 Yuefang Sun