passagemath-combinat 10.6.42__cp314-cp314t-win_amd64.whl

sage/combinat/species/recursive_species.py

@@ -0,0 +1,476 @@
+# sage_setup: distribution = sagemath-combinat
+"""
+Recursive species
+"""
+# ****************************************************************************
+#       Copyright (C) 2008 Mike Hansen <mhansen@gmail.com>,
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#
+#    This code is distributed in the hope that it will be useful,
+#    but WITHOUT ANY WARRANTY; without even the implied warranty of
+#    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+#    General Public License for more details.
+#
+#  The full text of the GPL is available at:
+#
+#                  http://www.gnu.org/licenses/
+# ****************************************************************************
+from sage.combinat.species.species import GenericCombinatorialSpecies
+from sage.combinat.species.structure import SpeciesStructureWrapper
+from sage.rings.rational_field import QQ
+
+
+class CombinatorialSpeciesStructure(SpeciesStructureWrapper):
+    pass
+
+
+class CombinatorialSpecies(GenericCombinatorialSpecies):
+    def __init__(self, min=None):
+        """
+        EXAMPLES::
+
+            sage: F = CombinatorialSpecies()
+            sage: loads(dumps(F))
+            Combinatorial species
+
+        ::
+
+            sage: X = species.SingletonSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: L = CombinatorialSpecies()
+            sage: L.define(E+X*L)
+            sage: L.generating_series()[0:4]
+            [1, 1, 1, 1]
+            sage: LL = loads(dumps(L))
+            sage: LL.generating_series()[0:4]
+            [1, 1, 1, 1]
+        """
+        self._generating_series = {}
+        self._isotype_generating_series = {}
+        self._cycle_index_series = {}
+        GenericCombinatorialSpecies.__init__(self, min=min, max=None, weight=None)
+
+    _default_structure_class = CombinatorialSpeciesStructure
+
+    def __hash__(self):
+        """
+        EXAMPLES::
+
+            sage: hash(CombinatorialSpecies) #random
+            53751280
+
+        ::
+
+            sage: X = species.SingletonSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: L = CombinatorialSpecies()
+            sage: L.define(E+X*L)
+            sage: hash(L) #random
+            -826511807095108317
+        """
+        try:
+            return hash(('CombinatorialSpecies', id(self._reference)))
+        except AttributeError:
+            return hash('CombinatorialSpecies')
+
+    def __eq__(self, other):
+        """
+        TESTS::
+
+            sage: A = species.CombinatorialSpecies()
+            sage: B = species.CombinatorialSpecies()
+            sage: A == B
+            False
+            sage: X = species.SingletonSpecies()
+            sage: A.define(X+A*A)
+            sage: B.define(X+B*B)
+            sage: A == B
+            True
+
+            sage: C = species.CombinatorialSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: C.define(E+X*C*C)
+            sage: A == C
+            False
+        """
+        if not isinstance(other, CombinatorialSpecies):
+            return False
+        if not hasattr(self, "_reference"):
+            return False
+        if hasattr(self, '_computing_eq'):
+            return True
+
+        self._computing_eq = True
+        res = self._unique_info() == other._unique_info()
+        del self._computing_eq
+        return res
+
+    def __ne__(self, other):
+        """
+        Check whether ``self`` is not equal to ``other``.
+
+        EXAMPLES::
+
+            sage: A = species.CombinatorialSpecies()
+            sage: B = species.CombinatorialSpecies()
+            sage: A != B
+            True
+            sage: X = species.SingletonSpecies()
+            sage: A.define(X+A*A)
+            sage: B.define(X+B*B)
+            sage: A != B
+            False
+
+            sage: C = species.CombinatorialSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: C.define(E+X*C*C)
+            sage: A != C
+            True
+        """
+        return not (self == other)
+
+    def _unique_info(self):
+        """
+        Return a tuple which should uniquely identify the species.
+
+        EXAMPLES::
+
+            sage: F = CombinatorialSpecies()
+            sage: F._unique_info()
+            (<class 'sage.combinat.species.recursive_species.CombinatorialSpecies'>,)
+
+        ::
+
+            sage: X = species.SingletonSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: L = CombinatorialSpecies()
+            sage: L.define(E+X*L)
+            sage: L._unique_info()
+            (<class 'sage.combinat.species.recursive_species.CombinatorialSpecies'>,
+             <class 'sage.combinat.species.sum_species.SumSpecies'>,
+             None,
+             None,
+             1,
+             Empty set species,
+             Product of (Singleton species) and (Combinatorial species))
+        """
+        if hasattr(self, "_reference"):
+            return (self.__class__,) + self._reference._unique_info()
+        else:
+            return (self.__class__,)
+
+    def __getstate__(self):
+        """
+        EXAMPLES::
+
+            sage: X = species.SingletonSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: L = CombinatorialSpecies()
+            sage: L.define(E+X*L)
+            sage: L.__getstate__()
+            {'reference': Sum of (Empty set species) and (Product of (Singleton species) and (Combinatorial species))}
+        """
+        state = {}
+        if hasattr(self, '_reference'):
+            state['reference'] = self._reference
+        return state
+
+    def __setstate__(self, state):
+        """
+        EXAMPLES::
+
+            sage: X = species.SingletonSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: L = CombinatorialSpecies()
+            sage: L.define(E+X*L)
+            sage: state = L.__getstate__(); state
+            {'reference': Sum of (Empty set species) and (Product of (Singleton species) and (Combinatorial species))}
+            sage: L._reference = None
+            sage: L.__setstate__(state)
+            sage: L._reference
+            Sum of (Empty set species) and (Product of (Singleton species) and (Combinatorial species))
+        """
+        CombinatorialSpecies.__init__(self)
+        if 'reference' in state:
+            self.define(state['reference'])
+
+    def _structures(self, structure_class, labels):
+        """
+        EXAMPLES::
+
+            sage: F = CombinatorialSpecies()
+            sage: list(F._structures(F._default_structure_class, [1,2,3]))
+            Traceback (most recent call last):
+            ...
+            NotImplementedError
+        """
+        if not hasattr(self, "_reference"):
+            raise NotImplementedError
+        for s in self._reference.structures(labels):
+            yield structure_class(self, s)
+
+    def _isotypes(self, structure_class, labels):
+        """
+        EXAMPLES::
+
+            sage: F = CombinatorialSpecies()
+            sage: list(F._isotypes(F._default_structure_class, [1,2,3]))
+            Traceback (most recent call last):
+            ...
+            NotImplementedError
+        """
+        if not hasattr(self, "_reference"):
+            raise NotImplementedError
+        for s in self._reference.isotypes(labels):
+            yield structure_class(self, s)
+
+    def _gs(self, series_ring, base_ring):
+        """
+        EXAMPLES::
+
+            sage: F = CombinatorialSpecies()
+            sage: F.generating_series()
+            Uninitialized Lazy Series
+        """
+        if base_ring not in self._generating_series:
+            self._generating_series[base_ring] = series_ring.undefined(valuation=(0 if self._min is None else self._min))
+
+        res = self._generating_series[base_ring]
+        if hasattr(self, "_reference") and not hasattr(res, "_reference"):
+            res._reference = None
+            res.define(self._reference.generating_series(base_ring))
+        return res
+
+    def _itgs(self, series_ring, base_ring):
+        """
+        EXAMPLES::
+
+            sage: F = CombinatorialSpecies()
+            sage: F.isotype_generating_series()
+            Uninitialized Lazy Series
+        """
+        if base_ring not in self._isotype_generating_series:
+            self._isotype_generating_series[base_ring] = series_ring.undefined(valuation=(0 if self._min is None else self._min))
+
+        res = self._isotype_generating_series[base_ring]
+        if hasattr(self, "_reference") and not hasattr(res, "_reference"):
+            res._reference = None
+            res.define(self._reference.isotype_generating_series(base_ring))
+        return res
+
+    def _cis(self, series_ring, base_ring):
+        """
+        EXAMPLES::
+
+            sage: F = CombinatorialSpecies()
+            sage: F.cycle_index_series()                                                # needs sage.modules
+            Uninitialized Lazy Series
+        """
+        if base_ring not in self._cycle_index_series:
+            self._cycle_index_series[base_ring] = series_ring.undefined(valuation=(0 if self._min is None else self._min))
+
+        res = self._cycle_index_series[base_ring]
+        if hasattr(self, "_reference") and not hasattr(res, "_reference"):
+            res._reference = None
+            res.define(self._reference.cycle_index_series(base_ring))
+        return res
+
+    def weight_ring(self):
+        """
+        EXAMPLES::
+
+            sage: F = species.CombinatorialSpecies()
+            sage: F.weight_ring()
+            Rational Field
+
+        ::
+
+            sage: X = species.SingletonSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: L = CombinatorialSpecies()
+            sage: L.define(E+X*L)
+            sage: L.weight_ring()
+            Rational Field
+        """
+        if not hasattr(self, "_reference"):
+            return QQ
+
+        if hasattr(self, "_weight_ring_been_called"):
+            return QQ
+        else:
+            self._weight_ring_been_called = True
+            res = self._reference.weight_ring()
+            del self._weight_ring_been_called
+            return res
+
+    def define(self, x):
+        """
+        Define ``self`` to be equal to the combinatorial species ``x``.
+
+        This is used to define combinatorial species recursively. All of the
+        real work is done by calling the ``.set()`` method for each of the
+        series associated to ``self``.
+
+        EXAMPLES: The species of linear orders `L` can be recursively defined
+        by `L = 1 + X*L` where 1 represents the empty set species
+        and `X` represents the singleton species::
+
+            sage: X = species.SingletonSpecies()
+            sage: E = species.EmptySetSpecies()
+            sage: L = CombinatorialSpecies()
+            sage: L.define(E+X*L)
+            sage: L.generating_series()[0:4]
+            [1, 1, 1, 1]
+            sage: L.structures([1,2,3]).cardinality()
+            6
+            sage: L.structures([1,2,3]).list()
+            [1*(2*(3*{})),
+             1*(3*(2*{})),
+             2*(1*(3*{})),
+             2*(3*(1*{})),
+             3*(1*(2*{})),
+             3*(2*(1*{}))]
+
+        ::
+
+            sage: L = species.LinearOrderSpecies()
+            sage: L.generating_series()[0:4]
+            [1, 1, 1, 1]
+            sage: L.structures([1,2,3]).cardinality()
+            6
+            sage: L.structures([1,2,3]).list()
+            [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]
+
+        TESTS::
+
+            sage: A = CombinatorialSpecies()
+            sage: A.define(E+X*A*A)
+            sage: A.generating_series()[0:6]
+            [1, 1, 2, 5, 14, 42]
+            sage: A.generating_series().counts(6)
+            [1, 1, 4, 30, 336, 5040]
+            sage: len(A.structures([1,2,3,4]).list())
+            336
+            sage: A.isotype_generating_series()[0:6]
+            [1, 1, 2, 5, 14, 42]
+            sage: len(A.isotypes([1,2,3,4]).list())
+            14
+
+        ::
+
+            sage: A = CombinatorialSpecies(min=1)
+            sage: A.define(X+A*A)
+            sage: A.generating_series()[0:6]
+            [0, 1, 1, 2, 5, 14]
+            sage: A.generating_series().counts(6)
+            [0, 1, 2, 12, 120, 1680]
+            sage: len(A.structures([1,2,3]).list())
+            12
+            sage: A.isotype_generating_series()[0:6]
+            [0, 1, 1, 2, 5, 14]
+            sage: len(A.isotypes([1,2,3,4]).list())
+            5
+
+        ::
+
+            sage: X2 = X*X
+            sage: X5 = X2*X2*X
+            sage: A = CombinatorialSpecies(min=1)
+            sage: B = CombinatorialSpecies(min=1)
+            sage: C = CombinatorialSpecies(min=1)
+            sage: A.define(X5+B*B)
+            sage: B.define(X5+C*C)
+            sage: C.define(X2+C*C+A*A)
+            sage: A.generating_series()[0:15]
+            [0, 0, 0, 0, 0, 1, 0, 0, 1, 2, 5, 4, 14, 10, 48]
+            sage: B.generating_series()[0:15]
+            [0, 0, 0, 0, 1, 1, 2, 0, 5, 0, 14, 0, 44, 0, 138]
+            sage: C.generating_series()[0:15]
+            [0, 0, 1, 0, 1, 0, 2, 0, 5, 0, 15, 0, 44, 2, 142]
+
+        ::
+
+            sage: F = CombinatorialSpecies()
+            sage: F.define(E+X+(X*F+X*X*F))
+            sage: F.generating_series().counts(10)
+            [1, 2, 6, 30, 192, 1560, 15120, 171360, 2217600, 32296320]
+            sage: F.generating_series()[0:10]
+            [1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
+            sage: F.isotype_generating_series()[0:10]
+            [1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
+
+        Check that :issue:`35071` is fixed::
+
+            sage: X = species.SingletonSpecies()
+            sage: E = species.SetSpecies(max=3)
+            sage: B = species.CombinatorialSpecies(min=1)
+            sage: B.define(X*E(B))
+            sage: B.generating_series()
+            z + z^2 + 3/2*z^3 + 5/2*z^4 + 9/2*z^5 + 17/2*z^6 + 133/8*z^7 + O(z^8)
+        """
+        if not isinstance(x, GenericCombinatorialSpecies):
+            raise TypeError("x must be a combinatorial species")
+
+        if self.__class__ is not CombinatorialSpecies:
+            raise TypeError("only undefined combinatorial species can be set")
+
+        self._reference = x
+
+    def _add_to_digraph(self, d):
+        """
+        Add this species as a vertex to the digraph d along with any
+        'children' of this species.
+
+        Note that to avoid infinite recursion, we just return if this
+        species already occurs in the digraph d.
+
+        EXAMPLES::
+
+            sage: d = DiGraph(multiedges=True)                                          # needs sage.graphs
+            sage: X = species.SingletonSpecies()
+            sage: B = species.CombinatorialSpecies()
+            sage: B.define(X+B*B)
+            sage: B._add_to_digraph(d); d                                               # needs sage.graphs
+            Multi-digraph on 4 vertices
+
+        TESTS::
+
+            sage: C = species.CombinatorialSpecies()
+            sage: C._add_to_digraph(d)                                                  # needs sage.graphs
+            Traceback (most recent call last):
+            ...
+            NotImplementedError
+        """
+        if self in d:
+            return
+        try:
+            d.add_edge(self, self._reference)
+            self._reference._add_to_digraph(d)
+        except AttributeError:
+            raise NotImplementedError
+
+    def _equation(self, var_mapping):
+        """
+        Return the right hand side of an algebraic equation satisfied by
+        this species. This is a utility function called by the
+        algebraic_equation_system method.
+
+        EXAMPLES::
+
+            sage: C = species.CombinatorialSpecies()
+            sage: C.algebraic_equation_system()                                         # needs sage.graphs
+            Traceback (most recent call last):
+            ...
+            NotImplementedError
+
+        ::
+
+            sage: B = species.BinaryTreeSpecies()
+            sage: B.algebraic_equation_system()                                         # needs sage.graphs
+            [-node3^2 + node1, -node1 + node3 + (-z)]
+        """
+        try:
+            return var_mapping[self._reference]
+        except AttributeError:
+            raise NotImplementedError

