Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Motzkin number

From Wikipedia, the free encyclopedia
Number of unique ways to draw non-intersecting chords in a circle
Motzkin number
Named afterTheodore Motzkin
Publication year1948
Author of publicationTheodore Motzkin
No. of known termsinfinity
FormulaseeProperties
First terms1,1,2,4,9,21,51
OEIS index

Inmathematics, thenthMotzkin number is the number of different ways of drawing non-intersectingchords betweenn points on acircle (not necessarily touching every point by a chord). The Motzkin numbers are named afterTheodore Motzkin and have diverse applications ingeometry,combinatorics andnumber theory.

The Motzkin numbersMn{\displaystyle M_{n}} forn=0,1,{\displaystyle n=0,1,\dots } form the sequence:

1,1,2,4,9,21,51,127, 323, 835, ... (sequenceA001006 in theOEIS)

Examples

[edit]

The following figure shows the 9 ways to draw non-intersecting chords between 4 points on a circle (M4 = 9):

The following figure shows the 21 ways to draw non-intersecting chords between 5 points on a circle (M5 = 21):

Properties

[edit]

The Motzkin numbers satisfy therecurrence relations

Mn=Mn1+i=0n2MiMn2i=2n+1n+2Mn1+3n3n+2Mn2.{\displaystyle M_{n}=M_{n-1}+\sum _{i=0}^{n-2}M_{i}M_{n-2-i}={\frac {2n+1}{n+2}}M_{n-1}+{\frac {3n-3}{n+2}}M_{n-2}.}

The Motzkin numbers can be expressed in terms ofbinomial coefficients andCatalan numbers:

Mn=k=0n/2(n2k)Ck,{\displaystyle M_{n}=\sum _{k=0}^{\lfloor n/2\rfloor }{\binom {n}{2k}}C_{k},}

and inversely,[1]

Cn+1=k=0n(nk)Mk{\displaystyle C_{n+1}=\sum _{k=0}^{n}{\binom {n}{k}}M_{k}}

This gives

k=0nCk=1+k=1n(nk)Mk1.{\displaystyle \sum _{k=0}^{n}C_{k}=1+\sum _{k=1}^{n}{\binom {n}{k}}M_{k-1}.}

Thegenerating functionm(x)=n=0Mnxn{\displaystyle m(x)=\sum _{n=0}^{\infty }M_{n}x^{n}} of the Motzkin numbers satisfies

x2m(x)2+(x1)m(x)+1=0{\displaystyle x^{2}m(x)^{2}+(x-1)m(x)+1=0}

and is explicitly expressed as

m(x)=1x12x3x22x2.{\displaystyle m(x)={\frac {1-x-{\sqrt {1-2x-3x^{2}}}}{2x^{2}}}.}

An integral representation of Motzkin numbers is given by

Mn=2π0πsin(x)2(2cos(x)+1)ndx{\displaystyle M_{n}={\frac {2}{\pi }}\int _{0}^{\pi }\sin(x)^{2}(2\cos(x)+1)^{n}dx}.

They have the asymptotic behaviour

Mn12π(3n)3/23n, n{\displaystyle M_{n}\sim {\frac {1}{2{\sqrt {\pi }}}}\left({\frac {3}{n}}\right)^{3/2}3^{n},~n\to \infty }.

AMotzkin prime is a Motzkin number that isprime. Four such primes are known:

2, 127, 15511, 953467954114363 (sequenceA092832 in theOEIS)

Combinatorial interpretations

[edit]

The Motzkin number forn is also the number of positive integer sequences of lengthn − 1 in which the opening and ending elements are either 1 or 2, and the difference between any two consecutive elements is −1, 0 or 1. Equivalently, the Motzkin number forn is the number of positive integer sequences of lengthn + 1 in which the opening and ending elements are 1, and the difference between any two consecutive elements is −1, 0 or 1.

Also, the Motzkin number forn gives the number of routes on the upper right quadrant of a grid from coordinate (0, 0) to coordinate (n, 0) inn steps if one is allowed to move only to the right (up, down or straight) at each step but forbidden from dipping below they = 0 axis.

For example, the following figure shows the 9 valid Motzkin paths from (0, 0) to (4, 0):

There are at least fourteen different manifestations of Motzkin numbers in different branches of mathematics, as enumerated byDonaghey & Shapiro (1977) in their survey of Motzkin numbers.Guibert, Pergola & Pinzani (2001) showed thatvexillary involutions are enumerated by Motzkin numbers.

See also

[edit]

References

[edit]
  1. ^Yi Wang and Zhi-Hai Zhang (2015)."Combinatorics of Generalized Motzkin Numbers"(PDF).Journal of Integer Sequences (18).

External links

[edit]
Classes ofnatural numbers
Powers and related numbers
Of the forma × 2b ± 1
Other polynomial numbers
Recursively defined numbers
Possessing a specific set of other numbers
Expressible via specific sums
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Combinatorial numbers
Divisor functions
Prime omega functions
Euler's totient function
Aliquot sequences
Primorial
Otherprime factor ordivisor related numbers
Numeral system-dependent numbers
Arithmetic functions
anddynamics
Digit sum
Digit product
Coding-related
Other
P-adic numbers-related
Digit-composition related
Digit-permutation related
Divisor-related
Other
Generated via asieve
Sorting related
Graphemics related
Retrieved from "https://en.wikipedia.org/w/index.php?title=Motzkin_number&oldid=1321323601"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp