On the diameter of a super-order-commuting graph
Abstract
We answer a question about the diameter of an order-super-commuting graph on a symmetric group by studying the number-theoretical concept of d-complete sequences of primes in arithmetic progression.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.