Linear growth of bottleneck error for dependent deletions
Determine whether there exists a family of interacting generator deletions for which the bottleneck error grows linearly with the number of deletions, thereby making the additive sum-of-costs bound essentially sharp.
References
We do not know whether some family forces the error to grow linearly with the number of deletions.
— Homological Trimming and Regularity of Filtrations via Local Obstruction Modules
(2609.28160 - Pritam, 23 Sep 2026) in Section 5, subsection “Rounds,” paragraph “The dependent case”
The weak NP-hardness reduction from PARTITION has ρ → 1 as the instance grows. It separates strict contraction from exact tractability but leaves the complexity for ρ bounded away from one open.
— When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure
(2610.01149 - Wang et al., 1 Oct 2026) in Section 4.4, Appendix A.2