Non-dominating sequences of vectors using only resets and increments
Discrete Mathematics
2015-12-08 v2
Abstract
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 . It perfectly match the previously known upperbound.
Keywords
Cite
@article{arxiv.1506.05279,
title = {Non-dominating sequences of vectors using only resets and increments},
author = {Wojciech Czerwinski and Tomasz Gogacz and Eryk Kopczynski},
journal= {arXiv preprint arXiv:1506.05279},
year = {2015}
}