simple_graph_leap_group
def
The leap group Λ₁(G) of a graph G: the subgroup of the symmetric group on the vertices generated by the hops of G.
Statement
def simple_graph_leap_group {V : Type*} (G : SimpleGraph V) : Subgroup (Equiv.Perm V)
- Defined in
- arXiv:2610.18463 (The group generated by a graph's derangements), Definition 2.1 (the leap group Λ₁(G)).
- Verified
- 15 Oct 2026
- Axioms
- none listed
- Built on 1
- simple_graph_is_hopA hop (graph derangement) of a graph G is a permutation h of the vertices that sends every vertex v to a neighbour h(v) of v.
- Used by 18
- kayak_paddle_three_three_one_leap_group_eq_topThe kayak paddle graph KP(3, 3, 1) (two triangles joined by an edge, 6 vertices) has full leap group S_6.
- op_300_prism_three_leap_group_eq_topFor n = 3, the triangular prism graph P₁ □ C₃ on 6 vertices has full leap group S₆.
- simple_graph_completeGraph_three_leap_closed_not_intersection_closedThe collection of leap-closed edge subsets of the complete graph K₃ on 3 vertices is not closed under intersection.
- kayak_paddle_leap_group_ne_of_even_cycleIf one of the two cycles of the kayak paddle graph KP(k, m, l) has even length, its leap group is neither the symmetric nor the…
- op_543_completeGraph_three_hop_word_length_le_oneFor the complete graph K₃ on 3 vertices, every element of its leap group is the product of at most 1 hop.
- simple_graph_leap_group_bipartite_ne_topLet G be a bipartite simple graph on a finite vertex set with at least 4 vertices. Then its leap group Λ₁(G) is not the full symmetric…
- op_300_hypercube_two_leap_group_cardThe 2-dimensional hypercube graph Q₂ (the 4-cycle C₄) has leap group of cardinality 8.
- op_543_completeGraph_two_hop_word_length_le_oneFor the complete graph K₂ on 2 vertices, every element of its leap group is the product of at most 1 hop.
- simple_graph_edgeSet_is_leap_closedFor any simple graph G, its full edge set E(G) is leap-closed.
- simple_graph_is_hop_mem_leap_groupEvery hop lies in the leap group.
- kayak_paddle_leap_group_ne_of_even_secondIf the second cycle of KP(k, m, l) has even length m, its leap group is neither the symmetric nor the alternating group.
- simple_graph_leap_group_normalized_cosetsEvery leap lies in the normalized subgroup or in its left coset by the baseline hop. Together with containment, this gives index at most…
- simple_graph_leap_word_bound_of_normalizedA signed normalized-word diameter bound D implies an actual hop-word diameter bound 2D+1. The normalized diameter bound remains an…
- simple_graph_normalized_hop_group_leFor a fixed baseline hop, its normalized subgroup is contained in the original leap group.
- simple_graph_is_leap_closedAn edge subset F of a simple graph G is leap-closed (leap-maximal) if F is a subset of the edge set of G and for every edge e in E(G) \ F,…
- op_300_hypercube_one_leap_group_cardThe hypercube graph Q₁ (the path K₂) has leap group of cardinality 2.
- kayak_paddle_leap_group_ne_of_even_firstIf the first cycle of KP(k, m, l) has even length k, its leap group is neither the symmetric nor the alternating group.
- kayak_paddle_leap_group_not_eq_top_or_alternatingNo: KP(3, 4, 1) (a triangle and a 4-cycle joined by an edge, 7 vertices) admits a hop, but its leap group is neither S_7 nor A_7. Every…
Lean source view module on GitHub
/-- The leap group `Λ₁(G)`: the subgroup of `Equiv.Perm V` generated by the hops of `G`. -/ def simple_graph_leap_group {V : Type*} (G : SimpleGraph V) : Subgroup (Equiv.Perm V) := Subgroup.closure {h | simple_graph_is_hop G h}