puiseux - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

All Products    Maple    MapleSim


algcurves

  

puiseux

  

determine the Puiseux expansions of an algebraic function

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

puiseux(a, x=p, n)

puiseux(f, x=p, y, n)

puiseux(f, x=p, y, n, T)

Parameters

a

-

algebraic function in RootOf form

x=p

-

gives the point around which the expansions are computed

n

-

number specifying the desired accuracy of the expansions

y

-

variable

f

-

square-free polynomial in x and y

T

-

(optional) variable, used for obtaining a different output syntax

Description

• 

A square-free polynomial f of degree N in the variable y with coefficients in a field Lx has N roots in the algebraic closure of the field Lxp. These roots are called the Puiseux expansions of f at x=p. Each Puiseux expansion is of the form i=Naixpir for some integer r (r is called the ramification index of the Puiseux expansion), and some integer N and elements ai in the algebraic closure of L.

• 

The polynomial f must be square-free, otherwise the puiseux procedure does not work.

• 

If f is irreducible then f gives an algebraic extension Lxy/f of Lx. Instead of giving f, this algebraic extension can also be specified with a RootOf a of f. This a can be viewed as a multivalued function in x. The Puiseux expansions give the local expansions of this multivalued function.

• 

The procedure puiseux determines the field L from the input. The groundfield L of the computation is the smallest field such that f and p are in Lxy .

• 

The Puiseux expansions are only computed up to conjugation over Lxp. So if a number of expansions are algebraically conjugated over Lxp then only one of these expansions is given.

• 

The Puiseux expansions are computed modulo xn. So if for instance n=10, then the term x495 would be computed, but not the term x10.

• 

If n=0 then the expansions are not computed modulo x0, but in this case the number of terms that is computed is precisely the number that is needed to distinguish the expansions from the other expansions. If n='minimal' then the same output is given.

• 

To avoid an output containing fractional powers of x one can specify a fifth argument T. Then the Puiseux expansions in the output are represented in a different way, namely as

[x=aconstantapowerofT,y=apower seriesinT]

  

So then x and y are expressed in terms of a local parameter.

  

Note: The Maple "alias" function does not recognize an alias in terms of another alias. Therefore, you must not use nested aliases for algebraic numbers because then the puiseux algorithm is not able to construct the field L over which the algebraic function is defined.

Examples

withalgcurves:

αRootOfx3+7

αRootOf_Z3+7

(1)

fy8+xy5+x4x6α

fy8RootOf_Z3+7x6+xy5+x4

(2)

puiseuxf,x=0,y,0

x13,x35

(3)

puiseuxf,x=0,y,5

170x13381+RootOf_Z3+7x1133+2x33x533+x13,2538915625+2RootOf_Z3+7225x235+42RootOf_Z3+7x215125483x195625+4RootOf_Z3+7x175252x35+RootOf_Z3+7x13556x11525x755x35

(4)

To get all 8 Puiseux expansions substitute all conjugates over Lx of x15 and x13 in this set.

See Also

series