Non-dominating sequences of vectors using only resets and increments

Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

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 22θ(n). It perfectly match the previously known upperbound.
Original languageEnglish
Pages (from-to)123-127
Number of pages5
JournalFundamenta Informaticae
Issue number2
Publication statusPublished - 27 Aug 2015


Dive into the research topics of 'Non-dominating sequences of vectors using only resets and increments'. Together they form a unique fingerprint.

Cite this