Skip to main content

All Questions

Filter by
Sorted by
Tagged with
9 votes
1 answer
698 views

Hensel's lemma, Bezout's identity, and the integers

Factorization in the ring $\mathbb{Z}[x]/(x^2+1)\mathbb{Z}[x]\cong \mathbb{Z}[i]$ is well known. For instance, $5$ and $13$ (and any prime $\equiv 1\pmod{4}$) are no longer prime. The factorization ...
Pace Nielsen's user avatar
  • 18.7k
5 votes
0 answers
153 views

On factorization algorithms for $\mathcal{O}[x]$

We know that $\mathsf{LLL}$ algorithm provides factorization procedure that runs in poly time for polynomials in $\Bbb Z[x]$ that are primitive. What other rings $\mathcal{O}$ can we use instead of $\...
user avatar