About: dbpedia:Alternating_permutation   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Thing, within Data Space : platform.yourdatastories.eu:8890 associated with source document(s)

In combinatorial mathematics, an alternating permutation of the set {1, 2, 3, ..., n} is an arrangement of those numbers into an order c1, ..., cn such that no element ci is between ci − 1 and ci + 1 for any value of i and c1< c2. In other words, ci < ci+ 1 if i is odd and ci > ci+ 1 if i is even.

AttributesValues
rdfs:comment
  • In combinatorial mathematics, an alternating permutation of the set {1, 2, 3, ..., n} is an arrangement of those numbers into an order c1, ..., cn such that no element ci is between ci − 1 and ci + 1 for any value of i and c1< c2. In other words, ci < ci+ 1 if i is odd and ci > ci+ 1 if i is even.
differentFrom
Faceted Search & Find service v1.13.91 as of Nov 14 2017


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3212 as of Mar 29 2016, on Linux (x86_64-unknown-linux-gnu), Single-Server Edition (68 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software