Enumeration of words by the sum of differences between adjacent letters

Toufik Mansour

Enumeration of words by the sum of differences between adjacent letters

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We consider the sum u of differences between adjacent letters of a word of n letters, chosen uniformly at random from a given alphabet. This paper obtains the enumerating generating function for the number of such words with respect to the sum u, as well as explicit formulas for the mean and variance of u.

Original language	English
Pages (from-to)	173-186
Number of pages	14
Journal	Discrete Mathematics and Theoretical Computer Science
Volume	11
Issue number	1
State	Published - 2009

Keywords

Chebyshev polynomials
Generating functions
K-ary words
Kernel method
Statistics

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
Discrete Mathematics and Combinatorics

Cite this

@article{254d9183fc754ee88e2d14a885d32aba,

title = "Enumeration of words by the sum of differences between adjacent letters",

abstract = "We consider the sum u of differences between adjacent letters of a word of n letters, chosen uniformly at random from a given alphabet. This paper obtains the enumerating generating function for the number of such words with respect to the sum u, as well as explicit formulas for the mean and variance of u.",

keywords = "Chebyshev polynomials, Generating functions, K-ary words, Kernel method, Statistics",

author = "Toufik Mansour",

year = "2009",

language = "English",

volume = "11",

pages = "173--186",

journal = "Discrete Mathematics and Theoretical Computer Science",

issn = "1462-7264",

publisher = "Maison de l'informatique et des mathematiques discretes",

number = "1",

}

TY - JOUR

T1 - Enumeration of words by the sum of differences between adjacent letters

AU - Mansour, Toufik

PY - 2009

Y1 - 2009

N2 - We consider the sum u of differences between adjacent letters of a word of n letters, chosen uniformly at random from a given alphabet. This paper obtains the enumerating generating function for the number of such words with respect to the sum u, as well as explicit formulas for the mean and variance of u.

AB - We consider the sum u of differences between adjacent letters of a word of n letters, chosen uniformly at random from a given alphabet. This paper obtains the enumerating generating function for the number of such words with respect to the sum u, as well as explicit formulas for the mean and variance of u.

KW - Chebyshev polynomials

KW - Generating functions

KW - K-ary words

KW - Kernel method

KW - Statistics

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

M3 - Article

AN - SCOPUS:67650951517

SN - 1462-7264

VL - 11

SP - 173

EP - 186

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

IS - 1

ER -

Enumeration of words by the sum of differences between adjacent letters

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this