# On Correlation Polynomials and Subword Complexity

Abstract : 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.
Keywords :
Type de document :
Communication dans un congrès
Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.1-18, 2007, DMTCS Proceedings
Domaine :

Littérature citée [28 références]

https://hal.inria.fr/hal-01184801
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 17:00:30
Dernière modification le : jeudi 11 mai 2017 - 01:02:52
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 12:18:52

### Fichier

dmAH0101.pdf
Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01184801, version 1

### Citation

Irina Gheorghiciuc, Mark Daniel Ward. On Correlation Polynomials and Subword Complexity. Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.1-18, 2007, DMTCS Proceedings. 〈hal-01184801〉

### Métriques

Consultations de la notice

## 83

Téléchargements de fichiers