compute a cylindrical decomposition of the complex space - Maple Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Factorization and Solving Equations : RegularChains : ConstructibleSetTools Subpackage : RegularChains/ConstructibleSetTools/CylindricalDecompose

RegularChains[ConstructibleSetTools][CylindricalDecompose] - compute a cylindrical decomposition of the complex space

RegularChains[ConstructibleSetTools][SeparateZeros] - separate the zeros of a univariate parametric polynomial

Calling Sequence

CylindricalDecompose(F, R)

CylindricalDecompose(F, R, 'output'='piecewise')

CylindricalDecompose(F, R, 'output'='tree')

SeparateZeros(rs, R)

Parameters

R

-

polynomial ring

F

-

list of polynomials of R

'output'='piecewise'

-

(optional) boolean flag

'output'='tree'

-

(optional) boolean flag

rs

-

regular system

Description

• 

CylindricalDecompose(F, R) returns an F-invariant cylindrical decomposition of the n-dimensional complex space, where n is the number of variables in R.

• 

A cylindrical decomposition of the n-dimensional complex space is a partition of the whole space into cells that are constructible sets, such that the cells in the partition are cylindrically arranged, that is, the projection of any two cells onto any lower dimensional complex space are either equal or disjoint. This decomposition is called F-invariant if for any given cell, either all polynomials of F are identically zero in that cell, or none of them admits a zero in that cell.

• 

The output is represented by a tree or a piecewise function. The default is the piecewise format.

• 

SeparateZeros(rs, R) returns a list, say pairs. Each item of pairs is a pair [cs, polys] where cs is a constructible set and polys is a list of nonconstant polynomials such that for each point u of cs, the initial of each polynomial p in polys  does not vanish at u and all the polynomials p(u) are squarefree and  pairwise coprime. Moreover, above each cs, the zero set of rs is equal to the union of the zero sets  of the polynomials in polys.

• 

Roughly speaking, SeparateZeros(rs, R) decomposes the zeros of rs regarding all variables but the largest one as parameters. Since the input is a regular system, one polynomial in rs has a non-zero degree in this largest variable; the other polynomials in rs define constraints on the parameters.

Examples

withRegularChains:

withChainTools:

withConstructibleSetTools:

Define a ring of polynomials.

R:=PolynomialRingx,a,b

R:=polynomial_ring

(1)

Define a polynomial set of R.

F:=ax2b

F:=ax2b

(2)

Compute a cylindrical decomposition of the 3-D complex space.

cd:=CylindricalDecomposeF,R

cd:={{1a=0{1x=01otherwiseotherwiseb=0{1a=0{1x2ab=01otherwiseotherwiseotherwise

(3)

Define a regular chain of R.

rc:=Chainax2b,EmptyR,R

rc:=regular_chain

(4)

Define a regular system of R.

rs:=RegularSystemrc,R;Infors,R

rs:=regular_system

ax2b,1

(5)

Separate its zeros, regarding all variables except the largest as parameters.

pairs:=SeparateZerosrs,R

pairs:=constructible_set,ax2b,constructible_set,x

(6)

The output consists of two pairs. Display the constructible sets.

seqInfopair1,R,pair=pairs

,a2,b,b,a

(7)

See Also

ComprehensiveTriangularize, CylindricalAlgebraicDecompose, RegularChains


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam