%0 Journal Article
%T Non-dominating sequences of vectors using only resets and increments
%A Wojciech Czerwinski
%A Tomasz Gogacz
%A Eryk Kopczynski
%J Computer Science
%D 2015
%I arXiv
%R 10.3233/FI-2015-1247
%X We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\theta (n)}}$. It perfectly match the previously known upperbound.
%U http://arxiv.org/abs/1506.05279v2