Non-dominating sequences of vectors using only resets and increments

Wojciech Czerwinski; Tomasz Gogacz; Eryk Kopczynski

doi:10.3233/FI-2015-1247

Non-dominating sequences of vectors using only resets and increments

Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski

Research output: Contribution to journal › Article › peer-review

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 22θ(n). It perfectly match the previously known upperbound.

Original language	English
Pages (from-to)	123-127
Number of pages	5
Journal	Fundamenta Informaticae
Volume	140
Issue number	2
DOIs	https://doi.org/10.3233/FI-2015-1247
Publication status	Published - 27 Aug 2015

Access to Document

10.3233/FI-2015-1247

http://content.iospress.com/articles/fundamenta-informaticae/fi1247

Cite this

@article{c9fd22da1547454da638abcffd6a7b76,

title = "Non-dominating sequences of vectors using only resets and increments",

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 22θ(n). It perfectly match the previously known upperbound. ",

author = "Wojciech Czerwinski and Tomasz Gogacz and Eryk Kopczynski",

year = "2015",

month = aug,

day = "27",

doi = "10.3233/FI-2015-1247",

language = "English",

volume = "140",

pages = "123--127",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press",

number = "2",

}

TY - JOUR

T1 - Non-dominating sequences of vectors using only resets and increments

AU - Czerwinski, Wojciech

AU - Gogacz, Tomasz

AU - Kopczynski, Eryk

PY - 2015/8/27

Y1 - 2015/8/27

N2 - 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.

AB - 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.

U2 - 10.3233/FI-2015-1247

DO - 10.3233/FI-2015-1247

M3 - Article

SN - 0169-2968

VL - 140

SP - 123

EP - 127

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 2

ER -

Non-dominating sequences of vectors using only resets and increments

Abstract

Access to Document

Fingerprint

Cite this