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)\)...

Full description

Saved in:
Bibliographic Details
Date:2018
Main Author: Verbitsky, Oleg
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