English
Related papers

Related papers: The path-missing and path-free complexes of a dire…

200 papers

Graph manifolds form important classes of $3$-dimensional closed and orientable manifolds. For example, {\it Seifert} manifolds are graph manifolds where hyperbolic manifolds are not. In applying singularity theory of differentiable maps to…

Geometric Topology · Mathematics 2022-08-16 Naoki Kitazawa

A directed graph $D$ is singly connected if for every ordered pair of vertices $(s,t)$, there is at most one path from $s$ to $t$ in $D$. Graph orientation problems ask, given an undirected graph $G$, to find an orientation of the edges…

Combinatorics · Mathematics 2023-06-06 Tim A. Hartmann , Komal Muluk

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is…

Computational Complexity · Computer Science 2017-05-11 Till Fluschnik , Marco Morik , Manuel Sorge

We prove the non-existence of special generic maps on complex projective space as our extended new result. Simplest special generic maps are Morse functions with exactly two singular points on spheres, or Morse functions in Reeb's theorem,…

Algebraic Topology · Mathematics 2022-06-24 Naoki Kitazawa

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

Combinatorics · Mathematics 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

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

This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f, g from X to Y and the second computes the group $[\Sigma X,Y]^*$ of pointed…

Algebraic Topology · Mathematics 2013-12-10 Marek Filakovský , Lukáš Vokřínek

We show that diagram groups can be viewed as fundamental groups of spaces of positive paths on directed 2-complexes (these spaces of paths turn out to be classifying spaces). Thus diagram groups are analogs of second homotopy groups,…

Group Theory · Mathematics 2007-05-23 V. S. Guba , M. V. Sapir

The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution of hard-particle models. In 2004, it was conjectured by Fendleyet al. that for some rectangular grids, with…

Combinatorics · Mathematics 2008-10-31 Mireille Bousquet-Mélou , Svante Linusson , Eran Nevo

We introduce a filtration on the simplicial homology of a finite simplicial complex X using bi-colourings of its vertices. This yields two dual homology theories closely related to discrete Morse matchings on X. We give an explicit…

Combinatorics · Mathematics 2022-12-05 Daniele Celoria

We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…

Combinatorics · Mathematics 2016-04-05 Oliver Cooley , Penny Haxell , Mihyun Kang , Philipp Sprüssel

A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph has at least two moplexes, little is known about structural properties of graphs…

Combinatorics · Mathematics 2023-02-01 Clément Dallard , Robert Ganian , Meike Hatzel , Matjaž Krnc , Martin Milanič

We show that every subset of vertices of a directed graph E gives a Morita equivalence between a subalgebra and an ideal of the associated Leavitt path algebra. We use this observation to prove an algebraic version of a theorem of Crisp and…

Rings and Algebras · Mathematics 2017-01-13 Lisa Orloff Clark , Astrid an Huef , Pareoranga Luiten-Apirana

In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…

Dynamical Systems · Mathematics 2020-05-29 José Ayala , Wolfgang Kliemann

A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…

Data Structures and Algorithms · Computer Science 2024-04-15 Loukas Georgiadis , Dionysios Kefallinos , Evangelos Kosinas

In the first part of this paper, we consider smooth maps from a compact orientable 3-manifold without boundary to the 2-sphere. We give a geometric criterion to decide whether two given maps are homotopic, based on the sets of points where…

Dynamical Systems · Mathematics 2007-05-23 Emmanuel Dufraine

Leavitt path algebras are free algebras subject to relations induced by directed graphs. This paper investigates the ideals of Leavitt path algebras, with an emphasis on the relationship between graph-theoretic properties of a directed…

Rings and Algebras · Mathematics 2025-10-09 Yvan Grinspan , Seth Yoo

The theory of complexes of directed trees was initiated by Kozlov to answer a question by Stanley, and later on, results from the theory were used by Babson and Kozlov in their proof of the Lovasz conjecture. We develop the theory and prove…

Combinatorics · Mathematics 2007-05-23 Alexander Engstrom

Let $\alpha$ be a Morse closed $1$-form of a smooth $n$-dimensional manifold $M$. The zeroes of $\alpha$ of index $0$ or $n$ are called \emph{centers}. It is known that every non-vanishing de Rham cohomology class $u$ contains a Morse…

Geometric Topology · Mathematics 2014-09-05 Carlos Moraga Ferrandiz

We show that there is an almost complex structure on a differential calculus on finite points coming from a bidirected finite graph without multiple edges or loops. We concentrate on a polygon as a concrete case. In particular, a…

Quantum Algebra · Mathematics 2024-06-07 Soumalya Joardar , Atibur Rahaman