Non-dominating Sequences of Vectors Using only Resets and Increments
Wojciech Krzysztof Czerwinski, Tomasz Gogacz, Eryk Kopczyński · Fundamenta Informaticae · 2015
We consider sequences of vectors from ℕ d . Each coordinate of a vector can be reset or incremented by 1 with respect to the same coordinate of the preceding vector. We give an example of non-dominating sequence, like in Dickson’s Lemma, of length 2 2 θ( n) , what matches the previously known upper bound.