sage/combinat/species/set_species.py

@@ -0,0 +1,192 @@
+# sage_setup: distribution = sagemath-combinat
+"""
+Set species
+"""
+# ****************************************************************************
+#       Copyright (C) 2008 Mike Hansen <mhansen@gmail.com>,
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#
+#    This code is distributed in the hope that it will be useful,
+#    but WITHOUT ANY WARRANTY; without even the implied warranty of
+#    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+#    General Public License for more details.
+#
+#  The full text of the GPL is available at:
+#
+#                  http://www.gnu.org/licenses/
+# ****************************************************************************
+
+from .species import GenericCombinatorialSpecies
+from sage.combinat.species.structure import GenericSpeciesStructure
+from sage.combinat.species.misc import accept_size
+from sage.structure.unique_representation import UniqueRepresentation
+from sage.arith.misc import factorial
+
+
+class SetSpeciesStructure(GenericSpeciesStructure):
+    def __repr__(self):
+        """
+        EXAMPLES::
+
+            sage: S = species.SetSpecies()
+            sage: a = S.structures(["a","b","c"]).random_element(); a
+            {'a', 'b', 'c'}
+        """
+        s = GenericSpeciesStructure.__repr__(self)
+        return "{"+s[1:-1]+"}"
+
+    def canonical_label(self):
+        """
+        EXAMPLES::
+
+            sage: S = species.SetSpecies()
+            sage: a = S.structures(["a","b","c"]).random_element(); a
+            {'a', 'b', 'c'}
+            sage: a.canonical_label()
+            {'a', 'b', 'c'}
+        """
+        rng = list(range(1, len(self._labels) + 1))
+        return SetSpeciesStructure(self.parent(), self._labels, rng)
+
+    def transport(self, perm):
+        """
+        Return the transport of this set along the permutation perm.
+
+        EXAMPLES::
+
+            sage: F = species.SetSpecies()
+            sage: a = F.structures(["a", "b", "c"]).random_element(); a
+            {'a', 'b', 'c'}
+            sage: p = PermutationGroupElement((1,2))                                    # needs sage.groups
+            sage: a.transport(p)                                                        # needs sage.groups
+            {'a', 'b', 'c'}
+        """
+        return self
+
+    def automorphism_group(self):
+        """
+        Return the group of permutations whose action on this set leave it
+        fixed. For the species of sets, there is only one isomorphism
+        class, so every permutation is in its automorphism group.
+
+        EXAMPLES::
+
+            sage: F = species.SetSpecies()
+            sage: a = F.structures(["a", "b", "c"]).random_element(); a
+            {'a', 'b', 'c'}
+            sage: a.automorphism_group()                                                # needs sage.groups
+            Symmetric group of order 3! as a permutation group
+        """
+        from sage.groups.perm_gps.permgroup_named import SymmetricGroup
+        return SymmetricGroup(max(1,len(self._labels)))
+
+
+class SetSpecies(GenericCombinatorialSpecies, UniqueRepresentation):
+    @staticmethod
+    @accept_size
+    def __classcall__(cls, *args, **kwds):
+        """
+        EXAMPLES::
+
+            sage: E = species.SetSpecies(); E
+            Set species
+        """
+        return super().__classcall__(cls, *args, **kwds)
+
+    def __init__(self, min=None, max=None, weight=None):
+        """
+        Return the species of sets.
+
+        EXAMPLES::
+
+            sage: E = species.SetSpecies()
+            sage: E.structures([1,2,3]).list()
+            [{1, 2, 3}]
+            sage: E.isotype_generating_series()[0:4]
+            [1, 1, 1, 1]
+
+            sage: S = species.SetSpecies()
+            sage: c = S.generating_series()[0:3]
+            sage: S._check()
+            True
+            sage: S == loads(dumps(S))
+            True
+        """
+        GenericCombinatorialSpecies.__init__(self, min=min, max=max, weight=weight)
+        self._name = "Set species"
+
+    _default_structure_class = SetSpeciesStructure
+
+    def _structures(self, structure_class, labels):
+        """
+        EXAMPLES::
+
+            sage: S = species.SetSpecies()
+            sage: S.structures([1,2,3]).list()
+            [{1, 2, 3}]
+        """
+        n = len(labels)
+        yield structure_class(self, labels, range(1,n+1))
+
+    _isotypes = _structures
+
+    def _gs_callable(self, base_ring, n):
+        r"""
+        The generating series for the species of sets is given by
+        `e^x`.
+
+        EXAMPLES::
+
+            sage: S = species.SetSpecies()
+            sage: g = S.generating_series()
+            sage: [g.coefficient(i) for i in range(10)]
+            [1, 1, 1/2, 1/6, 1/24, 1/120, 1/720, 1/5040, 1/40320, 1/362880]
+            sage: [g.count(i) for i in range(10)]
+            [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
+        """
+        return base_ring(self._weight / factorial(n))
+
+    def _itgs_list(self, base_ring, n):
+        r"""
+        The isomorphism type generating series for the species of sets is
+        `\frac{1}{1-x}`.
+
+        EXAMPLES::
+
+            sage: S = species.SetSpecies()
+            sage: g = S.isotype_generating_series()
+            sage: g[0:10]
+            [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
+            sage: [g.count(i) for i in range(10)]
+            [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
+        """
+        return base_ring(self._weight)
+
+    def _cis(self, series_ring, base_ring):
+        r"""
+        The cycle index series for the species of sets is given by
+        `exp\( \sum_{n=1}{\infty} = \frac{x_n}{n} \)`.
+
+        EXAMPLES::
+
+            sage: S = species.SetSpecies()
+            sage: g = S.cycle_index_series()                                            # needs sage.modules
+            sage: g[0:5]                                                                # needs sage.modules
+            [p[],
+             p[1],
+             1/2*p[1, 1] + 1/2*p[2],
+             1/6*p[1, 1, 1] + 1/2*p[2, 1] + 1/3*p[3],
+             1/24*p[1, 1, 1, 1] + 1/4*p[2, 1, 1] + 1/8*p[2, 2] + 1/3*p[3, 1] + 1/4*p[4]]
+        """
+        from .generating_series import ExponentialCycleIndexSeries
+        res = ExponentialCycleIndexSeries(base_ring)
+
+        if self.is_weighted():
+            res *= self._weight
+
+        return res
+
+
+#Backward compatibility
+SetSpecies_class = SetSpecies