Diff for "padicSageDays/Projects/Factoring"

Differences between revisions 2 and 6 (spanning 4 versions)

Sebastian Pauli, Brian Sinclair, Maurizio Monge, David Roe, Xavier Caruso

Implement a native Sage algorithm for local field polynomial factorization. For more detail, see http://wiki.sagemath.org/padics/PolynomialFactoring.

A functioning version of the algorithm is up: See #12561. "Functioning" was an ambitious term, some examples are incorrectly returned as irreducible.

Given a polynomial P, can we derive from this algorithm a way to compute the graph (embedded in the Berkovich line) whose edges are the roots of P?

-  ⇤ ← Revision 2 as of 2012-02-21 12:11:38 → 
  Size: 78
  Editor: roed
  Comment:
+   ← Revision 6 as of 2012-02-22 22:29:26 → ⇥
  Size: 680
  Editor: bsinclai
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 3:
-Sebastian Pauli, Brian Sinclair, Maurizio Monge, David Roe
+Sebastian Pauli, Brian Sinclair, Maurizio Monge, David Roe, Xavier Caruso

=== Description ===

Implement a native Sage algorithm for local field polynomial factorization. For more detail, see [[http://wiki.sagemath.org/padics/PolynomialFactoring]].

=== Current Progress ===

A functioning version of the algorithm is up: See [[http://trac.sagemath.org/sage_trac/ticket/12561|#12561]].  "Functioning" was an ambitious term, some examples are incorrectly returned as irreducible.

=== A question ===

Given a polynomial P, can we derive from this algorithm a way to compute the graph (embedded in the Berkovich line) whose edges are the roots of P?