Logo image
Se connecter
Retour
Avoidability of Additive Cubes over Alphabets of Four Numbers
Acte de colloque   Avec comité de lecture

Avoidability of Additive Cubes over Alphabets of Four Numbers

Florian Lietard et Matthieu Rosenfeld
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2020, Vol.12086, pp.192-206
Lecture Notes in Computer Science
26/05/2020
DOI: https://doi.org/10.1007/978-3-030-48516-0_15

Résumé

Computer Science Computer Science, Artificial Intelligence Computer Science, Software Engineering Computer Science, Theory & Methods Linguistics Science & Technology Social Sciences Technology
Let A subset of N be a set of size 4 such that A cannot be obtained by applying the same affine function to all of the elements of {0, 1, 2, 3}. We show that there is an infinite sequence of elements of A that contains no three consecutive blocks of same size and same sum (additive cubes). Moreover, it is possible to replace N by C in the statement.

Indicateurs

1 Consultations de la notice

Détails

Logo image