Parity palindrome compositions

George E. Andrews, Greg Simay

Research output: Contribution to journalArticlepeer-review

Abstract

A parity palindrome is a finite sequence of positive integers which when reduced modulo 2 reads the same from back to front as front to back. Compositions that are parity palindromes have ‘a surprisingly’ nice enumerating function. It will be proved that the number of such compositions of 2n + 1 and also of 2n is 2 · 3n−1. Further refinements and implications are also explored.

Original languageEnglish (US)
Article numberA85
JournalIntegers
Volume21
StatePublished - 2021

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Parity palindrome compositions'. Together they form a unique fingerprint.

Cite this