کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8903651 | 1632749 | 2018 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Border correlations, lattices, and the subgraph component polynomial
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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 ternary 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 give connections between the ternary period correlation of a partial word and its refined border correlation which specifies the lengths of all the word's bordered cyclic shifts' minimal borders. Finally, we investigate the population size, that is, the number of partial words sharing a given (refined) 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. (2011), which counts the number of connected components in vertex induced subgraphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 68, February 2018, Pages 204-222
Journal: European Journal of Combinatorics - Volume 68, February 2018, Pages 204-222
نویسندگان
F. Blanchet-Sadri, M. Cordier, R. Kirsch,