2019/04/25 by Kalpana Mahalingam, Mahalingam, Kalpana, Palak Pandoh +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #68R15 #Algorithms and Data Compression #Combinatorics (math.CO) #DNA and Biological Computing #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1904.11334
openalex publication_date 2019/04/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A two-dimensional (2D) word is a 2D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are 1D palindromes. We study some combinatorial and structural properties of HV-palindromes and its comparison with 2D palindromes. We investigate the maximum number number of distinct non-empty HV-palindromic sub-arrays in any finite 2D word, thus, proving the conjecture given by Anisiua et al. We also find the least number of HV-palindromes in an infinite 2D word over a finite alphabet size q.