Diff for "padicSageDays/Projects/Factoring"

Differences between revisions 3 and 5 (spanning 2 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.

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 3 as of 2012-02-22 09:23:21 → 
  Size: 390
  Editor: bsinclai
  Comment:
+   ← Revision 5 as of 2012-02-22 13:45:20 → ⇥
  Size: 589
  Editor: caruso
  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
 Line 7:
-Implement a native Sage algorithm for local field factorization. For more detail, see [[http://wiki.sagemath.org/padics/PolynomialFactoring]].
+Implement a native Sage algorithm for local field polynomial factorization. For more detail, see [[http://wiki.sagemath.org/padics/PolynomialFactoring]].
 Line 12:
+=== 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?