Eulerian number

Number of permutations of the numbers from 1 to n in which m elements are greater than the previous element

In combinatorics, the Eulerian number A ( n , k ) {\textstyle A(n,k)} is the number of permutations of the numbers 1 to n {\textstyle n} in which exactly k {\textstyle k} elements are greater than the previous element (permutations with k {\textstyle k} "ascents"). Leonhard Euler investigated them and associated polynomials in his 1755 book Institutiones calculi differentialis.

Nº Q1373849 ★

Común · Saberes

Eulerian number

Number of permutations of the numbers from 1 to n in which m elements are greater than the previous element

Texto en inglés

In combinatorics, the Eulerian number A ( n , k ) {\textstyle A(n,k)} is the number of permutations of the numbers 1 to n {\textstyle n} in which exactly k {\textstyle k} elements are greater than the previous element (permutations with k {\textstyle k} "ascents"). Leonhard Euler investigated them and associated polynomials in his 1755 book Institutiones calculi differentialis.

En Wikipedia

Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.

In combinatorics, the Eulerian number A ( n , k ) {\textstyle A(n,k)} is the number of permutations of the numbers 1 to n {\textstyle n} in which exactly k {\textstyle k} elements are greater than the previous element (permutations with k {\textstyle k} "ascents"). Leonhard Euler investigated them and associated polynomials in his 1755 book Institutiones calculi differentialis. Other notations for A ( n , k ) {\textstyle A(n,k)} are E ( n , k ) {\textstyle E(n,k)} and ⟨ n k ⟩ {\displaystyle \textstyle \left\langle {n \atop k}\right\rangle } .

Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Wirkstoff (CC BY-SA 3.0) ·

Cartas cercanas

Abrir

…

Confirmación