<\ Package>EDIM</Package>

\n EDIM \n is fre\ e software; you can redistribute it\n and/or modify it under the \ terms of the http://ww\ w.fsf.org/licenses/gpl.html as published by the Free Softwa\ re Foundation;\n either version 2 of the License, or (at your opt\ ion) any\n later version.\n \n\n\n\n\n\n\n \n\n\n\n\n\ The EDIM-Package\nEDIM\n\n(Elementary Divisors and Integer Matrices, \ by Frank\nLübeck)

\n\nThis chapter describes the functions d\ efined in the &GAP;4 package\nEDIM. The main functions\ implement variants of an\nalgorithm for computing for a given prime p the p-parts of\nthe elementary divisors of an integer matrix. Th\ ese algorithms use\na p-adic method and are described by the au\ thor in (see )\ .

\n\nThese functions were already applied to integer matrices of dimensio\ n\ngreater than 11000 (which had many non-trivial elementary\ndiv\ isors which were products of small primes).

\n\nFurthermore there are fun\ ctions for finding the biggest elementary\ndivisor of an invertible integer \ matrix and the inverse of a rational\ninvertible matrix (see and\n). These \ algorithms use p-adic\napproximations, explained in .

\n\nFinally we distribute implementations of some other \ algorithms for\nfinding elementary divisors or normal forms of integer m\ atrices: A\np-modular algorithm by Havas and Sterling from <\ Cite\nKey=\"HS79\"/> (see )\nand LLL-based algorithms for extended greatest common divisors of\nin\ tegers (see ) and for Hermite normal forms\nof int\ eger matrices with (very nice) transforming matrices (see ).

\n\nPlease, send me an \ e-mail\n(Frank.Luebeck@Math.RWTH-Aachen.De) if you\ have any\nquestions, remarks, suggestions, etc. concerning this mini-pac\ kage.\nAlso, I would like to hear about applications of this package.

\np-Parts of Elementary Divisors\n\nHere we explain the \ main functions of the package.\n\n\n\n\n\n\n\n\n These functions return a list \ [m_1, m_2, \\ldots,\nm_r] where m_i is the number of nonzero e\ lementary divisors\nof A divisible by p^i (see for a definition of the \ elementary\ndivisors).

\n\nThe algorithms for these functions are \ described in .

\n\nA must be a matrix with i\ nteger entries, p a prime, and\nrk the rank of A (as r\ ational matrix). In the first\nversion of the command rk is computed\ , if it is not given.

\n\nThe first version of the command delegates i\ ts job to the fourth\nversion by trying growing values for exp, see b\ elow.

\n\nThe second and third versions implement the main algorithm des\ cribed\nin and a variation. Here has a bit more overhead, but can\n\ be advantageous because the intermediate entries during the\ncomput\ ation can be much smaller.

\n\nIn the fourth form exp must be an up\ per bound for the highest\npower of p appearing in an elementary di\ visor of A.\nThis information allows reduction of matrix en\ tries modulo\np^{{exp+1}} during the computation.

\ \n\nIf exp is too small or the given rk is too large the\nfunc\ tion returns fail.

\n\nIf p^{exp} is small e\ nough we use internally a\nkernel function which can also be used directly i\ n the fifth form of\nthe command. There il can be 0 or 1 where in the\nsecond case some information is printed during the computation\ .

\n\nMore precisely, \ is\napplicable when p^{{exp+1}} < 2^{{b-4}} and\n<\ M>(p^{{exp+1}} - 1)(p-1) < 2^b where b=32\nin a 3\ 2-bit version of &GAP; and b=64 in a 64-bit version of\n&GAP;.

\n\ \nThis last form of the function was already succesfully applied to\ndens\ e matrices of rank up to 11000.

\n\nNote that you have to compile a \ file (see )\nwhile installing this package, if \ you want to have this kernel\nfunction available.

