determines the Puiseux expansions of an algebraic function
puiseux(a, x=p, n)
puiseux(f, x=p, y, n)
puiseux(f, x=p, y, n, T)
algebraic function in RootOf form
gives the point around which the expansions are computed
number specifying the desired accuracy of the expansions
square-free polynomial in x and y
(optional) variable, used for obtaining a different output syntax
A square-free polynomial f of degree N in the variable y with coefficients in a field L⁡x has N roots in the algebraic closure of the field L⁡x−p. These roots are called the Puiseux expansions of f at x=p. Each Puiseux expansion is of the form ∑i=−N∞⁡ai⁢x−pir 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 L⁡x. 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 L⁡x−p. So if a number of expansions are algebraically conjugated over L⁡x−p 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
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.
To get all 8 Puiseux expansions substitute all conjugates over L⁡x of x15 and −x13 in this set.
Download Help Document
What kind of issue would you like to report? (Optional)