We present a dynamic data structure for representing binary n×n matrices that are d-twin-ordered, for a~fixed parameter d. Our structure supports cell queries and single-cell updates both in \Oh(loglogn) expected worst case time, while using \Ohd(n) memory; here, the \Ohd(⋅) notation
Cite
@article{arxiv.2602.18770,
title = {Dynamic data structures for twin-ordered matrices},
author = {Bartłomiej Bosek and Jadwiga Czyżewska and Evangelos Kipouridis and Wojciech Nadara and Michał Pilipczuk and Karol Węgrzycki and Anna Zych-Pawlewicz},
journal= {arXiv preprint arXiv:2602.18770},
year = {2026}
}