String attractors of Rote sequences | Vidéo | Carmin.tv

00:00:00 / 00:00:00

String attractors of Rote sequences

By Veronika Hendrychová

Appears in collection : Combinatorics on words / Combinatoire des mots - Week 5

String attractor, a relatively new combinatorial notion, is closely related to measuring the complexity of words and offers a unified approach to the repetitiveness measures induced by dictionary compressors. However, attractors have been only little studied in the context of combinatorics on words, particularly for classes of low complexity, including complementary-symmetric Rote sequences. In this talk, we work with pseudopalindromic closures as a useful way to generate these sequences, and then show the form of minimal attractors of their pseudopalindromic prefixes.

Information about the video

Date of recording 26/02/2024
Date of publication 22/03/2024
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers, Graduate Students
Director(s) Luca Recanzone
Format MP4

Citation data

DOI 10.24350/CIRM.V.20145903
Cite this video Hendrychová, Veronika (26/02/2024). String attractors of Rote sequences. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20145903
URL https://dx.doi.org/10.24350/CIRM.V.20145903

Domain(s)

Combinatorics

Bibliography

DVOŘÁKOVÁ, Lubomíra et HENDRYCHOVÁ, Veronika. String attractors of Rote sequences. arXiv preprint arXiv:2308.00850, 2023. - https://doi.org/10.48550/arXiv.2308.00850

MSC codes

Document(s)

https://www.cirm-math.fr/RepOrga/3152/Slides/hendrychova.pdf

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2024

Give feedback