2 papers
math.CO2025
Tight complexity bounds for diagram commutativity verification
Artem Malko, Igor Spiridonov
A diagram over a monoid is an oriented graph endowed with a labeling . A diagram is commutative if and only if for any two…
math.AT2024
Simplifications of finite spaces equipped with sheaves
Artem Malko
Following the classical results of Stong, we introduce a cohomological analogue of a core of a finite sheaved topological space and propose an algorithm for simplification in this…