Inconstancy of finite and infinite sequences

DOI10.1016/J.TCS.2011.01.004MaRDI QIDQ533867zbMATH OpenOpenAlexFDO

Authors Laurence Maillard-Teyssier, Jean-Paul Allouche

Publication date 10 May 2011

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

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

zbMATH Keywords

entropytime seriescombinatorics on wordsfluctuationsautomatic sequencesCauchy-Crofton theoremdiscrete curvesinconstancy of sequencesSturmian sequences

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Combinatorics on words (68R15) Automata sequences (11B85)

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.

Recommendations

• On the statistical variation of sequences
• Aperiodicity Measure for Infinite Sequences
• On some questions of V.I. Arnold on the stochasticity of geometric and arithmetic progressions
• scientific article; zbMATH DE number 1543069
• scientific article; zbMATH DE number 566417

Cites work

• scientific article; zbMATH DE number 3830930 (Why is no real title available?)
• scientific article; zbMATH DE number 17408 (Why is no real title available?)
• scientific article; zbMATH DE number 4126298 (Why is no real title available?)
• scientific article; zbMATH DE number 1740032 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 1408935 (Why is no real title available?)
• scientific article; zbMATH DE number 3084023 (Why is no real title available?)
• An efficient algorithm for determining the convex hull of a finite planar set
• An optimal real-time algorithm for planar convex hulls
• Art of Graph Drawing and Art
• Automatic Sequences
• Can one measure the temperature of a curve?
• Convex hulls of finite sets of points in two and three dimensions
• Dimension des courbes planes, papiers plies et suites de Rudin-Shapiro
• Folding paper and thermodynamics
• Generalised entropy of curves for the analysis and classification of dynamical systems
• Intersecting two-dimensional fractals with lines
• La formule de Cauchy sur la longueur d’une courbe
• Length, shape and area
• On the identification of the convex hull of a finite set of points in the plane
• Paper folding, space-filling curves and Rudin-Shapiro sequences
• Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions
• Unbiased Estimation in Line-Intercept Sampling
• Using the entropy of curves to segment a time or spatial series

Cited in

(2)

• Aggregation of infinite sequences
• The inconstancy of music

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)