Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Dejan Govc"'
Publikováno v:
Harvard Data Science Review (2022)
Externí odkaz:
https://doaj.org/article/74e59bb8c53240808ffd36c8020981b4
Publikováno v:
Algorithms, Vol 13, Iss 1, p 19 (2020)
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 filtrations on the graph and the resulting complex. The persistent homology c
Externí odkaz:
https://doaj.org/article/1dbc71d8d1904d90a5f91d52831b9df1
Autor:
Dejan Govc
Publikováno v:
Journal of Applied and Computational Topology. 5:621-669
We completely characterize the unimodal category for functions $$f:{\mathbb {R}}\rightarrow [0,\infty )$$ using a decomposition theorem obtained by generalizing the sweeping algorithm of Baryshnikov and Ghrist. We also give a characterization of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10cdf4364893211e8021d6f58b52a7eb
https://doi.org/10.1007/s41468-021-00077-z
https://doi.org/10.1007/s41468-021-00077-z
In a recent publication [D. Govc, W. A. Marzantowicz and P. Pavešić, Estimates of covering type and the number of vertices of minimal triangulations, Discrete Comput. Geom. 63 2020, 1, 31–48], we have introduced a new method, based on the Lustern
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59f8e05888abe71916a29b2bb4a59bbc
http://arxiv.org/abs/2108.09853
http://arxiv.org/abs/2108.09853
Publikováno v:
Discrete & Computational Geometry. 63:31-48
The covering type of a space $X$ is a numerical homotopy invariant which in some sense measures the homotopical size of $X$. It was first introduced by Karoubi and Weibel (in Enseign Math 62(3-4):457-474, 2016) as the minimal cardinality of a good co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::774d724e68b4cef4ec9ee9447832a774
https://doi.org/10.1007/s00454-019-00092-z
https://doi.org/10.1007/s00454-019-00092-z
Autor:
Jason Smith, Dejan Govc
We present some results on the proportion of permutations of length $n$ containing certain mesh patterns as $n$ grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and columns are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78c489eccd12a8c6a5e1abdfdfe85171
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 simplices are tournaments. In particular, given a digraph $\mathcal{G}$, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88f1c14588fbb43207240ee43365a998
http://arxiv.org/abs/2003.00324
http://arxiv.org/abs/2003.00324
Publikováno v:
Topol. Methods Nonlinear Anal. 56, no. 2 (2020), 501-518
In this paper we use recently developed methods to compute a lower bound for the number of simplices that are needed to triangulate the Grassmann manifold $\G_k(\mathbb{R}^n)$. We first estimate the number of vertices that are needed for such a trian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e87c4721ba928af1f61d82d75567594c
Autor:
Dejan Govc, Primoz Skraba
Publikováno v:
Foundations of Computational Mathematics. 18:1245-1297
The nerve theorem relates the topological type of a suitably nice space with the nerve of a good cover of that space. It has many variants, such as to consider acyclic covers and numerous applications in topology including applied and computational t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d617b222a6efa7cf00f89345358ee7c0
https://doi.org/10.1007/s10208-017-9368-6
https://doi.org/10.1007/s10208-017-9368-6
Publikováno v:
Algorithms, Vol 13, Iss 1, p 19 (2020)
Algorithms
Volume 13
Issue 1
Algorithms
Volume 13
Issue 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 filtrations on the graph and the resulting complex. The persistent homology c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9d41e63acf1d9952073a53ed70c5f83