2 papers
math.AT2026
A data structure for quotient flag complexes
Konstantin Sorokin, Aleksandr Levin, Maxim Beketov +1
Vietoris-Rips filtrations, which are standard in topological data analysis, are flag complexes, and a simplex tree stores these without any attaching data. In this paper we ask wha…
cs.DS2026
Fast Leaf-to-Ancestor Minimum Query in the Oracle Model
Aleksey Upirvitskiy, Aleksandr Levin
We study leaf-to-ancestor path-minimum queries on a rooted, weighted tree in the oracle model, where the only allowed value operation is a comparison oracle on edge (or node) weigh…