Enhanced Packages in Maple 9: Part 2 - Maple Programming Help

Enhanced Packages in Maple 9: Part 2

 • Maple 9 contains many enhancements to existing packages. For additional enhancements, see Enhanced Packages in Maple 9: Part 1.
 • For information on new Maple 9 packages, see New Packages in Maple 9.
 • Enhanced Packages in Maple 9: Part 2 contains information for the following packages.

StringTools

 • The StringTools package contains many new procedures. Many existing StringTools commands have been improved.

Metrics and Distances

 • Several new string metrics are provided: StringTools[HammingDistance], StringTools[EditDistance], StringTools[PrefixDistance], StringTools[SuffixDistance], and StringTools[SimilarityCoefficient].
 > with( StringTools ):
 > HammingDistance( "Mathematics", "Mathematische" );
 ${4}$ (1)
 > EditDistance( "Mathematics", "Mathematische" );
 ${4}$ (2)
 > PrefixDistance( "Mathematics", "Mathematische" );
 ${6}$ (3)
 > SuffixDistance( "Mathematics", "Mathematische" );
 ${24}$ (4)
 > SimilarityCoefficient( "Mathematics", "Mathematische" );
 $\frac{{13}}{{7}}$ (5)

Pattern Matching

 • The Search and SearchAll pattern matching routines have been extended to allow simultaneous searching of multiple texts. By amortizing the cost of preprocessing, this is more efficient than composing single calls to Search using map2.
 > Pattern := Random( 1000, 'lower' ):
 ${\mathrm{true}}$ (6)
 > Texts := [seq]( Random( 5000, 'lower' ), i = 1 .. 5000 ):
 > evalb( Search( Pattern, Texts ) = map2( Search, Pattern, Texts ) );
 ${\mathrm{true}}$ (7)
 > time( Search( Pattern, Texts ) );
 ${0.006}$ (8)
 > time( map2( Search, Pattern, Texts ) );
 ${0.015}$ (9)
 > Texts := 'Texts':
 • In addition, you can perform multiple pattern searches on a single text.
 > SearchAll( [ "bac", "ab" ], "abcdababacef" );
 $\left[{1}{,}{2}\right]{,}\left[{5}{,}{2}\right]{,}\left[{7}{,}{2}\right]{,}\left[{8}{,}{1}\right]$ (10)
 > P := [seq]( ThueMorse( i ), i = 5 .. 10 );
 ${P}{≔}\left[{"01101"}{,}{"011010"}{,}{"0110100"}{,}{"01101001"}{,}{"011010011"}{,}{"0110100110"}\right]$ (11)
 > SearchAll( P, Random( 200, 'binary' ) );
 $\left[{26}{,}{1}\right]{,}\left[{26}{,}{2}\right]{,}\left[{65}{,}{1}\right]{,}\left[{65}{,}{2}\right]{,}\left[{65}{,}{3}\right]{,}\left[{77}{,}{1}\right]{,}\left[{77}{,}{2}\right]{,}\left[{77}{,}{3}\right]{,}\left[{135}{,}{1}\right]{,}\left[{135}{,}{2}\right]{,}\left[{176}{,}{1}\right]{,}\left[{176}{,}{2}\right]{,}\left[{176}{,}{3}\right]$ (12)
 • You can perform multiple pattern searches for persistent pattern lists using the PatternDictionary subpackage, which exports procedures designed to manage a persistent (external) search data structure for a list of patterns. You can also perform multiple pattern matching repeatedly without incurring the costs of pattern preprocessing, something not possible using only Search and SearchAll. You can create a dictionary using the PatternDictionary[Create] constructor. The input word list is preprocessed once and can then be used for all subsequent searches using PatternDictionary[Search]. Using the PatternDictionary[Get] and PatternDictionary[Size] procedures, you can retrieve matching patterns from the dictionary.
 > ReadWordList := fname -> remove( type, StringTools:-Split( readbytes( fname, 'TEXT', infinity ) ), "" ):
 > DICT := PatternDictionary:-Create( ReadWordList( "/usr/share/dict/words" ) ):
 > PatternDictionary:-Size( DICT );
 ${51122}$ (13)
 > PatternDictionary:-Get( DICT, 666 );
 ${"acquiring"}$ (14)
 > PatternDictionary:-Search( DICT, "childbirth" );
 $\left[{2}{,}{21453}\right]{,}\left[{1}{,}{7384}\right]{,}\left[{1}{,}{7412}\right]{,}\left[{6}{,}{4302}\right]{,}\left[{1}{,}{7414}\right]$ (15)
 > map2( PatternDictionary:-Get, DICT, map2( op, 2, [ (15) ] ) );
 $\left[{"hi"}{,}{"chi"}{,}{"child"}{,}{"birth"}{,}{"childbirth"}\right]$ (16)
 • The PatternDictionary subpackage also contains an algorithm for factoring a string over a dictionary of patterns. Given a string s, and a dictionary dict, the procedure PatternDictionary[Factors] computes a factorization of s over dict, that is, a sequence of patterns from dict whose concatenation is the string s.
 > dict := PatternDictionary:-Create( 'builtin' ): PatternDictionary:-Factors( "linearalgebra", dict );
 ${"linear"}{,}{"algebra"}$ (17)
 • Using the new WildcardMatch tool, you can perform glob-style pattern matching. The pattern language is similar to that used in UNIX shells, and is commonly applied to file and directory listings.
 > WildcardMatch( "a*b", "accccb" );
 ${\mathrm{true}}$ (18)
 > WildcardMatch( "a[c-z]b", "acccc" );
 ${\mathrm{false}}$ (19)
 > WildcardMatch( "a[c-z]??b", "acccc" );
 ${\mathrm{false}}$ (20)
 > WildcardMatch( "a[c-z]??b", "acccb" );
 ${\mathrm{true}}$ (21)
 > select( curry( WildcardMatch, "maple.???" ), listdir( if( nops( [ libname ] ) = 1, libname, libname[ 1 ] ) ) );
 $\left[{"maple.lib"}{,}{"maple.ind"}{,}{"maple.hdb"}\right]$ (22)
 • Using the new RegSplit procedure, you can split a string on substrings matching a regular expression.
 > RegSplit( "(a|b)+", "xabyazbaabubav" );
 ${"x"}{,}{"y"}{,}{"z"}{,}{"u"}{,}{"v"}$ (23)
 • Using the StringTools[RegSub] procedure, you can perform regular expression substitutions in strings. However, it has proved awkward to use in typical applications, and too closely matched the C APIs upon which it is based. A new StringTools[RegSubs] procedure is an improved user interface to this functionality. The calling interface resembles the built-in subs command.
 > RegSubs( "b" = "&&&", "abc" );
 ${"abbbc"}$ (24)
 > RegSubs( "[ \t]+" = " ", "Some text   \twith\t\t    too much  white     space.   " );
 ${"Some text with too much white space."}$ (25)
 • Four new procedures support approximate pattern matching, that is, searching text with errors. Two error models are supported. Approximate searching with respect to the Hamming metric using the StringTools[HammingSearch] and StringTools[HammingSearchAll] procedures. These are analogous to Search and SearchAll, respectively, but take a third argument, a non-negative integer, which specifies the maximum allowable number of mismatches (the Hamming distance) in a match. Similarly, StringTools[ApproximateSearch] and StringTools[ApproximateSearchAll] perform approximate pattern matching using the edit (Levenshtein) distance as the metric of closeness'' of a match.
 > Search( "maths", "mathematical" );
 ${0}$ (26)
 > HammingSearch( "maths", "mathematical", 1 );
 ${1}$ (27)
 > ApproximateSearch( "maths", "mathematical", 1 ); # reports END of match
 ${4}$ (28)
 • You can test whether one string is a subsequence of another using the new StringTools[IsSubSequence] procedure.
 ${\mathrm{true}}$ (29)
 • A number of string comparisons can be performed based on n-grams, using the new StringTools[NGrams] routine.
 > NGrams( "abracadabra", 2 ) ; # 2-grams or digrams
 $\left[{"ab"}{,}{"br"}{,}{"ra"}{,}{"ac"}{,}{"ca"}{,}{"ad"}{,}{"da"}{,}{"ab"}{,}{"br"}{,}{"ra"}\right]$ (30)
 > nops( (30) ) / nops( convert( (30), 'set' ) );
 $\frac{{10}}{{7}}$ (31)
 > NGrams( "abracadabra", 3 ) ; # 3-grams or trigrams
 $\left[{"abr"}{,}{"bra"}{,}{"rac"}{,}{"aca"}{,}{"cad"}{,}{"ada"}{,}{"dab"}{,}{"abr"}{,}{"bra"}\right]$ (32)
 > nops( (32) ) / nops( convert( (32), 'set' ) );
 $\frac{{9}}{{7}}$ (33)

