Definitionadvanced
Ulam distance
Also called Ulam metric.
Minimum number of delete-and-insert moves turning one permutation into another; equals n minus their longest common subsequence.
Minimum number of delete-and-insert moves turning one permutation into another; equals n minus their longest common subsequence.
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 A7K8JC Edit this page History Report an error