A generalization of the digital binomial theorem

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We prove a generalization of the digital binomial theorem by constructing a one- parameter subgroup of generalized Sierpiński matrices. In addition, we derive new formulas for the coefficients of Prouhet-Thue-Morse polynomials and describe group relations satisfied by generating matrices defined in terms of these Sierpiński matrices.

Original languageEnglish (US)
JournalJournal of Integer Sequences
Volume18
Issue number5
StatePublished - Jan 1 2015

Fingerprint

Binomial theorem
Subgroup
Polynomial
Coefficient
Generalization

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Cite this

@article{a2e833b0903741f1b218b2a7bd77e62d,
title = "A generalization of the digital binomial theorem",
abstract = "We prove a generalization of the digital binomial theorem by constructing a one- parameter subgroup of generalized Sierpiński matrices. In addition, we derive new formulas for the coefficients of Prouhet-Thue-Morse polynomials and describe group relations satisfied by generating matrices defined in terms of these Sierpiński matrices.",
author = "Hieu Nguyen",
year = "2015",
month = "1",
day = "1",
language = "English (US)",
volume = "18",
journal = "Journal of Integer Sequences",
issn = "1530-7638",
publisher = "University of Waterloo",
number = "5",

}

A generalization of the digital binomial theorem. / Nguyen, Hieu.

In: Journal of Integer Sequences, Vol. 18, No. 5, 01.01.2015.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A generalization of the digital binomial theorem

AU - Nguyen, Hieu

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We prove a generalization of the digital binomial theorem by constructing a one- parameter subgroup of generalized Sierpiński matrices. In addition, we derive new formulas for the coefficients of Prouhet-Thue-Morse polynomials and describe group relations satisfied by generating matrices defined in terms of these Sierpiński matrices.

AB - We prove a generalization of the digital binomial theorem by constructing a one- parameter subgroup of generalized Sierpiński matrices. In addition, we derive new formulas for the coefficients of Prouhet-Thue-Morse polynomials and describe group relations satisfied by generating matrices defined in terms of these Sierpiński matrices.

UR - http://www.scopus.com/inward/record.url?scp=84934881020&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84934881020&partnerID=8YFLogxK

M3 - Article

VL - 18

JO - Journal of Integer Sequences

JF - Journal of Integer Sequences

SN - 1530-7638

IS - 5

ER -