CGAL 4.7 - Polynomial: PolynomialTraits_d::IsSquareFree Concept Reference

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - Polynomial

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
PolynomialTraits_d::IsSquareFree Concept Reference
Concepts

## Definition

This `AdaptableUnaryFunction` computes whether the given a polynomial of type `PolynomialTraits_d::Polynomial_d` is square free.

Note that this statement does cover constant factors, i.e., whether the multivariate content contains a square.

Refines:

  `AdaptableUnaryFunction`

  `CopyConstructible`

  `DefaultConstructible`

See Also
  `Polynomial_d`
  `PolynomialTraits_d`
  `PolynomialTraits_d::SquareFreeFactorize`
  `PolynomialTraits_d::MakeSquareFree`
  `PolynomialTraits_d::MultivariateContent`

## Types

typedef bool | result_type
typedef PolynomialTraits_d::Polynomial_d | argument_type

## Operations

result_type | operator() (argument_type p)
| Returns whether the \( p\) is square free.