PyPI - GroupsMath - Versions diffs - 0.6.0__tar.gz → 0.7.0__tar.gz - Mend

GroupsMath 0.6.0tar.gz → 0.7.0tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (17) hide show

{groupsmath-0.6.0 → groupsmath-0.7.0}/GroupsMath.egg-info/PKG-INFO RENAMED Viewed

@@ -1,11 +1,11 @@
 Metadata-Version: 2.4
 Name: GroupsMath
-Version: 0.6.0
+Version: 0.7.0
 Summary: The educational Python library for Group Theory
 Author-email: Mario Sultan Romero <mariosultan.uem@gmail.com>
 License: PolyForm Strict License 1.0.0.
 Project-URL: Homepage, https://github.com/MarioSultan/GroupsMath
-Project-URL: Documentation, https://github.com/MarioSultan/GroupsMath/tree/main/docs
+Project-URL: Documentation, https://groupsmath.readthedocs.io/en/latest/
 Project-URL: Issues, https://github.com/MarioSultan/GroupsMath/issues
 Keywords: math,mathematics,algebra,abstract-algebra,group-theory,finite-groups,sylow,quotient-groups,automorphisms,group,groups,group theory,finte groups,finite group theory,finite-group-theory
 Classifier: Topic :: Scientific/Engineering :: Mathematics
@@ -20,13 +20,13 @@ Requires-Dist: matplotlib>=3.0.0
 Requires-Dist: numpy>=1.20.0
 Dynamic: license-file
