On the Length of Strongly Monotone Descending Chains over ${\mathbb{N}}^d$

Sylvain Schmitz, Lia Schütze

A recent breakthrough by Künnemann, Mazowiecki, Schütze, Sinclair-Banks, and Wegrzycki (ICALP, 2023) bounds the running time for the coverability problem in $d$-dimensional vector…