sage.{algebras,combinat,matroids}: Replace imports from sage.*.all for namespace packages

src/sage/algebras/affine_nil_temperley_lieb.py

@@ -7,7 +7,7 @@
 #  Distributed under the terms of the GNU General Public License (GPL)
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
-from sage.categories.all import AlgebrasWithBasis
+from sage.categories.algebras_with_basis import AlgebrasWithBasis
 from sage.combinat.root_system.cartan_type import CartanType
 from sage.combinat.root_system.weyl_group import WeylGroup
 from sage.rings.ring import Ring

src/sage/algebras/cluster_algebra.py

@@ -354,7 +354,7 @@
 
 from copy import copy
 
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from sage.categories.homset import Hom
 from sage.categories.morphism import SetMorphism
 from sage.categories.rings import Rings

src/sage/algebras/free_algebra.py

@@ -149,7 +149,7 @@
 
 from sage.structure.factory import UniqueFactory
 from sage.misc.cachefunc import cached_method
-from sage.all import PolynomialRing
+from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
 from sage.rings.ring import Algebra
 from sage.categories.algebras_with_basis import AlgebrasWithBasis
 from sage.combinat.free_module import CombinatorialFreeModule
@@ -282,7 +282,7 @@ def create_key(self, base_ring, arg1=None, arg2=None,
             PolRing = PolynomialRing(base_ring, *args, **kwds)
             if degrees is None:
                 return (PolRing,)
-            from sage.all import TermOrder
+            from sage.rings.polynomial.term_order import TermOrder
             T = TermOrder(PolRing.term_order(), PolRing.ngens() + 1)
             varnames = list(PolRing.variable_names())
             newname = 'x'

src/sage/algebras/free_algebra_quotient.py

@@ -357,7 +357,7 @@ def hamilton_quatalg(R):
     """
     n = 3
     from sage.algebras.free_algebra import FreeAlgebra
-    from sage.matrix.all import MatrixSpace
+    from sage.matrix.matrix_space import MatrixSpace
     A = FreeAlgebra(R, n, 'i')
     F = A.monoid()
     i, j, k = F.gens()

src/sage/algebras/group_algebra.py

@@ -35,8 +35,8 @@
 #                  http://www.gnu.org/licenses/
 #*****************************************************************************
 
-from sage.rings.all import IntegerRing
-from sage.categories.all import Rings
+from sage.rings.integer_ring import IntegerRing
+from sage.categories.rings import Rings
 from sage.categories.magmas import Magmas
 from sage.categories.additive_magmas import AdditiveMagmas
 from sage.categories.sets_cat import Sets

src/sage/algebras/hecke_algebras/ariki_koike_algebra.py

@@ -540,7 +540,7 @@ def dimension(self):
                     sage: LT.dimension()
                     29160
                 """
-                from sage.arith.all import factorial
+                from sage.arith.misc import factorial
                 return self._r**self._n * factorial(self._n)
 
             def some_elements(self):

src/sage/algebras/iwahori_hecke_algebra.py

@@ -30,10 +30,12 @@
 from sage.structure.parent import Parent
 from sage.structure.unique_representation import UniqueRepresentation
 from sage.categories.realizations import Realizations, Category_realization_of_parent
-from sage.categories.all import AlgebrasWithBasis, FiniteDimensionalAlgebrasWithBasis, CoxeterGroups
+from sage.categories.algebras_with_basis import AlgebrasWithBasis
+from sage.categories.finite_dimensional_algebras_with_basis import FiniteDimensionalAlgebrasWithBasis
+from sage.categories.coxeter_groups import CoxeterGroups
 from sage.rings.integer_ring import ZZ
 from sage.rings.polynomial.laurent_polynomial_ring import LaurentPolynomialRing
-from sage.arith.all import is_square
+from sage.arith.misc import is_square
 from sage.combinat.root_system.coxeter_group import CoxeterGroup
 from sage.sets.family import Family
 from sage.combinat.free_module import CombinatorialFreeModule

src/sage/algebras/lie_algebras/bch.py

@@ -20,7 +20,7 @@
 from sage.arith.misc import bernoulli
 from sage.categories.lie_algebras import LieAlgebras
 from sage.combinat.integer_vector import IntegerListsLex
-from sage.arith.all import factorial
+from sage.arith.misc import factorial
 from sage.rings.rational_field import QQ
 from sage.structure.element import canonical_coercion
 

src/sage/algebras/lie_algebras/free_lie_algebra.py

@@ -265,7 +265,7 @@ def graded_dimension(self, k):
         """
         if k == 0:
             return 0
-        from sage.arith.all import moebius
+        from sage.arith.misc import moebius
         s = len(self.lie_algebra_generators())
         k = ZZ(k) # Make sure we have something that is in ZZ
         return sum(moebius(d) * s**(k // d) for d in k.divisors()) // k

src/sage/algebras/lie_conformal_algebras/lie_conformal_algebra_element.py

@@ -14,7 +14,7 @@
 # (at your option) any later version.
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
-from sage.arith.all import factorial
+from sage.arith.misc import factorial
 from sage.misc.misc_c import prod
 from sage.misc.repr import repr_lincomb
 from sage.misc.latex import latex

src/sage/algebras/lie_conformal_algebras/lie_conformal_algebra_with_structure_coefs.py

@@ -17,7 +17,7 @@
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from sage.sets.family import Family
 from .lie_conformal_algebra_element import LCAStructureCoefficientsElement
 from sage.categories.lie_conformal_algebras import LieConformalAlgebras

src/sage/algebras/quatalg/quaternion_algebra.py

@@ -35,9 +35,14 @@
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
-from sage.arith.all import (hilbert_conductor_inverse, hilbert_conductor,
-                            factor, gcd, kronecker_symbol, valuation)
-from sage.rings.all import RR, Integer
+from sage.arith.misc import (hilbert_conductor_inverse,
+                             hilbert_conductor,
+                             factor,
+                             gcd,
+                             kronecker as kronecker_symbol,
+                             valuation)
+from sage.rings.real_mpfr import RR
+from sage.rings.integer import Integer
 from sage.rings.integer_ring import ZZ
 from sage.rings.rational import Rational
 from sage.rings.finite_rings.finite_field_constructor import GF

src/sage/algebras/schur_algebra.py

@@ -41,7 +41,7 @@
 from sage.combinat.sf.sf import SymmetricFunctions
 from sage.combinat.symmetric_group_algebra import SymmetricGroupAlgebra
 from sage.combinat.tableau import SemistandardTableaux
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from sage.matrix.constructor import Matrix
 from sage.misc.cachefunc import cached_method
 from sage.misc.flatten import flatten

src/sage/algebras/shuffle_algebra.py

@@ -972,7 +972,7 @@ def expansion_on_basis(self, w):
             sage: S.expansion_on_basis(Word('abab'))
             2*B[aabb] + B[abab]
         """
-        from sage.arith.all import factorial
+        from sage.arith.misc import factorial
         if not w:
             return self._alg.one()
         if len(w) == 1:

src/sage/algebras/steenrod/steenrod_algebra.py

@@ -455,7 +455,9 @@
 from sage.combinat.free_module import CombinatorialFreeModule
 from sage.misc.lazy_attribute import lazy_attribute
 from sage.misc.cachefunc import cached_method
-from sage.categories.all import ModulesWithBasis, tensor, Hom
+from sage.categories.modules_with_basis import ModulesWithBasis
+from sage.categories.tensor import tensor
+from sage.categories.homset import Hom
 
 ######################################################
 # the main class
@@ -584,7 +586,7 @@ def __init__(self, p=2, basis='milnor', **kwds):
             sage: A1 == SteenrodAlgebra(2, profile=[2,1], basis='pst')
             False
         """
-        from sage.arith.all import is_prime
+        from sage.arith.misc import is_prime
         from sage.categories.super_hopf_algebras_with_basis import SuperHopfAlgebrasWithBasis
         from sage.categories.infinite_enumerated_sets import InfiniteEnumeratedSets
         from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets

src/sage/algebras/steenrod/steenrod_algebra_mult.py

@@ -611,8 +611,9 @@ def multinomial_odd(list,p):
         sage: multinomial_odd([1,2,4], 107)
         105
     """
-    from sage.rings.all import GF, Integer
-    from sage.arith.all import binomial
+    from sage.rings.finite_rings.finite_field_constructor import FiniteField as GF
+    from sage.rings.integer import Integer
+    from sage.arith.misc import binomial
     n = sum(list)
     answer = 1
     F = GF(p)

src/sage/combinat/affine_permutation.py

@@ -23,7 +23,7 @@
 from sage.rings.integer_ring import ZZ
 
 from sage.groups.perm_gps.permgroup_named import SymmetricGroup
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from sage.combinat.root_system.cartan_type import CartanType
 from sage.combinat.root_system.weyl_group import WeylGroup
 from sage.combinat.composition import Composition

src/sage/combinat/alternating_sign_matrix.py

@@ -46,7 +46,7 @@
 from sage.modules.free_module_element import zero_vector
 from sage.misc.cachefunc import cached_method
 from sage.rings.integer_ring import ZZ
-from sage.arith.all import factorial
+from sage.arith.misc import factorial
 from sage.rings.integer import Integer
 from sage.combinat.posets.lattices import LatticePoset
 from sage.combinat.gelfand_tsetlin_patterns import GelfandTsetlinPatternsTopRow

src/sage/combinat/baxter_permutations.py

@@ -232,7 +232,7 @@ def cardinality(self):
         """
         if self._n == 0:
             return 1
-        from sage.arith.all import binomial
+        from sage.arith.misc import binomial
         return sum((binomial(self._n + 1, k) *
                     binomial(self._n + 1, k + 1) *
                     binomial(self._n + 1, k + 2)) //

src/sage/combinat/binary_recurrence_sequences.py

@@ -65,7 +65,8 @@
 from sage.rings.finite_rings.integer_mod_ring import Integers
 from sage.rings.finite_rings.finite_field_constructor import GF
 from sage.rings.integer import Integer
-from sage.arith.all import lcm, next_prime, is_prime, next_prime_power, legendre_symbol
+from sage.arith.functions import lcm
+from sage.arith.misc import is_prime, next_prime, next_prime_power, legendre_symbol
 from sage.functions.log import log
 from sage.misc.functional import sqrt
 

src/sage/combinat/blob_algebra.py

@@ -24,7 +24,7 @@
 #from sage.misc.inherit_comparison import InheritComparisonClasscallMetaclass
 from sage.misc.cachefunc import cached_method
 from sage.misc.misc import powerset
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
 from sage.categories.algebras import Algebras
 from sage.combinat.diagram_algebras import (TemperleyLiebDiagrams, diagram_latex,

src/sage/combinat/cluster_algebra_quiver/cluster_seed.py

@@ -43,13 +43,13 @@
 from sage.rings.fraction_field import FractionField
 from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
 from sage.rings.fraction_field_element import FractionFieldElement
-from sage.sets.all import Set
+from sage.sets.set import Set
 from sage.graphs.digraph import DiGraph
 from sage.combinat.cluster_algebra_quiver.quiver_mutation_type import QuiverMutationType_Irreducible, QuiverMutationType_Reducible
 from sage.combinat.cluster_algebra_quiver.mutation_type import is_mutation_finite
 from random import randint
 from sage.misc.misc_c import prod
-from sage.matrix.all import identity_matrix
+from sage.matrix.special import identity_matrix
 from sage.matrix.constructor import matrix
 from sage.combinat.cluster_algebra_quiver.quiver import ClusterQuiver
 from sage.rings.integer import Integer
@@ -3111,7 +3111,7 @@ def principal_extension(self):
             sage: T2 == T
             True
         """
-        from sage.matrix.all import identity_matrix
+        from sage.matrix.special import identity_matrix
         if self._m != 0:
             raise ValueError("the b-matrix is not square")
         M = self._M.stack(identity_matrix(self._n))
@@ -4600,7 +4600,7 @@ def _bino(n, k):
         0
     """
     if n >= 0:
-        from sage.arith.all import binomial
+        from sage.arith.misc import binomial
         return binomial(n, k)
     else:
         return 0

src/sage/combinat/cluster_algebra_quiver/quiver.py

@@ -558,7 +558,8 @@ def plot(self, circular=True, center=(0, 0), directed=True, mark=None,
         """
         from sage.plot.colors import rainbow
         from sage.graphs.graph_generators import GraphGenerators
-        from sage.all import e, pi, I
+        from sage.symbolic.constants import e, pi
+        from sage.rings.imaginary_unit import I
         graphs = GraphGenerators()
         # returns positions for graph vertices on two concentric cycles with radius 1 and 2
 

src/sage/combinat/cluster_algebra_quiver/quiver_mutation_type.py

@@ -27,7 +27,7 @@
 from sage.rings.infinity import infinity
 from sage.graphs.digraph import DiGraph
 from sage.graphs.graph import Graph
-from sage.arith.all import binomial, euler_phi
+from sage.arith.misc import binomial, euler_phi
 from sage.misc.misc_c import prod
 from sage.matrix.constructor import matrix
 

src/sage/combinat/combinat.py

@@ -167,11 +167,11 @@
 from __future__ import annotations
 from typing import Iterator
 
+from sage.arith.misc import bernoulli, factorial
 from sage.rings.integer_ring import ZZ
 from sage.rings.rational_field import QQ
 from sage.rings.integer import Integer
 from sage.rings.infinity import infinity
-from sage.arith.all import bernoulli, factorial
 from sage.rings.polynomial.polynomial_element import Polynomial
 from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
 from sage.libs.pari.all import pari

src/sage/combinat/combination.py

@@ -28,7 +28,7 @@
 
 from sage.rings.integer import Integer
 from sage.rings.integer_ring import ZZ
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from .integer_vector import IntegerVectors
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
 from sage.structure.parent import Parent

src/sage/combinat/composition_signed.py

@@ -20,7 +20,7 @@
 from sage.rings.integer_ring import ZZ
 from .composition import Compositions_n, Composition
 from sage.rings.integer import Integer
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 
 
 class SignedCompositions(Compositions_n):

src/sage/combinat/crystals/alcove_path.py

@@ -31,7 +31,7 @@
 from sage.graphs.digraph import DiGraph
 from sage.combinat.root_system.cartan_type import CartanType
 from sage.combinat.root_system.root_system import RootSystem
-from sage.all import vector
+from sage.modules.free_module_element import free_module_element as vector
 from sage.rings.integer import Integer
 from sage.combinat.root_system.weyl_group import WeylGroup
 from sage.misc.misc_c import prod

src/sage/combinat/cyclic_sieving_phenomenon.py

@@ -26,7 +26,7 @@
 # ****************************************************************************
 from __future__ import annotations
 from sage.rings.integer_ring import ZZ
-from sage.arith.all import lcm
+from sage.arith.functions import lcm
 from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
 
 

src/sage/combinat/decorated_permutation.py

@@ -24,7 +24,7 @@
 from sage.structure.unique_representation import UniqueRepresentation
 from sage.structure.parent import Parent
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
-from sage.arith.all import factorial
+from sage.arith.misc import factorial
 from sage.rings.integer import Integer
 from sage.combinat.permutation import Permutations
 from sage.combinat.subset import Subsets

src/sage/combinat/descent_algebra.py

@@ -19,7 +19,7 @@
 from sage.structure.unique_representation import UniqueRepresentation
 from sage.categories.algebras import Algebras
 from sage.categories.realizations import Realizations, Category_realization_of_parent
-from sage.categories.all import FiniteDimensionalAlgebrasWithBasis
+from sage.categories.finite_dimensional_algebras_with_basis import FiniteDimensionalAlgebrasWithBasis
 from sage.rings.integer_ring import ZZ
 from sage.rings.rational_field import QQ
 from sage.arith.misc import factorial

src/sage/combinat/designs/bibd.py

@@ -53,7 +53,7 @@
 from sage.categories.sets_cat import EmptySetError
 from sage.misc.unknown import Unknown
 from .design_catalog import transversal_design  # type:ignore
-from sage.arith.all import binomial, is_prime_power
+from sage.arith.misc import binomial, is_prime_power
 from .group_divisible_designs import GroupDivisibleDesign
 from .designs_pyx import is_pairwise_balanced_design
 

src/sage/combinat/designs/block_design.py

@@ -52,13 +52,13 @@
 # (at your option) any later version.
 #                  https://www.gnu.org/licenses/
 #*****************************************************************************
+from sage.arith.misc import binomial, integer_floor, is_prime_power
+from sage.categories.sets_cat import EmptySetError
 from sage.modules.free_module import VectorSpace
 from sage.rings.integer import Integer
 from sage.rings.integer_ring import ZZ
-from sage.arith.all import binomial, integer_floor, is_prime_power
 from .incidence_structures import IncidenceStructure
 from sage.rings.finite_rings.finite_field_constructor import FiniteField
-from sage.categories.sets_cat import EmptySetError
 from sage.misc.unknown import Unknown
 from sage.matrix.matrix_space import MatrixSpace
 from sage.libs.gap.libgap import libgap

src/sage/combinat/designs/covering_design.py

@@ -51,7 +51,7 @@
 from sage.misc.sage_eval import sage_eval
 from sage.structure.sage_object import SageObject
 from sage.rings.rational import Rational
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from sage.combinat.combination import Combinations
 from sage.combinat.designs.incidence_structures import IncidenceStructure
 from sage.cpython.string import bytes_to_str

src/sage/combinat/designs/difference_matrices.py

@@ -10,11 +10,11 @@
 ---------
 """
 
+from sage.arith.misc import divisors, is_prime_power
 from sage.misc.unknown import Unknown
 from sage.misc.cachefunc import cached_function
 from sage.categories.sets_cat import EmptySetError
 from sage.rings.finite_rings.finite_field_constructor import FiniteField
-from sage.arith.all import is_prime_power, divisors
 from .designs_pyx import is_difference_matrix
 from .database import DM as DM_constructions