songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

returns canonicalized square free part

This commit is contained in:
Michael Hemmer 2008-07-28 14:36:00 +00:00
parent b2b3651325
commit 87602b73c1
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Polynomial/doc_tex/Polynomial_ref/PolynomialTraits_d_MakeSquareFree.tex
View File

@ -7,7 +7,7 @@ a polynomial of type \ccc{PolynomialTraits_d::Polynomial_d}
A polynomial $p$ can be factored into square-free and pairwise coprime A polynomial $p$ can be factored into square-free and pairwise coprime
non-constant factors $g_i$ with multiplicities $m_i$ and a constant factor $a$, non-constant factors $g_i$ with multiplicities $m_i$ and a constant factor $a$,
such that $p = a \cdot g_1m_1 \cdot ... \cdot g_nm_n$. such that $p = a \cdot g_1m_1 \cdot ... \cdot g_nm_n$, where all $g_i$ are canonicalized.
Given this decomposition, the square free part is defined as the product $g_1 \cdot ... \cdot g_n$, Given this decomposition, the square free part is defined as the product $g_1 \cdot ... \cdot g_n$,
which is computed by this functor. which is computed by this functor.
@ -25,7 +25,7 @@ which is computed by this functor.
\ccOperations \ccOperations
\ccMethod{result_type operator()(argument_type p);} \ccMethod{result_type operator()(argument_type p);}
{ return the square-free part of $p$ {\em up to a constant factor.} } { return the square-free part of $p$.}
%\ccHasModels %\ccHasModels
@ -33,5 +33,6 @@ which is computed by this functor.
\ccSeeAlso \ccSeeAlso
\ccRefIdfierPage{Polynomial_d}\\ \ccRefIdfierPage{Polynomial_d}\\
\ccRefIdfierPage{PolynomialTraits_d} \ccRefIdfierPage{PolynomialTraits_d}\\
\ccRefIdfierPage{PolynomialTraits_d::Canonicalize}
\end{ccRefConcept} \end{ccRefConcept}