Inconstancy of finite and infinite sequences

From MaRDI portal
Publication:533867

DOI10.1016/J.TCS.2011.01.004zbMATH Open1236.68196arXiv0910.1173OpenAlexW2076242348MaRDI QIDQ533867FDOQ533867


Authors: Laurence Maillard-Teyssier, Jean-Paul Allouche Edit this on Wikidata


Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we introduce the inconstancy of a sequence and we show why it seems more pertinent than other criteria for measuring its variational complexity. We also compute the inconstancy of classical binary sequences including some automatic sequences and Sturmian sequences.


Full work available at URL: https://arxiv.org/abs/0910.1173




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Inconstancy of finite and infinite sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533867)