Steinhaus–Johnson–Trotter algorithm

Summary

Steinhaus–Johnson–Trotter algorithm is a combinatorial algorithm^[1]. It draws 55 Wikipedia views per month (combinatorial_algorithm category, ranking #3 of 8).^[2]

Key Facts

• Steinhaus–Johnson–Trotter algorithm's image is recorded as Symmetric group 4; Cayley graph 1,2,6 (3D); Steinhaus–Johnson–Trotter.svg^[3].
• Steinhaus–Johnson–Trotter algorithm's instance of is recorded as combinatorial algorithm^[4].
• Steinhaus–Johnson–Trotter algorithm's instance of is recorded as mathematical concept^[5].
• Hale F. Trotter is named after Steinhaus–Johnson–Trotter algorithm^[6].
• Hugo Steinhaus is named after Steinhaus–Johnson–Trotter algorithm^[7].
• Selmer M. Johnson is named after Steinhaus–Johnson–Trotter algorithm^[8].
• Steinhaus–Johnson–Trotter algorithm's Freebase ID is recorded as /m/07nm5d^[9].
• Steinhaus–Johnson–Trotter algorithm's Dictionary of Algorithms and Data Structures ID is recorded as johnsonTrotter^[10].
• Steinhaus–Johnson–Trotter algorithm's Microsoft Academic ID is recorded as 176569495^[11].

Body

Designation and Status

Recorded instance of include combinatorial algorithm^[4] and mathematical concept^[5].

History and Context

Things named after include Hale F. Trotter^[6], a mathematician^[12], 1931–2022^[13], of Canada^[14], specialised in mathematics^[15]; Hugo Steinhaus^[7], a mathematician^[16], 1887–1972^[17], of Cisleithania^[18], awarded the Commander with Star of the Order of Polonia Restituta^[19], specialised in probability theory^[20]; and Selmer M. Johnson^[8], a mathematician^[21], 1916–1996^[22], of United States^[23].

Why It Matters

Steinhaus–Johnson–Trotter algorithm draws 55 Wikipedia views per month (combinatorial_algorithm category, ranking #3 of 8).^[2] It has Wikipedia articles in 7 language editions, a strong signal of global cultural recognition.^[24]