We investigate the least number of distinct palindromic sub-arrays in two-dimensional words over a finite alphabet Σ={a1,a2⋯,aq} for a given alphabet size q. We discuss the case for both periodic as well as aperiodic words. © 2019

Kalpana Mahalingam

Department of Mathematics

Palak Pandoh

Kamala Krithivasan

Computational methods

Computer science

ALPHABET SIZE

COMBINATORICS ON WORDS

FINITE ALPHABET

NUMBER OF PALINDROMES

PALINDROMIC

Sub-arrays

Linguistics

IIT Madras is a public technical and research university located in Chennai, Tamil Nadu. Founded in 1959, it is recognised as an Institute of National Importance.

IIT Madras has been ranked as the top engineering institute in India for four years in a row by the National Institutional Ranking Framework of the MHRD

It currently offers undergraduate, postgraduate and research degrees across 16 disciplines in Engineering, Sciences, Humanities and Management. About 596 faculty belonging to science and engineering departments and centres of the Institute are engaged in teaching, research and industrial consultancy.

IIT Madras

Theoretical Computer Science

We investigate the maximum number of distinct palindromic sub-arrays in a two-dimensional finite word over a finite alphabet (Formula Presented). For any finite array in (Formula Presented), we find an upper bound for the number of distinct palindromic sub-arrays and improve it by giving a tight bound on the maximum number of distinct palindromes in an array in (Formula Presented) for (Formula Presented). We then, propose a better upper bound for any finite array in(Formula Presented). © 2019, Springer Nature Switzerland AG.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

On the Maximum Number of Distinct Palindromic Sub-arrays

Information and Computation

Finding maximal 2-dimensional palindromes

Information Processing Letters

Periodicity in rectangular arrays

On the least number of palindromes contained in an infinite word

Lecture Notes in Computer Science Scale Space and Variational Methods in Computer Vision

Shape Palindromes: Analysis of Intrinsic Symmetries in 2D Articulated Shapes

On the least number of palindromes in two-dimensional words

Journal	Data powered by TypesetTheoretical Computer Science
Publisher	Data powered by TypesetElsevier B.V.
ISSN	03043975
Open Access	No