activity
20172026
most citedComputing Minimal Injective Resolutions of Sheaves on Finite Posets

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CG2026

Lunar Generalizations of the Euclidean Minimum Spanning Tree in the Plane and their Expected Costs

Ondřej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier +1

Motivated by the recent introduction of chromatic persistent homology, we generalize the Euclidean minimum spanning tree (EMST) for points in to the lunar EMST f…

cs.CG2024

Chromatic Topological Data Analysis

Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner +1

Exploring the shape of point configurations has been a key driver in the evolution of TDA (short for topological data analysis) since its infancy. This survey illustrates the recen…

math.CO2022

On the Size of Chromatic Delaunay Mosaics

Ranita Biswas, Sebastiano Cultrera di Montesano, Ondřej Draganov +2

Given a locally finite set and a coloring , we introduce the chromatic Delaunay mosaic of , which is a Delaunay mosaic…

math.GN2022

Discrete Microlocal Morse Theory

Adam Brown, Ondrej Draganov

We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computation…

math.AT2021★ 1 cited

Computing Minimal Injective Resolutions of Sheaves on Finite Posets

Adam Brown, Ondrej Draganov

In this paper we introduce two new methods for constructing injective resolutions of sheaves of finite-dimensional vector spaces on finite posets. Our main result is the existence…

math.LO2017

The minimal arity of near-unanimity polymorphisms

Libor Barto, Ondřej Draganov

Dmitriy Zhuk has proved that there exist relational structures which admit near-unanimity polymorphisms, but the minimum arity of such a polymorphism is large and almost matches th…