passagemath-combinat 10.6.42__cp314-cp314-musllinux_1_2_x86_64.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- passagemath_combinat/__init__.py +3 -0
- passagemath_combinat-10.6.42.dist-info/METADATA +160 -0
- passagemath_combinat-10.6.42.dist-info/RECORD +400 -0
- passagemath_combinat-10.6.42.dist-info/WHEEL +5 -0
- passagemath_combinat-10.6.42.dist-info/top_level.txt +3 -0
- passagemath_combinat.libs/libgmp-0e7fc84e.so.10.5.0 +0 -0
- passagemath_combinat.libs/libsymmetrica-81fe8739.so.3.0.0 +0 -0
- sage/algebras/affine_nil_temperley_lieb.py +263 -0
- sage/algebras/all.py +24 -0
- sage/algebras/all__sagemath_combinat.py +35 -0
- sage/algebras/askey_wilson.py +935 -0
- sage/algebras/associated_graded.py +345 -0
- sage/algebras/cellular_basis.py +350 -0
- sage/algebras/cluster_algebra.py +2766 -0
- sage/algebras/down_up_algebra.py +860 -0
- sage/algebras/free_algebra.py +1698 -0
- sage/algebras/free_algebra_element.py +345 -0
- sage/algebras/free_algebra_quotient.py +405 -0
- sage/algebras/free_algebra_quotient_element.py +295 -0
- sage/algebras/free_zinbiel_algebra.py +885 -0
- sage/algebras/hall_algebra.py +783 -0
- sage/algebras/hecke_algebras/all.py +4 -0
- sage/algebras/hecke_algebras/ariki_koike_algebra.py +1796 -0
- sage/algebras/hecke_algebras/ariki_koike_specht_modules.py +475 -0
- sage/algebras/hecke_algebras/cubic_hecke_algebra.py +3520 -0
- sage/algebras/hecke_algebras/cubic_hecke_base_ring.py +1473 -0
- sage/algebras/hecke_algebras/cubic_hecke_matrix_rep.py +1079 -0
- sage/algebras/iwahori_hecke_algebra.py +3095 -0
- sage/algebras/jordan_algebra.py +1773 -0
- sage/algebras/lie_conformal_algebras/abelian_lie_conformal_algebra.py +113 -0
- sage/algebras/lie_conformal_algebras/affine_lie_conformal_algebra.py +156 -0
- sage/algebras/lie_conformal_algebras/all.py +18 -0
- sage/algebras/lie_conformal_algebras/bosonic_ghosts_lie_conformal_algebra.py +134 -0
- sage/algebras/lie_conformal_algebras/examples.py +43 -0
- sage/algebras/lie_conformal_algebras/fermionic_ghosts_lie_conformal_algebra.py +131 -0
- sage/algebras/lie_conformal_algebras/finitely_freely_generated_lca.py +139 -0
- sage/algebras/lie_conformal_algebras/free_bosons_lie_conformal_algebra.py +174 -0
- sage/algebras/lie_conformal_algebras/free_fermions_lie_conformal_algebra.py +167 -0
- sage/algebras/lie_conformal_algebras/freely_generated_lie_conformal_algebra.py +107 -0
- sage/algebras/lie_conformal_algebras/graded_lie_conformal_algebra.py +135 -0
- sage/algebras/lie_conformal_algebras/lie_conformal_algebra.py +353 -0
- sage/algebras/lie_conformal_algebras/lie_conformal_algebra_element.py +236 -0
- sage/algebras/lie_conformal_algebras/lie_conformal_algebra_with_basis.py +78 -0
- sage/algebras/lie_conformal_algebras/lie_conformal_algebra_with_structure_coefs.py +328 -0
- sage/algebras/lie_conformal_algebras/n2_lie_conformal_algebra.py +117 -0
- sage/algebras/lie_conformal_algebras/neveu_schwarz_lie_conformal_algebra.py +86 -0
- sage/algebras/lie_conformal_algebras/virasoro_lie_conformal_algebra.py +82 -0
- sage/algebras/lie_conformal_algebras/weyl_lie_conformal_algebra.py +205 -0
- sage/algebras/nil_coxeter_algebra.py +191 -0
- sage/algebras/q_commuting_polynomials.py +673 -0
- sage/algebras/q_system.py +608 -0
- sage/algebras/quantum_clifford.py +959 -0
- sage/algebras/quantum_groups/ace_quantum_onsager.py +693 -0
- sage/algebras/quantum_groups/all.py +9 -0
- sage/algebras/quantum_groups/fock_space.py +2219 -0
- sage/algebras/quantum_groups/q_numbers.py +207 -0
- sage/algebras/quantum_groups/quantum_group_gap.py +2695 -0
- sage/algebras/quantum_groups/representations.py +591 -0
- sage/algebras/quantum_matrix_coordinate_algebra.py +1006 -0
- sage/algebras/quantum_oscillator.py +623 -0
- sage/algebras/quaternion_algebra.py +20 -0
- sage/algebras/quaternion_algebra_element.py +55 -0
- sage/algebras/rational_cherednik_algebra.py +525 -0
- sage/algebras/schur_algebra.py +670 -0
- sage/algebras/shuffle_algebra.py +1011 -0
- sage/algebras/splitting_algebra.py +779 -0
- sage/algebras/tensor_algebra.py +709 -0
- sage/algebras/yangian.py +1082 -0
- sage/algebras/yokonuma_hecke_algebra.py +1018 -0
- sage/all__sagemath_combinat.py +35 -0
- sage/combinat/SJT.py +255 -0
- sage/combinat/affine_permutation.py +2405 -0
- sage/combinat/algebraic_combinatorics.py +55 -0
- sage/combinat/all.py +53 -0
- sage/combinat/all__sagemath_combinat.py +195 -0
- sage/combinat/alternating_sign_matrix.py +2063 -0
- sage/combinat/baxter_permutations.py +346 -0
- sage/combinat/bijectionist.py +3220 -0
- sage/combinat/binary_recurrence_sequences.py +1180 -0
- sage/combinat/blob_algebra.py +685 -0
- sage/combinat/catalog_partitions.py +27 -0
- sage/combinat/chas/all.py +23 -0
- sage/combinat/chas/fsym.py +1180 -0
- sage/combinat/chas/wqsym.py +2601 -0
- sage/combinat/cluster_complex.py +326 -0
- sage/combinat/colored_permutations.py +2039 -0
- sage/combinat/colored_permutations_representations.py +964 -0
- sage/combinat/composition_signed.py +142 -0
- sage/combinat/composition_tableau.py +855 -0
- sage/combinat/constellation.py +1729 -0
- sage/combinat/core.py +751 -0
- sage/combinat/counting.py +12 -0
- sage/combinat/crystals/affine.py +742 -0
- sage/combinat/crystals/affine_factorization.py +518 -0
- sage/combinat/crystals/affinization.py +331 -0
- sage/combinat/crystals/alcove_path.py +2013 -0
- sage/combinat/crystals/all.py +22 -0
- sage/combinat/crystals/bkk_crystals.py +141 -0
- sage/combinat/crystals/catalog.py +115 -0
- sage/combinat/crystals/catalog_elementary_crystals.py +18 -0
- sage/combinat/crystals/catalog_infinity_crystals.py +33 -0
- sage/combinat/crystals/catalog_kirillov_reshetikhin.py +18 -0
- sage/combinat/crystals/crystals.py +257 -0
- sage/combinat/crystals/direct_sum.py +260 -0
- sage/combinat/crystals/elementary_crystals.py +1251 -0
- sage/combinat/crystals/fast_crystals.py +441 -0
- sage/combinat/crystals/fully_commutative_stable_grothendieck.py +1205 -0
- sage/combinat/crystals/generalized_young_walls.py +1076 -0
- sage/combinat/crystals/highest_weight_crystals.py +436 -0
- sage/combinat/crystals/induced_structure.py +695 -0
- sage/combinat/crystals/infinity_crystals.py +730 -0
- sage/combinat/crystals/kac_modules.py +863 -0
- sage/combinat/crystals/kirillov_reshetikhin.py +4196 -0
- sage/combinat/crystals/kyoto_path_model.py +497 -0
- sage/combinat/crystals/letters.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/crystals/letters.pxd +79 -0
- sage/combinat/crystals/letters.pyx +3056 -0
- sage/combinat/crystals/littelmann_path.py +1518 -0
- sage/combinat/crystals/monomial_crystals.py +1262 -0
- sage/combinat/crystals/multisegments.py +462 -0
- sage/combinat/crystals/mv_polytopes.py +467 -0
- sage/combinat/crystals/pbw_crystal.py +511 -0
- sage/combinat/crystals/pbw_datum.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/crystals/pbw_datum.pxd +4 -0
- sage/combinat/crystals/pbw_datum.pyx +487 -0
- sage/combinat/crystals/polyhedral_realization.py +372 -0
- sage/combinat/crystals/spins.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/crystals/spins.pxd +21 -0
- sage/combinat/crystals/spins.pyx +756 -0
- sage/combinat/crystals/star_crystal.py +290 -0
- sage/combinat/crystals/subcrystal.py +464 -0
- sage/combinat/crystals/tensor_product.py +1177 -0
- sage/combinat/crystals/tensor_product_element.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/crystals/tensor_product_element.pxd +35 -0
- sage/combinat/crystals/tensor_product_element.pyx +1870 -0
- sage/combinat/crystals/virtual_crystal.py +420 -0
- sage/combinat/cyclic_sieving_phenomenon.py +204 -0
- sage/combinat/debruijn_sequence.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/debruijn_sequence.pyx +355 -0
- sage/combinat/decorated_permutation.py +270 -0
- sage/combinat/degree_sequences.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/degree_sequences.pyx +588 -0
- sage/combinat/derangements.py +527 -0
- sage/combinat/descent_algebra.py +1008 -0
- sage/combinat/diagram.py +1551 -0
- sage/combinat/diagram_algebras.py +5886 -0
- sage/combinat/dyck_word.py +4349 -0
- sage/combinat/e_one_star.py +1623 -0
- sage/combinat/enumerated_sets.py +123 -0
- sage/combinat/expnums.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/expnums.pyx +148 -0
- sage/combinat/fast_vector_partitions.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/fast_vector_partitions.pyx +346 -0
- sage/combinat/fqsym.py +1977 -0
- sage/combinat/free_dendriform_algebra.py +954 -0
- sage/combinat/free_prelie_algebra.py +1141 -0
- sage/combinat/fully_commutative_elements.py +1077 -0
- sage/combinat/fully_packed_loop.py +1523 -0
- sage/combinat/gelfand_tsetlin_patterns.py +1409 -0
- sage/combinat/gray_codes.py +311 -0
- sage/combinat/grossman_larson_algebras.py +667 -0
- sage/combinat/growth.py +4352 -0
- sage/combinat/hall_polynomial.py +188 -0
- sage/combinat/hillman_grassl.py +866 -0
- sage/combinat/integer_matrices.py +329 -0
- sage/combinat/integer_vectors_mod_permgroup.py +1238 -0
- sage/combinat/k_tableau.py +4564 -0
- sage/combinat/kazhdan_lusztig.py +215 -0
- sage/combinat/key_polynomial.py +885 -0
- sage/combinat/knutson_tao_puzzles.py +2286 -0
- sage/combinat/lr_tableau.py +311 -0
- sage/combinat/matrices/all.py +24 -0
- sage/combinat/matrices/hadamard_matrix.py +3790 -0
- sage/combinat/matrices/latin.py +2912 -0
- sage/combinat/misc.py +401 -0
- sage/combinat/multiset_partition_into_sets_ordered.py +3541 -0
- sage/combinat/ncsf_qsym/all.py +21 -0
- sage/combinat/ncsf_qsym/combinatorics.py +317 -0
- sage/combinat/ncsf_qsym/generic_basis_code.py +1427 -0
- sage/combinat/ncsf_qsym/ncsf.py +5637 -0
- sage/combinat/ncsf_qsym/qsym.py +4053 -0
- sage/combinat/ncsf_qsym/tutorial.py +447 -0
- sage/combinat/ncsym/all.py +21 -0
- sage/combinat/ncsym/bases.py +855 -0
- sage/combinat/ncsym/dual.py +593 -0
- sage/combinat/ncsym/ncsym.py +2076 -0
- sage/combinat/necklace.py +551 -0
- sage/combinat/non_decreasing_parking_function.py +634 -0
- sage/combinat/nu_dyck_word.py +1474 -0
- sage/combinat/output.py +861 -0
- sage/combinat/parallelogram_polyomino.py +4326 -0
- sage/combinat/parking_functions.py +1602 -0
- sage/combinat/partition_algebra.py +1998 -0
- sage/combinat/partition_kleshchev.py +1982 -0
- sage/combinat/partition_shifting_algebras.py +584 -0
- sage/combinat/partition_tuple.py +3114 -0
- sage/combinat/path_tableaux/all.py +13 -0
- sage/combinat/path_tableaux/catalog.py +29 -0
- sage/combinat/path_tableaux/dyck_path.py +380 -0
- sage/combinat/path_tableaux/frieze.py +476 -0
- sage/combinat/path_tableaux/path_tableau.py +728 -0
- sage/combinat/path_tableaux/semistandard.py +510 -0
- sage/combinat/perfect_matching.py +779 -0
- sage/combinat/plane_partition.py +3300 -0
- sage/combinat/q_bernoulli.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/q_bernoulli.pyx +128 -0
- sage/combinat/quickref.py +81 -0
- sage/combinat/recognizable_series.py +2051 -0
- sage/combinat/regular_sequence.py +4316 -0
- sage/combinat/regular_sequence_bounded.py +543 -0
- sage/combinat/restricted_growth.py +81 -0
- sage/combinat/ribbon.py +20 -0
- sage/combinat/ribbon_shaped_tableau.py +489 -0
- sage/combinat/ribbon_tableau.py +1180 -0
- sage/combinat/rigged_configurations/all.py +46 -0
- sage/combinat/rigged_configurations/bij_abstract_class.py +548 -0
- sage/combinat/rigged_configurations/bij_infinity.py +370 -0
- sage/combinat/rigged_configurations/bij_type_A.py +163 -0
- sage/combinat/rigged_configurations/bij_type_A2_dual.py +338 -0
- sage/combinat/rigged_configurations/bij_type_A2_even.py +218 -0
- sage/combinat/rigged_configurations/bij_type_A2_odd.py +199 -0
- sage/combinat/rigged_configurations/bij_type_B.py +900 -0
- sage/combinat/rigged_configurations/bij_type_C.py +267 -0
- sage/combinat/rigged_configurations/bij_type_D.py +771 -0
- sage/combinat/rigged_configurations/bij_type_D_tri.py +392 -0
- sage/combinat/rigged_configurations/bij_type_D_twisted.py +576 -0
- sage/combinat/rigged_configurations/bij_type_E67.py +402 -0
- sage/combinat/rigged_configurations/bijection.py +143 -0
- sage/combinat/rigged_configurations/kleber_tree.py +1475 -0
- sage/combinat/rigged_configurations/kr_tableaux.py +1898 -0
- sage/combinat/rigged_configurations/rc_crystal.py +461 -0
- sage/combinat/rigged_configurations/rc_infinity.py +540 -0
- sage/combinat/rigged_configurations/rigged_configuration_element.py +2403 -0
- sage/combinat/rigged_configurations/rigged_configurations.py +1918 -0
- sage/combinat/rigged_configurations/rigged_partition.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/rigged_configurations/rigged_partition.pxd +15 -0
- sage/combinat/rigged_configurations/rigged_partition.pyx +680 -0
- sage/combinat/rigged_configurations/tensor_product_kr_tableaux.py +499 -0
- sage/combinat/rigged_configurations/tensor_product_kr_tableaux_element.py +428 -0
- sage/combinat/rsk.py +3438 -0
- sage/combinat/schubert_polynomial.py +508 -0
- sage/combinat/set_partition.py +3318 -0
- sage/combinat/set_partition_iterator.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/set_partition_iterator.pyx +136 -0
- sage/combinat/set_partition_ordered.py +1590 -0
- sage/combinat/sf/abreu_nigro.py +346 -0
- sage/combinat/sf/all.py +52 -0
- sage/combinat/sf/character.py +576 -0
- sage/combinat/sf/classical.py +319 -0
- sage/combinat/sf/dual.py +996 -0
- sage/combinat/sf/elementary.py +549 -0
- sage/combinat/sf/hall_littlewood.py +1028 -0
- sage/combinat/sf/hecke.py +336 -0
- sage/combinat/sf/homogeneous.py +464 -0
- sage/combinat/sf/jack.py +1428 -0
- sage/combinat/sf/k_dual.py +1458 -0
- sage/combinat/sf/kfpoly.py +447 -0
- sage/combinat/sf/llt.py +789 -0
- sage/combinat/sf/macdonald.py +2019 -0
- sage/combinat/sf/monomial.py +525 -0
- sage/combinat/sf/multiplicative.py +113 -0
- sage/combinat/sf/new_kschur.py +1786 -0
- sage/combinat/sf/ns_macdonald.py +964 -0
- sage/combinat/sf/orthogonal.py +246 -0
- sage/combinat/sf/orthotriang.py +355 -0
- sage/combinat/sf/powersum.py +963 -0
- sage/combinat/sf/schur.py +880 -0
- sage/combinat/sf/sf.py +1653 -0
- sage/combinat/sf/sfa.py +7053 -0
- sage/combinat/sf/symplectic.py +253 -0
- sage/combinat/sf/witt.py +721 -0
- sage/combinat/shifted_primed_tableau.py +2735 -0
- sage/combinat/shuffle.py +830 -0
- sage/combinat/sidon_sets.py +146 -0
- sage/combinat/similarity_class_type.py +1721 -0
- sage/combinat/sine_gordon.py +618 -0
- sage/combinat/six_vertex_model.py +784 -0
- sage/combinat/skew_partition.py +2053 -0
- sage/combinat/skew_tableau.py +2989 -0
- sage/combinat/sloane_functions.py +8935 -0
- sage/combinat/specht_module.py +1403 -0
- sage/combinat/species/all.py +48 -0
- sage/combinat/species/characteristic_species.py +321 -0
- sage/combinat/species/composition_species.py +273 -0
- sage/combinat/species/cycle_species.py +284 -0
- sage/combinat/species/empty_species.py +155 -0
- sage/combinat/species/functorial_composition_species.py +148 -0
- sage/combinat/species/generating_series.py +673 -0
- sage/combinat/species/library.py +148 -0
- sage/combinat/species/linear_order_species.py +169 -0
- sage/combinat/species/misc.py +83 -0
- sage/combinat/species/partition_species.py +290 -0
- sage/combinat/species/permutation_species.py +268 -0
- sage/combinat/species/product_species.py +423 -0
- sage/combinat/species/recursive_species.py +476 -0
- sage/combinat/species/set_species.py +192 -0
- sage/combinat/species/species.py +820 -0
- sage/combinat/species/structure.py +539 -0
- sage/combinat/species/subset_species.py +243 -0
- sage/combinat/species/sum_species.py +225 -0
- sage/combinat/subword.py +564 -0
- sage/combinat/subword_complex.py +2122 -0
- sage/combinat/subword_complex_c.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/subword_complex_c.pyx +119 -0
- sage/combinat/super_tableau.py +821 -0
- sage/combinat/superpartition.py +1154 -0
- sage/combinat/symmetric_group_algebra.py +3774 -0
- sage/combinat/symmetric_group_representations.py +1830 -0
- sage/combinat/t_sequences.py +877 -0
- sage/combinat/tableau.py +9506 -0
- sage/combinat/tableau_residues.py +860 -0
- sage/combinat/tableau_tuple.py +5353 -0
- sage/combinat/tiling.py +2432 -0
- sage/combinat/triangles_FHM.py +777 -0
- sage/combinat/tutorial.py +1857 -0
- sage/combinat/vector_partition.py +337 -0
- sage/combinat/words/abstract_word.py +1722 -0
- sage/combinat/words/all.py +59 -0
- sage/combinat/words/alphabet.py +268 -0
- sage/combinat/words/finite_word.py +7201 -0
- sage/combinat/words/infinite_word.py +113 -0
- sage/combinat/words/lyndon_word.py +652 -0
- sage/combinat/words/morphic.py +351 -0
- sage/combinat/words/morphism.py +3878 -0
- sage/combinat/words/paths.py +2932 -0
- sage/combinat/words/shuffle_product.py +278 -0
- sage/combinat/words/suffix_trees.py +1873 -0
- sage/combinat/words/word.py +769 -0
- sage/combinat/words/word_char.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/words/word_char.pyx +847 -0
- sage/combinat/words/word_datatypes.cpython-314-x86_64-linux-musl.so +0 -0
- sage/combinat/words/word_datatypes.pxd +4 -0
- sage/combinat/words/word_datatypes.pyx +1067 -0
- sage/combinat/words/word_generators.py +2026 -0
- sage/combinat/words/word_infinite_datatypes.py +1218 -0
- sage/combinat/words/word_options.py +99 -0
- sage/combinat/words/words.py +2396 -0
- sage/data_structures/all__sagemath_combinat.py +1 -0
- sage/databases/all__sagemath_combinat.py +13 -0
- sage/databases/findstat.py +4897 -0
- sage/databases/oeis.py +2058 -0
- sage/databases/sloane.py +393 -0
- sage/dynamics/all__sagemath_combinat.py +14 -0
- sage/dynamics/cellular_automata/all.py +7 -0
- sage/dynamics/cellular_automata/catalog.py +34 -0
- sage/dynamics/cellular_automata/elementary.py +612 -0
- sage/dynamics/cellular_automata/glca.py +477 -0
- sage/dynamics/cellular_automata/solitons.py +1463 -0
- sage/dynamics/finite_dynamical_system.py +1249 -0
- sage/dynamics/finite_dynamical_system_catalog.py +382 -0
- sage/games/all.py +7 -0
- sage/games/hexad.py +704 -0
- sage/games/quantumino.py +591 -0
- sage/games/sudoku.py +889 -0
- sage/games/sudoku_backtrack.cpython-314-x86_64-linux-musl.so +0 -0
- sage/games/sudoku_backtrack.pyx +189 -0
- sage/groups/all__sagemath_combinat.py +1 -0
- sage/groups/indexed_free_group.py +489 -0
- sage/libs/all__sagemath_combinat.py +6 -0
- sage/libs/lrcalc/__init__.py +1 -0
- sage/libs/lrcalc/lrcalc.py +525 -0
- sage/libs/symmetrica/__init__.py +7 -0
- sage/libs/symmetrica/all.py +101 -0
- sage/libs/symmetrica/kostka.pxi +168 -0
- sage/libs/symmetrica/part.pxi +193 -0
- sage/libs/symmetrica/plet.pxi +42 -0
- sage/libs/symmetrica/sab.pxi +196 -0
- sage/libs/symmetrica/sb.pxi +332 -0
- sage/libs/symmetrica/sc.pxi +192 -0
- sage/libs/symmetrica/schur.pxi +956 -0
- sage/libs/symmetrica/symmetrica.cpython-314-x86_64-linux-musl.so +0 -0
- sage/libs/symmetrica/symmetrica.pxi +1172 -0
- sage/libs/symmetrica/symmetrica.pyx +39 -0
- sage/monoids/all.py +13 -0
- sage/monoids/automatic_semigroup.py +1054 -0
- sage/monoids/free_abelian_monoid.py +315 -0
- sage/monoids/free_abelian_monoid_element.cpython-314-x86_64-linux-musl.so +0 -0
- sage/monoids/free_abelian_monoid_element.pxd +16 -0
- sage/monoids/free_abelian_monoid_element.pyx +397 -0
- sage/monoids/free_monoid.py +335 -0
- sage/monoids/free_monoid_element.py +431 -0
- sage/monoids/hecke_monoid.py +65 -0
- sage/monoids/string_monoid.py +817 -0
- sage/monoids/string_monoid_element.py +547 -0
- sage/monoids/string_ops.py +143 -0
- sage/monoids/trace_monoid.py +972 -0
- sage/rings/all__sagemath_combinat.py +2 -0
- sage/sat/all.py +4 -0
- sage/sat/boolean_polynomials.py +405 -0
- sage/sat/converters/__init__.py +6 -0
- sage/sat/converters/anf2cnf.py +14 -0
- sage/sat/converters/polybori.py +611 -0
- sage/sat/solvers/__init__.py +5 -0
- sage/sat/solvers/cryptominisat.py +287 -0
- sage/sat/solvers/dimacs.py +783 -0
- sage/sat/solvers/picosat.py +228 -0
- sage/sat/solvers/sat_lp.py +156 -0
- sage/sat/solvers/satsolver.cpython-314-x86_64-linux-musl.so +0 -0
- sage/sat/solvers/satsolver.pxd +3 -0
- sage/sat/solvers/satsolver.pyx +405 -0
|
@@ -0,0 +1,477 @@
|
|
|
1
|
+
# sage_setup: distribution = sagemath-combinat
|
|
2
|
+
"""
|
|
3
|
+
Graftal Lace Cellular Automata
|
|
4
|
+
|
|
5
|
+
AUTHORS:
|
|
6
|
+
|
|
7
|
+
- Travis Scrimshaw (2020-04-30): Initial version
|
|
8
|
+
"""
|
|
9
|
+
|
|
10
|
+
#*****************************************************************************
|
|
11
|
+
# Copyright (C) 2020 Travis Scrimshaw <tcscrims at gmail.com>
|
|
12
|
+
#
|
|
13
|
+
# This program is free software: you can redistribute it and/or modify
|
|
14
|
+
# it under the terms of the GNU General Public License as published by
|
|
15
|
+
# the Free Software Foundation, either version 2 of the License, or
|
|
16
|
+
# (at your option) any later version.
|
|
17
|
+
# https://www.gnu.org/licenses/
|
|
18
|
+
# ****************************************************************************
|
|
19
|
+
|
|
20
|
+
from sage.structure.sage_object import SageObject
|
|
21
|
+
from sage.typeset.ascii_art import AsciiArt
|
|
22
|
+
from sage.typeset.unicode_art import UnicodeArt
|
|
23
|
+
|
|
24
|
+
|
|
25
|
+
class GraftalLaceCellularAutomata(SageObject):
|
|
26
|
+
r"""
|
|
27
|
+
Graftal Lace Cellular Automata (GLCA).
|
|
28
|
+
|
|
29
|
+
A GLCA is a deterministic cellular automaton whose rule is given
|
|
30
|
+
by an 8-digit octal number `r_7 \cdots r_0`. For a node `s_i`, let
|
|
31
|
+
`b_k`, for `k = -1,0,1` denote if there is an edge from `s_i` to
|
|
32
|
+
`s'_{i+k}`, where `s'_j` is the previous row. We determine the value
|
|
33
|
+
at `t_{i+k}` by considering the value of `r_m`, where the binary
|
|
34
|
+
representation of `m` is `b_{-1} b_0 b_1`. If `r_m` has a binary
|
|
35
|
+
representation of b'_1 b'_0 b'_{-1}`, then we add `b'_k` to `t_{i+k}`.
|
|
36
|
+
|
|
37
|
+
INPUT:
|
|
38
|
+
|
|
39
|
+
- ``rule`` -- list of length 8 with integer entries `0 \leq x < 8`
|
|
40
|
+
|
|
41
|
+
EXAMPLES::
|
|
42
|
+
|
|
43
|
+
sage: G = cellular_automata.GraftalLace([0,2,5,4,7,2,3,3])
|
|
44
|
+
sage: G.evolve(3)
|
|
45
|
+
sage: ascii_art(G)
|
|
46
|
+
o
|
|
47
|
+
|
|
|
48
|
+
o
|
|
49
|
+
|
|
|
50
|
+
o o o
|
|
51
|
+
/| |/|
|
|
52
|
+
o o o o o
|
|
53
|
+
/| |/|\|/|
|
|
54
|
+
o o o o o o o
|
|
55
|
+
|
|
56
|
+
sage: G = cellular_automata.GraftalLace([3,0,3,4,7,6,3,1])
|
|
57
|
+
sage: G.evolve(3)
|
|
58
|
+
sage: ascii_art(G)
|
|
59
|
+
o
|
|
60
|
+
|
|
|
61
|
+
o
|
|
62
|
+
|\
|
|
63
|
+
o o o
|
|
64
|
+
/ |\ \
|
|
65
|
+
o o o o o
|
|
66
|
+
/|/ |\ \ \
|
|
67
|
+
o o o o o o o
|
|
68
|
+
|
|
69
|
+
sage: G = cellular_automata.GraftalLace([2,0,3,3,6,0,2,7])
|
|
70
|
+
sage: G.evolve(20)
|
|
71
|
+
sage: G.plot() # needs sage.plot
|
|
72
|
+
Graphics object consisting of 842 graphics primitives
|
|
73
|
+
|
|
74
|
+
.. PLOT::
|
|
75
|
+
|
|
76
|
+
G = cellular_automata.GraftalLace([2,0,3,3,6,0,2,7])
|
|
77
|
+
G.evolve(20)
|
|
78
|
+
P = G.plot()
|
|
79
|
+
sphinx_plot(P)
|
|
80
|
+
|
|
81
|
+
REFERENCES:
|
|
82
|
+
|
|
83
|
+
- [Kas2018]_
|
|
84
|
+
"""
|
|
85
|
+
def __init__(self, rule):
|
|
86
|
+
"""
|
|
87
|
+
Initialize ``self``.
|
|
88
|
+
|
|
89
|
+
TESTS::
|
|
90
|
+
|
|
91
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
92
|
+
sage: TestSuite(G).run()
|
|
93
|
+
|
|
94
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5])
|
|
95
|
+
Traceback (most recent call last):
|
|
96
|
+
...
|
|
97
|
+
ValueError: invalid rule
|
|
98
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0,5])
|
|
99
|
+
Traceback (most recent call last):
|
|
100
|
+
...
|
|
101
|
+
ValueError: invalid rule
|
|
102
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,-1,5,5,0])
|
|
103
|
+
Traceback (most recent call last):
|
|
104
|
+
...
|
|
105
|
+
ValueError: invalid rule
|
|
106
|
+
sage: G = cellular_automata.GraftalLace([8,5,1,2,5,4,5,5])
|
|
107
|
+
Traceback (most recent call last):
|
|
108
|
+
...
|
|
109
|
+
ValueError: invalid rule
|
|
110
|
+
"""
|
|
111
|
+
if len(rule) != 8 or any(x not in range(8) for x in rule):
|
|
112
|
+
raise ValueError("invalid rule")
|
|
113
|
+
# We reverse the rule to make the evolution easier to compute
|
|
114
|
+
self._rule = tuple(reversed(rule))
|
|
115
|
+
self._states = [[2]]
|
|
116
|
+
|
|
117
|
+
def __eq__(self, other):
|
|
118
|
+
"""
|
|
119
|
+
Check equality.
|
|
120
|
+
|
|
121
|
+
Two GLCAs are equal if and only if they have the same rule.
|
|
122
|
+
|
|
123
|
+
TESTS::
|
|
124
|
+
|
|
125
|
+
sage: G1 = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
126
|
+
sage: G2 = cellular_automata.GraftalLace([0,5,5,4,5,2,1,5])
|
|
127
|
+
sage: G3 = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
128
|
+
sage: G1 == G2
|
|
129
|
+
False
|
|
130
|
+
sage: G1 == G3
|
|
131
|
+
True
|
|
132
|
+
sage: G1 is G3
|
|
133
|
+
False
|
|
134
|
+
"""
|
|
135
|
+
return (isinstance(other, GraftalLaceCellularAutomata)
|
|
136
|
+
and self._rule == other._rule)
|
|
137
|
+
|
|
138
|
+
def __ne__(self, other):
|
|
139
|
+
"""
|
|
140
|
+
Check non equality.
|
|
141
|
+
|
|
142
|
+
TESTS::
|
|
143
|
+
|
|
144
|
+
sage: G1 = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
145
|
+
sage: G2 = cellular_automata.GraftalLace([0,5,5,4,5,2,1,5])
|
|
146
|
+
sage: G3 = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
147
|
+
sage: G1 != G2
|
|
148
|
+
True
|
|
149
|
+
sage: G1 != G3
|
|
150
|
+
False
|
|
151
|
+
sage: G1 is G3
|
|
152
|
+
False
|
|
153
|
+
"""
|
|
154
|
+
return not (self == other)
|
|
155
|
+
|
|
156
|
+
# Evolution functions
|
|
157
|
+
# -------------------
|
|
158
|
+
|
|
159
|
+
def evolve(self, number=None):
|
|
160
|
+
r"""
|
|
161
|
+
Evolve ``self``.
|
|
162
|
+
|
|
163
|
+
INPUT:
|
|
164
|
+
|
|
165
|
+
- ``number`` -- (default: 1) the number of times to perform
|
|
166
|
+
the evolution
|
|
167
|
+
|
|
168
|
+
EXAMPLES::
|
|
169
|
+
|
|
170
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
171
|
+
sage: ascii_art(G)
|
|
172
|
+
o
|
|
173
|
+
|
|
|
174
|
+
o
|
|
175
|
+
sage: G.evolve(2)
|
|
176
|
+
sage: ascii_art(G)
|
|
177
|
+
o
|
|
178
|
+
|
|
|
179
|
+
o
|
|
180
|
+
/ \
|
|
181
|
+
o o o
|
|
182
|
+
/ \ / \
|
|
183
|
+
o o o o o
|
|
184
|
+
|
|
185
|
+
sage: G = cellular_automata.GraftalLace([0,2,1,4,7,2,3,0])
|
|
186
|
+
sage: G.evolve(3)
|
|
187
|
+
sage: ascii_art(G)
|
|
188
|
+
o
|
|
189
|
+
|
|
|
190
|
+
o
|
|
191
|
+
|
|
|
192
|
+
o o o
|
|
193
|
+
|
|
|
194
|
+
o o o o o
|
|
195
|
+
|
|
|
196
|
+
o o o o o o o
|
|
197
|
+
"""
|
|
198
|
+
if number is not None:
|
|
199
|
+
for _ in range(number):
|
|
200
|
+
self.evolve()
|
|
201
|
+
return
|
|
202
|
+
|
|
203
|
+
prev_state = self._states[-1]
|
|
204
|
+
next_state = [0] * (len(prev_state) + 2)
|
|
205
|
+
|
|
206
|
+
for i, val in enumerate(prev_state):
|
|
207
|
+
next_state[i] += self._rule[val] & 0x1
|
|
208
|
+
next_state[i+1] += self._rule[val] & 0x2
|
|
209
|
+
next_state[i+2] += self._rule[val] & 0x4
|
|
210
|
+
self._states.append(next_state)
|
|
211
|
+
|
|
212
|
+
# Output functions
|
|
213
|
+
# ----------------
|
|
214
|
+
|
|
215
|
+
def _repr_(self):
|
|
216
|
+
"""
|
|
217
|
+
Return a string representation of ``self``.
|
|
218
|
+
|
|
219
|
+
EXAMPLES::
|
|
220
|
+
|
|
221
|
+
sage: cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
222
|
+
Graftal Lace Cellular Automata with rule 51254550
|
|
223
|
+
"""
|
|
224
|
+
rule = ''.join(map(str, reversed(self._rule)))
|
|
225
|
+
return "Graftal Lace Cellular Automata with rule {}".format(rule)
|
|
226
|
+
|
|
227
|
+
def print_states(self, number=None, use_unicode=False):
|
|
228
|
+
r"""
|
|
229
|
+
Print the first ``num`` states of ``self``.
|
|
230
|
+
|
|
231
|
+
.. NOTE::
|
|
232
|
+
|
|
233
|
+
If the number of states computed for ``self`` is less than
|
|
234
|
+
``num``, then this evolves the system using the default
|
|
235
|
+
time evolution.
|
|
236
|
+
|
|
237
|
+
INPUT:
|
|
238
|
+
|
|
239
|
+
- ``number`` -- the number of states to print
|
|
240
|
+
|
|
241
|
+
EXAMPLES::
|
|
242
|
+
|
|
243
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
244
|
+
sage: G.evolve(2)
|
|
245
|
+
sage: G.print_states()
|
|
246
|
+
o
|
|
247
|
+
|
|
|
248
|
+
o
|
|
249
|
+
/ \
|
|
250
|
+
o o o
|
|
251
|
+
/ \ / \
|
|
252
|
+
o o o o o
|
|
253
|
+
sage: G.evolve(20)
|
|
254
|
+
sage: G.print_states(3)
|
|
255
|
+
o
|
|
256
|
+
|
|
|
257
|
+
o
|
|
258
|
+
/ \
|
|
259
|
+
o o o
|
|
260
|
+
/ \ / \
|
|
261
|
+
o o o o o
|
|
262
|
+
"""
|
|
263
|
+
if number is None:
|
|
264
|
+
number = len(self._states)
|
|
265
|
+
if number > len(self._states):
|
|
266
|
+
for dummy in range(number - len(self._states)):
|
|
267
|
+
self.evolve()
|
|
268
|
+
if use_unicode:
|
|
269
|
+
print(self._unicode_art_(number))
|
|
270
|
+
else:
|
|
271
|
+
print(self._ascii_art_(number))
|
|
272
|
+
|
|
273
|
+
def _ascii_art_(self, number=None):
|
|
274
|
+
r"""
|
|
275
|
+
Return an ascii art representation of ``self``.
|
|
276
|
+
|
|
277
|
+
EXAMPLES::
|
|
278
|
+
|
|
279
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
280
|
+
sage: G.evolve(10)
|
|
281
|
+
sage: ascii_art(G)
|
|
282
|
+
o
|
|
283
|
+
|
|
|
284
|
+
o
|
|
285
|
+
/ \
|
|
286
|
+
o o o
|
|
287
|
+
/ \ / \
|
|
288
|
+
o o o o o
|
|
289
|
+
/ \ | / \
|
|
290
|
+
o o o o o o o
|
|
291
|
+
/ \ / X X \ / \
|
|
292
|
+
o o o o o o o o o
|
|
293
|
+
/ \ |/ \|/ \| / \
|
|
294
|
+
o o o o o o o o o o o
|
|
295
|
+
/ \ / \ \ / \ / / \ / \
|
|
296
|
+
o o o o o o o o o o o o o
|
|
297
|
+
/ \ | / \| |/ \ | / \
|
|
298
|
+
o o o o o o o o o o o o o o o
|
|
299
|
+
/ \ / X X \ / \ / X X \ / \
|
|
300
|
+
o o o o o o o o o o o o o o o o o
|
|
301
|
+
/ \ |/ \|/ \| |/ \|/ \| / \
|
|
302
|
+
o o o o o o o o o o o o o o o o o o o
|
|
303
|
+
/ \ / \ \ / \ / \ / \ / / \ / \
|
|
304
|
+
o o o o o o o o o o o o o o o o o o o o o
|
|
305
|
+
"""
|
|
306
|
+
if number is None:
|
|
307
|
+
number = len(self._states)
|
|
308
|
+
|
|
309
|
+
space = len(self._states[:number]) * 2 - 1
|
|
310
|
+
ret = AsciiArt([' '*space + 'o'])
|
|
311
|
+
space += 1
|
|
312
|
+
for i,state in enumerate(self._states[:number]):
|
|
313
|
+
temp = ' '*(space-2)
|
|
314
|
+
last = ' '
|
|
315
|
+
for x in state:
|
|
316
|
+
if x & 0x4:
|
|
317
|
+
if last == '/':
|
|
318
|
+
temp += 'X'
|
|
319
|
+
else:
|
|
320
|
+
temp += '\\'
|
|
321
|
+
else:
|
|
322
|
+
temp += last
|
|
323
|
+
temp += '|' if x & 0x2 else ' '
|
|
324
|
+
last = '/' if x & 0x1 else ' '
|
|
325
|
+
ret *= AsciiArt([temp + last])
|
|
326
|
+
space -= 1
|
|
327
|
+
ret *= AsciiArt([' '*space + ' '.join('o' for dummy in range(2*i+1))])
|
|
328
|
+
space -= 1
|
|
329
|
+
return ret
|
|
330
|
+
|
|
331
|
+
def _unicode_art_(self, number=None):
|
|
332
|
+
r"""
|
|
333
|
+
Return a unicode art representation of ``self``.
|
|
334
|
+
|
|
335
|
+
EXAMPLES::
|
|
336
|
+
|
|
337
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
338
|
+
sage: G.evolve(10)
|
|
339
|
+
sage: unicode_art(G)
|
|
340
|
+
◾
|
|
341
|
+
│
|
|
342
|
+
◾
|
|
343
|
+
╱ ╲
|
|
344
|
+
◾ ◾ ◾
|
|
345
|
+
╱ ╲ ╱ ╲
|
|
346
|
+
◾ ◾ ◾ ◾ ◾
|
|
347
|
+
╱ ╲ │ ╱ ╲
|
|
348
|
+
◾ ◾ ◾ ◾ ◾ ◾ ◾
|
|
349
|
+
╱ ╲ ╱ ╳ ╳ ╲ ╱ ╲
|
|
350
|
+
◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾
|
|
351
|
+
╱ ╲ │╱ ╲│╱ ╲│ ╱ ╲
|
|
352
|
+
◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾
|
|
353
|
+
╱ ╲ ╱ ╲ ╲ ╱ ╲ ╱ ╱ ╲ ╱ ╲
|
|
354
|
+
◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾
|
|
355
|
+
╱ ╲ │ ╱ ╲│ │╱ ╲ │ ╱ ╲
|
|
356
|
+
◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾
|
|
357
|
+
╱ ╲ ╱ ╳ ╳ ╲ ╱ ╲ ╱ ╳ ╳ ╲ ╱ ╲
|
|
358
|
+
◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾
|
|
359
|
+
╱ ╲ │╱ ╲│╱ ╲│ │╱ ╲│╱ ╲│ ╱ ╲
|
|
360
|
+
◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾
|
|
361
|
+
╱ ╲ ╱ ╲ ╲ ╱ ╲ ╱ ╲ ╱ ╲ ╱ ╱ ╲ ╱ ╲
|
|
362
|
+
◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾ ◾
|
|
363
|
+
"""
|
|
364
|
+
if number is None:
|
|
365
|
+
number = len(self._states)
|
|
366
|
+
|
|
367
|
+
space = len(self._states[:number]) * 2 - 1
|
|
368
|
+
ret = UnicodeArt([' '*space + '◾'])
|
|
369
|
+
space += 1
|
|
370
|
+
for i,state in enumerate(self._states[:number]):
|
|
371
|
+
temp = ' '*(space-2)
|
|
372
|
+
last = ' '
|
|
373
|
+
for x in state:
|
|
374
|
+
if x & 0x4:
|
|
375
|
+
if last == '╱':
|
|
376
|
+
temp += '╳'
|
|
377
|
+
else:
|
|
378
|
+
temp += '╲'
|
|
379
|
+
else:
|
|
380
|
+
temp += last
|
|
381
|
+
temp += '│' if x & 0x2 else ' '
|
|
382
|
+
last = '╱' if x & 0x1 else ' '
|
|
383
|
+
ret *= UnicodeArt([temp + last])
|
|
384
|
+
space -= 1
|
|
385
|
+
ret *= UnicodeArt([' '*space + ' '.join('◾' for dummy in range(2*i+1))])
|
|
386
|
+
space -= 1
|
|
387
|
+
return ret
|
|
388
|
+
|
|
389
|
+
def plot(self, number=None):
|
|
390
|
+
r"""
|
|
391
|
+
Return a plot of ``self``.
|
|
392
|
+
|
|
393
|
+
INPUT:
|
|
394
|
+
|
|
395
|
+
- ``number`` -- the number of states to plot
|
|
396
|
+
|
|
397
|
+
EXAMPLES::
|
|
398
|
+
|
|
399
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
400
|
+
sage: G.evolve(20)
|
|
401
|
+
sage: G.plot() # needs sage.plot
|
|
402
|
+
Graphics object consisting of 865 graphics primitives
|
|
403
|
+
"""
|
|
404
|
+
if number is None:
|
|
405
|
+
number = len(self._states)
|
|
406
|
+
if number > len(self._states):
|
|
407
|
+
for dummy in range(number - len(self._states)):
|
|
408
|
+
self.evolve()
|
|
409
|
+
|
|
410
|
+
from sage.plot.circle import circle
|
|
411
|
+
from sage.plot.line import line
|
|
412
|
+
|
|
413
|
+
x = len(self._states[:number])
|
|
414
|
+
rad = 0.1
|
|
415
|
+
ret = circle((x, 1), rad, fill=True)
|
|
416
|
+
for i,state in enumerate(self._states[:number]):
|
|
417
|
+
for j,val in enumerate(state):
|
|
418
|
+
if val & 0x4:
|
|
419
|
+
ret += line([(x+j,-i), (x+j-1,-i+1)])
|
|
420
|
+
if val & 0x2:
|
|
421
|
+
ret += line([(x+j,-i), (x+j,-i+1)])
|
|
422
|
+
if val & 0x1:
|
|
423
|
+
ret += line([(x+j,-i), (x+j+1,-i+1)])
|
|
424
|
+
for j in range(2*i+1):
|
|
425
|
+
ret += circle((x+j, -i), rad, fill=True)
|
|
426
|
+
x -= 1
|
|
427
|
+
ret.set_aspect_ratio(1)
|
|
428
|
+
ret.axes(False)
|
|
429
|
+
return ret
|
|
430
|
+
|
|
431
|
+
def _latex_(self):
|
|
432
|
+
r"""
|
|
433
|
+
Return a latex representation of ``self``.
|
|
434
|
+
|
|
435
|
+
EXAMPLES::
|
|
436
|
+
|
|
437
|
+
sage: G = cellular_automata.GraftalLace([5,1,2,5,4,5,5,0])
|
|
438
|
+
sage: G.evolve(2)
|
|
439
|
+
sage: latex(G)
|
|
440
|
+
\begin{tikzpicture}
|
|
441
|
+
\fill (3,1) circle (2pt);
|
|
442
|
+
\draw[-] (3,0) -- (3,1);
|
|
443
|
+
\fill (3,0) circle (2pt);
|
|
444
|
+
\draw[-] (2,-1) -- (3,0);
|
|
445
|
+
\draw[-] (4,-1) -- (3,0);
|
|
446
|
+
\fill (2,-1) circle (2pt);
|
|
447
|
+
\fill (3,-1) circle (2pt);
|
|
448
|
+
\fill (4,-1) circle (2pt);
|
|
449
|
+
\draw[-] (1,-2) -- (2,-1);
|
|
450
|
+
\draw[-] (3,-2) -- (2,-1);
|
|
451
|
+
\draw[-] (3,-2) -- (4,-1);
|
|
452
|
+
\draw[-] (5,-2) -- (4,-1);
|
|
453
|
+
\fill (1,-2) circle (2pt);
|
|
454
|
+
\fill (2,-2) circle (2pt);
|
|
455
|
+
\fill (3,-2) circle (2pt);
|
|
456
|
+
\fill (4,-2) circle (2pt);
|
|
457
|
+
\fill (5,-2) circle (2pt);
|
|
458
|
+
\end{tikzpicture}
|
|
459
|
+
"""
|
|
460
|
+
ret = "\\begin{tikzpicture}\n"
|
|
461
|
+
|
|
462
|
+
x = len(self._states)
|
|
463
|
+
rad = 2
|
|
464
|
+
ret += "\\fill ({},{}) circle ({}pt);\n".format(x, 1, rad)
|
|
465
|
+
for i,state in enumerate(self._states):
|
|
466
|
+
for j,val in enumerate(state):
|
|
467
|
+
if val & 0x4:
|
|
468
|
+
ret += "\\draw[-] ({},{}) -- ({},{});\n".format(x+j,-i, x+j-1,-i+1)
|
|
469
|
+
if val & 0x2:
|
|
470
|
+
ret += "\\draw[-] ({},{}) -- ({},{});\n".format(x+j,-i, x+j,-i+1)
|
|
471
|
+
if val & 0x1:
|
|
472
|
+
ret += "\\draw[-] ({},{}) -- ({},{});\n".format(x+j,-i, x+j+1,-i+1)
|
|
473
|
+
for j in range(2*i+1):
|
|
474
|
+
ret += "\\fill ({},{}) circle ({}pt);\n".format(x+j, -i, rad)
|
|
475
|
+
x -= 1
|
|
476
|
+
ret += "\\end{tikzpicture}"
|
|
477
|
+
return ret
|