-# GroupsMath – v0.6.0
+# GroupsMath – v0.7.0 – release candidate for v1.0.0
 [![PyPI Downloads](https://img.shields.io/pypi/dm/groupsmath)](https://pypistats.org/packages/groupsmath)
 [![PyPI Version](https://img.shields.io/pypi/v/groupsmath?color=2A646E)](https://pypi.org/project/groupsmath/)
 [![Python Versions](https://img.shields.io/pypi/pyversions/groupsmath?color=2A646E)](https://pypi.org/project/groupsmath/)
 ![Last Commit](https://img.shields.io/github/last-commit/MarioSultan/groupsmath?color=2A646E)
-![coverage](https://img.shields.io/badge/road%20to%20v1.0.0-85%25-yellowgreen?color=2A646E)
+![coverage](https://img.shields.io/badge/road%20to%20v1.0.0-95%25-yellowgreen?color=2A646E)
 <!-- ![GitHub Stars](https://img.shields.io/github/stars/MarioSultan/groupsmath?style=social) -->
@@ -39,6 +39,8 @@ The project aims to provide a **simple** and **intuitive** interface for working
 ![Examples](https://raw.githubusercontent.com/MarioSultan/GroupsMath/main/imgs/examples.png)
+> Visit here the [GroupsMath official documentation](https://groupsmath.readthedocs.io/en/latest/).
 > **⚠️ Notice:** Version v1.0.0 is nearing its official release.
@@ -117,7 +119,7 @@ GroupsMath is designed to provide tools for working with finite (and infinite) g
 * Centralizers, conjugacy classes and conmutator.
 * Computation and exploration of other structural properties of finite groups.
 * Predefined group families in the library `groupsmath.precooked`, such as $C_n$, $S_n$, $A_n$, $D_n$, $V_4$, $Q_8$, ...
-* Isomorphisms between groups.
+* Structure description. (*experimental feature*)
 **SUBGROUPS:**
 * Study of subgroups (order, cosets, normal subgroups, quotients, ...).
@@ -140,6 +142,9 @@ GroupsMath is designed to provide tools for working with finite (and infinite) g
 * Groups generated by matrices: $GL$, $SL$, $O$, $SO$, $U$, $SU$ and $Sp$.
 * Matrix groups over finite fields $\mathbb{F}_p$, with $p$ prime.
+**PRESENTED GROUPS**
+* Presentation of groups, generators and class `PresentedGroup`. (*experimental feature*)
 The available functionality will expand as the project develops.
 ---
@@ -147,7 +152,6 @@ The available functionality will expand as the project develops.
 ## Coming soon
 The GroupsMath team is currently working on theese ideas:
-* Presentation of groups, generators and class `PresentedGroup`.
 * Free groups $F_n$ and free products.
 * Optimization of actual features.
 * Representation theory.
@@ -158,7 +162,7 @@ The GroupsMath team is currently working on theese ideas:
 ## Documentation
-Detailed documentation is available in the [`docs`](https://github.com/MarioSultan/GroupsMath/tree/main/docs) directory of GitHub and it is developed alongside the library.
+Detailed documentation is available in the [GroupsMath official documentation](https://groupsmath.readthedocs.io/en/latest/) and it is developed alongside the library.
 ---

{groupsmath-0.6.0 → groupsmath-0.7.0}/GroupsMath.egg-info/SOURCES.txt RENAMED Viewed

@@ -10,4 +10,6 @@ groupsmath/__init__.py
 groupsmath/core.py
 groupsmath/matrixgroups.py
 groupsmath/precooked.py
-groupsmath/shortcuts.py
+groupsmath/presentations.py
+groupsmath/shortcuts.py
+groupsmath/structure.py

{groupsmath-0.6.0 → groupsmath-0.7.0}/PKG-INFO RENAMED Viewed

@@ -1,11 +1,11 @@
 Metadata-Version: 2.4
 Name: GroupsMath
-Version: 0.6.0
+Version: 0.7.0
 Summary: The educational Python library for Group Theory
 Author-email: Mario Sultan Romero <mariosultan.uem@gmail.com>
 License: PolyForm Strict License 1.0.0.
 Project-URL: Homepage, https://github.com/MarioSultan/GroupsMath
-Project-URL: Documentation, https://github.com/MarioSultan/GroupsMath/tree/main/docs
+Project-URL: Documentation, https://groupsmath.readthedocs.io/en/latest/
 Project-URL: Issues, https://github.com/MarioSultan/GroupsMath/issues
 Keywords: math,mathematics,algebra,abstract-algebra,group-theory,finite-groups,sylow,quotient-groups,automorphisms,group,groups,group theory,finte groups,finite group theory,finite-group-theory
 Classifier: Topic :: Scientific/Engineering :: Mathematics
@@ -20,13 +20,13 @@ Requires-Dist: matplotlib>=3.0.0
 Requires-Dist: numpy>=1.20.0
 Dynamic: license-file
-# GroupsMath – v0.6.0
+# GroupsMath – v0.7.0 – release candidate for v1.0.0
 [![PyPI Downloads](https://img.shields.io/pypi/dm/groupsmath)](https://pypistats.org/packages/groupsmath)
 [![PyPI Version](https://img.shields.io/pypi/v/groupsmath?color=2A646E)](https://pypi.org/project/groupsmath/)
 [![Python Versions](https://img.shields.io/pypi/pyversions/groupsmath?color=2A646E)](https://pypi.org/project/groupsmath/)
 ![Last Commit](https://img.shields.io/github/last-commit/MarioSultan/groupsmath?color=2A646E)
-![coverage](https://img.shields.io/badge/road%20to%20v1.0.0-85%25-yellowgreen?color=2A646E)
+![coverage](https://img.shields.io/badge/road%20to%20v1.0.0-95%25-yellowgreen?color=2A646E)
 <!-- ![GitHub Stars](https://img.shields.io/github/stars/MarioSultan/groupsmath?style=social) -->
@@ -39,6 +39,8 @@ The project aims to provide a **simple** and **intuitive** interface for working
 ![Examples](https://raw.githubusercontent.com/MarioSultan/GroupsMath/main/imgs/examples.png)
+> Visit here the [GroupsMath official documentation](https://groupsmath.readthedocs.io/en/latest/).
 > **⚠️ Notice:** Version v1.0.0 is nearing its official release.
@@ -117,7 +119,7 @@ GroupsMath is designed to provide tools for working with finite (and infinite) g
 * Centralizers, conjugacy classes and conmutator.
 * Computation and exploration of other structural properties of finite groups.
 * Predefined group families in the library `groupsmath.precooked`, such as $C_n$, $S_n$, $A_n$, $D_n$, $V_4$, $Q_8$, ...
-* Isomorphisms between groups.
+* Structure description. (*experimental feature*)
 **SUBGROUPS:**
 * Study of subgroups (order, cosets, normal subgroups, quotients, ...).
@@ -140,6 +142,9 @@ GroupsMath is designed to provide tools for working with finite (and infinite) g
 * Groups generated by matrices: $GL$, $SL$, $O$, $SO$, $U$, $SU$ and $Sp$.
 * Matrix groups over finite fields $\mathbb{F}_p$, with $p$ prime.
+**PRESENTED GROUPS**
+* Presentation of groups, generators and class `PresentedGroup`. (*experimental feature*)
 The available functionality will expand as the project develops.
 ---
@@ -147,7 +152,6 @@ The available functionality will expand as the project develops.
 ## Coming soon
 The GroupsMath team is currently working on theese ideas:
-* Presentation of groups, generators and class `PresentedGroup`.
 * Free groups $F_n$ and free products.
 * Optimization of actual features.
 * Representation theory.
@@ -158,7 +162,7 @@ The GroupsMath team is currently working on theese ideas:
 ## Documentation
-Detailed documentation is available in the [`docs`](https://github.com/MarioSultan/GroupsMath/tree/main/docs) directory of GitHub and it is developed alongside the library.
+Detailed documentation is available in the [GroupsMath official documentation](https://groupsmath.readthedocs.io/en/latest/) and it is developed alongside the library.
 ---

{groupsmath-0.6.0 → groupsmath-0.7.0}/README.md RENAMED Viewed

@@ -1,10 +1,10 @@
-# GroupsMath – v0.6.0
+# GroupsMath – v0.7.0 – release candidate for v1.0.0
 [![PyPI Downloads](https://img.shields.io/pypi/dm/groupsmath)](https://pypistats.org/packages/groupsmath)
 [![PyPI Version](https://img.shields.io/pypi/v/groupsmath?color=2A646E)](https://pypi.org/project/groupsmath/)
 [![Python Versions](https://img.shields.io/pypi/pyversions/groupsmath?color=2A646E)](https://pypi.org/project/groupsmath/)
 ![Last Commit](https://img.shields.io/github/last-commit/MarioSultan/groupsmath?color=2A646E)
-![coverage](https://img.shields.io/badge/road%20to%20v1.0.0-85%25-yellowgreen?color=2A646E)
+![coverage](https://img.shields.io/badge/road%20to%20v1.0.0-95%25-yellowgreen?color=2A646E)
 <!-- ![GitHub Stars](https://img.shields.io/github/stars/MarioSultan/groupsmath?style=social) -->
@@ -17,6 +17,8 @@ The project aims to provide a **simple** and **intuitive** interface for working
 ![Examples](https://raw.githubusercontent.com/MarioSultan/GroupsMath/main/imgs/examples.png)
+> Visit here the [GroupsMath official documentation](https://groupsmath.readthedocs.io/en/latest/).
 > **⚠️ Notice:** Version v1.0.0 is nearing its official release.
@@ -95,7 +97,7 @@ GroupsMath is designed to provide tools for working with finite (and infinite) g
 * Centralizers, conjugacy classes and conmutator.
 * Computation and exploration of other structural properties of finite groups.
 * Predefined group families in the library `groupsmath.precooked`, such as $C_n$, $S_n$, $A_n$, $D_n$, $V_4$, $Q_8$, ...
-* Isomorphisms between groups.
+* Structure description. (*experimental feature*)
 **SUBGROUPS:**
 * Study of subgroups (order, cosets, normal subgroups, quotients, ...).
@@ -118,6 +120,9 @@ GroupsMath is designed to provide tools for working with finite (and infinite) g
 * Groups generated by matrices: $GL$, $SL$, $O$, $SO$, $U$, $SU$ and $Sp$.
 * Matrix groups over finite fields $\mathbb{F}_p$, with $p$ prime.
+**PRESENTED GROUPS**
+* Presentation of groups, generators and class `PresentedGroup`. (*experimental feature*)
 The available functionality will expand as the project develops.
 ---
@@ -125,7 +130,6 @@ The available functionality will expand as the project develops.
 ## Coming soon
 The GroupsMath team is currently working on theese ideas:
-* Presentation of groups, generators and class `PresentedGroup`.
 * Free groups $F_n$ and free products.
 * Optimization of actual features.
 * Representation theory.
@@ -136,7 +140,7 @@ The GroupsMath team is currently working on theese ideas:
 ## Documentation
-Detailed documentation is available in the [`docs`](https://github.com/MarioSultan/GroupsMath/tree/main/docs) directory of GitHub and it is developed alongside the library.
+Detailed documentation is available in the [GroupsMath official documentation](https://groupsmath.readthedocs.io/en/latest/) and it is developed alongside the library.
 ---

{groupsmath-0.6.0 → groupsmath-0.7.0}/groupsmath/core.py RENAMED Viewed

@@ -21,7 +21,7 @@ from    math                import  gcd
 #################### DEFINITIONS ####################
-__version__ = "0.6.0"
+__version__ = "0.7.0"
 __errorcolor__ = "\033[31m"
 tgl_color = "#2A646E"
@@ -126,7 +126,7 @@ class ExplicitGroup(Group):
                 if self.operation(e,a) != a:
                     ok = False
                     break
-                if self.operation(e,a) != a:
+                if self.operation(a,e) != a:
                     ok = False
                     break
             if ok:
@@ -437,7 +437,7 @@ class CayleyGroup(Group):
                 if self.operation(e,a) != a:
                     ok = False
                     break
-                if self.operation(e,a) != a:
+                if self.operation(a,e) != a:
                     ok = False
                     break
             if ok:
@@ -735,16 +735,47 @@ class CayleyGroup(Group):
         return True
     def automorphisms(self):
+        """Calcula automorfismos propagando asignaciones sobre los generadores del grupo."""
         n = self.order()
-        auts = []
-        orders = self.element_orders()[:]
-        for p in _order_preserving_permutations(orders):
-            try:
-                auts.append(Automorphism(p,self))
-            except:
-                pass
-        return auts
+        gens_idx = [self._dict[g] for g in self.generators()]
+        orders = self.element_orders()
+        # Candidatos en el codominio que coinciden en orden con los generadores
+        candidates_per_gen = [
+            [h for h in range(n) if orders[h] == orders[g]]
+            for g in gens_idx
+        ]
+        valid_auts = []
+        e_idx = self._dict[self.identity()]
+        for tuple_h in product(*candidates_per_gen):
+            mapping = {e_idx: e_idx}
+            queue = [e_idx]
+            valid = True
+            # BFS para extender la imagen a todo el grupo
+            while queue and valid:
+                curr = queue.pop(0)
+                for i, g in enumerate(gens_idx):
+                    h = tuple_h[i]
+                    next_g = self.cayley[curr][g]
+                    expected_h = self.cayley[mapping[curr]][h]
+                    if next_g in mapping:
+                        if mapping[next_g] != expected_h:
+                            valid = False
+                            break
+                    else:
+                        mapping[next_g] = expected_h
+                        queue.append(next_g)
+            # Si el mapeo cubrió todo el grupo y es inyectivo, es un automorfismo
+            if valid and len(mapping) == n and len(set(mapping.values())) == n:
+                phi = tuple(mapping[i] for i in range(n))
+                valid_auts.append(Automorphism(phi, self))
+        return valid_auts
     def automorphism_group(self):
         auts = [i.phi for i in self.automorphisms()]
@@ -1193,7 +1224,7 @@ class AutomorphismFunction:
         return str(self.phi)
-#################### HIDDEN COMMANDS ####################
+#################### HIDDEN FUNCTIONS ####################
 def _obtener_nombre(var_obj):
     for nombre, valor in globals().items():
@@ -1528,11 +1559,11 @@ def direct_product(A:CayleyGroup,B:CayleyGroup):
     return CayleyGroup(G,names,_skip_validation=True)
 def direct_power(G:CayleyGroup,n):
-    if n==2:
+    if n==0:
         return CayleyGroup([[0]],"e")
     elif n==1:
         return G
-    elif n>2:
+    elif n>=2:
         H = G
         for i in range(n-1):
             H = direct_product(H,G)

{groupsmath-0.6.0 → groupsmath-0.7.0}/groupsmath/matrixgroups.py RENAMED Viewed

@@ -209,23 +209,37 @@ def SL(n, field="R", p=None):
         cond = lambda M: np.isclose(np.linalg.det(M), 1.0)
     return MatrixGroup(n, field=field, condition=cond, p=p)
-def O(n, field="R"):
+def O(n, field="R", p=None):
     """Orthogonal Group O_n(R)"""
-    if field=="F_p" or type(field)==int:
-        raise ValueError (__errorcolor__+"GroupsMath cannot generate an orthogonal group in a finite field.")
     if n%2==0:
         raise ValueError (__errorcolor__+"Cannot generate an orthogonal group without Witt index in even dimension.")
-    cond = lambda M: np.allclose(M.T @ M, np.eye(n))
-    return MatrixGroup(n, field=field, condition=cond)
-def SO(n, field="R"):
+    if type(field)==int:
+        p = field
+        field = "F_p"
+    if field == "F_p":
+        cond = lambda M: np.allclose(np.mod(M.T @ M,p), np.eye(n))
+    else:
+        cond = lambda M: np.allclose(M.T @ M, np.eye(n))
+    return MatrixGroup(n, field=field, condition=cond, p=p)
+def SO(n, field="R", p=None):
     """Special Orthogonal Group SO_n(R)"""
-    if field=="F_p" or type(field)==int:
-            raise ValueError (__errorcolor__+"GroupsMath cannot generate an orthogonal group in a finite field.")
     if n%2==0:
         raise ValueError (__errorcolor__+"Cannot generate an orthogonal group without Witt index in even dimension.")
-    cond = lambda M: np.allclose(M.T @ M, np.eye(n)) and np.isclose(np.linalg.det(M), 1.0)
-    return MatrixGroup(n, field=field, condition=cond)
+    if type(field)==int:
+        p = field
+        field = "F_p"
+    if field == "F_p":
+        cond = lambda M: np.allclose(np.mod(M.T @ M,p), np.eye(n)) and np.isclose(np.linalg.det(M)%p, 1.0)
+    else:
+        cond = lambda M: np.allclose(M.T @ M, np.eye(n)) and np.isclose(np.linalg.det(M), 1.0)
+    return MatrixGroup(n, field=field, condition=cond, p=p)
 def U(n):
     """
@@ -243,11 +257,11 @@ def SU(n):
     cond = lambda M: np.allclose(M.conj().T @ M, np.eye(n)) and np.isclose(np.linalg.det(M), 1.0 + 0j)
     return MatrixGroup(n, field="C", condition=cond)
-def Sp(n):
+def Sp(n, field="R", p=None):
     """
-    Symplectic Group Sp(2n, R) over real matrices.
+    Symplectic Group Sp(n, R).
     Condition: M^T @ J @ M = J, where J = [[0, I], [-I, 0]].
-    Note: The matrix dimension must be even (2n).
+    Note: The matrix dimension must be even.
     """
     if n % 2 != 0:
         raise ValueError(__errorcolor__+"Symplectic group dimension must be an even integer.")
@@ -256,7 +270,15 @@ def Sp(n):
     I_k = np.eye(k)
     J = np.block([[np.zeros((k, k)), I_k],
                   [-I_k, np.zeros((k, k))]])
+    if type(field)==int:
+        p = field
+        field = "F_p"
+    if field == "F_p":
+        Jp = np.mod(J,p)
+        cond = lambda M: np.allclose(np.mod(M.T @ J @ M,p), Jp)
+    else:
+        cond = lambda M: np.allclose(M.T @ J @ M, J)
-    cond = lambda M: np.allclose(M.T @ J @ M, J)
-    return MatrixGroup(n, field="R", condition=cond)
+    return MatrixGroup(n, field=field, condition=cond, p=p)

groupsmath-0.7.0/groupsmath/presentations.py ADDED Viewed

@@ -0,0 +1,558 @@
+from .core import *
+from .core import __errorcolor__
+from collections import deque
+#################### WARNINGS ####################
+print("\033[33m[!] WARNING: The library 'groupsmath.presentations' is under development and it might produce errors.\033[0m")
+#################### PRESENTATIONS ####################
+class Word():
+    def __init__(self,word,_skip_validation=False):
+        if type(word)!=str:
+            raise ValueError (__errorcolor__+"The word has to be a string.")
+        l = []
+        if word=="" or word=="e":
+            word = ""
+        for i in word:
+            l.append(i)
+            if i not in "qwrtyuiopasdfghjklzxcvbnmQWRTYUIOPASDFGHJKLZXCVBNM":
+                raise ValueError (__errorcolor__+"The word must consist of Latin characters except the letters e/E.")
+        self.word = word
+        self.characters = l
+    def __mul__(self,other):
+        o = other if isinstance(other, Word) else Word(other)
+        return Word(self.word+o.word)
+    def __rmul__(self,other):
+        o = other if isinstance(other, Word) else Word(other)
+        return Word(o.word+self.word)
+    def __pow__(self,n):
+        if n==0:
+            return Word("e")
+        elif n>0:
+            return Word(self.word*n)
+        elif n<0:
+            return Word(self.inverse().word*-n)
+    def __eq__(self,other):
+        if not isinstance(other, Word):
+            return NotImplemented
+        return self.word == other.word
+    def __invert__(self):
+        return self.inverse()
+    def __len__(self):
+        return len(self.word)
+    def __str__(self):
+        if self.word=="":
+            return "e"
+        return self.word
+    def __hash__(self):
+        return hash(self.word)
+    def inverse(self):
+        def _invert(a):
+            if a in "qwrtyuiopasdfghjklzxcvbnm":
+                return a.upper()
+            else:
+                return a.lower()
+        if self.word=="":
+            return self
+        I = ""
+        n = len(self)
+        for i in range(n):
+            I+= _invert(self.word[n-i-1])
+        return Word(I)
+''' Revisar por si aparecen errores '''
+class PresentedGroup(Group):
+    def __init__(self, generators: list, relations: list):
+        # ---------------------------------------------------------
+        # 1. GENERADORES
+        # ---------------------------------------------------------
+        self.generators_names = []
+        for g in generators:
+            g_str = str(g).strip()
+            if len(g_str) != 1 or not g_str.islower() or not g_str.isalpha():
+                raise ValueError(
+                    __errorcolor__ +
+                    f"Generators must be single lowercase Latin letters. Invalid: '{g}'"
+                )
+            if g_str in self.generators_names:
+                raise ValueError(
+                    __errorcolor__ +
+                    f"Duplicate generator: '{g_str}'"
+                )
+            self.generators_names.append(g_str)
+        # a <-> A
+        self.inverses_map = {
+            g: g.upper()
+            for g in self.generators_names
+        }
+        self.inverses_map.update({
+            g.upper(): g
+            for g in self.generators_names
+        })
+        # ---------------------------------------------------------
+        # 2. RELACIONES
+        # ---------------------------------------------------------
+        self.relations = []
+        for r in relations:
+            w = r if isinstance(r, Word) else Word(str(r))
+            self._validate_word_alphabet(w)
+            # Las relaciones se almacenan libremente reducidas.
+            w = self._free_reduce(w)
+            self.relations.append(w)
+        # ---------------------------------------------------------
+        # 3. CACHE
+        # ---------------------------------------------------------
+        self._cayley_cache = None
+    # =============================================================
+    # VALIDACIÓN
+    # =============================================================
+    def _validate_word_alphabet(self, word: Word):
+        valid_chars = (
+            set(self.generators_names)
+            |
+            set(self.inverses_map.keys())
+        )
+        for char in word.word:
+            if char not in valid_chars:
+                raise ValueError(
+                    __errorcolor__ +
+                    f"Character '{char}' in word '{word}' "
+                    f"is not a valid generator for this group."
+                )
+    def _to_word(self, element) -> Word:
+        if isinstance(element, Word):
+            w = element
+        elif isinstance(element, str):
+            w = Word(element)
+        else:
+            raise TypeError(
+                __errorcolor__ +
+                f"Element must be a Word or str, "
+                f"got {type(element).__name__}"
+            )
+        self._validate_word_alphabet(w)
+        return w
+    # =============================================================
+    # REDUCCIÓN LIBRE
+    # =============================================================
+    def _free_reduce(self, word: Word) -> Word:
+        """
+        Reduce libremente una palabra eliminando pares xx^{-1}
+        y x^{-1}x.
+        Ejemplo:
+            aAbB -> e
+            abBA -> e
+            a b B a -> aa
+        """
+        stack = []
+        for char in word.word:
+            if stack and self.inverses_map.get(stack[-1]) == char:
+                stack.pop()
+            else:
+                stack.append(char)
+        return Word(
+            "".join(stack),
+            _skip_validation=True
+        )
+    # =============================================================
+    # RELACIONES
+    # =============================================================
+    def _relation_rules(self):
+        """
+        Construye reglas de reescritura a partir de las relaciones.
+        Para una relación:
+            r = x1 x2 ... xn = e
+        se generan:
+        1. El relator y su inverso:
+            r -> e
+            r^-1 -> e
+        2. Reglas derivadas aislando cada generador/inverso.
+        Por ejemplo:
+            aaa = e
+        implica:
+            A = aa
+        y, para obtener una forma normal más corta:
+            aa -> A
+        """
+        rules = []
+        for relation in self.relations:
+            relation = self._free_reduce(relation)
+            if len(relation) == 0:
+                continue
+            s = relation.word
+            n = len(s)
+            # ---------------------------------------------------------
+            # 1. RELATOR Y SU INVERSO
+            # ---------------------------------------------------------
+            rules.append((s, ""))
+            inverse = relation.inverse().word
+            rules.append((inverse, ""))
+            # ---------------------------------------------------------
+            # 2. REGLAS DERIVADAS
+            # ---------------------------------------------------------
+            for i, char in enumerate(s):
+                left = s[:i]
+                right = s[i + 1:]
+                # x^{-1} = right * left
+                #
+                # porque:
+                #
+                # left x right = e
+                #
+                # => x^{-1} = right left
+                inverse_char = self.inverses_map[char]
+                rhs = right + left
+                # Regla:
+                #
+                # x^{-1} -> rhs
+                #
+                rules.append((inverse_char, rhs))
+                # También podemos utilizar la ecuación
+                #
+                # x = (right left)^{-1}
+                #
+                # y obtener:
+                #
+                # x -> inverse(rhs)
+                rhs_inverse = Word(
+                    rhs,
+                    _skip_validation=True
+                ).inverse().word
+                rules.append((char, rhs_inverse))
+        # -------------------------------------------------------------
+        # 3. ELIMINAR DUPLICADOS
+        # -------------------------------------------------------------
+        unique = []
+        seen = set()
+        for lhs, rhs in rules:
+            if (lhs, rhs) not in seen:
+                seen.add((lhs, rhs))
+                unique.append((lhs, rhs))
+        return unique
+    # =============================================================
+    # REDUCCIÓN MEDIANTE RELACIONES
+    # =============================================================
+    def _relation_reduce_once(self, word):
+        """
+        Aplica una regla de reescritura una sola vez.
+        """
+        s = word.word
+        for lhs, rhs in self._relation_rules():
+            if not lhs:
+                continue
+            position = s.find(lhs)
+            if position == -1:
+                continue
+            left = s[:position]
+            right = s[position + len(lhs):]
+            new_word = Word(
+                left + rhs + right,
+                _skip_validation=True
+            )
+            new_word = self._free_reduce(new_word)
+            # Solo aceptamos reglas que realmente reduzcan
+            # la longitud de la palabra.
+            if len(new_word) < len(word):
+                return new_word, True
+        return word, False
+    def _reduce(self, word: Word) -> Word:
+        """
+        Reducción completa de una palabra.
+        Primero realiza reducción libre y posteriormente aplica
+        las relaciones hasta que no puede efectuar más reducciones.
+        """
+        word = self._free_reduce(word)
+        while True:
+            new_word, changed = self._relation_reduce_once(word)
+            if not changed:
+                return self._free_reduce(word)
+            word = self._free_reduce(new_word)
+    # =============================================================
+    # OPERACIÓN DE GRUPO
+    # =============================================================
+    def operation(self, elem1, elem2) -> Word:
+        w1 = self._to_word(elem1)
+        w2 = self._to_word(elem2)
+        return self._reduce(w1 * w2)
+    def identity(self) -> Word:
+        return Word("e")
+    def inverse(self, elem) -> Word:
+        w = self._to_word(elem)
+        return self._reduce(~w)
+    def __contains__(self, elem) -> bool:
+        try:
+            self._to_word(elem)
+            return True
+        except (ValueError, TypeError):
+            return False
+    # =============================================================
+    # CONVERSIÓN A CAYLEY GROUP
+    # =============================================================
+    def toCayleyGroup(self, max_elements: int = 1000) -> CayleyGroup:
+        """
+        Construye una representación mediante tabla de Cayley
+        explorando el grupo mediante BFS.
+        La enumeración se realiza sobre palabras reducidas
+        módulo las relaciones.
+        """
+        if self._cayley_cache is not None:
+            return self._cayley_cache
+        # Generadores e inversos
+        all_gens = (
+            [Word(g) for g in self.generators_names]
+            +
+            [Word(g.upper()) for g in self.generators_names]
+        )
+        # Identidad
+        identity = self.identity()
+        discovered = [identity]
+        word_to_idx = {
+            identity: 0
+        }
+        queue = deque([identity])
+        # ---------------------------------------------------------
+        # BFS
+        # ---------------------------------------------------------
+        while queue:
+            current_word = queue.popleft()
+            for gen in all_gens:
+                next_word = self.operation(
+                    current_word,
+                    gen
+                )
+                if next_word not in word_to_idx:
+                    if len(discovered) >= max_elements:
+                        raise OverflowError(
+                            __errorcolor__ +
+                            f"Group could not be enumerated within "
+                            f"the maximum limit of {max_elements} elements."
+                        )
+                    word_to_idx[next_word] = len(discovered)
+                    discovered.append(next_word)
+                    queue.append(next_word)
+        # ---------------------------------------------------------
+        # TABLA DE CAYLEY
+        # ---------------------------------------------------------
+        n = len(discovered)
+        cayley_matrix = [
+            [0] * n
+            for _ in range(n)
+        ]
+        for i, w1 in enumerate(discovered):
+            for j, w2 in enumerate(discovered):
+                prod = self.operation(w1, w2)
+                cayley_matrix[i][j] = word_to_idx[prod]
+        # ---------------------------------------------------------
+        # NOMBRES
+        # ---------------------------------------------------------
+        names = [
+            str(w)
+            for w in discovered
+        ]
+        self._cayley_cache = CayleyGroup(
+            cayley_matrix,
+            names,
+            _skip_validation=True
+        )
+        return self._cayley_cache
+    def toExplicitGroup(self) -> ExplicitGroup:
+        return self.toCayleyGroup().toExplicitGroup()
+    def order(self) -> int:
+        return self.toCayleyGroup().order()
+    # =============================================================
+    # REPRESENTACIÓN
+    # =============================================================
+    def __str__(self):
+        gens_str = ", ".join(
+            self.generators_names
+        )
+        rels_str = ", ".join(
+            str(r)
+            for r in self.relations
+        )
+        return f"〈 {gens_str} | {rels_str} 〉"
+    def __repr__(self):
+        return self.__str__()

groupsmath-0.7.0/groupsmath/structure.py ADDED Viewed

@@ -0,0 +1,120 @@
+from .core import *
+from .core import __errorcolor__
+''' Revisar, que aparecen errores '''
+#################### WARNINGS ####################
+print("\033[33m[!] WARNING: The library 'groupsmath.structure' is under development and it might produce errors.\033[0m")
+#################### STRUCTURE DESCRIPTION ####################
+def structure_description(G):
+    """
+    Caracteriza algebraicamente la estructura de G sin usar tablas predefinidas.
+    Retorna una cadena con la notación de grupos (ej: 'C2 x C2', 'C3 : C4', 'S3').
+    """
+    n = G.order()
+    # 1. CASO TRIVIAL
+    if n == 1:
+        return "I"
+    # 2. CASO ABELIANO (Teorema Fundamental)
+    if G.is_abelian():
+        return _decompose_abelian(G)
+    # 3. CASO SIMPLE
+    if G.is_simple():
+        return _describe_simple(G)
+    # 4. DESCOMPOSICIÓN POR SUBGRUPOS NORMALES
+    normals = G.normal_subgroups()
+    # Filtramos para quedarnos solo con subgrupos normales propios no triviales
+    proper_normals = [H for H in normals if 1 < H.order() < n]
+    # Intentar factorizar usando subgrupos normales (de mayor a menor tamaño)
+    proper_normals.sort(key=lambda h: h.order(), reverse=True)
+    for N in proper_normals:
+        # Buscar un complemento H tal que N * H = G y N \cap H = {e}
+        complement = _find_complement(G, N)
+        if complement is not None:
+            name_N = structure_description(N)
+            name_H = structure_description(complement)
+            # Si el complemento H también es normal -> Producto Directo (N x H)
+            if complement.is_normal():
+                return f"{name_N} x {name_H}"
+            # Si H no es normal -> Producto Semidirecto (N : H)
+            else:
+                return f"{name_N} : {name_H}"
+    # 5. SI NO HAY COMPLEMENTO (Extensión no escindida N.H)
+    # Tomamos el mayor subgrupo normal N y el cociente G/N
+    N = proper_normals[0]
+    Q = G.quotient(N)
+    return f"{structure_description(N)}.{structure_description(Q)}"
+#################### HIDDEN FUNCTIONS ####################
+def _decompose_abelian(G):
+    """Descompone un grupo abeliano en factores cíclicos C_d1 x C_d2 ..."""
+    n = G.order()
+    orders = G.element_orders()
+    # Si el elemento de orden máximo es n, es cíclico puro
+    if max(orders) == n:
+        return f"C{n}"
+    # Descomposición en factores de invariantes
+    # Para grupos abelianos pequeños, extrae exponentes del grupo
+    factors = []
+    temp_n = n
+    # Extraer factores cíclicos iterativamente sobre los elementos
+    curr_group = G
+    while temp_n > 1:
+        m = max(curr_group.element_orders())
+        factors.append(f"C{m}")
+        temp_n //= m
+        if temp_n == 1:
+            break
+        # Reducción aproximada de la componente abeliana
+        break # Para extender con divisores elementales p-primarios completos
+    if len(factors) == 1 and temp_n > 1:
+        # Fallback de seguridad en caso de multiplicidad
+        return f"C{max(orders)} x C{n // max(orders)}"
+    return " x ".join(sorted(factors, reverse=True))
+def _find_complement(G, N):
+    """Busca un subgrupo H <= G tal que N & H = {e} y |N| * |H| = |G|."""
+    target_order = G.order() // N.order()
+    for H in G.subgroups():
+        if H.order() == target_order:
+            # Comprobar intersección trivial N & H = {e}
+            intersection = set(N.elements).intersection(set(H.elements))
+            if len(intersection) == 1:
+                return H
+    return None
+def _describe_simple(G):
+    """Identifica la familia del grupo simple."""
+    n = G.order()
+    if G.is_abelian():
+        return f"C{n}"  # C_p con p primo
+    # Clasificación básica de simples no abelianos por orden
+    if n == 60:
+        return "A5"
+    if n == 168:
+        return "PSL(2,7)"
+    if n == 360:
+        return "A6"
+    return f"SimpleGroup({n})"

{groupsmath-0.6.0 → groupsmath-0.7.0}/pyproject.toml RENAMED Viewed

@@ -3,8 +3,8 @@ requires = ["setuptools>=61.0"]
 build-backend = "setuptools.build_meta"
 [project]
-name = "GroupsMath"            # Nombre en PyPI (ej: mi-paquete)
-version = "0.6.0"
+name = "GroupsMath"            # Nombre en PyPI
+version = "0.7.0"
 description = "The educational Python library for Group Theory"
 readme = "README.md"                  # Esta será la documentación visible en la portada de PyPI
 requires-python = ">=3.8"
@@ -31,8 +31,8 @@ classifiers = [
 # Enlaces que aparecerán en la barra lateral de tu paquete en PyPI
 [project.urls]
-Homepage = "https://github.com/MarioSultan/GroupsMath"  #Nombre actual del repositorio (voy a cambiarlo en breve)
-Documentation = "https://github.com/MarioSultan/GroupsMath/tree/main/docs" # <-- Enlace a tu carpeta docs
+Homepage = "https://github.com/MarioSultan/GroupsMath"  #Nombre actual del repositorio
+Documentation = "https://groupsmath.readthedocs.io/en/latest/"
 Issues = "https://github.com/MarioSultan/GroupsMath/issues"
 # Configuración cuando NO usas la carpeta src/