Abstract
In combinatorics on words squares can be viewed in two different ways. One way is to construct more square-free words and another way is to maximize the number of square factors in a word. Vesa Halava, Tero Harju and Tomi Karki in [6] discussed squares in partial words, which are words with ‘do not know’ symbols ◊ called holes. In this paper, we introduce squares in partial array, row wise position of the square, Column wise position of the square in partial array and also square free partial array. We investigate the problem of the number of distinct full squares compatible with factors in a partial array, of order (m,n) over a k-letter alphabet, with h holes and prove it is bounded above by some quantity. We also prove that fork≥2 a partial array with more than k squares at position (1,1) having one hole is obtained.

This publication has 3 references indexed in Scilit: