A Ramsey characterisation of eventually periodic words

نویسندگان

چکیده

A factorisation x = u 1 2 ? $x u_1 u_2 \cdots$ of an infinite word $x$ on alphabet X $X$ is called ‘monochromatic’, for a given colouring the finite words ? $X^*$ , if each i $u_i$ same colour. Wojcik and Zamboni proved that periodic only every there monochromatic . On other hand, it follows from Ramsey's theorem that, any suffix having factorisation. ‘super-monochromatic’ k n $u_{k_1} u_{k_2} \cdots u_{k_n}$ where < $k_1 k_n$ Our aim in this paper to show eventually super-monochromatic main tool Ramsey result about alternating sums may be independent interest.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffusion on Graphs Is Eventually Periodic

We study a variant of the chip-firing game called diffusion. In diffusion on a graph, each vertex of the graph is initially labelled with an integer interpreted as the number of chips at that vertex, and at each subsequent step, each vertex simultaneously fires one chip to each of its neighbours with fewer chips. Since this firing rule may result in negative labels, diffusion, unlike the parall...

متن کامل

LMI tools for eventually periodic systems

This paper is focused on the concept of an eventually periodic linear discrete-time system. We derive a necessary and su4cient analysis condition for checking open-loop stability and performance of such systems, and use this to derive exact controller synthesis conditions given eventually periodic plants. All the conditions derived are provided in terms of semi-de9nite programming problems. The...

متن کامل

Eventually Periodic Solutions of a Max-Type Difference Equation

We study the following max-type difference equation xn = max{A(n)/x(n-r), x(n-k)}, n = 1,2,…, where {A(n)} n=1 (+∞) is a periodic sequence with period p and k, r ∈ {1,2,…} with gcd(k, r) = 1 and k ≠ r, and the initial conditions x(1-d), x(2-d),…, x 0 are real numbers with d = max{r, k}. We show that if p = 1 (or p ≥ 2 and k is odd), then every well-defined solution of this equation is eventuall...

متن کامل

Asymptotic Controllability by Means of Eventually Periodic Switching Rules

In this paper we introduce the notion of eventually periodic switching signal. We prove that if a family of linear vector fields satisfies a mild finite time controllability condition, and for each initial state there exists a time-dependent switching signal which asymptotically drives the system to the origin (possibly allowing different signals for different initial states), then the same goa...

متن کامل

Delta Sets of Numerical Monoids Are Eventually Periodic

Let M be a numerical monoid (i.e., an additive submonoid of N0) with minimal generating set 〈n1, . . . , nt〉. For m ∈ M , if m = Pt i=1 xini, then Pt i=1 xi is called a factorization length of m. We denote by L(m) = {m1, . . . , mk} (where mi < mi+1 for each 1 ≤ i < k) the set of all possible factorization lengths of m. The Delta set of m is defined by ∆(m) = {mi+1 −mi | 1 ≤ i < k } and the Del...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of The London Mathematical Society

سال: 2022

ISSN: ['1469-2120', '0024-6093']

DOI: https://doi.org/10.1112/blms.12704