← Back to catalogue
Research draft

permutation

vr.tr.permutation · XCT.QLT

Let an agent explain permutations and count them, describe their structure and special kinds, apply them in probability and computing, and distinguish them from combinations.

Thing Registry Cross-cutting context

Research draft, second pass

A second pass drafted this model: the structure a model of this thing needs, and what is known about it in the world. The line under this one says how the second half was obtained - researched against sources, or recalled without web access, in which case nothing here was read anywhere and every claim is a lead to verify. Unreviewed either way.

written by Claude from model knowledge without web access - no source was read, every claim is a lead to verify

Researched by: Claude

Purpose and description

Let an agent explain permutations and count them, describe their structure and special kinds, apply them in probability and computing, and distinguish them from combinations.

An arrangement of the elements of a set in a particular order, or equivalently a bijection from a set to itself, with the number of permutations of n distinct items equal to n factorial, and with special kinds such as transpositions, involutions, derangements, cyclic permutations and riffle shuffle permutations; permutations are fundamental in combinatorics, group theory, probability, cryptography and computing.

What it is for: Orderings and rearrangements.

It can be explain and count permutations; describe structure and special kinds; apply in probability and computing; distinguish from combinations.

Distinguishing features

Order matters

Bijection

Group structure

Counting principle

What it looks like

Not physical; orderings and mappings.

How it is recognised

Ordered arrangement or bijection

n factorial of n items

A combination ignores order

Related models

is a kind of - category

bijection

is related to - sums over permutations

sum

is related to - permutation groups

homomorphism

is related to - ordered structures

ordered pair

In practice

Families and kinds

permutations of a finite set

transpositions and cycles

involutions and derangements

pattern-avoiding permutations

permutations in shuffling and computing

Standards and regulation

Mathematical notation conventions

Failure modes and hazards

Confusing permutations with combinations

Overflow in factorial computation

Biased shuffling algorithms

Also called

transpositionpermutation involutionpattern avoidanceshader permutationderangementriffle shuffle permutationstack-sortable permutationcyclic permutationpermutation of multisetrandom permutationBaxter permutationeven permutationodd permutationcircular permutation in proteins

Where this came from

wikidata · CC0 1.0

Drafted structure

Bundle to layer to finding to question, as the second pass will find it: 4 bundles · 8 layers · 8 findings · 16 questions.

Define What permutations are.

Concepts.

Definition

Definition and counting.

Definition

Definition.

  1. What is a permutation, how many permutations of n items exist, and how does this differ from combinations? definition
  2. How are permutations written in one-line and cycle notation? definition

Count

Counting problems.

Count

Counting.

  1. How many permutations satisfy this constraint, such as derangements or arrangements with repeats? action
  2. How are partial permutations counted? definition
Structure Structure of permutations.

Algebra.

Cycles

Cycles and transpositions.

Cycles

Cycles.

  1. How are permutations decomposed into cycles and transpositions, and what are parity and sign? definition
  2. What are involutions? definition

Groups

Permutation groups.

Groups

Groups.

  1. What is the symmetric group, and how do permutation groups arise in algebra? definition
  2. What is pattern avoidance in permutations? definition
Apply Applications.

Practice.

Probability

Probability and shuffling.

Probability

Probability.

  1. How are permutations used in probability, and how many riffle shuffles randomise a deck, according to research? provenance
  2. What is a derangement probability? definition

Computing

Algorithms.

Computing

Computing.

  1. How are permutations generated and shuffled correctly in code, and where do they appear in cryptography and graphics? action
  2. Which entry fits sorting or shader permutations? action
Learn Teaching and history.

Education.

Teach

Teaching permutations.

Teach

Teaching.

  1. How can permutations be taught with hands-on counting? action
  2. Which misconceptions arise? provenance

History

History.

History

History.

  1. How did the study of permutations develop, from early combinatorics to group theory? provenance
  2. Which references are standard? provenance

What the second pass must settle

  • Should permutation groups be a separate entry?
  • How should combinatorics resources be linked?
  • How should algorithms be linked?