|
1 | 1 | """
|
2 | 2 | Combinatorics features that are imported by default in the interpreter namespace
|
3 | 3 | """
|
4 |
| -from combinat import bell_number, catalan_number, euler_number, fibonacci, \ |
| 4 | +from __future__ import absolute_import |
| 5 | + |
| 6 | +from .combinat import bell_number, catalan_number, euler_number, fibonacci, \ |
5 | 7 | lucas_number1, lucas_number2, stirling_number1, stirling_number2, \
|
6 | 8 | CombinatorialObject, CombinatorialClass, FilteredCombinatorialClass, \
|
7 | 9 | UnionCombinatorialClass, MapCombinatorialClass, \
|
|
11 | 13 | bell_polynomial, fibonacci_sequence, \
|
12 | 14 | fibonacci_xrange, bernoulli_polynomial
|
13 | 15 |
|
14 |
| -from expnums import expnums |
| 16 | +from .expnums import expnums |
15 | 17 |
|
16 | 18 | from sage.combinat.crystals.all import *
|
17 |
| -from rigged_configurations.all import * |
| 19 | +from .rigged_configurations.all import * |
18 | 20 |
|
19 | 21 | from sage.combinat.dlx import DLXMatrix, AllExactCovers, OneExactCover
|
20 | 22 |
|
21 | 23 | # block designs, etc
|
22 | 24 | from sage.combinat.designs.all import *
|
23 | 25 |
|
24 | 26 | # Free modules and friends
|
25 |
| -from free_module import CombinatorialFreeModule |
26 |
| -from combinatorial_algebra import CombinatorialAlgebra |
27 |
| -from debruijn_sequence import DeBruijnSequences |
28 |
| - |
29 |
| -from schubert_polynomial import SchubertPolynomialRing |
30 |
| -from symmetric_group_algebra import SymmetricGroupAlgebra, HeckeAlgebraSymmetricGroupT |
31 |
| -from symmetric_group_representations import SymmetricGroupRepresentation, SymmetricGroupRepresentations |
32 |
| -from yang_baxter_graph import YangBaxterGraph |
| 27 | +from .free_module import CombinatorialFreeModule |
| 28 | +from .combinatorial_algebra import CombinatorialAlgebra |
| 29 | +from .debruijn_sequence import DeBruijnSequences |
| 30 | + |
| 31 | +from .schubert_polynomial import SchubertPolynomialRing |
| 32 | +from .symmetric_group_algebra import SymmetricGroupAlgebra, HeckeAlgebraSymmetricGroupT |
| 33 | +from .symmetric_group_representations import SymmetricGroupRepresentation, SymmetricGroupRepresentations |
| 34 | +from .yang_baxter_graph import YangBaxterGraph |
33 | 35 | #from hall_littlewood import HallLittlewood_qp, HallLittlewood_q, HallLittlewood_p
|
34 | 36 |
|
35 | 37 | #Permutations
|
36 |
| -from permutation import Permutation, Permutations, Arrangements, PermutationOptions, CyclicPermutations, CyclicPermutationsOfPartition |
37 |
| -from affine_permutation import AffinePermutationGroup |
| 38 | +from .permutation import Permutation, Permutations, Arrangements, PermutationOptions, CyclicPermutations, CyclicPermutationsOfPartition |
| 39 | +from .affine_permutation import AffinePermutationGroup |
38 | 40 | lazy_import('sage.combinat.colored_permutations', ['ColoredPermutations',
|
39 | 41 | 'SignedPermutations'])
|
40 |
| -from derangements import Derangements |
| 42 | +from .derangements import Derangements |
41 | 43 | lazy_import('sage.combinat.baxter_permutations', ['BaxterPermutations'])
|
42 | 44 |
|
43 | 45 | #RSK
|
44 |
| -from rsk import RSK, RSK_inverse, robinson_schensted_knuth, robinson_schensted_knuth_inverse |
| 46 | +from .rsk import RSK, RSK_inverse, robinson_schensted_knuth, robinson_schensted_knuth_inverse |
45 | 47 |
|
46 | 48 | #PerfectMatchings
|
47 |
| -from perfect_matching import PerfectMatching, PerfectMatchings |
| 49 | +from .perfect_matching import PerfectMatching, PerfectMatchings |
48 | 50 |
|
49 | 51 | # Integer lists
|
50 |
| -from integer_lists import IntegerListsLex |
| 52 | +from .integer_lists import IntegerListsLex |
51 | 53 |
|
52 | 54 | #Compositions
|
53 |
| -from composition import Composition, Compositions |
54 |
| -from composition_signed import SignedCompositions |
| 55 | +from .composition import Composition, Compositions |
| 56 | +from .composition_signed import SignedCompositions |
55 | 57 |
|
56 | 58 | #Partitions
|
57 |
| -from partition import Partition, Partitions, PartitionsInBox,\ |
| 59 | +from .partition import Partition, Partitions, PartitionsInBox,\ |
58 | 60 | OrderedPartitions, PartitionsGreatestLE, PartitionsGreatestEQ,\
|
59 | 61 | PartitionsGreatestLE, PartitionsGreatestEQ, number_of_partitions
|
60 | 62 |
|
61 | 63 | from sage.combinat.partition_tuple import PartitionTuple, PartitionTuples
|
62 |
| -from skew_partition import SkewPartition, SkewPartitions |
| 64 | +from .skew_partition import SkewPartition, SkewPartitions |
63 | 65 |
|
64 | 66 | #Partition algebra
|
65 |
| -from partition_algebra import SetPartitionsAk, SetPartitionsPk, SetPartitionsTk, SetPartitionsIk, SetPartitionsBk, SetPartitionsSk, SetPartitionsRk, SetPartitionsRk, SetPartitionsPRk |
| 67 | +from .partition_algebra import SetPartitionsAk, SetPartitionsPk, SetPartitionsTk, SetPartitionsIk, SetPartitionsBk, SetPartitionsSk, SetPartitionsRk, SetPartitionsRk, SetPartitionsPRk |
66 | 68 |
|
67 | 69 | #Diagram algebra
|
68 |
| -from diagram_algebras import PartitionAlgebra, BrauerAlgebra, TemperleyLiebAlgebra, PlanarAlgebra, PropagatingIdeal |
| 70 | +from .diagram_algebras import PartitionAlgebra, BrauerAlgebra, TemperleyLiebAlgebra, PlanarAlgebra, PropagatingIdeal |
69 | 71 |
|
70 | 72 | #Descent algebra
|
71 |
| -from descent_algebra import DescentAlgebra |
| 73 | +from .descent_algebra import DescentAlgebra |
72 | 74 |
|
73 | 75 | #Vector Partitions
|
74 |
| -from vector_partition import VectorPartition, VectorPartitions |
| 76 | +from .vector_partition import VectorPartition, VectorPartitions |
75 | 77 |
|
76 | 78 | #Similarity class types
|
77 |
| -from similarity_class_type import PrimarySimilarityClassType, PrimarySimilarityClassTypes, SimilarityClassType, SimilarityClassTypes |
| 79 | +from .similarity_class_type import PrimarySimilarityClassType, PrimarySimilarityClassTypes, SimilarityClassType, SimilarityClassTypes |
78 | 80 |
|
79 | 81 | #Cores
|
80 |
| -from core import Core, Cores |
| 82 | +from .core import Core, Cores |
81 | 83 |
|
82 | 84 | #Tableaux
|
83 |
| -from tableau import Tableau, SemistandardTableau, StandardTableau, \ |
| 85 | +from .tableau import Tableau, SemistandardTableau, StandardTableau, \ |
84 | 86 | Tableaux, StandardTableaux, SemistandardTableaux
|
85 |
| -from skew_tableau import SkewTableau, SkewTableaux, StandardSkewTableaux, SemistandardSkewTableaux |
86 |
| -from ribbon_shaped_tableau import RibbonShapedTableau, RibbonShapedTableaux, StandardRibbonShapedTableaux |
87 |
| -from ribbon_tableau import RibbonTableaux, RibbonTableau, MultiSkewTableaux, MultiSkewTableau, SemistandardMultiSkewTableaux |
88 |
| -from composition_tableau import CompositionTableau, CompositionTableaux |
| 87 | +from .skew_tableau import SkewTableau, SkewTableaux, StandardSkewTableaux, SemistandardSkewTableaux |
| 88 | +from .ribbon_shaped_tableau import RibbonShapedTableau, RibbonShapedTableaux, StandardRibbonShapedTableaux |
| 89 | +from .ribbon_tableau import RibbonTableaux, RibbonTableau, MultiSkewTableaux, MultiSkewTableau, SemistandardMultiSkewTableaux |
| 90 | +from .composition_tableau import CompositionTableau, CompositionTableaux |
89 | 91 |
|
90 | 92 | from sage.combinat.tableau_tuple import TableauTuple, StandardTableauTuple, TableauTuples, StandardTableauTuples
|
91 |
| -from k_tableau import WeakTableau, WeakTableaux, StrongTableau, StrongTableaux |
| 93 | +from .k_tableau import WeakTableau, WeakTableaux, StrongTableau, StrongTableaux |
92 | 94 |
|
93 | 95 | #Words
|
94 |
| -from words.all import * |
| 96 | +from .words.all import * |
95 | 97 |
|
96 |
| -from subword import Subwords |
| 98 | +from .subword import Subwords |
97 | 99 |
|
98 |
| -from graph_path import GraphPaths |
| 100 | +from .graph_path import GraphPaths |
99 | 101 |
|
100 | 102 | #Tuples
|
101 |
| -from tuple import Tuples, UnorderedTuples |
| 103 | +from .tuple import Tuples, UnorderedTuples |
102 | 104 |
|
103 | 105 | #Alternating sign matrices
|
104 |
| -from alternating_sign_matrix import AlternatingSignMatrix, AlternatingSignMatrices, MonotoneTriangles, ContreTableaux, TruncatedStaircases |
| 106 | +from .alternating_sign_matrix import AlternatingSignMatrix, AlternatingSignMatrices, MonotoneTriangles, ContreTableaux, TruncatedStaircases |
105 | 107 |
|
106 | 108 | # Parking Functions
|
107 |
| -from non_decreasing_parking_function import NonDecreasingParkingFunctions, NonDecreasingParkingFunction |
108 |
| -from parking_functions import ParkingFunctions, ParkingFunction |
| 109 | +from .non_decreasing_parking_function import NonDecreasingParkingFunctions, NonDecreasingParkingFunction |
| 110 | +from .parking_functions import ParkingFunctions, ParkingFunction |
109 | 111 |
|
110 | 112 | # Trees and Tamari interval posets
|
111 | 113 | from sage.misc.lazy_import import lazy_import
|
112 |
| -from ordered_tree import (OrderedTree, OrderedTrees, |
| 114 | +from .ordered_tree import (OrderedTree, OrderedTrees, |
113 | 115 | LabelledOrderedTree, LabelledOrderedTrees)
|
114 |
| -from binary_tree import (BinaryTree, BinaryTrees, |
| 116 | +from .binary_tree import (BinaryTree, BinaryTrees, |
115 | 117 | LabelledBinaryTree, LabelledBinaryTrees)
|
116 | 118 |
|
117 | 119 | lazy_import('sage.combinat.interval_posets', ['TamariIntervalPoset', 'TamariIntervalPosets'])
|
118 |
| -from rooted_tree import (RootedTree, RootedTrees, |
| 120 | +from .rooted_tree import (RootedTree, RootedTrees, |
119 | 121 | LabelledRootedTree, LabelledRootedTrees)
|
120 | 122 |
|
121 |
| -from combination import Combinations |
122 |
| -from cartesian_product import CartesianProduct |
| 123 | +from .combination import Combinations |
| 124 | +from .cartesian_product import CartesianProduct |
123 | 125 |
|
124 |
| -from set_partition import SetPartition, SetPartitions |
125 |
| -from set_partition_ordered import OrderedSetPartition, OrderedSetPartitions |
126 |
| -from subset import Subsets |
| 126 | +from .set_partition import SetPartition, SetPartitions |
| 127 | +from .set_partition_ordered import OrderedSetPartition, OrderedSetPartitions |
| 128 | +from .subset import Subsets |
127 | 129 | #from subsets_pairwise import PairwiseCompatibleSubsets
|
128 |
| -from necklace import Necklaces |
129 |
| -from lyndon_word import LyndonWord, LyndonWords, StandardBracketedLyndonWords |
130 |
| -from dyck_word import DyckWords, DyckWord |
131 |
| -from sloane_functions import sloane |
132 |
| - |
133 |
| -from root_system.all import * |
134 |
| -from sf.all import * |
135 |
| -from ncsf_qsym.all import * |
136 |
| -from ncsym.all import * |
137 |
| -from matrices.all import * |
| 130 | +from .necklace import Necklaces |
| 131 | +from .lyndon_word import LyndonWord, LyndonWords, StandardBracketedLyndonWords |
| 132 | +from .dyck_word import DyckWords, DyckWord |
| 133 | +from .sloane_functions import sloane |
| 134 | + |
| 135 | +from .root_system.all import * |
| 136 | +from .sf.all import * |
| 137 | +from .ncsf_qsym.all import * |
| 138 | +from .ncsym.all import * |
| 139 | +from .matrices.all import * |
138 | 140 | # Posets
|
139 |
| -from posets.all import * |
| 141 | +from .posets.all import * |
140 | 142 |
|
141 | 143 | # Cluster Algebras and Quivers
|
142 |
| -from cluster_algebra_quiver.all import * |
| 144 | +from .cluster_algebra_quiver.all import * |
143 | 145 |
|
144 | 146 | #import lrcalc
|
145 | 147 |
|
146 |
| -import ranker |
| 148 | +from . import ranker |
147 | 149 |
|
148 |
| -from integer_vector import IntegerVectors |
149 |
| -from integer_vector_weighted import WeightedIntegerVectors |
150 |
| -from integer_vectors_mod_permgroup import IntegerVectorsModPermutationGroup |
| 150 | +from .integer_vector import IntegerVectors |
| 151 | +from .integer_vector_weighted import WeightedIntegerVectors |
| 152 | +from .integer_vectors_mod_permgroup import IntegerVectorsModPermutationGroup |
151 | 153 |
|
152 |
| -from finite_class import FiniteCombinatorialClass |
| 154 | +from .finite_class import FiniteCombinatorialClass |
153 | 155 |
|
154 |
| -from q_analogues import gaussian_binomial, q_binomial |
| 156 | +from .q_analogues import gaussian_binomial, q_binomial |
155 | 157 |
|
156 |
| -from species.all import * |
| 158 | +from .species.all import * |
157 | 159 |
|
158 |
| -from multichoose_nk import MultichooseNK |
| 160 | +from .multichoose_nk import MultichooseNK |
159 | 161 |
|
160 |
| -from kazhdan_lusztig import KazhdanLusztigPolynomial |
| 162 | +from .kazhdan_lusztig import KazhdanLusztigPolynomial |
161 | 163 |
|
162 |
| -from degree_sequences import DegreeSequences |
| 164 | +from .degree_sequences import DegreeSequences |
163 | 165 |
|
164 |
| -from cyclic_sieving_phenomenon import CyclicSievingPolynomial, CyclicSievingCheck |
| 166 | +from .cyclic_sieving_phenomenon import CyclicSievingPolynomial, CyclicSievingCheck |
165 | 167 |
|
166 |
| -from sidon_sets import sidon_sets |
| 168 | +from .sidon_sets import sidon_sets |
167 | 169 |
|
168 | 170 | # Puzzles
|
169 |
| -from knutson_tao_puzzles import KnutsonTaoPuzzleSolver |
| 171 | +from .knutson_tao_puzzles import KnutsonTaoPuzzleSolver |
170 | 172 |
|
171 | 173 | # Gelfand-Tsetlin patterns
|
172 |
| -from gelfand_tsetlin_patterns import GelfandTsetlinPattern, GelfandTsetlinPatterns |
| 174 | +from .gelfand_tsetlin_patterns import GelfandTsetlinPattern, GelfandTsetlinPatterns |
173 | 175 |
|
174 | 176 | # Finite State Machines (Automaton, Transducer)
|
175 | 177 | lazy_import('sage.combinat.finite_state_machine',
|
176 | 178 | ['Automaton', 'Transducer', 'FiniteStateMachine'])
|
177 | 179 | lazy_import('sage.combinat.finite_state_machine_generators',
|
178 | 180 | ['automata', 'transducers'])
|
179 | 181 | # Binary Recurrence Sequences
|
180 |
| -from binary_recurrence_sequences import BinaryRecurrenceSequence |
| 182 | +from .binary_recurrence_sequences import BinaryRecurrenceSequence |
181 | 183 |
|
182 | 184 | # Six Vertex Model
|
183 | 185 | lazy_import('sage.combinat.six_vertex_model', 'SixVertexModel')
|
|
0 commit comments