Name
Abstract | ||
|---|---|---|
We consider sequences of vectors from N-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 2(2 theta(n)), what matches the previously known upper bound. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.3233/FI-2015-1247 | FUNDAMENTA INFORMATICAE |
Keywords | Field | DocType |
Dickson's Lemma | Discrete mathematics,Combinatorics,Upper and lower bounds,Lemma (mathematics),Mathematics | Journal |
Volume | Issue | ISSN |
140 | 2 | 0169-2968 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wojciech Czerwinski | 1 | 0 | 0.34 |
| Tomasz Gogacz | 2 | 43 | 5.80 |
| Eryk Kopczynski | 3 | 64 | 9.68 |