{
  "aliases": [
    "p-q-shuffle",
    "shuffle-permutation"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematics of [[permutations|05RWFKVTJ7]] and the study of shuffling playing cards, a **riffle shuffle permutation** is a permutation of a set of $n$ ordered items that can be obtained by a single riffle shuffle, in which a sorted deck of $n$ cards (increasing top-to-bottom) is cut into two packets and then the two packets are interleaved (e.g. by moving cards one at a time from the bottom of one or the other of the packets to the top of the sorted deck). As a special case of this, a **$(p,q)$-shuffle**, for numbers $p$ and $q$ with $p+q=n$, is a riffle in which the first packet has $p$ cards and the second packet has $q$ cards.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "p-q-shuffle",
      "shuffle-permutation"
    ],
    "inventory": [
      "8ST18KFD1H"
    ],
    "kind": "concept",
    "name": "Riffle shuffle permutation",
    "same_as": {
      "wikidata": "Q13846433",
      "wikipedia": "Riffle shuffle permutation"
    },
    "sources": [
      {
        "locator": "Riffle shuffle permutation",
        "mention": "wikipedia://en/39949298",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:39949298@r1373717204"
      }
    ],
    "tag": "NDTRC3H9BY"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/NDTRC3H9BY/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/NDTRC3H9BY.md",
  "msc": null,
  "name": "Riffle shuffle permutation",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/NDT/NDTRC3H9BY.md",
  "status": null,
  "tag": "NDTRC3H9BY",
  "uri": "m2://NDTRC3H9BY",
  "url": "https://math2.tamnd.com/wiki/riffle-shuffle-permutation/",
  "writing": {
    "tag": "NDTRC3H9BY",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}