Manipulating English Text

 • An implementation of Porter's stemming algorithm is provided in the new Stem procedure.
 > Stem( "hopeful" );
 ${"hope"}$ (34)
 • Other routines designed to operate on natural language (especially English) text are StringTools[Words], StringTools[WordCount], StringTools[Metaphone], and StringTools[SyllableLength].
 > Words( "Dimension implies direction, implies measurement, implies the more and the less." ); # - Edwin E. Abbot, "Flatland"
 $\left[{"Dimension"}{,}{"implies"}{,}{"direction"}{,}{"implies"}{,}{"measurement"}{,}{"implies"}{,}{"the"}{,}{"more"}{,}{"and"}{,}{"the"}{,}{"less"}\right]$ (35)
 > WordCount( "Dimension implies direction, implies measurement, implies the more and the less." );
 ${11}$ (36)
 > Metaphone( "Cline" );
 ${"KLN"}$ (37)
 > Metaphone( "Kline" );
 ${"KLN"}$ (38)
 The value that SyllableLength returns does not match the lexical syllable length found in dictionaries for some words.
 > SyllableLength( "antidisestablishmentarianism" );
 ${10}$ (39)

Combinatorial Utilities

 • A number of procedures are now provided for combinatorial operations on strings.
 • The Permute procedure applies an arbitrary permutation to the characters comprising a string. This defines an action of the symmetric group of degree $n$ on strings of length $n$.
 > Permute( "abc", [ 1, 3, 2 ] );
 ${"acb"}$ (40)
 • Two special cases are provided in the procedures Rotate and Exchange. The former applies a permutation of the form $\left(123\mathrm{...}n\right)$ to a string of length $n$, and the latter applies a transposition permutation to a string.
 > seq( Rotate( "abc", i ), i = -3 .. 3 );
 ${"abc"}{,}{"bca"}{,}{"cab"}{,}{"abc"}{,}{"cab"}{,}{"bca"}{,}{"abc"}$ (41)
 > Exchange( "abc", 1, 3 );
 ${"cba"}$ (42)
 • The characters (actually, byte code points) of a string can be simultaneously shifted by a fixed quantity using the Shift procedure. This is essentially a generalized Caesar cipher.
 > Shift( "abc", 2 );
 ${"cde"}$ (43)
 > Shift( "abc", -1 );
 ${"ab"}$ (44)
 • All strings of a given length on a fixed set of characters can be produced using the Generate procedure. Specify the length of strings to produce and the `alphabet'' upon which to generate the strings. Because of the rapid growth in the numbers of strings with the length and alphabet size, it is only practical to use this for modest sized inputs.
 > Generate( 3, "abc" );
 $\left[{"aaa"}{,}{"aab"}{,}{"aac"}{,}{"aba"}{,}{"abb"}{,}{"abc"}{,}{"aca"}{,}{"acb"}{,}{"acc"}{,}{"baa"}{,}{"bab"}{,}{"bac"}{,}{"bba"}{,}{"bbb"}{,}{"bbc"}{,}{"bca"}{,}{"bcb"}{,}{"bcc"}{,}{"caa"}{,}{"cab"}{,}{"cac"}{,}{"cba"}{,}{"cbb"}{,}{"cbc"}{,}{"cca"}{,}{"ccb"}{,}{"ccc"}\right]$ (45)
 • The Repeat procedure implements iterated concatenation efficiently.
 > Repeat( "some text ", 4 );
 ${"some text some text some text some text"}$ (46)
 • The Support utility determines the set of characters that occur in a string.
 > Support( "foobar" );
 ${"abfor"}$ (47)
 • Analogous to the numboccur procedure, the NumbOccur procedure in the StringTools package counts the number of occurrences of a character in a string.
 > seq( NumbOccur( "foobar", ch ), ch = Support( "foobar" ) );
 ${\mathrm{NumbOccur}}{}\left({"foobar"}{,}{"a"}\right){,}{\mathrm{NumbOccur}}{}\left({"foobar"}{,}{"b"}\right){,}{\mathrm{NumbOccur}}{}\left({"foobar"}{,}{"f"}\right){,}{\mathrm{NumbOccur}}{}\left({"foobar"}{,}{"o"}\right){,}{\mathrm{NumbOccur}}{}\left({"foobar"}{,}{"r"}\right)$ (48)

Handling Whitespace

 • The Trim, TrimLeft, and TrimRight procedures remove leading and trailing whitespace from strings. The new Center, PadLeft, and PadRight procedures provide approximate inverses to these text operations by adding leading and trailing whitespace to strings. You must specify a width as the second argument to each of these routines.
 ${"foo"}$ (49)
 ${"foo"}$ (50)
 > Center( "foo", 10 );
 ${"foo"}$ (51)

Combinatorics on Words

 • A number of new procedures support investigations in combinatorics on words (represented as strings).
 • Initial segments of the Thue-Morse and Fibonacci (semi-infinite) words can be constructed using StringTools[ThueMorse] and StringTools[Fibonacci], respectively.
 > seq( ThueMorse( n ), n = 1 .. 10 );
 ${"0"}{,}{"01"}{,}{"011"}{,}{"0110"}{,}{"01101"}{,}{"011010"}{,}{"0110100"}{,}{"01101001"}{,}{"011010011"}{,}{"0110100110"}$ (52)
 > seq( Fibonacci( n ), n = 1 .. 5 );
 ${"0"}{,}{"01"}{,}{"010"}{,}{"01001"}{,}{"01001010"}$ (53)
 > map( length, [ (53) ] );
 $\left[{1}{,}{2}{,}{3}{,}{5}{,}{8}\right]$ (54)
 • You can determine primitivity using StringTools[IsPrimitive].  You can extract the primitive root of a word using StringTools[PrimitiveRoot].
 > IsPrimitive( "abc" );
 ${\mathrm{true}}$ (55)
 > IsPrimitive( "ababab" );
 ${\mathrm{false}}$ (56)
 > PrimitiveRoot( "abc" );
 ${"abc"}$ (57)
 > PrimitiveRoot( "ababab" );
 ${"ab"}$ (58)
 • You can test for conjugacy in the free semigroup (on the nonzero byte values less than 256) using StringTools[IsConjugate]. You can also efficiently compute the (lexicographically) minimal element in the conjugacy class of a given word using StringTools[MinimumConjugate].
 > IsConjugate( "bca", "abc" );
 ${\mathrm{true}}$ (59)
 > IsConjugate( "bac", "abc" );
 ${\mathrm{false}}$ (60)
 > MinimumConjugate( "bca" );
 ${"abc"}$ (61)
 > MinimumConjugate( "bac" );
 ${"acb"}$ (62)
 • Every string possesses a unique non-increasing factorization into substrings, each of which is a minimum conjugate. These factors are the Lyndon factors of the string. You can compute this factorization using the procedure StringTools[LyndonFactors].
 > L := LyndonFactors( Fibonacci( 8 ) );
 ${L}{≔}\left[{"01"}{,}{"00101"}{,}{"0010010100101"}{,}{"00100101"}{,}{"001"}{,}{"001"}\right]$ (63)
 > cat( op( L ) );
 ${"0100101001001010010100100101001001"}$ (64)
 > Fibonacci( 8 );
 ${"0100101001001010010100100101001001"}$ (65)
 > evalb( (65) = (64) );
 ${\mathrm{true}}$ (66)
 > andmap( w -> evalb( w = MinimumConjugate( w ) ), L );
 ${\mathrm{true}}$ (67)
 > seq( evalb( L[ i ] <= L[ i - 1 ] ), i = 2 .. nops( L ) );
 ${\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}$ (68)
 • You can also factor a word into monotonic factors using MonotonicFactors.
 > MonotonicFactors( Fibonacci( 8 ) );
 $\left[{"01"}{,}{"001"}{,}{"01"}{,}{"001"}{,}{"001"}{,}{"01"}{,}{"001"}{,}{"01"}{,}{"001"}{,}{"001"}{,}{"01"}{,}{"001"}{,}{"001"}\right]$ (69)
 > andmap( IsMonotonic, (69) );
 ${\mathrm{true}}$ (70)
 • You can identify palindromes using the StringTools[IsPalindrome] procedure. (A palindrome is a string s for which $s=\mathrm{Reverse}\left(s\right)$.)
 > IsPalindrome( "abc" );
 ${\mathrm{false}}$ (71)
 > IsPalindrome( "aba" );
 ${\mathrm{true}}$ (72)
 • Periodicity of words (strings) plays an important role in combinatorics on words, as well as in pattern matching. A positive integer k is a period of a string s if ${s}_{i}={s}_{i+k}$, for $i=1..n-k$, where n is the length of s. You can test whether k is a period of s using the StringTools[IsPeriod] procedure. The least period of a string s is the period of s. You can compute the period of a string using the StringTools[Period] procedure.
 > IsPeriod( "abcab", 2 );
 ${\mathrm{false}}$ (73)
 > IsPeriod( "abcab", 3 );
 ${\mathrm{true}}$ (74)
 > Period( "abcab" );
 ${3}$ (75)
 > Period( "abcde" );
 ${5}$ (76)
 • You can compute the length of the maximum overlap between two strings using the StringTools[Overlap] procedure.
 • The border of a word is the longest subword that is both a prefix and suffix of the word. You can compute the border of a word using the StringTools[Border] procedure. For efficiency, you can compute the length of the border without actually constructing it using StringTools[BorderLength]. The border array of a word is the list of the lengths of the borders of its prefixes.
 > Border( Fibonacci( 8 ) );
 ${"0100101001001"}$ (77)
 > seq( evalb( Border( Fibonacci( n + 2 ) ) = Fibonacci( n ) ), n = 1 .. 10 );
 ${\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}{,}{\mathrm{true}}$ (78)
 > BorderArray( Fibonacci( 6 ) );
 $\left[{0}{,}{0}{,}{1}{,}{1}{,}{2}{,}{3}{,}{2}{,}{3}{,}{4}{,}{5}{,}{6}{,}{4}{,}{5}\right]$ (79)
 > Overlap( "abc", "bcd" );
 ${2}$ (80)
 > f8 := Fibonacci( 8 ):
 > Overlap( f8, f8 );
 ${34}$ (81)

Miscellaneous

 • The new StringTools[IsVowel] procedure recognizes the upper and lower case English language vowels: a, e, i, o, and u.
 > Select( IsVowel, "facetious" );
 ${"aeiou"}$ (82)
 • The StringTools[CamelCase] procedure performs a conversion that is best explained by the following example.
 > CamelCase( "linearalgebraicgroups" );
 ${"LinearAlgebraicGroups"}$ (83)
 • The new StringTools[Visible] procedure is an aid for examining strings that contain control characters. It replaces non-printing characters with ASCII escape codes.
 > Visible( Random( 10 ) );
 ${"\228\right\}\216\152\11\197\EG1"}$ (84)
 • The new StringTools[Anagrams] procedure searches for anagrams of a given word (string) in a list of words (strings).
 > Anagrams( "edit", [ "foo", "diet", "bar", "tide", "baz", "edit", "dite", "foobar" ] );
 ${"tide"}{,}{"diet"}{,}{"edit"}{,}{"dite"}$ (85)

Student

 • Two new subpackages have been added to the Student package, LinearAlgebra and Precalculus. For more information, see New Packages in Maple 9.
 • The Calculus1 subpackage in the Student package now contains interactive tutors, which are graphical user interfaces that help you work through particular calculus problems.  For more information, see Student[Calculus1][InteractiveOverview].

SumTools

 The SumTools package now contains functions that help you find closed forms of definite and indefinite sums. The package consists of three functions and three subpackages.

Functions for Computing Closed Forms

 The functions for computing closed forms of definite and indefinite sums are the following.
 • Summation: compute closed forms of definite and indefinite sums
 • DefiniteSummation: compute closed forms of definite sums
 • IndefiniteSummation: compute closed forms of indefinite sums

The DefiniteSum Package

 The DefiniteSum package contains tools for computing closed forms of definite sums.
 • CreativeTelescoping: compute closed forms of definite sums using the creative telescoping method
 • Definite: compute closed forms of definite sums using the general routine
 • pFqToStandardFunctions: compute closed forms of definite sums using the conversion method where the hypergeometric series is used as an intermediate representation
 • Telescoping: compute closed forms of definite sums using the classical telescoping method

The IndefiniteSum Subpackage

 The IndefiniteSum package contains tools for computing closed forms of indefinite sums.
 • AccurateSummation: indefinite sums using the method of accurate summation
 • Hypergeometric: indefinite sums of j-fold hypergeometric terms
 • Indefinite: general routine for computing closed forms of indefinite sums
 • Polynomial: indefinite sums of polynomials
 • Rational: indefinite sums of rational functions
 • RemoveIndefiniteSum: library extension mechanism

The Hypergeometric Subpackage

 The Hypergeometric package contains tools for working with hypergeometric terms in general, and for finding closed forms of definite and indefinite sums of hypergeometric term.
 • Normal forms of rational functions and of hypergeometric terms: MultiplicativeDecomposition, PolynomialNormalForm, RationalCanonicalForm, SumDecomposition
 • Algorithms for definite and indefinite sums of hypergeometric type: ExtendedGosper, ExtendedZeilberger, Gosper, IsZApplicable, KoepfGosper, KoepfZeilberger, LowerBound, MinimalZpair, Zeilberger, ZeilbergerRecurrence, ZpairDirect
 • Applications: DefiniteSum, IndefiniteSum, WZMethod
 •

SumTools[Hypergeometric] Enhancements

 • The SumTools[Hypergeometric][AccurateSummation] function has been superseded by the SumTools[IndefiniteSum][AccurateSummation] function.
 • The following new functions have been added to the SumTools[Hypergeometric] package:
 > with(SumTools:-Hypergeometric):
 • IsZApplicable: An implementation of a necessary and sufficient condition for the termination of Zeilberger's algorithm to hypergeometric terms.
 > T1 := 1/(n*k+n+1)*binomial(n,k+1) +      (n*k-2*k-n+2)/(n^2*k+2*n*k^2-n*k+2*k+n-1)*binomial(n,k);
 ${\mathrm{T1}}{≔}\frac{\left(\genfrac{}{}{0}{}{{n}}{{k}{+}{1}}\right)}{{n}{}{k}{+}{n}{+}{1}}{+}\frac{\left({n}{}{k}{-}{2}{}{k}{-}{n}{+}{2}\right){}\left(\genfrac{}{}{0}{}{{n}}{{k}}\right)}{{2}{}{n}{}{{k}}^{{2}}{+}{{n}}^{{2}}{}{k}{-}{n}{}{k}{+}{2}{}{k}{+}{n}{-}{1}}$ (86)
 > IsZApplicable(T1,n,k);
 ${\mathrm{true}}$ (87)
 > T2 := (-1)^k*1/(n*k+1)*binomial(n+1,k)*binomial(2*n-2*k-1,n-1);
 ${\mathrm{T2}}{≔}\frac{{\left({-1}\right)}^{{k}}{}\left(\genfrac{}{}{0}{}{{n}{+}{1}}{{k}}\right){}\left(\genfrac{}{}{0}{}{{2}{}{n}{-}{2}{}{k}{-}{1}}{{n}{-}{1}}\right)}{{n}{}{k}{+}{1}}$ (88)
 > IsZApplicable(T2,n,k);
 ${\mathrm{false}}$ (89)
 • LowerBound: An implementation of an algorithm to compute a lower bound for the order of the telescopers for a given bivariate hypergeometric term.
 > T3 := 1/(n*(k+1)+1)*binomial(2*n,k+1)-1/(n*k+1)*binomial(2*n,k)+      1/(2*k-1)/(n-3*k+1)*binomial(2*n,k);
 ${\mathrm{T3}}{≔}\frac{\left(\genfrac{}{}{0}{}{{2}{}{n}}{{k}{+}{1}}\right)}{{n}{}\left({k}{+}{1}\right){+}{1}}{-}\frac{\left(\genfrac{}{}{0}{}{{2}{}{n}}{{k}}\right)}{{n}{}{k}{+}{1}}{+}\frac{\left(\genfrac{}{}{0}{}{{2}{}{n}}{{k}}\right)}{\left({2}{}{k}{-}{1}\right){}\left({n}{-}{3}{}{k}{+}{1}\right)}$ (90)
 > LowerBound(T3,n,k);
 ${3}$ (91)
 • ExtendedZeilberger: An implementation of an algorithm which computes the minimal Z-pairs for a class of sums of hypergeometric terms.
 > T4 := (-1)^k*binomial(m,k)*binomial(2*k,k)*1/2^(2*k);
 ${\mathrm{T4}}{≔}\frac{{\left({-1}\right)}^{{k}}{}\left(\genfrac{}{}{0}{}{{m}}{{k}}\right){}\left(\genfrac{}{}{0}{}{{2}{}{k}}{{k}}\right)}{{{2}}^{{2}{}{k}}}$ (92)
 > V := Sum(T4,m=0..n);
 ${V}{≔}{\sum }_{{m}{=}{0}}^{{n}}{}\frac{{\left({-1}\right)}^{{k}}{}\left(\genfrac{}{}{0}{}{{m}}{{k}}\right){}\left(\genfrac{}{}{0}{}{{2}{}{k}}{{k}}\right)}{{{2}}^{{2}{}{k}}}$ (93)
 > ExtendedZeilberger(V,n,k,En);
 $\left[\left({2}{}{n}{+}{4}\right){}{{\mathrm{En}}}^{{2}}{+}\left({-}{4}{}{n}{-}{7}\right){}{\mathrm{En}}{+}{2}{}{n}{+}{3}{,}\frac{{2}{}{{k}}^{{2}}{}{\left({-1}\right)}^{{k}}{}\left(\genfrac{}{}{0}{}{{n}{+}{1}}{{k}}\right){}\left(\genfrac{}{}{0}{}{{2}{}{k}}{{k}}\right)}{\left({-}{n}{-}{2}{+}{k}\right){}{{2}}^{{2}{}{k}}}\right]$ (94)
 > _EnvDoubleSum := true:
 > Sum(V,k=0..n) = DefiniteSum(V,n,k,0..n);
 ${\sum }_{{k}{=}{0}}^{{n}}{}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{\sum }_{{m}{=}{0}}^{{n}}{}\frac{{\left({-1}\right)}^{{k}}{}\left(\genfrac{}{}{0}{}{{m}}{{k}}\right){}\left(\genfrac{}{}{0}{}{{2}{}{k}}{{k}}\right)}{{{2}}^{{2}{}{k}}}{=}\frac{\left({2}{}{n}{+}{1}\right){}\left(\genfrac{}{}{0}{}{{2}{}{n}}{{n}}\right)}{{{4}}^{{n}}}$ (95)
 • KoepfGosper and KoepfZeilberger: Implementation of W. Koepf's extension to Gosper's algorithm and Zeilberger's algorithm, respectively.
 > T5 := n*(n/2)!;
 ${\mathrm{T5}}{≔}{n}{}\left(\frac{{n}}{{2}}\right){!}$ (96)
 > Sum(T5,n) = KoepfGosper(T5,n);
 ${\sum }_{{n}}{}{n}{}\left(\frac{{n}}{{2}}\right){!}{=}{2}{}\left(\frac{{n}}{{2}}\right){!}{+}{2}{}\left(\frac{{n}}{{2}}{+}\frac{{1}}{{2}}\right){!}$ (97)
 > T6 := binomial(2/3*n,2*k);
 ${\mathrm{T6}}{≔}\left(\genfrac{}{}{0}{}{\frac{{2}{}{n}}{{3}}}{{2}{}{k}}\right)$ (98)
 > Zpair := KoepfZeilberger(T6,n,k,En);
 ${\mathrm{Zpair}}{≔}\left[{{\mathrm{En}}}^{{3}}{-}{4}{,}\frac{{6}{}\left({k}{-}\frac{{n}}{{2}}{-}{1}\right){}\left({2}{}{k}{-}{1}\right){}{k}{}\left(\genfrac{}{}{0}{}{\frac{{2}{}{n}}{{3}}}{{2}{}{k}}\right)}{\left({k}{-}{1}{-}\frac{{n}}{{3}}\right){}\left({-}\frac{{2}{}{n}}{{3}}{-}{1}{+}{2}{}{k}\right){}{n}}\right]$ (99)
 • MinimalZpair: A combination of various algorithms for computing the minimal Z-pairs of hypergeometric terms.
 > T7 := 1/(3*n+20*k+2)^3;
 ${\mathrm{T7}}{≔}\frac{{1}}{{\left({3}{}{n}{+}{20}{}{k}{+}{2}\right)}^{{3}}}$ (100)
 > MinimalZpair(T7,n,k,En);
 $\left[{{\mathrm{En}}}^{{20}}{-}{1}{,}\frac{{1}}{{\left({3}{}{n}{+}{20}{}{k}{+}{42}\right)}^{{3}}}{+}\frac{{1}}{{\left({3}{}{n}{+}{20}{}{k}{+}{22}\right)}^{{3}}}{+}\frac{{1}}{{\left({3}{}{n}{+}{20}{}{k}{+}{2}\right)}^{{3}}}\right]$ (101)
 > T8 := 1/(n*(k+1)-1)/(n-2*k-4)/(2*n+k+4)!-1/(n*k-1)/(n-2*k-2)/(2*n+k+3)!+1/(n-2*k-2)/(2*n+k+3)!;
 ${\mathrm{T8}}{≔}\frac{{1}}{\left({n}{}\left({k}{+}{1}\right){-}{1}\right){}\left({n}{-}{2}{}{k}{-}{4}\right){}\left({2}{}{n}{+}{k}{+}{4}\right){!}}{-}\frac{{1}}{\left({k}{}{n}{-}{1}\right){}\left({n}{-}{2}{}{k}{-}{2}\right){}\left({2}{}{n}{+}{k}{+}{3}\right){!}}{+}\frac{{1}}{\left({n}{-}{2}{}{k}{-}{2}\right){}\left({2}{}{n}{+}{k}{+}{3}\right){!}}$ (102)
 > Zpair := MinimalZpair(T8,n,k,En):
 > Zpair[1];
 $\left({-}{1953125}{}{{n}}^{{9}}{-}{44140625}{}{{n}}^{{8}}{-}{438125000}{}{{n}}^{{7}}{-}{2505718750}{}{{n}}^{{6}}{-}{9095640625}{}{{n}}^{{5}}{-}{21719685625}{}{{n}}^{{4}}{-}{34096450250}{}{{n}}^{{3}}{-}{33905768600}{}{{n}}^{{2}}{-}{19362572120}{}{n}{-}{4833216960}\right){}{{\mathrm{En}}}^{{3}}{+}\left({1953125}{}{{n}}^{{9}}{+}{42187500}{}{{n}}^{{8}}{+}{400625000}{}{{n}}^{{7}}{+}{2194468750}{}{{n}}^{{6}}{+}{7637609375}{}{{n}}^{{5}}{+}{17505613750}{}{{n}}^{{4}}{+}{26405971500}{}{{n}}^{{3}}{+}{25257742600}{}{{n}}^{{2}}{+}{13888257120}{}{n}{+}{3340995840}\right){}{{\mathrm{En}}}^{{2}}{+}\left({20000}{}{{n}}^{{4}}{+}{152000}{}{{n}}^{{3}}{+}{422400}{}{{n}}^{{2}}{+}{508160}{}{n}{+}{223232}\right){}{\mathrm{En}}{-}{20000}{}{{n}}^{{4}}{-}{232000}{}{{n}}^{{3}}{-}{998400}{}{{n}}^{{2}}{-}{1888960}{}{n}{-}{1325792}$ (103)
 As previously demonstrated using the IsZApplicable function, you cannot apply Zeilberger's algorithm to $\mathrm{T2}$.
 > MinimalZpair(T2,n,k,En);

VectorCalculus

 The VectorCalculus package has been enhanced in several ways.
 • The Divergence, Curl, Gradient, and Laplacian operators now return the form of the operator if invoked with no arguments.  Note that coordinate names must have been assigned previously (see SetCoordinates).
 • All of the $\mathrm{VectorCalculus}$ operations that compute integrals now take an optional argument, inert.  When this option is specified, the command returns the unevaluated integral representation of that computation.
 • The top-level D command has been extended to work with Vectors.
 • The TangentLine and TangentPlane commands have been extended.  You can now specify the curve for TangentLine and the surface for TangentPlane as simple expressions.

Worksheet

 • The Worksheet package has been updated to support the new XML worksheet format. Various utilities for converting Maple worksheets between the previous and new format have been added to the package.
 • The Process and Validate functions are not required in Maple 9. They have been removed.

XMLTools

 • The XMLTools package has been updated with significant new functionality, including namespace support, XSLT transforms, and a validating XML parser.
 • Three new exports form the core of the functionality improvements in this package: XMLTools[ParseString], XMLTools[ParseFile], and XMLTools[Transform].
 • The XMLTools[ParseString] (and related XMLTools[ParseFile]) command is a Maple interface to the Xerces validating XML parser.
 > with( XMLTools ):
 > x := ParseString( "θ" ):
 > Print( x );
                   θ
 > ElementName( FirstChild( x ) );
 ${"m:apply"}$ (104)
 > ElementType( FirstChild( x ) );
 ${\mathrm{_XML_ElementType}}{}\left({"apply"}{,}{"m"}{,}{"http://www.w3.org/Math/"}\right)$ (105)
 • The XMLTools[ParseFile] command takes the name of an XML file as an argument, and returns the internal representation of the XML data.
 • The new routine XMLTools[Transform] applies an XSL stylesheet to an XML document instance.
 > ss := "B:":
 > doc := "":
 > Print( ss );

 > Print( doc );

 > res := ToString( Transform( ParseString( ss ), ParseString( doc ) ) ):
 > Print( res );

 • Note that the internal representation of XML documents has changed significantly in this release to support namespaces and DTD internal subsets.
 • The JoinEntities, SeparateEntities, MakeElement, and DocumentIterator functions have been removed.
 • The CData, Comment, Element, and ProcessingInstruction functions have been superseded by the XMLCData, XMLComment, XMLElement, and XMLProcessingInstruction functions, respectively.