Border Correlations, Lattices, and the Subgraph Component Polynomial
We consider the border sets of partial words and study the combinatorics of specific representations of them, called border correlations, which are binary vectors of same length indicating the borders. We characterize precisely which of these vectors are valid border correlations, and establish a one-to-one correspondence between the set of valid border correlations and the set of valid period correlations of a given length, the latter being ternary vectors representing the strong and strictly weak period sets. It turns out that the sets of all border correlations of a given length form distributive lattices under suitably defined partial orderings. We also investigate the population size, i.e., the number of partial words sharing a given border correlation, and obtain formulas to compute it. We do so using the subgraph component polynomial of an undirected graph, introduced recently by Tittmann et al. (European Journal of Combinatorics, 2011), which counts the number of connected components in vertex induced subgraphs.
KeywordsUndirected Graph Partial Word Cycle Graph Binary Alphabet Graph Polynomial
- 1.Allen, E., Blanchet-Sadri, F., Byrum, C., Cucuringu, M., Mercaş, R.: Counting bordered partial words by critical positions. Electron. J. Comb. 18, P138 (2011)Google Scholar
- 6.Christodoulakis, M., Ryan, P.J., Smyth, W.F., Wang, S.: Indeterminate strings, prefix arrays and undirected graphs, 12 Jun 2014. arXiv:1406.3289v1 [cs.DM]
- 12.Smyth, W.F.: Computing Patterns in Strings. Pearson Addison-Wesley, London (2003)Google Scholar