Affiliations: [a] Institute of Computer Science, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. [email protected] | [b] Institute of Computer Science, University of Wrocław, Joliot-Curie 15, Wrocław, Poland. [email protected] | [c] Institute of Computer Science, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. [email protected]
Note: [*] Address for correspondence: Institute of Computer Science, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland.
Abstract: 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 22θ(n), what matches the previously known upper bound.
