Ramseyan variations on symmetric subsequences
A theorem of Dekking in the combinatorics of words implies that there exists an injective order-preserving transformation \(f : {\{0,1,\ldots,n\}}\rightarrow {\{0,1,\ldots,2n\}}\) with the restriction \(f(i+1)\le f(i) + 2\) such that for every 5-term arithmetic progression \(P\) its image \(f(P)\)...
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1147 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete Mathematics| id |
oai:ojs.admjournal.luguniv.edu.ua:article-1147 |
|---|---|
| record_format |
ojs |
| spelling |
oai:ojs.admjournal.luguniv.edu.ua:article-11472018-05-13T06:43:21Z Ramseyan variations on symmetric subsequences Verbitsky, Oleg A theorem of Dekking in the combinatorics of words implies that there exists an injective order-preserving transformation \(f : {\{0,1,\ldots,n\}}\rightarrow {\{0,1,\ldots,2n\}}\) with the restriction \(f(i+1)\le f(i) + 2\) such that for every 5-term arithmetic progression \(P\) its image \(f(P)\) is not an arithmetic progression. In this paper we consider symmetric sets in place of arithmetic progressions and prove lower and upper bounds for the maximum \(M=M(n)\) such that every \(f\) as above preserves the symmetry of at least one symmetric set \(S\subseteq\{0,1,\ldots,n\}\) with \(|S|\ge M\). Lugansk National Taras Shevchenko University 2018-05-13 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1147 Algebra and Discrete Mathematics; Vol 2, No 1 (2003) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1147/639 Copyright (c) 2018 Algebra and Discrete Mathematics |
| institution |
Algebra and Discrete Mathematics |
| baseUrl_str |
|
| datestamp_date |
2018-05-13T06:43:21Z |
| collection |
OJS |
| language |
English |
| topic |
|
| spellingShingle |
Verbitsky, Oleg Ramseyan variations on symmetric subsequences |
| topic_facet |
|
| format |
Article |
| author |
Verbitsky, Oleg |
| author_facet |
Verbitsky, Oleg |
| author_sort |
Verbitsky, Oleg |
| title |
Ramseyan variations on symmetric subsequences |
| title_short |
Ramseyan variations on symmetric subsequences |
| title_full |
Ramseyan variations on symmetric subsequences |
| title_fullStr |
Ramseyan variations on symmetric subsequences |
| title_full_unstemmed |
Ramseyan variations on symmetric subsequences |
| title_sort |
ramseyan variations on symmetric subsequences |
| description |
A theorem of Dekking in the combinatorics of words implies that there exists an injective order-preserving transformation \(f : {\{0,1,\ldots,n\}}\rightarrow {\{0,1,\ldots,2n\}}\) with the restriction \(f(i+1)\le f(i) + 2\) such that for every 5-term arithmetic progression \(P\) its image \(f(P)\) is not an arithmetic progression. In this paper we consider symmetric sets in place of arithmetic progressions and prove lower and upper bounds for the maximum \(M=M(n)\) such that every \(f\) as above preserves the symmetry of at least one symmetric set \(S\subseteq\{0,1,\ldots,n\}\) with \(|S|\ge M\). |
| publisher |
Lugansk National Taras Shevchenko University |
| publishDate |
2018 |
| url |
https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1147 |
| work_keys_str_mv |
AT verbitskyoleg ramseyanvariationsonsymmetricsubsequences |
| first_indexed |
2025-07-17T10:35:03Z |
| last_indexed |
2025-07-17T10:35:03Z |
| _version_ |
1837890015210766336 |