Metraipolis › archive › dc_d430afcb425b
Alternating permutation — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Alternating_permutation
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-08T17:55:17.525Z
- SHA-256 of the archived text
e20fff9b58487f55f65dc8d72d9c842bc0275abd8fb9c5a84b579d57772a8513- Stable URL of this page
https://metraipolis.com/documento/dc_d430afcb425b
How to cite
Alternating permutation — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Alternating_permutation (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d430afcb425b (Metraipolis archive dc_d430afcb425b, sha256 e20fff9b58487f55f65dc8d72d9c842bc0275abd8fb9c5a84b579d57772a8513)
BibTeX
@misc{dcd430afcb425b,
title = {Alternating permutation — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Alternating_permutation},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d430afcb425b; sha256 e20fff9b58487f55f65dc8d72d9c842bc0275abd8fb9c5a84b579d57772a8513},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Alternating_permutation. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In combinatorial mathematics, an alternating permutation (or zigzag permutation) of the set {1, 2, 3, ..., n} is a permutation (arrangement) of those numbers so that each entry is alternately greater or less than the preceding entry. For example, the five alternating permutations of {1, 2, 3, 4} are: 1, 3, 2, 4 because 1 < 3 > 2 < 4, 1, 4, 2, 3 because 1 < 4 > 2 < 3, 2, 3, 1, 4 because 2 < 3 > 1 < 4, 2, 4, 1, 3 because 2 < 4 > 1 < 3, and 3, 4, 1, 2 because 3 < 4 > 1 < 2. This type of permutation was first studied by Désiré André in the 19th century. Different authors use the term alternating permutation slightly differently: some require that the second entry in an alternating permutation should be larger than the first (as in the examples above), others require that the alternation should be reversed (so that the second entry is smaller than the first, then the third larger than the second, and so on), while others call both types by the name alternating permutation. The determination of the number An of alternating permutations of the set {1, ..., n} is called André's problem. The numbers An are known as Euler numbers, zigzag numbers, or up/down numbers. When n is even the number An is known as a secant number, while if n is odd it is known as a tangent number. These latter names come from the study of the generating function for the sequence.
Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Alternating permutation» — https://en.wikipedia.org/wiki/Alternating_permutation
Wikidata Q3900011: «type of permutation studied in combinatorics» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3900011
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Alternating_permutation?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1382006398, consultata il 2026-11-08T17:51:20.684Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 68489d11cae346806c8340335767272682ea1a4bef1d808da671c6fd507926cd