passagemath-combinat 10.6.42__cp314-cp314-musllinux_1_2_x86_64.whl

sage/combinat/superpartition.py

@@ -0,0 +1,1154 @@
+# sage_setup: distribution = sagemath-combinat
+r"""
+Super partitions
+
+A super partition of size `n` and fermionic sector `m` is a
+pair consisting of a strict partition of some integer `r` of
+length `m` (that may end in a `0`) and an integer partition of
+`n - r`.
+
+This module provides tools for manipulating super partitions.
+
+Super partitions are the indexing set for symmetric functions in
+super space.
+
+Super partitions may be input in two different formats: one as a pair
+consisting of fermionic (strict partition) and a bosonic (partition) part
+and the other as a list of integer values where the negative entries come
+first and are listed in strict order followed by the positive values in
+weak order.
+
+A super partition is displayed as two partitions separated by a semicolon
+as a default.  Super partitions may also be displayed as a weakly increasing
+sequence of integers that are strict if the numbers are not positive.
+
+These combinatorial objects index the space of symmetric polynomials in
+two sets of variables, one commuting and one anti-commuting, and they
+are known as symmetric functions in super space (hence the origin of the
+name super partitions).
+
+EXAMPLES::
+
+    sage: SuperPartitions()
+    Super Partitions
+    sage: SuperPartitions(2)
+    Super Partitions of 2
+    sage: SuperPartitions(2).cardinality()
+    8
+    sage: SuperPartitions(4,2)
+    Super Partitions of 4 and of fermionic sector 2
+    sage: [[2,0],[1,1]] in SuperPartitions(4,2)
+    True
+    sage: [[1,0],[1,1]] in SuperPartitions(4,2)
+    False
+    sage: [[1,0],[2,1]] in SuperPartitions(4)
+    True
+    sage: [[1,0],[2,2,1]] in SuperPartitions(4)
+    False
+    sage: [[1,0],[2,1]] in SuperPartitions()
+    True
+    sage: [[1,1],[2,1]] in SuperPartitions()
+    False
+    sage: [-2, 0, 1, 1] in SuperPartitions(4,2)
+    True
+    sage: [-1, 0, 1, 1] in SuperPartitions(4,2)
+    False
+    sage: [-2, -2, 2, 1] in SuperPartitions(7,2)
+    False
+
+REFERENCES:
+
+- [JL2016]_
+
+AUTHORS:
+
+- Mike Zabrocki
+"""
+
+# ****************************************************************************
+#       Copyright (C) 2018 Mike Zabrocki <zabrocki at mathstat.yorku.ca>
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 2 of the License, or
+# (at your option) any later version.
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
+from __future__ import annotations
+from functools import reduce
+from itertools import chain
+
+from sage.structure.list_clone import ClonableArray
+from sage.structure.unique_representation import UniqueRepresentation
+from sage.structure.parent import Parent
+from sage.structure.richcmp import richcmp, richcmp_method
+from sage.combinat.partition import Partition, Partitions, _Partitions
+from sage.combinat.composition import Composition
+from sage.categories.enumerated_sets import EnumeratedSets
+from sage.rings.integer import Integer
+from sage.structure.global_options import GlobalOptions
+from sage.rings.integer_ring import ZZ
+from sage.misc.inherit_comparison import InheritComparisonClasscallMetaclass
+
+
+@richcmp_method
+class SuperPartition(ClonableArray,
+                     metaclass=InheritComparisonClasscallMetaclass):
+    r"""
+    A super partition.
+
+    A *super partition* of size `n` and fermionic sector `m` is a
+    pair consisting of a strict partition of some integer `r` of
+    length `m` (that may end in a `0`) and an integer partition of
+    `n - r`.
+
+    EXAMPLES::
+
+        sage: sp = SuperPartition([[1,0],[2,2,1]]); sp
+        [1, 0; 2, 2, 1]
+        sage: sp[0]
+        (1, 0)
+        sage: sp[1]
+        (2, 2, 1)
+        sage: sp.fermionic_degree()
+        2
+        sage: sp.bosonic_degree()
+        6
+        sage: sp.length()
+        5
+        sage: sp.conjugate()
+        [4, 2; ]
+    """
+    @staticmethod
+    def __classcall_private__(cls, lst):
+        r"""
+        Construct a superpartition in the correct parent.
+
+        EXAMPLES::
+
+            sage: SuperPartition([[1],[1]]).parent()
+            Super Partitions
+            sage: SuperPartition([[1],[1]])
+            [1; 1]
+            sage: SuperPartition([-1, 1])
+            [1; 1]
+            sage: SuperPartition([[1,1],[1]])
+            Traceback (most recent call last):
+            ...
+            ValueError: [[1, 1], [1]] not in Super Partitions
+            sage: SuperPartition([-1,1])
+            [1; 1]
+            sage: SuperPartition([])
+            [; ]
+
+            sage: SP = SuperPartitions(8,4)([[3,2,1,0],[2]])
+            sage: SuperPartition(SP) is SP
+            True
+        """
+        if isinstance(lst, SuperPartition):
+            return lst
+        SPs = SuperPartitions()
+        if not lst:
+            return SPs([[], []])
+        elif isinstance(lst[0], (list, tuple)):
+            return SPs([[Integer(a) for a in lst[0]],
+                        [Integer(a) for a in lst[1]]])
+        else:
+            return SPs([[-a for a in lst if a <= 0],
+                        [a for a in lst if a > 0]])
+
+    def __init__(self, parent, lst, check=True, immutable=True):
+        """
+        Initialize ``self``.
+
+        EXAMPLES::
+
+            sage: SP = SuperPartition([[1],[1]])
+            sage: TestSuite(SP).run()
+        """
+        if check and lst not in parent:
+            raise ValueError("%s not in %s" % (lst, parent))
+        lst = [tuple(lst[0]), tuple(lst[1])]
+        ClonableArray.__init__(self, parent, lst, False, immutable)
+
+    def check(self):
+        """
+        Check that ``self`` is a valid super partition.
+
+        EXAMPLES::
+
+            sage: SP = SuperPartition([[1],[1]])
+            sage: SP.check()
+        """
+        if self not in self.parent():
+            raise ValueError("%s not in %s" % (self, self.parent()))
+
+    def __richcmp__(self, other, op) -> bool:
+        r"""
+        Check whether ``self`` is equal to ``other``.
+
+        .. TODO::
+
+            This overwrites the equality check of
+            :class:`~sage.structure.list_clone.ClonableArray`
+            in order to circumvent the coercion framework.
+            Eventually this should be solved more elegantly.
+
+            For now, two elements are compared by their defining lists.
+        """
+        if isinstance(other, SuperPartition):
+            return richcmp(list(self), list(other), op)
+        else:
+            return richcmp(list(self), other, op)
+
+    def _repr_(self) -> str:
+        r"""
+        Return a string representation of ``self``.
+
+        A super partition is represented by the antisymmetric and symmetric
+        parts separated by a semicolon.
+
+        EXAMPLES::
+
+            sage: SuperPartition([[1],[1]])
+            [1; 1]
+            sage: SuperPartition([[],[1]])
+            [; 1]
+            sage: SuperPartition([])
+            [; ]
+            sage: SuperPartitions.options.display = "list"
+            sage: SuperPartition([[1],[1]])
+            [-1, 1]
+            sage: SuperPartition([[],[1]])
+            [1]
+            sage: SuperPartition([-2,-1,0,2,1])
+            [-2, -1, 0, 2, 1]
+            sage: SuperPartitions.options.display = "pair"
+            sage: SuperPartition([[1],[1]])
+            [[1], [1]]
+            sage: SuperPartition([[],[1]])
+            [[], [1]]
+            sage: SuperPartition([-2,-1,0,2,1])
+            [[2, 1, 0], [2, 1]]
+            sage: SuperPartitions.options._reset()
+        """
+        display = self.parent().options.display
+        if display == "default":
+            asp = ', '.join(str(a) for a in self.antisymmetric_part())
+            sp = ', '.join(str(a) for a in self.symmetric_part())
+            return '[' + asp + '; ' + sp + ']'
+        elif display == "pair":
+            return self._repr_pair()
+        else:  # "list"
+            return self._repr_list()
+
+    def _repr_pair(self) -> str:
+        r"""
+        Representation of a super partition as a pair.
+
+        A super partition is represented by a list consisting of the
+        antisymmetric and symmetric parts.
+
+        EXAMPLES::
+
+            sage: SuperPartition([[1],[1]])._repr_pair()
+            '[[1], [1]]'
+            sage: SuperPartition([[],[1]])._repr_pair()
+            '[[], [1]]'
+            sage: SuperPartition([[],[]])._repr_pair()
+            '[[], []]'
+        """
+        return repr(self.to_list())
+
+    def _repr_list(self) -> str:
+        r"""
+        Representation of a super partition as a list.
+
+        A super partition is represented by a list consisting of the
+        negative values for the antisymmetric part listed first followed
+        by positive values for the symmetric part
+
+        EXAMPLES::
+
+            sage: SuperPartition([[1],[1]])._repr_list()
+            '[-1, 1]'
+            sage: SuperPartition([[],[1]])._repr_list()
+            '[1]'
+            sage: SuperPartition([[],[]])._repr_list()
+            '[]'
+        """
+        return repr([-a for a in self[0]] + list(self[1]))
+
+    def _latex_(self) -> str:
+        r"""
+        Latex a super partition.
+
+        A super partition is represented by the antisymmetric and symmetric
+        parts separated by a semicolon.
+
+        EXAMPLES::
+
+            sage: latex(SuperPartition([[1],[1]]))
+            (1; 1)
+            sage: latex(SuperPartition([[],[1]]))
+            (; 1)
+        """
+        return ('(' + ','.join(str(a) for a in self.antisymmetric_part())
+                + '; ' + ', '.join(str(a) for a in self.symmetric_part()) + ')')
+
+    def to_list(self) -> list:
+        r"""
+        The list of two lists with the antisymmetric and symmetric parts.
+
+        EXAMPLES::
+
+            sage: SuperPartition([[1],[1]]).to_list()
+            [[1], [1]]
+            sage: SuperPartition([[],[1]]).to_list()
+            [[], [1]]
+        """
+        return [list(self[0]), list(self[1])]
+
+    def to_composition(self) -> Composition:
+        r"""
+        Concatenate the antisymmetric and symmetric parts to a composition.
+
+        OUTPUT:
+
+        - a (possibly weak) composition
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).to_composition()
+            [3, 1, 2, 2, 1]
+            sage: SuperPartition([[2,1,0],[3,3]]).to_composition()
+            [2, 1, 0, 3, 3]
+            sage: SuperPartition([[2,1,0],[3,3]]).to_composition().parent()
+            Compositions of nonnegative integers
+        """
+        return Composition(self[0] + self[1])
+
+    def to_partition(self) -> Partition:
+        r"""
+        Concatenate and sort the antisymmetric and symmetric parts
+        to a partition.
+
+        OUTPUT: a partition
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).to_partition()
+            [3, 2, 2, 1, 1]
+            sage: SuperPartition([[2,1,0],[3,3]]).to_partition()
+            [3, 3, 2, 1]
+            sage: SuperPartition([[2,1,0],[3,3]]).to_partition().parent()
+            Partitions
+        """
+        return Partition(sorted(self[0] + self[1], reverse=True))  # type:ignore
+
+    def antisymmetric_part(self) -> list:
+        r"""
+        The antisymmetric part as a list of strictly decreasing integers.
+
+        OUTPUT: list
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).antisymmetric_part()
+            [3, 1]
+            sage: SuperPartition([[2,1,0],[3,3]]).antisymmetric_part()
+            [2, 1, 0]
+        """
+        return list(self[0])
+
+    a_part = antisymmetric_part
+
+    def symmetric_part(self) -> list:
+        r"""
+        The symmetric part as a list of weakly decreasing integers.
+
+        OUTPUT: list
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).symmetric_part()
+            [2, 2, 1]
+            sage: SuperPartition([[2,1,0],[3,3]]).symmetric_part()
+            [3, 3]
+        """
+        return list(self[1])
+
+    s_part = symmetric_part
+
+    def bosonic_degree(self) -> int:
+        r"""
+        Return the bosonic degree of ``self``.
+
+        The *bosonic degree* is the sum of the sizes of the
+        antisymmetric and symmetric parts.
+
+        OUTPUT: integer
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).bosonic_degree()
+            9
+            sage: SuperPartition([[2,1,0],[3,3]]).bosonic_degree()
+            9
+        """
+        return sum(self.antisymmetric_part() + self.symmetric_part())
+
+    degree = bosonic_degree
+
+    def fermionic_degree(self) -> int:
+        r"""
+        Return the fermionic degree of ``self``.
+
+        The *fermionic degree* is the length of the antisymmetric part.
+
+        OUTPUT: integer
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).fermionic_degree()
+            2
+            sage: SuperPartition([[2,1,0],[3,3]]).fermionic_degree()
+            3
+        """
+        return len(self.antisymmetric_part())
+
+    fermionic_sector = fermionic_degree
+
+    def bi_degree(self) -> tuple:
+        r"""
+        Return the bidegree of ``self``, which is a pair consisting
+        of the bosonic and fermionic degree.
+
+        OUTPUT: a tuple of two integers
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).bi_degree()
+            (9, 2)
+            sage: SuperPartition([[2,1,0],[3,3]]).bi_degree()
+            (9, 3)
+        """
+        return (self.bosonic_degree(), self.fermionic_degree())
+
+    def length(self) -> int:
+        r"""
+        Return the length of ``self``, which is the sum of the
+        lengths of the antisymmetric and symmetric part.
+
+        OUTPUT: integer
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).length()
+            5
+            sage: SuperPartition([[2,1,0],[3,3]]).length()
+            5
+        """
+        return self.fermionic_degree() + len(self.symmetric_part())
+
+    def bosonic_length(self) -> int:
+        r"""
+        Return the length of the partition of the symmetric part.
+
+        OUTPUT: integer
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).bosonic_length()
+            3
+            sage: SuperPartition([[2,1,0],[3,3]]).bosonic_length()
+            2
+        """
+        return len(self.symmetric_part())
+
+    def shape_circled_diagram(self) -> Partition:
+        r"""
+        A concatenated partition with an extra cell for each antisymmetric part
+
+        OUTPUT: a partition
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).shape_circled_diagram()
+            [4, 2, 2, 2, 1]
+            sage: SuperPartition([[2,1,0],[3,3]]).shape_circled_diagram()
+            [3, 3, 3, 2, 1]
+        """
+        pi = sorted([a + 1 for a in self.antisymmetric_part()] +
+                    self.symmetric_part(), reverse=True)
+        return Partition(pi)  # type:ignore
+
+    @staticmethod
+    def from_circled_diagram(shape, corners) -> SuperPartition:
+        r"""
+        Construct a super partition from a circled diagram.
+
+        A circled diagram consists of a partition of the concatenation of
+        the antisymmetric and symmetric parts and a list of addable cells
+        of the partition which indicate the location of the circled cells.
+
+        INPUT:
+
+        - ``shape`` -- a partition or list of integers
+        - ``corners`` -- list of removable cells of ``shape``
+
+        OUTPUT: a :class:`SuperPartition`
+
+        EXAMPLES::
+
+            sage: SuperPartition.from_circled_diagram([3, 2, 2, 1, 1], [(0, 3), (3, 1)])
+            [3, 1; 2, 2, 1]
+            sage: SuperPartition.from_circled_diagram([3, 3, 2, 1], [(2, 2), (3, 1), (4, 0)])
+            [2, 1, 0; 3, 3]
+            sage: from_cd = SuperPartition.from_circled_diagram
+            sage: all(sp == from_cd(*sp.to_circled_diagram()) for sp in SuperPartitions(4))
+            True
+        """
+        data = [sorted([c[1] for c in corners], reverse=True),
+                [shape[i] for i in range(len(shape))
+                 if i not in [c[0] for c in corners]]]
+        return SuperPartition(data)  # type:ignore
+
+    def to_circled_diagram(self) -> list:
+        r"""
+        The shape of the circled diagram and a list of addable cells
+
+        A circled diagram consists of a partition for the outer shape
+        and a list of removable cells of the partition indicating the
+        location of the circled cells
+
+        OUTPUT: list consisting of a partition and a list of pairs of integers
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3,1],[2,2,1]]).to_circled_diagram()
+            [[3, 2, 2, 1, 1], [(0, 3), (3, 1)]]
+            sage: SuperPartition([[2,1,0],[3,3]]).to_circled_diagram()
+            [[3, 3, 2, 1], [(2, 2), (3, 1), (4, 0)]]
+            sage: from_cd = SuperPartition.from_circled_diagram
+            sage: all(sp == from_cd(*sp.to_circled_diagram()) for sp in SuperPartitions(4))
+            True
+        """
+        shape = self.to_partition()
+        corners = [c for c in shape.addable_cells() if c[1] in self.antisymmetric_part()]
+        return [shape, corners]
+
+    def conjugate(self) -> SuperPartition:
+        r"""
+        Conjugate of a super partition.
+
+        The *conjugate* of a super partition is defined by conjugating
+        the circled diagram.
+
+        OUTPUT: a :class:`SuperPartition`
+
+        EXAMPLES::
+
+            sage: SuperPartition([[3, 1, 0], [4, 3, 2, 1]]).conjugate()
+            [6, 4, 1; 3]
+            sage: all(sp == sp.conjugate().conjugate() for sp in SuperPartitions(4))
+            True
+            sage: all(sp.conjugate() in SuperPartitions(3,2) for sp in SuperPartitions(3,2))
+            True
+        """
+        sd = self.to_circled_diagram()
+        return SuperPartition.from_circled_diagram(sd[0].conjugate(),
+                                                   [(j, i) for (i, j) in sd[1]])
+
+    def zee(self) -> Integer:
+        r"""
+        Return the centralizer size of a permutation of cycle
+        type symmetric part of ``self``.
+
+        OUTPUT: a positive integer
+
+        EXAMPLES::
+
+            sage: SuperPartition([[1,0],[3,1,1]]).zee()
+            6
+            sage: SuperPartition([[1],[2,2,1]]).zee()
+            8
+            sage: sum(1/sp.zee() for sp in SuperPartitions(6,0))
+            1
+        """
+        return Partition(self.symmetric_part()).centralizer_size()  # type:ignore
+
+    def sign(self) -> int:
+        r"""
+        Return the sign of a permutation of cycle type the
+        symmetric part of ``self``.
+
+        OUTPUT: either `1` or `-1`
+
+        EXAMPLES::
+
+            sage: SuperPartition([[1,0],[3,1,1]]).sign()
+            -1
+            sage: SuperPartition([[1,0],[3,2,1]]).sign()
+            1
+            sage: sum(sp.sign()/sp.zee() for sp in SuperPartitions(6,0))
+            0
+        """
+        return (-1)**(self.degree() - len(self.symmetric_part()))
+
+    def dominates(self, other) -> bool:
+        r"""
+        Return ``True`` if and only if ``self`` dominates ``other``.
+
+        If the symmetric and anti-symmetric parts of ``self`` and ``other``
+        are not the same size then the result is ``False``.
+
+        EXAMPLES::
+
+            sage: LA = SuperPartition([[2,1],[2,1,1]])
+            sage: LA.dominates([[2,1],[3,1]])
+            False
+            sage: LA.dominates([[2,1],[1,1,1,1]])
+            True
+            sage: LA.dominates([[3],[2,1,1]])
+            False
+            sage: LA.dominates([[1],[1]*6])
+            False
+        """
+        return (self.degree() == sum(other[0]) + sum(other[1]) and
+                Partition(self.antisymmetric_part()).dominates(other[0]) and
+                Partition(self.symmetric_part()).dominates(other[1]))
+
+    def add_horizontal_border_strip_star(self, h) -> list:
+        r"""
+        Return a list of super partitions that differ from ``self``
+        by a horizontal strip.
+
+        The notion of horizontal strip comes from the Pieri rule for the
+        Schur-star basis of symmetric functions in super space (see
+        Theorem 7 from [JL2016]_).
+
+        INPUT:
+
+        - ``h`` -- number of cells in the horizontal strip
+
+        OUTPUT: list of super partitions
+
+        EXAMPLES::
+
+            sage: SuperPartition([[4,1],[3]]).add_horizontal_border_strip_star(3)
+            [[3, 1; 7],
+             [4, 1; 6],
+             [3, 0; 6, 2],
+             [3, 1; 6, 1],
+             [4, 0; 5, 2],
+             [4, 1; 5, 1],
+             [3, 0; 5, 3],
+             [3, 1; 5, 2],
+             [4, 0; 4, 3],
+             [4, 1; 4, 2],
+             [4, 1; 3, 3]]
+            sage: SuperPartition([[2,1],[3]]).add_horizontal_border_strip_star(2)
+            [[2, 1; 5], [2, 0; 4, 2], [2, 1; 4, 1], [2, 0; 3, 3], [2, 1; 3, 2]]
+        """
+        sp1, circ_list = self.to_circled_diagram()
+        nsp = [list(la) + [0] for la in sp1.add_horizontal_border_strip(h)]
+        sp1 = sp1 + [0]
+        out = []
+        for elt in nsp:
+            row_changed = [row1 - row2 for row1, row2 in zip(elt, sp1)]
+            new_sp = [elt, [(i[0] + 1, elt[i[0] + 1]) for i in circ_list
+                            if row_changed[i[0]] != 0]
+                      # TODO: Check that this is not supposed to be
+                      #   a tuple of size 1
+                      + [(i) for i in circ_list if row_changed[i[0]] == 0]]
+            if len({k for j, k in new_sp[1]}) == len(new_sp[1]):
+                out += [SuperPartition.from_circled_diagram(*new_sp)]
+        return out
+
+    def add_horizontal_border_strip_star_bar(self, h) -> list:
+        r"""
+        List super partitions that differ from ``self`` by a horizontal strip.
+
+        The notion of horizontal strip comes from the Pieri rule for the
+        Schur-star-bar basis of symmetric functions in super space (see
+        Theorem 10 from [JL2016]_).
+
+        INPUT:
+
+        - ``h`` -- number of cells in the horizontal strip
+
+        OUTPUT: list of super partitions
+
+        EXAMPLES::
+
+            sage: SuperPartition([[4,1],[5,4]]).add_horizontal_border_strip_star_bar(3)
+            [[4, 1; 8, 4],
+             [4, 1; 7, 5],
+             [4, 2; 7, 4],
+             [4, 1; 7, 4, 1],
+             [4, 2; 6, 5],
+             [4, 1; 6, 5, 1],
+             [4, 3; 6, 4],
+             [4, 2; 6, 4, 1],
+             [4, 1; 6, 4, 2],
+             [4, 3; 5, 5],
+             [4, 2; 5, 5, 1],
+             [4, 1; 5, 5, 2],
+             [4, 3; 5, 4, 1],
+             [4, 1; 5, 4, 3]]
+            sage: SuperPartition([[3,1],[5]]).add_horizontal_border_strip_star_bar(2)
+            [[3, 1; 7],
+             [4, 1; 6],
+             [3, 2; 6],
+             [3, 1; 6, 1],
+             [4, 2; 5],
+             [4, 1; 5, 1],
+             [3, 2; 5, 1],
+             [3, 1; 5, 2]]
+        """
+        sp1, circ_list = self.to_circled_diagram()
+        nsp = [list(la) + [0] for la in sp1.add_horizontal_border_strip(h)]
+        sp1 = sp1 + [0]
+        out = []
+        for asp in nsp:
+            asp = asp + [0]
+            change_in_rows = [asp[i] - sp1[i] for i in range(len(sp1))]
+            moved_circ_list: list[list[tuple]] = [[] for _ in range(len(circ_list))]
+            for i, pos in enumerate(circ_list):
+                if change_in_rows[pos[0]] == 0:
+                    moved_circ_list[i].append(pos)
+                else:
+                    if pos[0] == 0:
+                        moved_circ_list[i].append((0, pos[1] + change_in_rows[0]))
+                        if pos[1] == asp[1]:
+                            moved_circ_list[i].append((1, asp[1]))
+                    else:
+                        if pos[1] + change_in_rows[pos[0]] < sp1[pos[0] - 1]:
+                            moved_circ_list[i].append((pos[0], pos[1] + change_in_rows[pos[0]]))
+                        if asp[pos[0] + 1] == sp1[pos[0]]:
+                            moved_circ_list[i].append((pos[0] + 1, pos[1]))
+            out += [[moved_circ_list, asp]]
+        result = []
+        for ti in out:
+            if not ti[0]:
+                result += [[ti[1], ti[0]]]
+            else:
+                x = reduce(lambda a, b: [item_a + item_b for item_a in a for item_b in b], ti[0])
+                for j in x:
+                    result += [[ti[1], list(zip(j, j[1:]))[::2]]]
+        return [SuperPartition.from_circled_diagram(*ti)
+                for ti in result if len(ti[1]) == len(self[0])]
+
+
+class SuperPartitions(UniqueRepresentation, Parent):
+    r"""
+    Super partitions.
+
+    A super partition of size `n` and fermionic sector `m` is a
+    pair consisting of a strict partition of some integer `r` of
+    length `m` (that may end in a `0`) and an integer partition of
+    `n - r`.
+
+    INPUT:
+
+    - ``n`` -- integer (default: ``None``)
+    - ``m`` -- if ``n`` is specified, an integer (optional: default ``None``)
+
+    Super partitions are the indexing set for symmetric functions
+    in super space.
+
+    EXAMPLES::
+
+        sage: SuperPartitions()
+        Super Partitions
+        sage: SuperPartitions(2)
+        Super Partitions of 2
+        sage: SuperPartitions(2).cardinality()
+        8
+        sage: SuperPartitions(4,2)
+        Super Partitions of 4 and of fermionic sector 2
+        sage: [[2,0],[1,1]] in SuperPartitions(4,2)
+        True
+        sage: [[1,0],[1,1]] in SuperPartitions(4,2)
+        False
+        sage: [[1,0],[2,1]] in SuperPartitions(4)
+        True
+        sage: [[1,0],[2,2,1]] in SuperPartitions(4)
+        False
+        sage: [[1,0],[2,1]] in SuperPartitions()
+        True
+        sage: [[1,1],[2,1]] in SuperPartitions()
+        False
+    """
+    @staticmethod
+    def __classcall_private__(self, n=None, m=None, **kwargs):
+        r"""
+        Return the corresponding parent based upon input.
+
+        TESTS::
+
+            sage: from sage.combinat.superpartition import *
+            sage: isinstance(SuperPartitions(), SuperPartitions_all)
+            True
+            sage: isinstance(SuperPartitions(3), SuperPartitions_n)
+            True
+            sage: isinstance(SuperPartitions(3,2), SuperPartitions_n_m)
+            True
+
+        ::
+
+            sage: SP = SuperPartitions(5,2)
+            sage: SP2 = SuperPartitions(int(5),int(2))
+            sage: SP3 = SuperPartitions(ZZ(5),int(2))
+            sage: SP is SP2
+            True
+            sage: SP is SP3
+            True
+
+        ::
+
+            sage: SP = SuperPartitions(5)
+            sage: SP2 = SuperPartitions(int(5))
+            sage: SP3 = SuperPartitions(ZZ(5))
+            sage: SP is SP2
+            True
+            sage: SP is SP3
+            True
+        """
+        if n is None:
+            return SuperPartitions_all()
+        elif n in ZZ:
+            if m is None:
+                return SuperPartitions_n(n)
+            elif m in ZZ:
+                return SuperPartitions_n_m(n, m)
+            raise ValueError("m must be an integer")
+        raise ValueError("n must be an integer")
+
+    def __init__(self, is_infinite=False):
+        """
+        Initialize ``self``.
+
+        EXAMPLES::
+
+            sage: SP = SuperPartitions()
+            sage: TestSuite(SP).run()
+        """
+        cat = EnumeratedSets()
+        if is_infinite:
+            cat = cat.Infinite()
+        else:
+            cat = cat.Finite()
+        Parent.__init__(self, category=cat)
+
+    Element = SuperPartition
+
+    class options(GlobalOptions):
+        """
+        Set the global options for elements of the SuperPartition class.
+
+        The defaults are for Super Partitions to be displayed in a list
+        notation with the fermionic part and the bosonic part separated
+        by a semicolon. There is a slight disadvantage to this notation
+        because a list containing a semicolon can not be used as input
+        for a super partition.
+
+        @OPTIONS@
+
+        EXAMPLES::
+
+            sage: sp = SuperPartition([[1, 0], [2, 2, 1]])
+            sage: SuperPartitions.options.display
+            default
+            sage: sp
+            [1, 0; 2, 2, 1]
+            sage: SuperPartitions.options.display = 'list'
+            sage: sp
+            [-1, 0, 2, 2, 1]
+            sage: SuperPartitions.options._reset()
+        """,
+        NAME = 'SuperPartition'
+        module = 'sage.combinat.superpartition'
+        display = dict(default='default',
+                       description="Specifies how the super partitions should "
+                                   "be printed",
+                       values=dict(list="the super partitions are displayed in "
+                                        "a list of two lists",
+                                   pair="the super partition is displayed as a "
+                                        "list of integers",
+                                   default="the super partition is displayed in "
+                                           "a form [fermionic part; bosonic part]"),
+                       case_sensitive=False)
+
+    def _element_constructor_(self, lst, check=True):
+        """
+        Construct an element with ``self`` as parent.
+
+        EXAMPLES::
+
+            sage: SP = SuperPartitions()
+            sage: SP([[],[3,3,1]])
+            [; 3, 3, 1]
+            sage: SP([[],[3,3,1]]) in SP
+            True
+            sage: SP([[],[3,3,1]]).parent()
+            Super Partitions
+            sage: SuperPartitions(7)([[],[3,3,1]])
+            [; 3, 3, 1]
+            sage: SuperPartitions(7,0)([[],[3,3,1]])
+            [; 3, 3, 1]
+            sage: SuperPartitions(7,1)([[],[3,3,1]])
+            Traceback (most recent call last):
+            ...
+            ValueError: [[], [3, 3, 1]] not in Super Partitions of 7 and of fermionic sector 1
+        """
+        if not lst:
+            return self.element_class(self, [[], []], check=check)
+        if isinstance(lst, SuperPartition):
+            lst = list(lst)
+        if isinstance(lst[0], (list, tuple)):
+            return self.element_class(self, [lst[0], [a for a in lst[1] if a > 0]],
+                                      check=check)
+        else:
+            return self.element_class(self, [[-a for a in lst if a <= 0],
+                                             [a for a in lst if a > 0]],
+                                      check=check)
+
+    def __contains__(self, x) -> bool:
+        """
+        TESTS::
+
+            sage: [[1],[2,1]] in SuperPartitions()
+            True
+            sage: [[],[]] in SuperPartitions()
+            True
+            sage: [[0],[]] in SuperPartitions()
+            True
+            sage: [[],[0]] in SuperPartitions()
+            True
+            sage: [-1, 2, 1] in SuperPartitions()
+            True
+            sage: [2, -1, 1, 0] in SuperPartitions()
+            True
+            sage: [2, 0, 1, -1] in SuperPartitions()
+            False
+            sage: [] in SuperPartitions()
+            True
+            sage: [0] in SuperPartitions()
+            True
+        """
+        if isinstance(x, SuperPartition):
+            return True
+        if not isinstance(x, (list, tuple)):
+            return False
+        if all(isinstance(i, (int, Integer)) or i in ZZ for i in x):
+            sp = [a for a in x if a <= 0]
+            return (all(sp[i] > sp[i - 1] for i in range(1, len(sp)))
+                    and [a for a in x if a > 0] in _Partitions)
+        elif (len(x) == 2 and
+              isinstance(x[0], (list, tuple)) and
+              isinstance(x[1], (list, tuple))):
+            for i in chain(x[0], x[1]):
+                if i not in ZZ:
+                    return False
+                if i < 0:
+                    return False
+            return (all(x[0][i] > x[0][i + 1] for i in range(len(x[0]) - 1))
+                    and all(x[1][i] >= x[1][i + 1] for i in range(len(x[1]) - 1))
+                    and ((not x[0]) or x[0][-1] >= 0) and ((not x[1]) or x[1][-1] >= 0))
+        else:
+            return False
+
+
+class SuperPartitions_n_m(SuperPartitions):
+    def __init__(self, n, m):
+        """
+        Initialize ``self``.
+
+        TESTS::
+
+            sage: SP = SuperPartitions(3,2)
+            sage: TestSuite(SP).run()
+        """
+        self.n = n
+        self.m = m
+        SuperPartitions.__init__(self, False)
+
+    def _repr_(self) -> str:
+        """
+        Return a string representation of ``self``.
+
+        TESTS::
+
+            sage: repr(SuperPartitions(3,2))
+            'Super Partitions of 3 and of fermionic sector 2'
+        """
+        return "Super Partitions of %s and of fermionic sector %s" % (self.n, self.m)
+
+    def __contains__(self, x) -> bool:
+        """
+        TESTS::
+
+            sage: [[3,2,1,0],[2]] in SuperPartitions(8,4)
+            True
+            sage: [[3,2,1,0],[]] in SuperPartitions(6,3)
+            False
+            sage: [[],[]] in SuperPartitions(0,0)
+            True
+            sage: [[0],[]] in SuperPartitions(0,1)
+            True
+            sage: [[],[]] in SuperPartitions(0,1)
+            False
+            sage: [-3,-2,-1,0,2] in SuperPartitions(8,4)
+            True
+            sage: [0] in SuperPartitions(0,0)
+            False
+            sage: [] in SuperPartitions(0,0)
+            True
+            sage: [0] in SuperPartitions(0,1)
+            True
+        """
+        if x in SuperPartitions():
+            if not x:
+                return self.n == 0 and self.m == 0
+            if isinstance(x[0], (list, tuple)):
+                n = sum(x[0] + x[1])
+                m = len(x[0])
+            else:
+                n = sum(abs(a) for a in x)
+                m = len([a for a in x if a <= 0])
+            return n == self.n and m == self.m
+        else:
+            return False
+
+    def __iter__(self):
+        r"""
+        An iterator for super partitions of degree ``n`` and sector ``m``.
+
+        EXAMPLES::
+
+            sage: SuperPartitions(6,2).cardinality()
+            28
+            sage: SuperPartitions(6,4).first()
+            [3, 2, 1, 0; ]
+        """
+        for r in range(self.n + 1):
+            for p1 in Partitions(r):
+                for p0 in Partitions(self.n - r, max_slope=-1, length=self.m):
+                    yield self.element_class(self, [list(p0), list(p1)])
+                for p0 in Partitions(self.n - r, max_slope=-1, length=self.m - 1):
+                    yield self.element_class(self, [list(p0) + [0], list(p1)])
+
+
+class SuperPartitions_n(SuperPartitions):
+    def __init__(self, n):
+        """
+        Initialize ``self``.
+
+        TESTS::
+
+            sage: SP = SuperPartitions(3)
+            sage: TestSuite(SP).run()
+        """
+        self.n = n
+        SuperPartitions.__init__(self, False)
+
+    def _repr_(self) -> str:
+        """
+        Return a string representation of ``self``.
+
+        TESTS::
+
+            sage: repr(SuperPartitions(3))
+            'Super Partitions of 3'
+        """
+        return "Super Partitions of %s" % self.n
+
+    def __contains__(self, x) -> bool:
+        """
+        EXAMPLES::
+
+            sage: SuperPartitions(7)([[],[3,3,1]]) in SuperPartitions()
+            True
+            sage: SuperPartitions()([[],[3,3,1]]) in SuperPartitions(7)
+            True
+            sage: [[],[]] in SuperPartitions(0)
+            True
+            sage: [[0],[]] in SuperPartitions(0)
+            True
+            sage: [0] in SuperPartitions(0)
+            True
+            sage: [] in SuperPartitions(0)
+            True
+            sage: [1] in SuperPartitions(0)
+            False
+        """
+        if x in SuperPartitions():
+            if not x:
+                return self.n == 0
+            if isinstance(x[0], (list, tuple)):
+                n = sum(x[0] + x[1])
+            else:
+                n = sum(abs(a) for a in x)
+            return n == self.n
+        else:
+            return False
+
+    def __iter__(self):
+        r"""
+        An iterator for super partitions of degree ``n``.
+
+        EXAMPLES::
+
+            sage: SuperPartitions(1).list()
+            [[; 1], [1; ], [0; 1], [1, 0; ]]
+            sage: SuperPartitions(6).cardinality()
+            80
+        """
+        m = 0
+        while self.n >= m * (m - 1) // 2:
+            for LA in SuperPartitions(self.n, m):
+                yield self.element_class(self, LA)
+            m += 1
+
+
+class SuperPartitions_all(SuperPartitions):
+    def __init__(self):
+        """
+        Initialize ``self``.
+
+        TESTS::
+
+            sage: SP = SuperPartitions()
+            sage: TestSuite(SP).run()
+        """
+        SuperPartitions.__init__(self, True)
+
+    def _repr_(self) -> str:
+        """
+        Return a string representation of ``self``.
+
+        TESTS::
+
+            sage: repr(SuperPartitions())
+            'Super Partitions'
+        """
+        return "Super Partitions"
+
+    def __iter__(self):
+        """
+        Iterate over all super partitions.
+
+        EXAMPLES::
+
+            sage: SP = SuperPartitions()
+            sage: it = SP.__iter__()
+            sage: [next(it) for i in range(6)]
+            [[; ], [0; ], [; 1], [1; ], [0; 1], [1, 0; ]]
+        """
+        n = 0
+        while True:
+            for sp in SuperPartitions(n):
+                yield self.element_class(self, list(sp))
+            n += 1