On Correlation Polynomials and Subword Complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

On Correlation Polynomials and Subword Complexity


We consider words with letters from a $q-ary$ alphabet $\mathcal{A}$. The kth subword complexity of a word $w ∈\mathcal{A}^*$ is the number of distinct subwords of length $k$ that appear as contiguous subwords of $w$. We analyze subword complexity from both combinatorial and probabilistic viewpoints. Our first main result is a precise analysis of the expected $kth$ subword complexity of a randomly-chosen word $w ∈\mathcal{A}^n$. Our other main result describes, for $w ∈\mathcal{A}^*$, the degree to which one understands the set of all subwords of $w$, provided that one knows only the set of all subwords of some particular length $k$. Our methods rely upon a precise characterization of overlaps between words of length $k$. We use three kinds of correlation polynomials of words of length $k$: unweighted correlation polynomials; correlation polynomials associated to a Bernoulli source; and generalized multivariate correlation polynomials. We survey previously-known results about such polynomials, and we also present some new results concerning correlation polynomials.
Fichier principal
Vignette du fichier
dmAH0101.pdf (290.56 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184801 , version 1 (17-08-2015)



Irina Gheorghiciuc, Mark Daniel Ward. On Correlation Polynomials and Subword Complexity. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.1-18, ⟨10.46298/dmtcs.3553⟩. ⟨hal-01184801⟩


84 View
864 Download



Gmail Facebook Twitter LinkedIn More