a >> from sympy.combinatorics.permutations import Permutation >>> from sympy.combinatorics.testutil import _cmp_perm_lists >>> a = Permutation([0, 2, 3, 4, 1]) >>> b = Permutation([1, 2, 0, 4, 3]) >>> c = Permutation([3, 4, 0, 1, 2]) >>> ls1 = [a, b, c] >>> ls2 = [b, c, a] >>> _cmp_perm_lists(ls1, ls2) True cSsh|] }t|qStuple.0arrl/Users/vegardjervell/Documents/master/model/venv/lib/python3.9/site-packages/sympy/combinatorics/testutil.py z"_cmp_perm_lists..cSsh|] }t|qSrrrrrr r !r r)firstsecondrrr _cmp_perm_listss  rFcsddlm}ddlmt|drt|jdd}dd|jDfd d }g}|s||D]}||r\|t |q\n|D]}||r||q|St|d rt ||||St|d rt |||g|SdS) NrPermutationGroup)_af_commutes_with generatorsTafcSsg|] }|jqSr)Z _array_formr xrrr Br z+_naive_list_centralizer..cstfddDS)Nc3s|]}|VqdS)Nr)r gen)rrrr Cr z<_naive_list_centralizer....)allrrgensrr Cr z)_naive_list_centralizer..getitem array_form) sympy.combinatorics.perm_groupsr sympy.combinatorics.permutationsrhasattrlistgenerate_diminorappendrZ_af_new_naive_list_centralizer)selfotherrrelementsZcommutes_with_gensZcentralizer_listelementrrr r)$s&      r)cCspddlm}t||}|}tt|D]4}|||}||krLdS|||}q&|dkrldSdS)a Verify the correctness of a base and strong generating set. Explanation =========== This is a naive implementation using the definition of a base and a strong generating set relative to it. There are other procedures for verifying a base and strong generating set, but this one will serve for more robust testing. Examples ======== >>> from sympy.combinatorics.named_groups import AlternatingGroup >>> from sympy.combinatorics.testutil import _verify_bsgs >>> A = AlternatingGroup(4) >>> A.schreier_sims() >>> _verify_bsgs(A, A.base, A.strong_gens) True See Also ======== sympy.combinatorics.perm_groups.PermutationGroup.schreier_sims rrFT)r#rrrangelenorderZ stabilizer)groupbaserrZstrong_gens_distrZcurrent_stabilizeri candidaterrr _verify_bsgsTs    r6NcCs:|dur||}t|jdd}t||dd}t||S)a3 Verify the centralizer of a group/set/element inside another group. This is used for testing ``.centralizer()`` from ``sympy.combinatorics.perm_groups`` Examples ======== >>> from sympy.combinatorics.named_groups import (SymmetricGroup, ... AlternatingGroup) >>> from sympy.combinatorics.perm_groups import PermutationGroup >>> from sympy.combinatorics.permutations import Permutation >>> from sympy.combinatorics.testutil import _verify_centralizer >>> S = SymmetricGroup(5) >>> A = AlternatingGroup(5) >>> centr = PermutationGroup([Permutation([0, 1, 2, 3, 4])]) >>> _verify_centralizer(S, A, centr) True See Also ======== _naive_list_centralizer, sympy.combinatorics.perm_groups.PermutationGroup.centralizer, _cmp_perm_lists NTr)Z centralizerr&r'r)r)r2argZcentrZ centr_listZcentr_list_naiverrr _verify_centralizer}s  r8c Csddlm}|dur||}t}t|dr6|j}n t|drF|}nt|drV|g}|D]}|D]}|||Aqfq^|t|}| |S)Nrrr __getitem__r") r#rZnormal_closuresetr%rr'addr&Z is_subgroup) r2r7closurerZ conjugatesZ subgr_genselrZ naive_closurerrr _verify_normal_closures       r>cGsddlm}ddlm}m}ddlm}g}tt|D],} || \} } } } | | | gg| | fq8||\}}}||||d}t |t rd}|g}|g}nt|}g}t|D]"} | ||| || |dq||}|dd|D}t |jd d }|j}t}|jd d D]4}|||}|D]}t|||}||q,qt |}|d |}|D]<}|d d |d d kr|d|dkrdS|}qlt |dS)au Canonicalize tensor formed by tensors of the different types. Explanation =========== sym_i symmetry under exchange of two component tensors of type `i` None no symmetry 0 commuting 1 anticommuting Parameters ========== g : Permutation representing the tensor. dummies : List of dummy indices. msym : Symmetry of the metric. v : A list of (base_i, gens_i, n_i, sym_i) for tensors of type `i`. base_i, gens_i BSGS for tensors of this type n_i number ot tensors of type `i` Returns ======= Returns 0 if the tensor is zero, else returns the array form of the permutation representing the canonical form of the tensor. Examples ======== >>> from sympy.combinatorics.testutil import canonicalize_naive >>> from sympy.combinatorics.tensor_can import get_symmetric_group_sgs >>> from sympy.combinatorics import Permutation >>> g = Permutation([1, 3, 2, 0, 4, 5]) >>> base2, gens2 = get_symmetric_group_sgs(2) >>> canonicalize_naive(g, [2, 3], 0, (base2, gens2, 2, 0)) [0, 2, 1, 3, 4, 5] rr) gens_products dummy_sgs)_af_rmulr.cSsg|] }t|qSrrrrrr rr z&canonicalize_naive..TrrN)r#rsympy.combinatorics.tensor_canr?r@r$rAr/r0r( isinstanceintextendr&generater"r:rr;sort)gdummiessymvrr?r@rAv1r4Zbase_iZgens_iZn_iZsym_isizeZsbaseZsgensZdgensZ num_typesSDZdliststshdqr prevrrr canonicalize_naivesH'      rZcCsddlm}ddlm}m}t|}|jdddddd |D}||}d}|D]\}}|t|7}qXd d |D} d} |D]R\}}|D]D} |||| kr| || | | ||  | d | d 7} qqg} | D]}| |qt| |ksJ| ||d g7} |d } t | tt | ks4Jt | } dgt| dd }| D]}|t|d 7<qVg}t t|D]2} || }|r|| \}}| |||dfq|tt |}|| |dg|R}|S) a Return a certificate for the graph Parameters ========== gr : adjacency list Explanation =========== The graph is assumed to be unoriented and without external lines. Associate to each vertex of the graph a symmetric tensor with number of indices equal to the degree of the vertex; indices are contracted when they correspond to the same line of the graph. The canonical form of the tensor gives a certificate for the graph. This is not an efficient algorithm to get the certificate of a graph. Examples ======== >>> from sympy.combinatorics.testutil import graph_certificate >>> gr1 = {0:[1, 2, 3, 5], 1:[0, 2, 4], 2:[0, 1, 3, 4], 3:[0, 2, 4], 4:[1, 2, 3, 5], 5:[0, 4]} >>> gr2 = {0:[1, 5], 1:[0, 2, 3, 4], 2:[1, 3, 5], 3:[1, 2, 4, 5], 4:[1, 3, 5], 5:[0, 2, 3, 4]} >>> c1 = graph_certificate(gr1) >>> c2 = graph_certificate(gr2) >>> c1 [0, 2, 4, 6, 1, 8, 10, 12, 3, 14, 16, 18, 5, 9, 15, 7, 11, 17, 13, 19, 20, 21] >>> c1 == c2 True r) _af_invert)get_symmetric_group_sgs canonicalizecSs t|dS)Nr.)r0rrrr r >r z#graph_certificate..T)keyreversecSsg|] }|dqSrCrrrrr r?r z%graph_certificate..cSsg|]}gqSrr)r r4rrr rJr r.rB)r$r[rFr\r]r&itemsrKr0r(rIsortedr/rr_)Zgrr[r\r]r`ZpvertZ num_indicesrOZneighZverticesr4v2rLrQZvlennr3rrMZcanrrr graph_certificatesL#        rd)F)N)N) Zsympy.combinatoricsrZsympy.combinatorics.utilrZrmulrr)r6r8r>rZrdrrrr s   0) $ )N