\n\n\ngap\ > ReadPackage(\"edim\", \"tst/mat\");\nReading 242x242 integer matrix 'mat' w\ ith elementary divisors 'eldiv'.\ntrue\ngap> ElementaryDivisorsPPartRkI(mat, 2\ , 242); time; # mat has full rank\n[ 94, 78, 69, 57, 23, 23, 9, 2, 2, 0 ]\n490\ \ngap> ElementaryDivisorsPPartRkExpSmall(mat, 2, 242, 10, 0); time;\n[ 94, 78,\ 69, 57, 23, 23, 9, 2, 2, 0 ]\n10\n\n\n\n\ \n\n\n\n\n \nFor an i\ nteger matrix A and a prime p this function\nreturns a list\ [m_1, m_2, \\ldots, m_r] where m_i is the\nnumber of nonzero\ elementary divisors of A divisible by\np^i.

\n\ \nAn upper bound d for the highest power of p appearing in\nan \ elementary divisor of A must be given. Smaller d\nimprove th\ e performance of the algorithm considerably.

\n\nThis is an implementation \ of the modular algorithm described in .

\n\nWe added\ a slight improvement: we divide the considered submatrices by\nthe p-p\ art of the greatest common divisor of all entries (and\nlower the d \ appropriately). This reduces the size of the\nentries and often shortens\ the pivot search.

\n\n\ngap> ReadPackage(\"edim\", \"tst/mat\");\ \nReading 242x242 integer matrix 'mat' with elementary divisors 'eldiv'.\ntrue\ \ngap> ElementaryDivisorsPPartHavasSterling(mat, 2, 10); time;\n[ 94, 78, 69, \ 57, 23, 23, 9, 2, 2 ]\n1260\n\n\n\n\n\n\ \n\n

\nInverse of Rational Matrices<\ /Heading>\n\n\n\n\n \nThis func\ tion returns the inverse of an invertible matrix over the\nrational numbers\ .

\n\nIt first computes the inverse modulo some prime p, compute\ s\nfrom this a p-adic approximation to the inverse and finally\ncon\ structs the rational entries from their p-adic\napproxima\ tions. See section for more\ndetails.

\ \n\nThis seems to be better than GAP's\nst\ andard Gauß algorithm (A^-1) already for small\nmatrice\ s. (Try, e.g., RandomMat(20,20,[-10000..10000]) or\nRandomMat(\ 100,100).)

\n\nThe optional argument p should be a prime such\ that A\nmodulo p is invertible (default is p=251<\ /M>). If\nA is not invertible modulo p then p \ is\nautomatically replaced by the next prime.

\n\n\n\n\n<\ ManSection>\n\n\n\ \nThis function returns the solution x of the system of\ linear\nequations x A = v.

\n\nHere, A must be\ a matrix with integer entries which is invertible\nover the rationals and \ v must be a vector with integer entries of\nthe appropriate length.

\n\ \nThe optional arguments are a prime p such that A\n\\pm\ od{p} is invertible (if not given, p = 251 is assumed)\nand the i\ nverse invA of A \\pmod{p}.

\n\nThe solution is comput\ ed via p-adic approximation as explained in \n.

\n\n\n\n\n\n\n \n\n<\ Description>\nThis function returns the biggest elementary divisor of a \ square\ninteger matrix A of full rank.

\n\nFor such a matrix A<\ /A> the least common multiple of the\ndenominators of all entries of \ the inverse matrix A^{-1}\nis exactly the biggest elementary div\ isor of A.

\n \nThis function is implemented by a slight modi\ fication of . The third argument nr tells the\nfunction to return the least common multiple of the first \ nr\nrows of the rational inverse matrix only. Very often the funct\ ion\nwill already return the biggest elementary divisor with\n<\ M>nr=2 or 3 (and the command without this argument\nwould s\ pend most time in checking, that this is correct).

\n\nThe optional argumen\ t p should be a prime such that A\nmodulo p is invert\ ible (default is p=251). If\nA is not invertible \ modulo p then p is\nautomatically replaced by the next pri\ me.

\n\n\ngap> ReadPackage(\"edim\", \"tst/mat\");\nReading 242x2\ 42 integer matrix 'mat' with elementary divisors 'eldiv'.\ntrue\ngap> inv := I\ nverseRatMat(mat);; time; \n840\ngap> ExponentSquareIntMa\ tFullRank(mat, 101, 3); # same as without the `3'\n115200\n\n\n\n\n

\n\n\n\n

\nAll Elementary Divisors Using p-adic Method\n\nIn the following tw\ o functions we put things together. In particular\nwe handle the prime parts\ of the elementary divisors efficiently for\nprimes appearing with low power\ s in the highest elementary divisor\nrespectively determinant divisor.\n\n<\ ManSection>\n \n\n\nThis function returns a list of nonzero ele\ mentary divisors of an\ninteger matrix A.

\n \nHere we start with\ computing the biggest elementary divisor via . If it runs into a problem\nbecause A is singula\ r modulo a choosen prime (it starts by\ndefault with 251) then the prime is\ automatically replaced by the next\none.

\n\nThe rest is done using and\n.

\n\nT\ he function fails if the biggest elementary divisor cannot be\ncomplete\ ly factored and the non-factored part is not a divisor of the\nbiggest elemen\ tary divisor only.

\n\nNote that this function may for many matrices not \ be the best choice\nfor computing all elementary divisors. You may first try \ the standard\nGAP library routines for Smith normal form i\ nstead\nof this function. Nevertheless remember for hard and big\nex\ amples. It is particularly good when the largest elementary divisor\nis a ver\ y small factor of the determinant.\n\n\ngap> Collected(ElementaryDivi\ sorsSquareIntMatFullRank(mat)); \n[ [ 1, 49 ], [ 3, 99 ], [ 6, 7 ], [ 30,\ 9 ], [ 60, 9 ], [ 120, 2 ], \n [ 360, 10 ], [ 720, 22 ], [ 3600, 12 ], [ 144\ 00, 14 ], \n [ 28800, 7 ], [ 115200, 2 ] ]\ngap> time;\n860\ngap> last2 = Col\ lected(DiagonalOfMat(NormalFormIntMat(mat, 1).normal));\ntrue\ngap> time;\n517\ 0\n\n\n\n\n\n\n\n\n\n\nThis function returns a list of nonzero elementary divisors of an\nin\ teger matrix A.

\n\nHere det must be an integer which is a m\ ultiple of the biggest\ndeterminant divisor of A. If the matrix does\ not have full\nrank then its rank rk must be given, too.

\n\nThe \ argument det can be given in the form of\nCollect\ ed(FactorsInt(det)).

\n\nThis function handles prime divisors o\ f det with multiplicity\nsmaller than 4 specially, for the other pr\ ime divisors p it\ndelegates to where the\nexp argument is the multiplicity of the p\ in det.\n(Note that this is not very good when p has actuall\ y a much\nsmaller multiplicity in the largest elementary divisor.)

\n\n\ngap> ReadPackage(\"edim\", \"tst/mat\");\nReading 242x242 integer mat\ rix 'mat' with elementary divisors 'eldiv'.\ntrue\ngap> # not so good:\ngap> E\ lementaryDivisorsIntMatDeterminant(mat,Product(eldiv)) = \n> Concatenation([1.\ .49]*0+1, eldiv); time;\ntrue\n5490\n\n\n\ \n\n

\n\n\n\n

\nGcd and Normal For\ ms Using LLL\n\nThe EDIM-mini package also contai\ ns implementations\nof an extended Gcd-algorithm for integers and a Hermit\ e and Smith\nnormal form algorithm for integer matrices using LLL-techiques\ . They\nare well described in the paper by Havas, Majews\ ki\nand Matthews.

\n\nThey are particularly useful if one wants to have \ the normal forms\ntogether with transforming matrices. These transforming ma\ trices have\nspectacularly nice (i.e., small) entries in cases of\ input\nmatrices which are non-square or not of full rank (otherwise t\ he\ntransformation to the Hermite normal form is unique).

\n\nIn detail:

\n\n\n \ \n\n \nThis function returns for integers n1, n2, \\ldots a\nlist [g, [c_1, c_2, \\ldots]], where g = c_\ 1 n1 +\nc_2n2 + \\ldots is the greatest common diviso\ r of the\nni. Here all the c_i are usually very small.\n\n\ngap> GcdexIntLLL( 517, 244, -304, -872, -286, 854, 866, 224, -765, -38)\ ;\n[ 1, [ 0, 0, 0, 0, 1, 0, 1, 1, 1, 1 ] ]\n\n\n\n\n\n\n\n \n\n \nThis function returns a pair of matrices [H, \ L] where H = L\nA is the Hermite normal form of an integer \ matrix A.\nThe transforming matrix L can have surprisingly small\ entries.\n\n\ngap> ReadPackage(\"edim\", \"tst/mat2\");\nReading 34\ x34 integer matrix 'mat2' with elementary divisors 'eldiv2'.\ntrue\ngap> tr :=\ HermiteIntMatLLLTrans(mat2);; Maximum(List(Flat(tr[2]), AbsInt));\n606\ngap> \ tr[2]*mat2 = tr[1]; \ntrue\n\n\n\n\n\n\n\n \n\n \nThis function returns the Smi\ th normal form of an integer matrix\nA using the LLL-algorithm to av\ oid entry explosion.\n\n\n\n\n\n\n\n\n\nThis function \ returns [S, L, R] where S = L A R\nis the Smith normal f\ orm of an integer matrix A.

\n\nWe apply the algorithm for Hermite \ normal form several times to get\nthe Smith normal form, that is n\ ot in the paper . The transforming matrices need\ not be as nice as for\nthe Hermite normal form.

\n\n\ngap> Read\ Package(\"edim\", \"tst/mat2\");\nReading 34x34 integer matrix 'mat2' with el\ ementary divisors 'eldiv2'.\ntrue\ngap> tr := SmithIntMatLLLTrans(mat2);;\ngap\ > tr[2] * mat2 * tr[3] = tr[1]; \ntrue\n\n\n\n\n

\n\n\n\n\n

\n\nUtility Functio\ ns from the EDIM-package\n\n\n\n\n\nT\ his function returns r/s = x \\pmod{n}, if\nit exists. M\ ore precisely:

\n\nn, k, l must be positive i\ ntegers with\n2k l \\leq n and x an int\ eger with\n-n/2 < x \\leq n/2. If it ex\ ists\nthis function returns a rational number r/s with 0 <\n\ s < l, \\gcd(s, n) = 1, -k\n< \ r < k and r/s congruent to x\n\\pmod{n\ } (i.e., n \\mid r - s x). Such\nan r/s \ is unique. The function returns fail if such a\nnumber does not exist\ .

\n\n\n\n\n\n\n \n\n\nThis function returns an inver\ se matrix modulo a prime p or\nfail. More precisely:

\n\nA must be an integer matrix and p a prime such that\nA\ is invertible modulo p. This function returns an\ninteger matrix\ inv with entries in the range ]-p/2\n\\ldots p/2]<\ /M> such that inv A reduced modulo p\nis the identity matrix.\n\nIt returns fail if the inverse modulo p does not exist.\n\ \nThis function is particularly fast for primes smaller 256.\n\n\ \n\n\n\n\n \n\n\nThe Hadamard bound for a square integer matrix A\ is the product\nof Euclidean norms of the nonzero rows (or columns) of A. It is\nan upper bound for the absolute value of the determinant of A.\n\n\n\n\n\n\n \n\n\nThis function returns a list \ of factors of an integer n,\nincluding small prime factors \ - here the optional argument\nnr is the number of iterations for \ `FactorsRho' (default is\n2000).

\n\nThis is only a slight modificati\ on of the library function w\ hich avoids an error message when\nthe number is not completely factored.

\n \n\n\n\n\n\n\n\n\nThis function returns the rank of an integ\ er matrix A modulo\np. Here p must not necessarily be a\ prime. If it is not\nand this function returns an integer, then this is\ the rank of\nA for all prime divisors of p.

\n\nIf during\ the computation a factorisation of p is found\n(because some pi\ vot entry has nontrivial greatest common divisor with\np) then the fun\ ction is recursively applied to the found\nfactors f_i of p. The result is then given in the form\n[[f_1, rk_1], [f_2, rk_2], ...]<\ /C>.

\n\nThe idea to make this function useful for non primes was to use\ it\nwith large factors of the biggest elementary divisor of A whose\n\ prime factorization cannot be found easily.

\n\n\ngap> ReadPackage\ (\"edim\", \"tst/mat\");\nReading 242x242 integer matrix 'mat' with elementar\ y divisors 'eldiv'.\ntrue\ngap> RankMod(mat, 5);\n155\ngap> RankMod(mat, (2*79\ *4001));\n[ [ 2, 148 ], [ 79, 242 ], [ 4001, 242 ] ]\n\n\n\n\n

\n\n\n\n

\n\ InverseRatMat - the Algorithm\n\n\nThe idea is to recover a rati\ onal matrix from an l-adic\napproximation for some prime l. \ This description came out of\ndiscussions with Jürgen Müller. I thank J\ ohn Cannon for pointing out\nthat the basic idea already appeared in the paper\ of\nDixon.

\n\nLet A be an invertible matrix o\ ver the rational numbers. By\nmultiplying with a constant we may assume tha\ t its entries are in fact\nintegers.

\n\n(1) We first describe how to find\ an l-adic approximation of\nA^{-1}. Find a prime l su\ ch that A is invertible\nmodulo l and let B be the intege\ r matrix with entries in\nthe range \\left]-l/2,l/2\\right] such \ that BA is\ncongruent to the identity matrix modulo l. \ (This can be\ncomputed fast by usual Gauß elimination.)

\n\nNow let \ v \\in &ZZ;^r be a row vector. Define two sequences\nv_i and x_i of row vectors in &ZZ;^r by: x_0\n:= 0 \\in &ZZ;^r, \ v_0 := -v and for i > 0 set\nx_i to the vector \ congruent to -v_{i-1} B modulo\nl having entries in the r\ ange \\left]-l/2, l/2\\right].\nThen all entries of x_i A + v_{i-1\ } are divisible by l\nand we set v_i := (1/l) \\cdot (x_i A + v\ _{i-1}).

\n\nInduction shows that for y_i := \\sum_{k=1}^{i} l^{k-\ 1} x_k we\nhave y_i A = v + l^i v_i for all i \\geq 0. H\ ence the\nsequence y_i, i \\geq 0, gives an l-a\ dic\napproximation to the vector y \\in &QQ;^r with y A =\nv.\

\n\n(2) The second point is to show how we can get the vector y\ \nfrom a sufficiently good approximation y_i. Note that the\nsequ\ ence of y_i becomes constant for i \\geq i_0 if all\nentries \ of y are integers of absolute value smaller than\nl^{i_0} / 2<\ /M> because of our choice of representatives of residue\nclasses modulo l in the interval \\left]-l/2,\nl/2\\right].

\n\nMo\ re generally consider a / b \\in &QQ; with b > 0 and\na, b\ coprime. Then there is for each n \\in &NN; which is\ncoprime to <\ M>b a unique c \\in &ZZ; with -n / 2 < c\n\\leq n / 2 \ and a \\equiv c b \\pmod{n}. This c can be\ncomputed via the ext\ ended Euclidean algorithm applied to b and\nn.

\n\nNow let <\ M>n, \\alpha, \\beta \\in &NN; with 2 \\alpha \\beta \\leq\nn. Th\ en the map \\{a/b \\in &QQ; \\mid -\\alpha \\leq a \\leq \\alpha,\n1 \\leq \ b < \\beta \\} \\rightarrow \\left]-n/2, n/2\\right], a/b\n\\mapsto\ c (defined as above) is injective (since for a/b,\na'/b' \ in the above set we have a b' - a' b \\equiv 0\n\\pmod{n} if a\ nd only if a b' - a' b = 0).

\n\nIn practice we can use for any c \\in \\left]-n/2, n/2\\right] a\ncertain extended Euclidean algorithm \ applied to n and c\nto decide if c is in the image of the\ above map and to find the\ncorresponding a/b if it exists.

\n\n(3) \ To put things together we apply (2) to the entries of the vectors\ny_i\ constructed in (1), choosing n = l^i, \\alpha =\n\\sqrt{n}/2\ and \\beta = \\sqrt{n}. If we have found this way\na candidate for \ y we can easily check if it is correct by\ncomputing y A. I\ f \\mu is the maximal absolute value of\nall numerators and denominato\ rs of the entries of y it is clear\nfrom (2) that we will find y from y_i if l^i > 2\n\\mu^2.

\n\n(4) If we take as v\ in (1) to(3) all standard unit vectors we\nclearly get the rows of \ A^{-1}. But we can do it\nbetter. Namely we can take as \ v the standard unit vectors\nmultiplied by the least common mul\ tiple \\epsilon of the\ndenominators of the already computed entri\ es of A^{-1}. In\nmany examples this \\epsilon actually equa\ ls \\epsilon_r\nafter the computation of the first or first few rows\ . Therefore we\nwill often find quickly the next row of A^{-1} alread\ y in (1),\nbecause we find a v_i = 0 such that the sequence of y_i<\ /M>\nbecomes constant (=y).

\n\n\nRank of Integer Matrix\n\nThe following strategy has s\ hown to be useful in proving that some very\nbig integer matrix is not invert\ ible.

\n\n\nCheck the rank modulo some small primes, s\ ay with . \nIf the rank seems less t\ han the number of rows choose a prime\np, a collection of lines wh\ ich is linearly independent modulo\np, and another line linearly dep\ endend on these. Guess that this\nlast line is also linearly dependend on the\ chosen collection over the\nrational numbers (maybe check modulo several sma\ ll primes).\nFind columns of the collection of lines which give\ an invertible\nmatrix modulo some prime.\nThen use with the invertible\nsubmatrix and corresponding e\ ntries of the linearly dependend row to\nprove this.\n\n\nGue\ ssing the rank of a matrix from the rank modulo several primes,\nchosing\ a maximal set of lines which are linearly independent modulo\nsome prime\ s, and using with the\nremaining lin\ es, one may also find the exact rank of a huge integer\nmatrix.

\n\n<\ /Subsection>\n\n

\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", inputorigins := [ [ 1, "doc/edim.xml", 1 ], [ 40, "doc/edim.xml", 2 ], [ 41, "doc/edim.xml", 3 ], [ 77, "doc/edim.xml", 4 ], [ 78, "doc/edim.xml", 5 ], [ 83, "doc/edim.xml", 6 ], [ 84, "doc/edim.xml", 7 ], [ 159, "doc/edim.xml", 8 ], [ 160, "doc/edim.xml", 9 ], [ 228, "doc/edim.xml", 10 ], [ 229, "doc/edim.xml", 11 ], [ 233, "doc/edim.xml", 12 ], [ 234, "doc/edim.xml", 13 ], [ 253, "doc/edim.xml", 14 ], [ 254, "doc/edim.xml", 15 ], [ 266, "doc/edim.xml", 16 ], [ 309, "doc/edim.xml", 17 ], [ 375, "doc/edim.xml", 18 ], [ 389, "doc/edim.xml", 19 ], [ 403, "doc/../VERSION", 1 ], [ 409, "doc/edim.xml", 19 ], [ 410, "doc/edim.xml", 20 ], [ 425, "doc/edim.xml", 21 ], [ 451, "doc/edim.xml", 22 ], [ 461, "doc/edim.xml", 23 ], [ 489, "doc/edim.xml", 24 ], [ 501, "doc/edim.xml", 25 ], [ 519, "doc/edim.xml", 26 ], [ 532, "doc/edim.xml", 27 ], [ 540, "doc/edim.xml", 28 ], [ 551, "doc/edim.xml", 29 ], [ 604, "doc/edim.xml", 30 ], [ 681, "doc/edim.xml", 31 ], [ 695, "doc/edim.xml", 32 ], [ 724, "doc/edim.xml", 33 ], [ 763, "doc/edim.xml", 34 ], [ 821, "doc/edim.xml", 35 ], [ 861, "doc/edim.xml", 36 ], [ 917, "doc/edim.xml", 37 ], [ 986, "doc/edim.xml", 38 ], [ 1126, "doc/edim.xml", 39 ], [ 1197, "doc/edim.xml", 40 ], [ 1226, "doc/edim.xml", 41 ], [ 1243, "doc/edim.xml", 42 ], [ 1244, "doc/edim.xml", 43 ], [ 1257, "doc/edim.xml", 44 ], [ 1258, "doc/edim.xml", 45 ], [ 1329, "doc/edim.xml", 46 ], [ 1348, "doc/edim.xml", 47 ], [ 1349, "doc/edim.xml", 48 ], [ 1390, "doc/edim.xml", 49 ], [ 1397, "doc/main.xml", 1 ], [ 1403, "doc/main.xml", 2 ], [ 1404, "doc/main.xml", 3 ], [ 1474, "doc/main.xml", 4 ], [ 1475, "doc/main.xml", 5 ], [ 1550, "doc/main.xml", 6 ], [ 1551, "doc/main.xml", 7 ], [ 1598, "doc/main.xml", 8 ], [ 1599, "doc/main.xml", 9 ], [ 1603, "doc/main.xml", 10 ], [ 1604, "doc/main.xml", 11 ], [ 1632, "doc/main.xml", 12 ], [ 1687, "doc/main.xml", 13 ], [ 1726, "doc/main.xml", 14 ], [ 1727, "doc/main.xml", 15 ], [ 1798, "doc/main.xml", 16 ], [ 1818, "doc/main.xml", 17 ], [ 1819, "doc/main.xml", 18 ], [ 1892, "doc/main.xml", 19 ], [ 1965, "doc/main.xml", 20 ], [ 2038, "doc/main.xml", 21 ], [ 2111, "doc/main.xml", 22 ], [ 2184, "doc/main.xml", 23 ], [ 2247, "doc/main.xml", 24 ], [ 2248, "doc/main.xml", 25 ], [ 2319, "doc/main.xml", 26 ], [ 2390, "doc/main.xml", 27 ], [ 2441, "doc/main.xml", 28 ], [ 2442, "doc/main.xml", 29 ], [ 2513, "doc/main.xml", 30 ], [ 2584, "doc/main.xml", 31 ], [ 2655, "doc/main.xml", 32 ], [ 2726, "doc/main.xml", 33 ], [ 2792, "doc/main.xml", 34 ], [ 2793, "doc/main.xml", 35 ], [ 2864, "doc/main.xml", 36 ], [ 2935, "doc/main.xml", 37 ], [ 3006, "doc/main.xml", 38 ], [ 3077, "doc/main.xml", 39 ], [ 3148, "doc/main.xml", 40 ], [ 3219, "doc/main.xml", 41 ], [ 3290, "doc/main.xml", 42 ], [ 3322, "doc/main.xml", 43 ], [ 3323, "doc/main.xml", 44 ], [ 3394, "doc/main.xml", 45 ], [ 3465, "doc/main.xml", 46 ], [ 3536, "doc/main.xml", 47 ], [ 3603, "doc/main.xml", 48 ], [ 3604, "doc/main.xml", 49 ], [ 3619, "doc/main.xml", 50 ], [ 3620, "doc/main.xml", 51 ], [ 3651, "doc/main.xml", 52 ], [ 3722, "doc/main.xml", 53 ], [ 3723, "doc/main.xml", 54 ], [ 3794, "doc/main.xml", 55 ], [ 3831, "doc/main.xml", 56 ], [ 3898, "doc/main.xml", 57 ], [ 3966, "doc/main.xml", 58 ], [ 4036, "doc/main.xml", 59 ], [ 4061, "doc/main.xml", 60 ], [ 4126, "doc/main.xml", 61 ], [ 4153, "doc/main.xml", 62 ], [ 4154, "doc/main.xml", 63 ], [ 4232, "doc/main.xml", 64 ], [ 4277, "doc/main.xml", 65 ], [ 4278, "doc/main.xml", 66 ], [ 4316, "doc/main.xml", 67 ], [ 4317, "doc/main.xml", 68 ], [ 4388, "doc/main.xml", 69 ], [ 4452, "doc/main.xml", 70 ], [ 4472, "doc/main.xml", 71 ], [ 4548, "doc/main.xml", 72 ], [ 4624, "doc/main.xml", 73 ], [ 4668, "doc/main.xml", 74 ], [ 4672, "doc/main.xml", 75 ], [ 4673, "doc/main.xml", 76 ], [ 4735, "doc/main.xml", 77 ], [ 4736, "doc/main.xml", 78 ], [ 4811, "doc/main.xml", 79 ], [ 4877, "doc/main.xml", 80 ], [ 4878, "doc/main.xml", 81 ], [ 4954, "doc/main.xml", 82 ], [ 4955, "doc/main.xml", 83 ], [ 4969, "doc/main.xml", 84 ], [ 4970, "doc/main.xml", 85 ], [ 5000, "doc/main.xml", 86 ], [ 5001, "doc/main.xml", 87 ], [ 5019, "doc/main.xml", 88 ], [ 5090, "doc/main.xml", 89 ], [ 5161, "doc/main.xml", 90 ], [ 5232, "doc/main.xml", 91 ], [ 5269, "doc/main.xml", 92 ], [ 5284, "doc/main.xml", 93 ], [ 5298, "doc/main.xml", 94 ], [ 5299, "doc/main.xml", 95 ], [ 5310, "doc/main.xml", 96 ], [ 5311, "doc/main.xml", 97 ], [ 5381, "doc/main.xml", 98 ], [ 5412, "doc/main.xml", 99 ], [ 5469, "doc/main.xml", 100 ], [ 5470, "doc/main.xml", 101 ], [ 5521, "doc/main.xml", 102 ], [ 5522, "doc/main.xml", 103 ], [ 5535, "doc/main.xml", 104 ], [ 5574, "doc/main.xml", 105 ], [ 5600, "doc/main.xml", 106 ], [ 5640, "doc/main.xml", 107 ], [ 5663, "doc/main.xml", 108 ], [ 5704, "doc/main.xml", 109 ], [ 5727, "doc/main.xml", 110 ], [ 5769, "doc/main.xml", 111 ], [ 5797, "doc/main.xml", 112 ], [ 5844, "doc/main.xml", 113 ], [ 5876, "doc/main.xml", 114 ], [ 5877, "doc/main.xml", 115 ], [ 5948, "doc/main.xml", 116 ], [ 6019, "doc/main.xml", 117 ], [ 6090, "doc/main.xml", 118 ], [ 6161, "doc/main.xml", 119 ], [ 6176, "doc/main.xml", 120 ], [ 6177, "doc/main.xml", 121 ], [ 6248, "doc/main.xml", 122 ], [ 6265, "doc/main.xml", 123 ], [ 6266, "doc/main.xml", 124 ], [ 6337, "doc/main.xml", 125 ], [ 6408, "doc/main.xml", 126 ], [ 6479, "doc/main.xml", 127 ], [ 6480, "doc/main.xml", 128 ], [ 6551, "doc/main.xml", 129 ], [ 6616, "doc/main.xml", 130 ], [ 6617, "doc/main.xml", 131 ], [ 6688, "doc/main.xml", 132 ], [ 6759, "doc/main.xml", 133 ], [ 6830, "doc/main.xml", 134 ], [ 6901, "doc/main.xml", 135 ], [ 6938, "doc/main.xml", 136 ], [ 6939, "doc/main.xml", 137 ], [ 7010, "doc/main.xml", 138 ], [ 7081, "doc/main.xml", 139 ], [ 7152, "doc/main.xml", 140 ], [ 7214, "doc/main.xml", 141 ], [ 7215, "doc/main.xml", 142 ], [ 7284, "doc/main.xml", 143 ], [ 7319, "doc/main.xml", 144 ], [ 7320, "doc/main.xml", 145 ], [ 7391, "doc/main.xml", 146 ], [ 7462, "doc/main.xml", 147 ], [ 7533, "doc/main.xml", 148 ], [ 7601, "doc/main.xml", 149 ], [ 7602, "doc/main.xml", 150 ], [ 7673, "doc/main.xml", 151 ], [ 7744, "doc/main.xml", 152 ], [ 7815, "doc/main.xml", 153 ], [ 7886, "doc/main.xml", 154 ], [ 7897, "doc/main.xml", 155 ], [ 7898, "doc/main.xml", 156 ], [ 7969, "doc/main.xml", 157 ], [ 8016, "doc/main.xml", 158 ], [ 8017, "doc/main.xml", 159 ], [ 8088, "doc/main.xml", 160 ], [ 8159, "doc/main.xml", 161 ], [ 8184, "doc/main.xml", 162 ], [ 8185, "doc/main.xml", 163 ], [ 8195, "doc/main.xml", 164 ], [ 8233, "doc/main.xml", 165 ], [ 8304, "doc/main.xml", 166 ], [ 8309, "doc/main.xml", 167 ], [ 8381, "doc/main.xml", 168 ], [ 8420, "doc/main.xml", 169 ], [ 8424, "doc/main.xml", 170 ], [ 8490, "doc/main.xml", 171 ], [ 8529, "doc/main.xml", 172 ], [ 8532, "doc/main.xml", 173 ], [ 8543, "doc/main.xml", 174 ], [ 8558, "doc/main.xml", 175 ], [ 8572, "doc/main.xml", 176 ], [ 8573, "doc/main.xml", 177 ], [ 8643, "doc/main.xml", 178 ], [ 8656, "doc/main.xml", 179 ], [ 8706, "doc/main.xml", 180 ], [ 8726, "doc/main.xml", 181 ], [ 8768, "doc/main.xml", 182 ], [ 8769, "doc/main.xml", 183 ], [ 8784, "doc/main.xml", 184 ], [ 8855, "doc/main.xml", 185 ], [ 8926, "doc/main.xml", 186 ], [ 8997, "doc/main.xml", 187 ], [ 9021, "doc/main.xml", 188 ], [ 9022, "doc/main.xml", 189 ], [ 9093, "doc/main.xml", 190 ], [ 9164, "doc/main.xml", 191 ], [ 9223, "doc/main.xml", 192 ], [ 9224, "doc/main.xml", 193 ], [ 9295, "doc/main.xml", 194 ], [ 9314, "doc/main.xml", 195 ], [ 9315, "doc/main.xml", 196 ], [ 9386, "doc/main.xml", 197 ], [ 9457, "doc/main.xml", 198 ], [ 9528, "doc/main.xml", 199 ], [ 9577, "doc/main.xml", 200 ], [ 9578, "doc/main.xml", 201 ], [ 9588, "doc/main.xml", 202 ], [ 9626, "doc/main.xml", 203 ], [ 9697, "doc/main.xml", 204 ], [ 9702, "doc/main.xml", 205 ], [ 9763, "doc/main.xml", 206 ], [ 9799, "doc/main.xml", 207 ], [ 9804, "doc/main.xml", 208 ], [ 9815, "doc/main.xml", 209 ], [ 9830, "doc/main.xml", 210 ], [ 9844, "doc/main.xml", 211 ], [ 9855, "doc/main.xml", 212 ], [ 9856, "doc/main.xml", 213 ], [ 9926, "doc/main.xml", 214 ], [ 9927, "doc/main.xml", 215 ], [ 9960, "doc/main.xml", 216 ], [ 10008, "doc/main.xml", 217 ], [ 10009, "doc/main.xml", 218 ], [ 10022, "doc/main.xml", 219 ], [ 10049, "doc/main.xml", 220 ], [ 10069, "doc/main.xml", 221 ], [ 10113, "doc/main.xml", 222 ], [ 10114, "doc/main.xml", 223 ], [ 10130, "doc/main.xml", 224 ], [ 10201, "doc/main.xml", 225 ], [ 10223, "doc/main.xml", 226 ], [ 10224, "doc/main.xml", 227 ], [ 10295, "doc/main.xml", 228 ], [ 10366, "doc/main.xml", 229 ], [ 10437, "doc/main.xml", 230 ], [ 10509, "doc/main.xml", 231 ], [ 10522, "doc/main.xml", 232 ], [ 10523, "doc/main.xml", 233 ], [ 10594, "doc/main.xml", 234 ], [ 10666, "doc/main.xml", 235 ], [ 10737, "doc/main.xml", 236 ], [ 10769, "doc/main.xml", 237 ], [ 10770, "doc/main.xml", 238 ], [ 10841, "doc/main.xml", 239 ], [ 10912, "doc/main.xml", 240 ], [ 10983, "doc/main.xml", 241 ], [ 11029, "doc/main.xml", 242 ], [ 11044, "doc/main.xml", 243 ], [ 11058, "doc/main.xml", 244 ], [ 11059, "doc/main.xml", 245 ], [ 11129, "doc/main.xml", 246 ], [ 11142, "doc/main.xml", 247 ], [ 11178, "doc/main.xml", 248 ], [ 11210, "doc/main.xml", 249 ], [ 11274, "doc/main.xml", 250 ], [ 11275, "doc/main.xml", 251 ], [ 11291, "doc/main.xml", 252 ], [ 11360, "doc/main.xml", 253 ], [ 11404, "doc/main.xml", 254 ], [ 11405, "doc/main.xml", 255 ], [ 11478, "doc/main.xml", 256 ], [ 11551, "doc/main.xml", 257 ], [ 11579, "doc/main.xml", 258 ], [ 11580, "doc/main.xml", 259 ], [ 11651, "doc/main.xml", 260 ], [ 11722, "doc/main.xml", 261 ], [ 11783, "doc/main.xml", 262 ], [ 11784, "doc/main.xml", 263 ], [ 11858, "doc/main.xml", 264 ], [ 11895, "doc/main.xml", 265 ], [ 11910, "doc/main.xml", 266 ], [ 11924, "doc/main.xml", 267 ], [ 11925, "doc/main.xml", 268 ], [ 11995, "doc/main.xml", 269 ], [ 11996, "doc/main.xml", 270 ], [ 12009, "doc/main.xml", 271 ], [ 12051, "doc/main.xml", 272 ], [ 12079, "doc/main.xml", 273 ], [ 12096, "doc/main.xml", 274 ], [ 12097, "doc/main.xml", 275 ], [ 12111, "doc/main.xml", 276 ], [ 12182, "doc/main.xml", 277 ], [ 12224, "doc/main.xml", 278 ], [ 12225, "doc/main.xml", 279 ], [ 12296, "doc/main.xml", 280 ], [ 12367, "doc/main.xml", 281 ], [ 12426, "doc/main.xml", 282 ], [ 12429, "doc/main.xml", 283 ], [ 12500, "doc/main.xml", 284 ], [ 12571, "doc/main.xml", 285 ], [ 12642, "doc/main.xml", 286 ], [ 12713, "doc/main.xml", 287 ], [ 12784, "doc/main.xml", 288 ], [ 12855, "doc/main.xml", 289 ], [ 12917, "doc/main.xml", 290 ], [ 12918, "doc/main.xml", 291 ], [ 12989, "doc/main.xml", 292 ], [ 13060, "doc/main.xml", 293 ], [ 13131, "doc/main.xml", 294 ], [ 13177, "doc/main.xml", 295 ], [ 13178, "doc/main.xml", 296 ], [ 13188, "doc/main.xml", 297 ], [ 13226, "doc/main.xml", 298 ], [ 13297, "doc/main.xml", 299 ], [ 13302, "doc/main.xml", 300 ], [ 13363, "doc/main.xml", 301 ], [ 13367, "doc/main.xml", 302 ], [ 13441, "doc/main.xml", 303 ], [ 13448, "doc/main.xml", 304 ], [ 13459, "doc/main.xml", 305 ], [ 13474, "doc/main.xml", 306 ], [ 13488, "doc/main.xml", 307 ], [ 13489, "doc/main.xml", 308 ], [ 13500, "doc/main.xml", 309 ], [ 13501, "doc/main.xml", 310 ], [ 13571, "doc/main.xml", 311 ], [ 13572, "doc/main.xml", 312 ], [ 13604, "doc/main.xml", 313 ], [ 13667, "doc/main.xml", 314 ], [ 13668, "doc/main.xml", 315 ], [ 13739, "doc/main.xml", 316 ], [ 13810, "doc/main.xml", 317 ], [ 13881, "doc/main.xml", 318 ], [ 13915, "doc/main.xml", 319 ], [ 13916, "doc/main.xml", 320 ], [ 13929, "doc/main.xml", 321 ], [ 13981, "doc/main.xml", 322 ], [ 14002, "doc/main.xml", 323 ], [ 14003, "doc/main.xml", 324 ], [ 14017, "doc/main.xml", 325 ], [ 14088, "doc/main.xml", 326 ], [ 14117, "doc/main.xml", 327 ], [ 14120, "doc/main.xml", 328 ], [ 14191, "doc/main.xml", 329 ], [ 14262, "doc/main.xml", 330 ], [ 14333, "doc/main.xml", 331 ], [ 14404, "doc/main.xml", 332 ], [ 14413, "doc/main.xml", 333 ], [ 14414, "doc/main.xml", 334 ], [ 14485, "doc/main.xml", 335 ], [ 14512, "doc/main.xml", 336 ], [ 14513, "doc/main.xml", 337 ], [ 14583, "doc/main.xml", 338 ], [ 14654, "doc/main.xml", 339 ], [ 14691, "doc/main.xml", 340 ], [ 14692, "doc/main.xml", 341 ], [ 14763, "doc/main.xml", 342 ], [ 14834, "doc/main.xml", 343 ], [ 14905, "doc/main.xml", 344 ], [ 14976, "doc/main.xml", 345 ], [ 15047, "doc/main.xml", 346 ], [ 15118, "doc/main.xml", 347 ], [ 15161, "doc/main.xml", 348 ], [ 15162, "doc/main.xml", 349 ], [ 15172, "doc/main.xml", 350 ], [ 15239, "doc/main.xml", 351 ], [ 15308, "doc/main.xml", 352 ], [ 15366, "doc/main.xml", 353 ], [ 15398, "doc/main.xml", 354 ], [ 15409, "doc/main.xml", 355 ], [ 15413, "doc/main.xml", 356 ], [ 15485, "doc/main.xml", 357 ], [ 15490, "doc/main.xml", 358 ], [ 15501, "doc/main.xml", 359 ], [ 15506, "doc/main.xml", 360 ], [ 15517, "doc/main.xml", 361 ], [ 15532, "doc/main.xml", 362 ], [ 15546, "doc/main.xml", 363 ], [ 15547, "doc/main.xml", 364 ], [ 15617, "doc/main.xml", 365 ], [ 15618, "doc/main.xml", 366 ], [ 15631, "doc/main.xml", 367 ], [ 15680, "doc/main.xml", 368 ], [ 15711, "doc/main.xml", 369 ], [ 15712, "doc/main.xml", 370 ], [ 15726, "doc/main.xml", 371 ], [ 15797, "doc/main.xml", 372 ], [ 15826, "doc/main.xml", 373 ], [ 15827, "doc/main.xml", 374 ], [ 15898, "doc/main.xml", 375 ], [ 15969, "doc/main.xml", 376 ], [ 16022, "doc/main.xml", 377 ], [ 16023, "doc/main.xml", 378 ], [ 16094, "doc/main.xml", 379 ], [ 16140, "doc/main.xml", 380 ], [ 16141, "doc/main.xml", 381 ], [ 16212, "doc/main.xml", 382 ], [ 16283, "doc/main.xml", 383 ], [ 16354, "doc/main.xml", 384 ], [ 16425, "doc/main.xml", 385 ], [ 16496, "doc/main.xml", 386 ], [ 16557, "doc/main.xml", 387 ], [ 16558, "doc/main.xml", 388 ], [ 16568, "doc/main.xml", 389 ], [ 16606, "doc/main.xml", 390 ], [ 16677, "doc/main.xml", 391 ], [ 16682, "doc/main.xml", 392 ], [ 16702, "doc/main.xml", 393 ], [ 16766, "doc/main.xml", 394 ], [ 16809, "doc/main.xml", 395 ], [ 16814, "doc/main.xml", 396 ], [ 16819, "doc/main.xml", 397 ], [ 16830, "doc/main.xml", 398 ], [ 16845, "doc/main.xml", 399 ], [ 16859, "doc/main.xml", 400 ], [ 16860, "doc/main.xml", 401 ], [ 16871, "doc/main.xml", 402 ], [ 16872, "doc/main.xml", 403 ], [ 16942, "doc/main.xml", 404 ], [ 16943, "doc/main.xml", 405 ], [ 16978, "doc/main.xml", 406 ], [ 17028, "doc/main.xml", 407 ], [ 17029, "doc/main.xml", 408 ], [ 17100, "doc/main.xml", 409 ], [ 17171, "doc/main.xml", 410 ], [ 17242, "doc/main.xml", 411 ], [ 17313, "doc/main.xml", 412 ], [ 17331, "doc/main.xml", 413 ], [ 17332, "doc/main.xml", 414 ], [ 17403, "doc/main.xml", 415 ], [ 17474, "doc/main.xml", 416 ], [ 17548, "doc/main.xml", 417 ], [ 17619, "doc/main.xml", 418 ], [ 17677, "doc/main.xml", 419 ], [ 17678, "doc/main.xml", 420 ], [ 17693, "doc/main.xml", 421 ], [ 17694, "doc/main.xml", 422 ], [ 17707, "doc/main.xml", 423 ], [ 17732, "doc/main.xml", 424 ], [ 17762, "doc/main.xml", 425 ], [ 17763, "doc/main.xml", 426 ], [ 17779, "doc/main.xml", 427 ], [ 17852, "doc/main.xml", 428 ], [ 17925, "doc/main.xml", 429 ], [ 17998, "doc/main.xml", 430 ], [ 18057, "doc/main.xml", 431 ], [ 18058, "doc/main.xml", 432 ], [ 18068, "doc/main.xml", 433 ], [ 18141, "doc/main.xml", 434 ], [ 18181, "doc/main.xml", 435 ], [ 18192, "doc/main.xml", 436 ], [ 18207, "doc/main.xml", 437 ], [ 18221, "doc/main.xml", 438 ], [ 18222, "doc/main.xml", 439 ], [ 18292, "doc/main.xml", 440 ], [ 18293, "doc/main.xml", 441 ], [ 18306, "doc/main.xml", 442 ], [ 18336, "doc/main.xml", 443 ], [ 18354, "doc/main.xml", 444 ], [ 18355, "doc/main.xml", 445 ], [ 18426, "doc/main.xml", 446 ], [ 18497, "doc/main.xml", 447 ], [ 18512, "doc/main.xml", 448 ], [ 18526, "doc/main.xml", 449 ], [ 18527, "doc/main.xml", 450 ], [ 18597, "doc/main.xml", 451 ], [ 18598, "doc/main.xml", 452 ], [ 18611, "doc/main.xml", 453 ], [ 18646, "doc/main.xml", 454 ], [ 18667, "doc/main.xml", 455 ], [ 18668, "doc/main.xml", 456 ], [ 18683, "doc/main.xml", 457 ], [ 18754, "doc/main.xml", 458 ], [ 18825, "doc/main.xml", 459 ], [ 18895, "doc/main.xml", 460 ], [ 18896, "doc/main.xml", 461 ], [ 18906, "doc/main.xml", 462 ], [ 18945, "doc/main.xml", 463 ], [ 19016, "doc/main.xml", 464 ], [ 19021, "doc/main.xml", 465 ], [ 19098, "doc/main.xml", 466 ], [ 19102, "doc/main.xml", 467 ], [ 19175, "doc/main.xml", 468 ], [ 19180, "doc/main.xml", 469 ], [ 19191, "doc/main.xml", 470 ], [ 19206, "doc/main.xml", 471 ], [ 19220, "doc/main.xml", 472 ], [ 19221, "doc/main.xml", 473 ], [ 19291, "doc/main.xml", 474 ], [ 19292, "doc/main.xml", 475 ], [ 19305, "doc/main.xml", 476 ], [ 19333, "doc/main.xml", 477 ], [ 19354, "doc/main.xml", 478 ], [ 19355, "doc/main.xml", 479 ], [ 19370, "doc/main.xml", 480 ], [ 19441, "doc/main.xml", 481 ], [ 19500, "doc/main.xml", 482 ], [ 19515, "doc/main.xml", 483 ], [ 19529, "doc/main.xml", 484 ], [ 19530, "doc/main.xml", 485 ], [ 19600, "doc/main.xml", 486 ], [ 19601, "doc/main.xml", 487 ], [ 19614, "doc/main.xml", 488 ], [ 19647, "doc/main.xml", 489 ], [ 19668, "doc/main.xml", 490 ], [ 19669, "doc/main.xml", 491 ], [ 19683, "doc/main.xml", 492 ], [ 19754, "doc/main.xml", 493 ], [ 19814, "doc/main.xml", 494 ], [ 19815, "doc/main.xml", 495 ], [ 19886, "doc/main.xml", 496 ], [ 19957, "doc/main.xml", 497 ], [ 20028, "doc/main.xml", 498 ], [ 20057, "doc/main.xml", 499 ], [ 20058, "doc/main.xml", 500 ], [ 20068, "doc/main.xml", 501 ], [ 20107, "doc/main.xml", 502 ], [ 20178, "doc/main.xml", 503 ], [ 20183, "doc/main.xml", 504 ], [ 20222, "doc/main.xml", 505 ], [ 20261, "doc/main.xml", 506 ], [ 20266, "doc/main.xml", 507 ], [ 20277, "doc/main.xml", 508 ], [ 20292, "doc/main.xml", 509 ], [ 20306, "doc/main.xml", 510 ], [ 20307, "doc/main.xml", 511 ], [ 20318, "doc/main.xml", 512 ], [ 20319, "doc/main.xml", 513 ], [ 20320, "doc/main.xml", 514 ], [ 20390, "doc/main.xml", 515 ], [ 20391, "doc/main.xml", 516 ], [ 20419, "doc/main.xml", 517 ], [ 20420, "doc/main.xml", 518 ], [ 20498, "doc/main.xml", 519 ], [ 20499, "doc/main.xml", 520 ], [ 20512, "doc/main.xml", 521 ], [ 20546, "doc/main.xml", 522 ], [ 20573, "doc/main.xml", 523 ], [ 20574, "doc/main.xml", 524 ], [ 20588, "doc/main.xml", 525 ], [ 20653, "doc/main.xml", 526 ], [ 20684, "doc/main.xml", 527 ], [ 20685, "doc/main.xml", 528 ], [ 20756, "doc/main.xml", 529 ], [ 20827, "doc/main.xml", 530 ], [ 20898, "doc/main.xml", 531 ], [ 20969, "doc/main.xml", 532 ], [ 21040, "doc/main.xml", 533 ], [ 21111, "doc/main.xml", 534 ], [ 21182, "doc/main.xml", 535 ], [ 21253, "doc/main.xml", 536 ], [ 21280, "doc/main.xml", 537 ], [ 21295, "doc/main.xml", 538 ], [ 21309, "doc/main.xml", 539 ], [ 21310, "doc/main.xml", 540 ], [ 21380, "doc/main.xml", 541 ], [ 21381, "doc/main.xml", 542 ], [ 21394, "doc/main.xml", 543 ], [ 21424, "doc/main.xml", 544 ], [ 21446, "doc/main.xml", 545 ], [ 21447, "doc/main.xml", 546 ], [ 21461, "doc/main.xml", 547 ], [ 21532, "doc/main.xml", 548 ], [ 21565, "doc/main.xml", 549 ], [ 21566, "doc/main.xml", 550 ], [ 21637, "doc/main.xml", 551 ], [ 21708, "doc/main.xml", 552 ], [ 21779, "doc/main.xml", 553 ], [ 21850, "doc/main.xml", 554 ], [ 21878, "doc/main.xml", 555 ], [ 21879, "doc/main.xml", 556 ], [ 21950, "doc/main.xml", 557 ], [ 21951, "doc/main.xml", 558 ], [ 22010, "doc/main.xml", 559 ], [ 22025, "doc/main.xml", 560 ], [ 22039, "doc/main.xml", 561 ], [ 22040, "doc/main.xml", 562 ], [ 22110, "doc/main.xml", 563 ], [ 22111, "doc/main.xml", 564 ], [ 22124, "doc/main.xml", 565 ], [ 22157, "doc/main.xml", 566 ], [ 22176, "doc/main.xml", 567 ], [ 22177, "doc/main.xml", 568 ], [ 22191, "doc/main.xml", 569 ], [ 22262, "doc/main.xml", 570 ], [ 22333, "doc/main.xml", 571 ], [ 22403, "doc/main.xml", 572 ], [ 22418, "doc/main.xml", 573 ], [ 22432, "doc/main.xml", 574 ], [ 22433, "doc/main.xml", 575 ], [ 22503, "doc/main.xml", 576 ], [ 22504, "doc/main.xml", 577 ], [ 22517, "doc/main.xml", 578 ], [ 22546, "doc/main.xml", 579 ], [ 22571, "doc/main.xml", 580 ], [ 22572, "doc/main.xml", 581 ], [ 22586, "doc/main.xml", 582 ], [ 22657, "doc/main.xml", 583 ], [ 22728, "doc/main.xml", 584 ], [ 22799, "doc/main.xml", 585 ], [ 22810, "doc/main.xml", 586 ], [ 22811, "doc/main.xml", 587 ], [ 22884, "doc/main.xml", 588 ], [ 22957, "doc/main.xml", 589 ], [ 23001, "doc/main.xml", 590 ], [ 23017, "doc/main.xml", 591 ], [ 23031, "doc/main.xml", 592 ], [ 23032, "doc/main.xml", 593 ], [ 23102, "doc/main.xml", 594 ], [ 23103, "doc/main.xml", 595 ], [ 23116, "doc/main.xml", 596 ], [ 23137, "doc/main.xml", 597 ], [ 23158, "doc/main.xml", 598 ], [ 23159, "doc/main.xml", 599 ], [ 23173, "doc/main.xml", 600 ], [ 23244, "doc/main.xml", 601 ], [ 23315, "doc/main.xml", 602 ], [ 23386, "doc/main.xml", 603 ], [ 23435, "doc/main.xml", 604 ], [ 23436, "doc/main.xml", 605 ], [ 23507, "doc/main.xml", 606 ], [ 23578, "doc/main.xml", 607 ], [ 23649, "doc/main.xml", 608 ], [ 23719, "doc/main.xml", 609 ], [ 23763, "doc/main.xml", 610 ], [ 23764, "doc/main.xml", 611 ], [ 23835, "doc/main.xml", 612 ], [ 23906, "doc/main.xml", 613 ], [ 23954, "doc/main.xml", 614 ], [ 23955, "doc/main.xml", 615 ], [ 23965, "doc/main.xml", 616 ], [ 24003, "doc/main.xml", 617 ], [ 24074, "doc/main.xml", 618 ], [ 24079, "doc/main.xml", 619 ], [ 24101, "doc/main.xml", 620 ], [ 24105, "doc/main.xml", 621 ], [ 24137, "doc/main.xml", 622 ], [ 24180, "doc/main.xml", 623 ], [ 24191, "doc/main.xml", 624 ], [ 24206, "doc/main.xml", 625 ], [ 24220, "doc/main.xml", 626 ], [ 24221, "doc/main.xml", 627 ], [ 24232, "doc/main.xml", 628 ], [ 24233, "doc/main.xml", 629 ], [ 24303, "doc/main.xml", 630 ], [ 24304, "doc/main.xml", 631 ], [ 24340, "doc/main.xml", 632 ], [ 24389, "doc/main.xml", 633 ], [ 24390, "doc/main.xml", 634 ], [ 24391, "doc/main.xml", 635 ], [ 24462, "doc/main.xml", 636 ], [ 24533, "doc/main.xml", 637 ], [ 24606, "doc/main.xml", 638 ], [ 24677, "doc/main.xml", 639 ], [ 24688, "doc/main.xml", 640 ], [ 24689, "doc/main.xml", 641 ], [ 24760, "doc/main.xml", 642 ], [ 24831, "doc/main.xml", 643 ], [ 24845, "doc/main.xml", 644 ], [ 24846, "doc/main.xml", 645 ], [ 24917, "doc/main.xml", 646 ], [ 24988, "doc/main.xml", 647 ], [ 25059, "doc/main.xml", 648 ], [ 25130, "doc/main.xml", 649 ], [ 25201, "doc/main.xml", 650 ], [ 25248, "doc/main.xml", 651 ], [ 25249, "doc/main.xml", 652 ], [ 25320, "doc/main.xml", 653 ], [ 25391, "doc/main.xml", 654 ], [ 25462, "doc/main.xml", 655 ], [ 25533, "doc/main.xml", 656 ], [ 25604, "doc/main.xml", 657 ], [ 25675, "doc/main.xml", 658 ], [ 25735, "doc/main.xml", 659 ], [ 25736, "doc/main.xml", 660 ], [ 25807, "doc/main.xml", 661 ], [ 25878, "doc/main.xml", 662 ], [ 25949, "doc/main.xml", 663 ], [ 26014, "doc/main.xml", 664 ], [ 26025, "doc/main.xml", 665 ], [ 26026, "doc/main.xml", 666 ], [ 26097, "doc/main.xml", 667 ], [ 26168, "doc/main.xml", 668 ], [ 26239, "doc/main.xml", 669 ], [ 26310, "doc/main.xml", 670 ], [ 26381, "doc/main.xml", 671 ], [ 26452, "doc/main.xml", 672 ], [ 26472, "doc/main.xml", 673 ], [ 26473, "doc/main.xml", 674 ], [ 26544, "doc/main.xml", 675 ], [ 26615, "doc/main.xml", 676 ], [ 26686, "doc/main.xml", 677 ], [ 26757, "doc/main.xml", 678 ], [ 26828, "doc/main.xml", 679 ], [ 26842, "doc/main.xml", 680 ], [ 26843, "doc/main.xml", 681 ], [ 26914, "doc/main.xml", 682 ], [ 26985, "doc/main.xml", 683 ], [ 27056, "doc/main.xml", 684 ], [ 27127, "doc/main.xml", 685 ], [ 27198, "doc/main.xml", 686 ], [ 27255, "doc/main.xml", 687 ], [ 27256, "doc/main.xml", 688 ], [ 27327, "doc/main.xml", 689 ], [ 27398, "doc/main.xml", 690 ], [ 27469, "doc/main.xml", 691 ], [ 27512, "doc/main.xml", 692 ], [ 27513, "doc/main.xml", 693 ], [ 27584, "doc/main.xml", 694 ], [ 27655, "doc/main.xml", 695 ], [ 27726, "doc/main.xml", 696 ], [ 27797, "doc/main.xml", 697 ], [ 27868, "doc/main.xml", 698 ], [ 27939, "doc/main.xml", 699 ], [ 28010, "doc/main.xml", 700 ], [ 28025, "doc/main.xml", 701 ], [ 28026, "doc/main.xml", 702 ], [ 28097, "doc/main.xml", 703 ], [ 28168, "doc/main.xml", 704 ], [ 28239, "doc/main.xml", 705 ], [ 28310, "doc/main.xml", 706 ], [ 28381, "doc/main.xml", 707 ], [ 28452, "doc/main.xml", 708 ], [ 28523, "doc/main.xml", 709 ], [ 28594, "doc/main.xml", 710 ], [ 28665, "doc/main.xml", 711 ], [ 28699, "doc/main.xml", 712 ], [ 28700, "doc/main.xml", 713 ], [ 28738, "doc/main.xml", 714 ], [ 28780, "doc/main.xml", 715 ], [ 28781, "doc/main.xml", 716 ], [ 28854, "doc/main.xml", 717 ], [ 28896, "doc/main.xml", 718 ], [ 28897, "doc/main.xml", 719 ], [ 28904, "doc/main.xml", 720 ], [ 28977, "doc/main.xml", 721 ], [ 29003, "doc/main.xml", 722 ], [ 29076, "doc/main.xml", 723 ], [ 29149, "doc/main.xml", 724 ], [ 29222, "doc/main.xml", 725 ], [ 29295, "doc/main.xml", 726 ], [ 29362, "doc/main.xml", 727 ], [ 29435, "doc/main.xml", 728 ], [ 29468, "doc/main.xml", 729 ], [ 29541, "doc/main.xml", 730 ], [ 29614, "doc/main.xml", 731 ], [ 29633, "doc/main.xml", 732 ], [ 29641, "doc/main.xml", 733 ], [ 29642, "doc/main.xml", 734 ], [ 29715, "doc/main.xml", 735 ], [ 29788, "doc/main.xml", 736 ], [ 29861, "doc/main.xml", 737 ], [ 29934, "doc/main.xml", 738 ], [ 29947, "doc/main.xml", 739 ], [ 29948, "doc/main.xml", 740 ], [ 29962, "doc/main.xml", 741 ], [ 29963, "doc/main.xml", 742 ], [ 29974, "doc/main.xml", 743 ], [ 29975, "doc/main.xml", 744 ], [ 29986, "doc/main.xml", 745 ], [ 29987, "doc/edim.xml", 50 ], [ 29988, "doc/edim.xml", 51 ], [ 29996, "doc/edim.xml", 52 ], [ 29997, "doc/edim.xml", 53 ], [ 30031, "doc/edim.xml", 54 ], [ 30064, "doc/edim.xml", 55 ], [ 30065, "doc/edim.xml", 56 ], [ 30106, "doc/edim.xml", 57 ], [ 30118, "doc/edim.xml", 58 ], [ 30119, "doc/edim.xml", 59 ], [ 30127, "doc/edim.xml", 60 ] ], labels := rec( ("Chap-EDIM") := [ "1", "chap1_mj.html#X7AA826067CC8C395" ], CheapFactorsInt := [ "1.6-4", "chap1_mj.html#X7BAB977C7EB05067" ], ElementaryDivisorsIntMatDeterminant := [ "1.4-2", "chap1_mj.html#X821E30477A5DCE68" ], ElementaryDivisorsPPartHavasSterling := [ "1.2-2", "chap1_mj.html#X82EC4724865F4DF9" ], ElementaryDivisorsPPartRk := [ "1.2-1", "chap1_mj.html#X813B0D73868CD751" ], ElementaryDivisorsPPartRkExp := [ "1.2-1", "chap1_mj.html#X813B0D73868CD751" ], ElementaryDivisorsPPartRkExpSmall := [ "1.2-1", "chap1_mj.html#X813B0D73868CD751" ], ElementaryDivisorsPPartRkI := [ "1.2-1", "chap1_mj.html#X813B0D73868CD751" ], ElementaryDivisorsPPartRkII := [ "1.2-1", "chap1_mj.html#X813B0D73868CD751" ], ElementaryDivisorsSquareIntMatFullRank := [ "1.4-1", "chap1_mj.html#X7B6A3B8486872B0C" ], ExponentSquareIntMatFullRank := [ "1.3-3", "chap1_mj.html#X86DA61D978D2D889" ], GcdexIntLLL := [ "1.5-1", "chap1_mj.html#X799B1A5285D00859" ], HadamardBoundIntMat := [ "1.6-3", "chap1_mj.html#X7CDF3D2081207080" ], HermiteIntMatLLL := [ "1.5-2", "chap1_mj.html#X7C6AE6777B72F9D2" ], HermiteIntMatLLLTrans := [ "1.5-3", "chap1_mj.html#X862962B7878A284F" ], InfoEDIM := [ "1.1-1", "chap1_mj.html#X7AF83FEC7CD0311C" ], InverseIntMatMod := [ "1.6-2", "chap1_mj.html#X78518E1D81435762" ], InverseRatMat := [ "1.3-1", "chap1_mj.html#X7A9656D47C4D2D16" ], RankMod := [ "1.6-5", "chap1_mj.html#X8312EDA78209B4EA" ], RatNumberFromModular := [ "1.6-1", "chap1_mj.html#X7EC844F97C469C03" ], RationalSolutionIntMat := [ "1.3-2", "chap1_mj.html#X8302B31E86B3AFDB" ] , ("Sect-ElDivPad") := [ "1.4", "chap1_mj.html#X7A6548FA7C837D27" ], ("Sect-Install") := [ "1.1", "chap1_mj.html#X84D3F5E77E3BF046" ], ("Sect-InvRatMat") := [ "1.3", "chap1_mj.html#X80FF39C07E03D7EF" ], ("Sect-InvRatMatAlg") := [ "1.7", "chap1_mj.html#X83FD1AAB7EB2E934" ], ("Sect-NFIntMatLLL") := [ "1.5", "chap1_mj.html#X788047737FA04422" ], ("Sect-PPElDiv") := [ "1.2", "chap1_mj.html#X818BE04687230849" ], ("Sect-Util") := [ "1.6", "chap1_mj.html#X832582857EB36B23" ], SmithIntMatLLL := [ "1.5-4", "chap1_mj.html#X8626F15179C09798" ], SmithIntMatLLLTrans := [ "1.5-5", "chap1_mj.html#X86094B1B7C87EBF6" ], ("Ssect-rankintmat") := [ "1.7-1", "chap1_mj.html#X791ED7D97F87FDFD" ] ) , labeltexts := rec( ("Chap-EDIM") := "The EDIM\ -Package", ("Sect-ElDivPad") := "All Elementary Divisors Us\ ing p-adic Method", ("Sect-Install") := "Installation of the EDIM package", ("Sect-InvRatMat") := "Inverse of Rational Matri\ ces", ("Sect-InvRatMatAlg") := "InverseRatMat - the Al\ gorithm", ("Sect-NFIntMatLLL") := "Gcd and Normal Forms Us\ ing LLL", ("Sect-PPElDiv") := "\ \\(p\\)-Parts of Elementary Divisors", ("Sect-Util") := "Utility Functions from the EDIM-package", ("Ssect-rankintmat") := "Rank of Integer Matrix<\ /span>" ), linelength := 76, mathmode := "MathJax", name := "WHOLEDOCUMENT", next := 30144, root := ~, six := [ [ "Title page", ".", [ 0, 0, 0 ], 1, 1, "title page", "X7D2C85EC87DD46E5" ], [ "Copyright", ".-1", [ 0, 0, 1 ], 28, 2, "copyright", "X81488B807F2A1CF1" ], [ "Table of Contents", ".-2", [ 0, 0, 2 ], 39, 3, "table of contents", "X8537FEB07AF2BEC8" ], [ "\033[1X\033[33X\033[0;-2YThe \033[5XEDIM\033[105X\033[101X\027\033[1X\\ 027-Package\033[133X\033[101X", "1", [ 1, 0, 0 ], 1, 4, "the edim-package", "X7AA826067CC8C395" ], [ "\033[1X\033[33X\033[0;-2YInstallation of the \033[5XEDIM\033[105X\033[\ 101X\027\033[1X\027 package\033[133X\033[101X", "1.1", [ 1, 1, 0 ], 35, 4, "installation of the edim package", "X84D3F5E77E3BF046" ], [ "\033[1X\033[33X\033[0;-2Y\033[22Xp\033[122X\033[101X\027\033[1X\027-Pa\ rts of Elementary Divisors\033[133X\033[101X", "1.2", [ 1, 2, 0 ], 63, 5, "p-parts of elementary divisors", "X818BE04687230849" ], [ "\033[1X\033[33X\033[0;-2YInverse of Rational Matrices\033[133X\033[101\ X", "1.3", [ 1, 3, 0 ], 155, 6, "inverse of rational matrices", "X80FF39C07E03D7EF" ], [ "\033[1X\033[33X\033[0;-2YAll Elementary Divisors Using p-adic Method\\ 033[133X\033[101X", "1.4", [ 1, 4, 0 ], 225, 7, "all elementary divisors using p-adic method", "X7A6548FA7C837D27" ] , [ "\033[1X\033[33X\033[0;-2YGcd and Normal Forms Using LLL\033[133X\033[1\ 01X", "1.5", [ 1, 5, 0 ], 302, 8, "gcd and normal forms using lll", "X788047737FA04422" ], [ "\033[1X\033[33X\033[0;-2YUtility Functions from the \033[5XEDIM\033[10\ 5X\033[101X\027\033[1X\027-package\033[133X\033[101X", "1.6", [ 1, 6, 0 ], 383, 10, "utility functions from the edim-package", "X832582857EB36B23" ], [ "\033[1X\033[33X\033[0;-2YInverseRatMat - the Algorithm\033[133X\033[10\ 1X", "1.7", [ 1, 7, 0 ], 459, 11, "inverseratmat - the algorithm", "X83FD1AAB7EB2E934" ], [ "\033[1X\033[33X\033[0;-2YRank of Integer Matrix\033[133X\033[101X", "1.7-1", [ 1, 7, 1 ], 522, 12, "rank of integer matrix", "X791ED7D97F87FDFD" ], [ "Bibliography", "Bib", [ "Bib", 0, 0 ], 1, 13, "bibliography", "X7A6F98FD85F02BFE" ], [ "References", "Bib", [ "Bib", 0, 0 ], 1, 13, "references", "X7A6F98FD85F02BFE" ], [ "Index", "Ind", [ "Ind", 0, 0 ], 1, 14, "index", "X83A0356F839C696F" ] , [ "License", ".-1", [ 0, 0, 1 ], 28, 2, "license", "X81488B807F2A1CF1" ] , [ "\033[5XEDIM\033[105X", "1.", [ 1, 0, 0 ], 1, 4, "edim", "X7AA826067CC8C395" ], [ "\033[2XInfoEDIM\033[102X", "1.1-1", [ 1, 1, 1 ], 55, 5, "infoedim", "X7AF83FEC7CD0311C" ], [ "\033[2XElementaryDivisorsPPartRk\033[102X", "1.2-1", [ 1, 2, 1 ], 68, 5, "elementarydivisorsppartrk", "X813B0D73868CD751" ], [ "\033[2XElementaryDivisorsPPartRkI\033[102X", "1.2-1", [ 1, 2, 1 ], 68, 5, "elementarydivisorsppartrki", "X813B0D73868CD751" ], [ "\033[2XElementaryDivisorsPPartRkII\033[102X", "1.2-1", [ 1, 2, 1 ], 68, 5, "elementarydivisorsppartrkii", "X813B0D73868CD751" ], [ "\033[2XElementaryDivisorsPPartRkExp\033[102X", "1.2-1", [ 1, 2, 1 ], 68, 5, "elementarydivisorsppartrkexp", "X813B0D73868CD751" ], [ "\033[2XElementaryDivisorsPPartRkExpSmall\033[102X", "1.2-1", [ 1, 2, 1 ], 68, 5, "elementarydivisorsppartrkexpsmall", "X813B0D73868CD751" ], [ "\033[2XElementaryDivisorsPPartHavasSterling\033[102X", "1.2-2", [ 1, 2, 2 ], 127, 6, "elementarydivisorspparthavassterling", "X82EC4724865F4DF9" ], [ "\033[2XInverseRatMat\033[102X", "1.3-1", [ 1, 3, 1 ], 158, 6, "inverseratmat", "X7A9656D47C4D2D16" ], [ "\033[2XRationalSolutionIntMat\033[102X", "1.3-2", [ 1, 3, 2 ], 177, 6, "rationalsolutionintmat", "X8302B31E86B3AFDB" ], [ "\033[2XExponentSquareIntMatFullRank\033[102X", "1.3-3", [ 1, 3, 3 ], 193, 7, "exponentsquareintmatfullrank", "X86DA61D978D2D889" ], [ "\033[2XElementaryDivisorsSquareIntMatFullRank\033[102X", "1.4-1", [ 1, 4, 1 ], 233, 7, "elementarydivisorssquareintmatfullrank", "X7B6A3B8486872B0C" ], [ "\033[2XElementaryDivisorsIntMatDeterminant\033[102X", "1.4-2", [ 1, 4, 2 ], 272, 8, "elementarydivisorsintmatdeterminant", "X821E30477A5DCE68" ], [ "\033[2XGcdexIntLLL\033[102X", "1.5-1", [ 1, 5, 1 ], 318, 9, "gcdexintlll", "X799B1A5285D00859" ], [ "\033[2XHermiteIntMatLLL\033[102X", "1.5-2", [ 1, 5, 2 ], 331, 9, "hermiteintmatlll", "X7C6AE6777B72F9D2" ], [ "\033[2XHermiteIntMatLLLTrans\033[102X", "1.5-3", [ 1, 5, 3 ], 338, 9, "hermiteintmatllltrans", "X862962B7878A284F" ], [ "\033[2XSmithIntMatLLL\033[102X", "1.5-4", [ 1, 5, 4 ], 356, 9, "smithintmatlll", "X8626F15179C09798" ], [ "\033[2XSmithIntMatLLLTrans\033[102X", "1.5-5", [ 1, 5, 5 ], 363, 9, "smithintmatllltrans", "X86094B1B7C87EBF6" ], [ "\033[2XRatNumberFromModular\033[102X", "1.6-1", [ 1, 6, 1 ], 386, 10, "ratnumberfrommodular", "X7EC844F97C469C03" ], [ "\033[2XInverseIntMatMod\033[102X", "1.6-2", [ 1, 6, 2 ], 398, 10, "inverseintmatmod", "X78518E1D81435762" ], [ "\033[2XHadamardBoundIntMat\033[102X", "1.6-3", [ 1, 6, 3 ], 412, 10, "hadamardboundintmat", "X7CDF3D2081207080" ], [ "\033[2XCheapFactorsInt\033[102X", "1.6-4", [ 1, 6, 4 ], 420, 10, "cheapfactorsint", "X7BAB977C7EB05067" ], [ "\033[2XRankMod\033[102X", "1.6-5", [ 1, 6, 5 ], 432, 11, "rankmod", "X8312EDA78209B4EA" ] ], sixcount := [ [ 0, 0, 0 ], [ 0, 0, 1 ], [ 0, 0, 1 ], [ 0, 0, 2 ], [ 1, 0, 0 ], [ 1, 0, 0 ], [ 1, 1, 0 ], [ 1, 1, 1 ], [ 1, 2, 0 ], [ 1, 2, 1 ], [ 1, 2, 1 ], [ 1, 2, 1 ], [ 1, 2, 1 ], [ 1, 2, 1 ], [ 1, 2, 2 ], [ 1, 3, 0 ], [ 1, 3, 1 ], [ 1, 3, 2 ], [ 1, 3, 3 ], [ 1, 4, 0 ], [ 1, 4, 1 ], [ 1, 4, 2 ], [ 1, 5, 0 ], [ 1, 5, 1 ], [ 1, 5, 2 ], [ 1, 5, 3 ], [ 1, 5, 4 ], [ 1, 5, 5 ], [ 1, 6, 0 ], [ 1, 6, 1 ], [ 1, 6, 2 ], [ 1, 6, 3 ], [ 1, 6, 4 ], [ 1, 6, 5 ], [ 1, 7, 0 ], [ 1, 7, 1 ], [ "Bib", 0, 0 ], [ "Bib", 0, 0 ], [ "Ind", 0, 0 ] ], sixindex := [ 1, 2, 16, 3, 4, 17, 5, 18, 6, 23, 22, 21, 20, 19, 24, 7, 25, 26, 27, 8, 28, 29, 9, 30, 31, 32, 33, 34, 10, 35, 36, 37, 38, 39, 11, 12, 13, 14, 15 ], start := 0, stop := 30143, toctext := "

1 The EDIM-Package<\ /span>\n

1.1 Installation of the EDIM package\n\n

\n
<\ span class=\"nocss\"> 1.1-1 InfoEDIM\n

1.2 \\(p\ \\)-Parts of Elementary Divisors\n\n

\n
1.2-1 ElementaryDivisorsPPartR\ k\n
<\ /span>1.2-2 ElementaryDivisorsPPar\ tHavasSterling\n

1.3 Inverse of Rational Matrices\n\n

\n
  \ 1.3-1 InverseRatMat\n
  1.3-2 Rati\ onalSolutionIntMat\n
  1.3-3 Expon\ entSquareIntMatFullRank\n

1.4 All Elementary Divisors Using\ p-adic Method\n\n

\n
1.4-1 ElementaryDivisorsSquareIntMatFullRank\n
1.4-2 ElementaryDivisorsIntMatDetermina\ nt\n

<\ span class=\"nocss\"> \ 1.5 Gcd and Normal Forms Using LLL\n\ \n

\n
  1.5-1 Gcdex\ IntLLL\n
&n\ bsp;1.5-2 HermiteIntMatLLL<\ /a>\n
  1.5-3 HermiteIntMatLLLTrans\n
  1.5-4 SmithIntMatLLL\ \n
  1.5-5 SmithIntMatLLLTrans\n

1.6 Utility Functions from the EDIM-pac\ kage\n\n

\n\
  1.6-1 RatNumberFromModular\n  1.6-2 InverseIntMatMod\n
  1.6-3 HadamardBoundIntMat\n
  1\ .6-4 CheapFactorsInt\n
  1.6-5 Ran\ kMod\n

1.7 InverseRatMat - the Algorithm\n\n

\n
1.7-1 Rank of Integer Matrix\n\n

\ \n

References

Index

1 The\ EDIM-Package\n

1.1 Installation of the EDIM package\n\n

\n
<\ /span>1.1-1 InfoEDIM\n<\ /div>

1.2 \\(p\\)-Parts of Elementary Divi\ sors\n\n

\n\
1.2-1 ElementaryDivisorsPPartRk\n
1.2-2 ElementaryDivisorsPPartHavasSterling\n

<\ /div>\n

&\ nbsp;1.3 Inverse of Rational Matrices\n\n

\n
  <\ a href=\"chap1_mj.html#X7A9656D47C4D2D16\">1.3-1 InverseRatMat\n
  1.3-2 RationalSolutionIntMat\n
  1.3-3 ExponentSquareIntMatFullRank\ \n

1.4 All Elementary Divisors Using p-adic Method\n\ \n

\n
1.4-1 Eleme\ ntaryDivisorsSquareIntMatFullRank\n
1.4-2 ElementaryDivisorsIntMatDeterminant\n

<\ a href=\"chap1_mj.html#X788047737FA04422\">1.5 Gcd and\ Normal Forms Using LLL\n\n

\n
  1.5-1 GcdexIntLLL\n
  1.5-2 HermiteIntMatLLL\n\
  1.5-3 HermiteIntMatLLLTrans\n  1.5-4 SmithIntMatLLL\n
  1.5-5 SmithIntMatLLLTrans\n

1.6 Utility Functions from t\ he EDIM-package\n\n

\n
&n\ bsp;1.6-1 RatNumberFromModu\ lar\n
  \ ;1.6-2 InverseIntMatMod\ \n
  1.6-3 HadamardBoundIntMat\n
  1.6-4 CheapFactorsInt\n
  1.6-5 RankMod\n

\ 1.7 Invers\ eRatMat - the Algorithm\n\n

\n
1.7-1 Rank of Integer \ Matrix\n\n

References

\n<\ div class=\"ContChap\">Ind\ ex

\n" ) gap> ───────────────────────────────────────────────────────────────────────────── Loading EDIM 1.3.5 (Elementary Divisors of Integer Matrices) by Frank Lübeck (http://www.math.rwth-aachen.de/~Frank.Luebeck). Homepage: http://www.math.rwth-aachen.de/~Frank.Luebeck/EDIM ───────────────────────────────────────────────────────────────────────────── #I File: /builddir/build/BUILD/EDIM-1.3.5/../pkg/EDIM-1.3.5/doc/manual.lab written. gap> gap> + rm -fr ../../doc ../pkg + RPM_EC=0 ++ jobs -p + exit 0 Executing(%install): /bin/sh -e /var/tmp/rpm-tmp.gsSmvF + umask 022 + cd /builddir/build/BUILD + '[' /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386 '!=' / ']' + rm -rf /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386 ++ dirname /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386 + mkdir -p /builddir/build/BUILDROOT + mkdir /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386 + cd EDIM-1.3.5 + mkdir -p /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/bin/i686-redhat-linux-gnu-default32-kv7 + cp -p bin/i686-redhat-linux-gnu-default32-kv7/.libs/ediv.so /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/bin/i686-redhat-linux-gnu-default32-kv7 + cp -a doc lib tst VERSION PackageInfo.g init.g makedocrel.g read.g /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5 + rm -f /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/clean + rm -f /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.aux /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.bbl /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.blg /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.brf /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.idx /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.ilg /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.ind /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.log /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.out /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/doc/edim.pnr + /usr/lib/rpm/find-debuginfo.sh -j48 --strict-build-id -m -i --build-id-seed 1.3.5-4.fc32 --unique-debug-suffix -1.3.5-4.fc32.i386 --unique-debug-src-base gap-pkg-edim-1.3.5-4.fc32.i386 --run-dwz --dwz-low-mem-die-limit 10000000 --dwz-max-die-limit 50000000 -S debugsourcefiles.list /builddir/build/BUILD/EDIM-1.3.5 explicitly decompress any DWARF compressed ELF sections in /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/bin/i686-redhat-linux-gnu-default32-kv7/ediv.so extracting debug info from /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap/pkg/EDIM-1.3.5/bin/i686-redhat-linux-gnu-default32-kv7/ediv.so Exception caught while booting Guile. /usr/bin/gdb.minimal: warning: Could not complete Guile gdb module initialization from: /usr/share/gdb/guile/gdb/boot.scm. Limited Guile support is available. Suggest passing --data-directory=/path/to/gdb/data-directory. Error in function "open-file": No such file or directory: "/usr/share/gdb/guile/gdb/boot.scm"original debug info size: 76kB, size after compression: 76kB /usr/lib/rpm/sepdebugcrcfix: Updated 1 CRC32s, 0 CRC32s did match. 17 blocks + /usr/lib/rpm/check-buildroot + /usr/lib/rpm/redhat/brp-ldconfig + /usr/lib/rpm/brp-compress + /usr/lib/rpm/brp-strip-static-archive /usr/bin/strip + /usr/lib/rpm/redhat/brp-python-bytecompile /usr/bin/python 1 0 + /usr/lib/rpm/brp-python-hardlink + /usr/lib/rpm/redhat/brp-mangle-shebangs Executing(%check): /bin/sh -e /var/tmp/rpm-tmp.84N7xG + umask 022 + cd /builddir/build/BUILD + cd EDIM-1.3.5 + export LC_ALL=C.UTF-8 + LC_ALL=C.UTF-8 + gap -q -l '/builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/lib/gap;/usr/lib/gap' + tee log #I autpgrp package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I alnuth package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I crisp package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I ctbllib package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I factint package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I fga package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I irredsol package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I laguna package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I polenta package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I polycyclic package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I resclasses package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I sophus package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I tomlib package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') Reading 34x34 integer matrix 'mat2' with elementary divisors 'eldiv2'. true From here you should only see a sequence of `true' lines, until the session quits. true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true true + grep -Fq false log + rm -f log + RPM_EC=0 ++ jobs -p + exit 0 Processing files: gap-pkg-edim-1.3.5-4.fc32.i686 Executing(%doc): /bin/sh -e /var/tmp/rpm-tmp.9KrzwG + umask 022 + cd /builddir/build/BUILD + cd EDIM-1.3.5 + DOCDIR=/builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/share/doc/gap-pkg-edim + export LC_ALL=C + LC_ALL=C + export DOCDIR + /usr/bin/mkdir -p /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/share/doc/gap-pkg-edim + cp -pr CHANGES /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/share/doc/gap-pkg-edim + cp -pr README /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/share/doc/gap-pkg-edim + cp -pr TODO /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/share/doc/gap-pkg-edim + RPM_EC=0 ++ jobs -p + exit 0 Executing(%license): /bin/sh -e /var/tmp/rpm-tmp.RG5avG + umask 022 + cd /builddir/build/BUILD + cd EDIM-1.3.5 + LICENSEDIR=/builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/share/licenses/gap-pkg-edim + export LC_ALL=C + LC_ALL=C + export LICENSEDIR + /usr/bin/mkdir -p /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/share/licenses/gap-pkg-edim + cp -pr GPL /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386/usr/share/licenses/gap-pkg-edim + RPM_EC=0 ++ jobs -p + exit 0 Provides: gap-pkg-edim = 1.3.5-4.fc32 gap-pkg-edim(x86-32) = 1.3.5-4.fc32 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Requires: libc.so.6 libc.so.6(GLIBC_2.0) libc.so.6(GLIBC_2.1.3) libc.so.6(GLIBC_2.3.4) rtld(GNU_HASH) Processing files: gap-pkg-edim-doc-1.3.5-4.fc32.noarch Provides: gap-pkg-edim-doc = 1.3.5-4.fc32 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Processing files: gap-pkg-edim-debugsource-1.3.5-4.fc32.i686 Provides: gap-pkg-edim-debugsource = 1.3.5-4.fc32 gap-pkg-edim-debugsource(x86-32) = 1.3.5-4.fc32 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Processing files: gap-pkg-edim-debuginfo-1.3.5-4.fc32.i686 Provides: debuginfo(build-id) = 343b79e85f1e0b5e01225a580b6406ca7ea98bb9 gap-pkg-edim-debuginfo = 1.3.5-4.fc32 gap-pkg-edim-debuginfo(x86-32) = 1.3.5-4.fc32 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Recommends: gap-pkg-edim-debugsource(x86-32) = 1.3.5-4.fc32 Checking for unpackaged file(s): /usr/lib/rpm/check-files /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386 Wrote: /builddir/build/RPMS/gap-pkg-edim-debugsource-1.3.5-4.fc32.i686.rpm Wrote: /builddir/build/RPMS/gap-pkg-edim-debuginfo-1.3.5-4.fc32.i686.rpm Wrote: /builddir/build/RPMS/gap-pkg-edim-1.3.5-4.fc32.i686.rpm Wrote: /builddir/build/RPMS/gap-pkg-edim-doc-1.3.5-4.fc32.noarch.rpm Executing(%clean): /bin/sh -e /var/tmp/rpm-tmp.93ZMHH + umask 022 + cd /builddir/build/BUILD + cd EDIM-1.3.5 + /usr/bin/rm -rf /builddir/build/BUILDROOT/gap-pkg-edim-1.3.5-4.fc32.i386 + RPM_EC=0 ++ jobs -p + exit 0 Child return code was: 0