HV-Palindromes in Two-Dimensional Words

DOI10.1142/S012905412250006XarXiv1904.11334OpenAlexW4214506306MaRDI QIDQ6114875FDOQ6114875

Authors: Kalpana Mahalingam, Palak Pandoh 

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Abstract: A two-dimensional ($2$D) word is a $2$D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are $1$D palindromes. We study some combinatorial and structural properties of HV-palindromes and its comparison with $2$D palindromes. We investigate the maximum number number of distinct non-empty HV-palindromic sub-arrays in any finite $2$D word, thus, proving the conjecture given by Anisiua et al. We also find the least number of HV-palindromes in an infinite $2$D word over a finite alphabet size $q$.

Full work available at URL: https://arxiv.org/abs/1904.11334

Recommendations

• Two-dimensional palindromes and their properties
• Enumeration of two dimensional palindromes
• On the least number of palindromes in two-dimensional words
• scientific article; zbMATH DE number 5501412
• On the maximum number of distinct palindromic sub-arrays

zbMATH Keywords

combinatorics on wordstwo-dimensional wordsproperties of palindromes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Palindromic richness
• Palindrome complexity.
• Title not available (Why is that?)
• Palindromes and two-dimensional Sturmian sequences
• Periodicity in rectangular arrays
• Two-Dimensional Periodicity in Rectangular Arrays
• Total palindrome complexity of finite words
• On the least number of palindromes in two-dimensional words
• On the least number of palindromes contained in an infinite word
• Pseudopalindrome closure operators in free monoids
• Watson-Crick Conjugate and Commutative Words
• Watson-Crick palindromes in DNA computing
• The derivation of on-line algorithms, with an application to finding palindromes
• Title not available (Why is that?)
• Two-dimensional palindromes and their properties
• Finding maximal 2-dimensional palindromes
• Theta palindromes in theta conjugates
• On the maximum number of distinct palindromic sub-arrays
• Periods and borders of random words
• Coverability and multi-scale coverability on infinite pictures

Cited In (2)

• From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
• 2-dimensional palindromes with \(k\) mismatches

This page was built for publication: HV-Palindromes in Two-Dimensional Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114875)