Extreme Palindromes

Ji and Wilf illustrate that a word is recursively palindromic if it is empty, or it is a palindrome and its left half and its right half are recursively palindromic. Moreover, the method of recursive palindromes suggests a different, and nice, bijective proof, which uses the fact that the Catalan nu...

Full description

Saved in:
Bibliographic Details
Published in:The American mathematical monthly 2008-05, Vol.115 (5), p.447-451
Main Authors: Ji, Kathy Q., Wilf, Herbert S.
Format: Article
Language:English
Subjects:
Alphabetic letters
Alphabets
Catalan numbers
Combinatorics
Discrete mathematics
Integers
Mathematical congruence
Mathematical lattices
Mathematical problems
Palindromes
Theorems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Ji and Wilf illustrate that a word is recursively palindromic if it is empty, or it is a palindrome and its left half and its right half are recursively palindromic. Moreover, the method of recursive palindromes suggests a different, and nice, bijective proof, which uses the fact that the Catalan number is the number of binary trees of n nodes.
ISSN:0002-9890
1930-0972
DOI:10.1080/00029890.2008.11920548