3 | | 1. def random_irreducible in `class SkewPolynomialRing_general` in `skew_polynomial_ring.py` |

4 | | |

5 | | 2. Following functions to the `class SkewPolynomial_finite_field_dense`: |

6 | | - def is_irreducible |

7 | | - def bound |

8 | | - def type |

9 | | - cdef SkewPolynomial_finite_field_dense _rdivisor_c |

10 | | - def irreducible_divisor |

11 | | - def irreducible_divisor_with_norm |

12 | | - def irreducible_divisors |

13 | | - def _irreducible_divisors |

14 | | - def count_irreducible_divisors |

15 | | - cdef _factor_c |

16 | | - cdef _factor_uniform_c |

17 | | - def factor(self,distribution=None): |

18 | | - def count_factorizations(self): |

19 | | - def count_factorisations(self): |

20 | | - def factorizations |

21 | | - def factorisations |

22 | | |

23 | | Note: The original ticket #13215 first introduced this functionality. That was subsequently modified to support the basic implementation of skew polynomials and the factoring and irreducibility related methods from that ticket that were removed are being reintroduced here. |

| 3 | - `is_irreducible` |

| 4 | - `right_irreducible_divisor`, `left_irreducible_divisor` (return a divisor) |

| 5 | - `right_irreducible_divisors`, `left_irreducible_divisors` (return an iterator over all divisors) |

| 6 | - `count_irreducible_divisors` |

| 7 | - `factor` (return a factorization) |

| 8 | - `factorizations` (return an iterator over all factorizations) |

| 9 | - `count_factorizations` |