Definitionintro
Minimal change ordering
Also called Gray-type ordering of permutations, Minimal-change ordering, adjacent-difference ordering, adjacent-transposition ordering, minimal change property.
An ordering of combinatorial objects in which consecutive objects differ by a single small change.
An ordering of combinatorial objects in which consecutive objects differ by a single small change.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag DD8NX7 Edit this page History Report an error