Abstract
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.
This material is based upon work supported by the National Science Foundation under Grants DMS–0754154 and DMS–1060775. The Department of Defense is also gratefully acknowledged.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Allen, E., Blanchet-Sadri, F., Byrum, C., Cucuringu, M., Mercaş, R.: Counting bordered partial words by critical positions. Electron. J. Comb. 18, P138 (2011)
Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton (2008)
Blanchet-Sadri, F., Bodnar, M., Fox, N., Hidakatsu, J.: A graph polynomial approach to primitivity. In: Dediu, A.-H., Martín-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 153–164. Springer, Heidelberg (2013)
Blanchet-Sadri, F., Clader, E., Simpson, O.: Border correlations of partial words. Theory Comput. Syst. 47, 179–195 (2010)
Blanchet-Sadri, F., Fowler, J., Gafni, J.D., Wilson, K.H.: Combinatorics on partial word correlations. J. Comb. Theory Ser. A 117, 607–624 (2010)
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]
Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)
Guibas, L.J., Odlyzko, A.M.: Periods in strings. J. Comb. Theory Ser. A 30, 19–42 (1981)
Harju, T., Nowotka, D.: Border correlation of binary words. J. Comb.Theory Ser. A 108, 331–341 (2004)
Makowsky, J.A.: From a zoo to a zoology: towards a general study of graph polynomials. Theory Comput. Syst. 43, 542–562 (2008)
Rivals, E., Rahmann, S.: Combinatorics of periods in strings. J. Comb. Theory Ser. A 104, 95–113 (2003)
Smyth, W.F.: Computing Patterns in Strings. Pearson Addison-Wesley, London (2003)
Tittmann, P., Averbouch, I., Makowsky, J.: The enumeration of vertex induced subgraphs with respect to number of components. Eur. J. Comb. 32, 954–974 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Blanchet-Sadri, F., Cordier, M., Kirsch, R. (2015). Border Correlations, Lattices, and the Subgraph Component Polynomial. In: Jan, K., Miller, M., Froncek, D. (eds) Combinatorial Algorithms. IWOCA 2014. Lecture Notes in Computer Science(), vol 8986. Springer, Cham. https://doi.org/10.1007/978-3-319-19315-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-19315-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19314-4
Online ISBN: 978-3-319-19315-1
eBook Packages: Computer ScienceComputer Science (R0)