منابع مشابه
A coloring problem for infinite words
In this paper we consider the following question in the spirit of Ramsey theory: Given x ∈ A, where A is a finite non-empty set, does there exist a finite coloring of the non-empty factors of x with the property that no factorization of x is monochromatic? We prove that this question has a positive answer using two colors for almost all words relative to the standard Bernoulli measure on A. We ...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملA Coloring Problem for Sturmian and Episturmian Words
We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word w, does there exist a finite coloring of its factors such that no factorization of w is monochromatic? We show that such a coloring always exists whenever w is a Sturmian word or a standard episturmian word.
متن کاملThe equality problem for infinite words generated by primitive morphisms
We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.
متن کاملa new simulated annealing algorithm for the robust coloring problem
the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2014
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2014.03.009