5 citations · 8 across the 3 of their papers we have counts for
6 papers · 1 filter
An application of neighbourhoods in digraphs to the classification of binary dynamics
Pedro Conceição, Dejan Govc, Jānis Lazovskis +3
A binary state on a graph means an assignment of binary values to its vertices. For example, if one encodes a network of spiking neurons as a directed graph, then the spikes produc…
Computing Homotopy Types of Directed Flag Complexes
Dejan Govc
Combinatorially and stochastically defined simplicial complexes often have the homotopy type of a wedge of spheres. A prominent conjecture of Kahle quantifies this precisely for th…
Complexes of Tournaments, Directionality Filtrations and Persistent Homology
Dejan Govc, Ran Levi, Jason P. Smith
Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as "tournaplexes", whose simpl…
How many simplices are needed to triangulate a Grassmannian?
Dejan Govc, Wacław Marzantowicz, Petar Pavešić
We compute a lower bound for the number of simplices that are needed to triangulate the Grassmann manifold . In particular, we show that the number of top-dimens…
Computing persistent homology of directed flag complexes
Daniel Luetgehetmann, Dejan Govc, Jason Smith +1
We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrat…
Unimodal Category and the Monotonicity Conjecture
Dejan Govc
We completely characterize the unimodal category for functions using a decomposition theorem obtained by generalizing the sweeping algorithm of Baryshnik…