1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884
|
/****************************************************************************
**
*W dt.c GAP source Wolfgang Merkwitz
**
*H @(#)$Id: dt.c,v 4.29 2002/04/15 10:03:46 sal Exp $
**
*Y Copyright (C) 1996, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany
*Y (C) 1998 School Math and Comp. Sci., University of St. Andrews, Scotland
*Y Copyright (C) 2002 The GAP Group
**
** This file implements the part of the deep thought package which deals
** with computing the deep thought polynomials.
**
** Deep Thought deals with trees. A tree <tree> is a concatenation of
** several nodes where each node is a 5-tuple of immediate integers. If
** <tree> is an atom it contains only one node, thus it is itself a
** 5-tuple. If <tree> is not an atom we obtain its list representation by
**
** <tree> := topnode(<tree>) concat left(<tree>) concat right(<tree>) .
**
** Let us denote the i-th node of <tree> by (<tree>, i) and the tree rooted
** at (<tree>, i) by tree(<tree>, i). Let <a> be tree(<tree>, i)
** The first entry of (<tree>, i) is pos(a),
** and the second entry is num(a). The third entry of (<tree>, i) gives a
** mark.(<tree>, i)[3] = 1 means that (<tree>, i) is marked,
** (<tree>, i)[3] = 0 means that (<tree>, i) is not marked. The fourth entry
** of (<tree>, i) contains the number of knodes of tree(<tree>, i). The
** fifth entry of (<tree>, i) finally contains a boundary for
** pos( tree(<tree>, i) ). (<tree>, i)[5] <= 0 means that
** pos( tree(<tree>, i) ) is unbounded. If tree(<tree>, i) is an atom we
** already know that pos( tree(<tree>, i) ) is unbound. Thus we then can
** use the fifth component of (<tree>, i) to store the side. In this case
** (<tree>, i)[5] = -1 means that tree(<tree>, i) is an atom from the
** right hand word, and (<tree>, i)[5] = -2 means that tree(<tree>, i) is
** an atom from the left hand word.
**
** A second important data structure deep thought deals with is a deep
** thought monomial. A deep thought monomial g_<tree> is a product of
** binomial coefficients with a coefficient c. Deep thought monomials
** are represented in this implementation by formula
** vectors, which are lists of integers. The first entry of a formula
** vector is 0, to distinguish formula vectors from trees. The second
** entry is the coefficient c, and the third and fourth entries are
** num( left(tree) ) and num( right(tree) ). The remaining part of the
** formula vector is a concatenation of pairs of integers. A pair (i, j)
** with i > 0 represents binomial(x_i, j). A pair (0, j) represents
** binomial(y_gen, j) when word*gen^power is calculated.
**
** Finally deep thought has to deal with pseudorepresentatives. A
** pseudorepresentative <a> is stored in list of length 4. The first entry
** stores left( <a> ), the second entry contains right( <a> ), the third
** entry contains num( <a> ) and the last entry finally gives a boundary
** for pos( <b> ) for all trees <b> which are represented by <a>.
*/
#include "system.h"
const char * Revision_dt_c =
"@(#)$Id: dt.c,v 4.29 2002/04/15 10:03:46 sal Exp $";
#include "gasman.h" /* garbage collector */
#include "objects.h" /* objects */
#include "scanner.h" /* scanner */
#include "bool.h" /* booleans */
#include "calls.h" /* generic call mechanism */
#include "gap.h" /* error handling, initialisation */
#include "gvars.h" /* global variables */
#include "integer.h" /* integers */
#define INCLUDE_DECLARATION_PART
#include "dt.h" /* deep thought */
#undef INCLUDE_DECLARATION_PART
#include "records.h" /* generic records */
#include "precord.h" /* plain records */
#include "lists.h" /* generic lists */
#include "listfunc.h" /* functions for generic lists */
#include "plist.h" /* plain lists */
#include "string.h" /* strings */
/****************************************************************************
**
*F DT_POS(tree, index) . . . . . . . . . . . . . position of (<tree>, index)
**
** 'DT_POS' returns pos(<a>) where <a> is the subtree of <tree> rooted at
** (<tree>, index). <index> has to be a positive integer less or equal than
** the number of nodes of <tree>.
*/
#define DT_POS(tree, index) \
(ELM_PLIST(tree, (index-1)*5 + 1 ) )
/***************************************************************************
**
*F SET_DT_POS(tree, index, obj) . . . assign the position of(<tree>, index)
**
** 'SET_DT_POS sets pos(<a>) to the object <obj>, where <a> is the subtree
** of <tree>, rooted at (<tree>, index). <index> has to be an positive
** integer less or equal to the number of nodes of <tree>
*/
#define SET_DT_POS(tree, index, obj) \
SET_ELM_PLIST(tree, (index-1)*5 + 1, obj)
/***************************************************************************
**
*F DT_GEN(tree, index) . . . . . . . . . . . . . generator of (<tree>, index)
**
** 'DT_GEN' returns num(<a>) where <a> is the subtree of <tree> rooted at
** (<tree>, index). <index> has to be a positive integer less or equal than
** the number of nodes of <tree>.
*/
#define DT_GEN(tree, index) \
(ELM_PLIST(tree, (index-1)*5 + 2) )
/**************************************************************************
**
*F SET_DT_GEN(tree, index, obj) . . . assign the generator of(<tree>, index)
**
** 'SET_DT_GEN sets num(<a>) to the object <obj>, where <a> is the subtree
** of <tree>, rooted at (<tree>, index). <index> has to be an positive
** integer less or equal to the number of nodes of <tree>
*/
#define SET_DT_GEN(tree, index, obj) \
(SET_ELM_PLIST(tree, (index-1)*5 + 2, obj) )
/**************************************************************************
**
*F DT_IS_MARKED(tree, index) . . . . . . tests if (<tree>, index) is marked
**
** 'DT_IS_MARKED' returns 1 (as C integer) if (<tree>, index) is marked, and
** 0 otherwise. <index> has to be a positive integer less or equal to the
** number of nodes of <tree>.
*/
#define DT_IS_MARKED(tree, index) \
(INT_INTOBJ (ELM_PLIST(tree, (index-1)*5 + 3) ) )
/**************************************************************************
**
*F DT_MARK(tree, index) . . . . . . . . . . . . . . . . . . . . mark a node
**
** 'DT_MARK' marks the node (<tree>, index). <index> has to be a positive
** integer less or equal to the number of nodes of <tree>.
*/
#define DT_MARK(tree, index) \
SET_ELM_PLIST(tree, (index-1)*5 + 3, INTOBJ_INT(1) )
/**************************************************************************
**
*F DT_UNMARK(tree, index) . . . . . . . . . . . remove the mark from a node
**
** 'DT_UNMARK' removes the mark from the node (<tree>, index). <index> has
** has to be a positive integer less or equal to the number of nodes of
** <tree>.
*/
#define DT_UNMARK(tree, index) \
SET_ELM_PLIST(tree, (index-1)*5 + 3, INTOBJ_INT(0) )
/****************************************************************************
**
*F DT_RIGHT(tree, index) . . . .determine the right subnode of (<tree>, index)
*F DT_LEFT(tree, index) . . . . determine the left subnode of (<tree>, index)
**
** 'DT_RIGHT' returns the right subnode of (<tree>, index). That means if
** DT_RIGHT(tree, index) = index2, then (<tree>, index2) is the right
** subnode of (<tree>, index).
**
** 'DT_LEFT' returns the left subnode of (<tree>, index). That means if
** DT_LEFT(tree, index) = index2, then (<tree>, index2) is the left
** subnode of (<tree>, index).
**
** Before calling 'DT_RIGHT' or 'DT_LEFT' it should be ensured, that
** (<tree>, index) is not an atom. <index> has to be a positive integer
** less or equal to the number of nodes of <tree>.
*/
#define DT_RIGHT(tree, index) \
( INT_INTOBJ(ELM_PLIST(tree, index*5 + 4) ) + index + 1)
#define DT_LEFT(tree, index) \
( index + 1 )
/****************************************************************************
**
*F DT_SIDE(tree, index) . . . . . . . determine the side of (<tree>, index)
*V RIGHT. . . . . . . . . . . . . . . integer describing "right"
*V LEFT . . . . . . . . . . . . . . . integer describing "left"
**
** 'DT_SIDE' returns 'LEFT' if (<tree>, index) is an atom from the Left-hand
** word, and 'RIGHT' if (<tree>, index) is an atom of the Right-hand word.
** Otherwise 'DT_SIDE' returns an integer bigger than 1. <index> has to be
** a positive integer less or equal to the number of nodes of <tree>.
*/
#define RIGHT -1
#define LEFT -2
#define DT_SIDE(tree, index) \
(INT_INTOBJ( ELM_PLIST(tree, (index-1)*5 + 5 ) ) )
/****************************************************************************
**
*F DT_LENGTH(tree, index) . . . . . . . . number of nodes of (<tree>, index)
**
** 'DT_LENGTH' returns the number of nodes of (<tree>, index). <index> has
** to be a positive integer less or equal to the number of nodes of <tree>.
*/
#define DT_LENGTH(tree, index) \
( INT_INTOBJ(ELM_PLIST(tree, (index-1)*5 + 4) ) )
/***************************************************************************
**
*F DT_MAX(tree, index) . . . . . . . . . . . . . . . . boundary of a node
**
** 'DT_MAX(tree, index)' returns a boundary for 'DT_POS(tree, index)'.
** 'DT_MAX(tree, index) = 0 ' means that 'DT_POS(tree, index)' is unbound.
** <index> has to be a positive integer less or equal to the number of nodes
** of tree.
*/
#define DT_MAX(tree, index) \
(ELM_PLIST(tree, (index-1)*5 + 5 ) )
/****************************************************************************
**
*F CELM(list, pos) . . . . . . . . . . element of a plain list as C integer
**
** 'CELM' returns the <pos>-th element of the plain list <list>. <pos> has
** to be a positive integer less or equal to the physical length of <list>.
** Before calling 'CELM' it should be ensured that the <pos>-th entry of
** <list> is an immediate integer object.
*/
#define CELM(list, pos) ( INT_INTOBJ(ELM_PLIST(list, pos) ) )
/****************************************************************************
**
*V Dt_add
**
** Dt_add is used to store the library function dt_add.
*/
Obj Dt_add;
extern Obj ShallowCopyPlist( Obj list );
/****************************************************************************
**
*F UnmarkTree( <tree> ) . . . . . . . remove the marks of all nodes of <tree>
**
** 'UnmarkTree' removes all marks of all nodes of the tree <tree>.
*/
void UnmarkTree(
Obj tree )
{
UInt i, len; /* loop variable */
len = DT_LENGTH(tree, 1);
for (i=1; i <= len; i++ )
DT_UNMARK(tree, i);
}
/****************************************************************************
**
*F FuncUnmarkTree(<self>, <tree>) . . remove the marks of all nodes of <tree>
**
** 'FuncUnmarkTree' implements the internal function 'UnmarkTree'.
**
** 'UnmarkTree( <tree> )'
**
** 'UnmarkTree' removes all marks of all nodes of the tree <tree>.
*/
Obj FuncUnmarkTree(
Obj self,
Obj tree )
{
UnmarkTree(tree);
return 0;
}
/*****************************************************************************
**
*F Mark(<tree>, <reftree>, <index>) . . . . . . . . find all nodes of <tree>
** which are almost equal
** to (<reftree>, index)
**
** 'Mark' determines all nodes of the tree <tree>, rooting subtrees almost
** equal to the tree rooted at (<reftree>, index). 'Mark' marks these nodes
** and returns the number of different nodes among these nodes. Since it
** is assumed that the set {pos(a) | a almost equal to (<reftree>, index) }
** is equal to {1,...,n} for a positive integer n, 'Mark' actually returns
** the Maximum of {pos(a) | a almost equal to (<reftree>, index)}.
*/
UInt Mark(
Obj tree,
Obj reftree,
Int indexx )
{
UInt i, /* loop variable */
m, /* integer to return */
len;
Obj refgen;
m = 0;
i = 1;
len = DT_LENGTH(tree, 1);
refgen = DT_GEN(reftree, indexx);
while ( i <= len )
{
/* skip all nodes (<tree>, i) with
** num(<tree>, i) > num(<reftree>, indexx) */
while( i < len &&
DT_GEN(tree, i) > refgen )
i++;
if ( AlmostEqual(tree, i, reftree, indexx) )
{
DT_MARK(tree, i);
if ( m < INT_INTOBJ( DT_POS(tree, i) ) )
m = INT_INTOBJ( DT_POS(tree, i) );
}
/* Since num(a) < num(b) holds for all subtrees <a> of an arbitrary
** tree <b> we can now skip the whole tree rooted at (<tree>, i).
** If (<tree>, i) is the left subnode of another node we can even
** skip the tree rooted at that node, because of
** num( right(a) ) < num( left(a) ) for all trees <a>.
** Note that (<tree>, i) is the left subnode of another node, if and
** only if the previous node (<tree>, i-1) is not an atom. in this
** case (<tree>, i) is the left subnode of (<tree>, i-1). */
if ( DT_LENGTH(tree, i-1) == 1 )
/* skip the tree rooted at (<tree>, i). */
i = i + DT_LENGTH(tree, i);
else
/* skip the tree rooted at (<tree>, i-1) */
i = i - 1 + DT_LENGTH(tree, i-1);
}
return m;
}
/****************************************************************************
**
*F AmostEqual(<tree1>,<index1>,<tree2>,<index2>) . . test of almost equality
**
** 'AlmostEqual' tests if tree(<tree1>, index1) is almost equal to
** tree(<tree2>, index2). 'AlmostEqual' returns 1
** if these trees are almost equal, and 0 otherwise. <index1> has to be
** a positive integer less or equal to the number of nodes of <tree1>,
** and <index2> has to be a positive integer less or equal to the number of
** nodes of <tree2>.
*/
Int AlmostEqual(
Obj tree1,
Int index1,
Obj tree2,
Int index2 )
{
UInt k, schranke; /* loop variable */
/* First the two top nodes of tree(<tree1>, index1) and
** tree(<tree2>, index2) (that are (<tree1>, index1) and
** (<tree2, index2) ) are compared by testing the equality of the 2-nd,
** 5-th and 6-th entries the nodes. */
if ( DT_GEN(tree1, index1) != DT_GEN(tree2, index2) )
return 0;
if ( DT_SIDE(tree1, index1) != DT_SIDE(tree2, index2) )
return 0;
if ( DT_LENGTH(tree1, index1) != DT_LENGTH(tree2, index2) )
return 0;
/* For the comparison of the remaining nodes of tree(<tree1>, index1)
** and tree(<tree2>, index2) it is also necessary to compare the first
** entries of the nodes. Note that we know at this point, that
** tree(<tree1>, index1) and tree(<tree2>, index2) have the same number
** of nodes */
schranke = index1 + DT_LENGTH(tree1, index1);
for (k = index1 + 1; k < schranke; k++ )
{
if ( DT_GEN(tree1, k) != DT_GEN(tree2, k + index2 - index1 ) )
return 0;
if ( DT_POS(tree1, k) != DT_POS(tree2, k + index2 - index1 ) )
return 0;
if ( DT_SIDE(tree1, k) !=
DT_SIDE(tree2, k + index2 - index1) )
return 0;
if ( DT_LENGTH(tree1, k) != DT_LENGTH(tree2, k + index2 - index1) )
return 0;
}
return 1;
}
/*****************************************************************************
**
*F Equal(<tree1>,<index1>,<tree2>,<index2>) . . . . . . . . test of equality
**
** 'Equal' tests if tree(<tree1>, index1) is equal to
** tree(<tree2>, index2). 'Equal' returns 1
** if these trees are equal, and 0 otherwise. <index1> has to be
** a positive integer less or equal to the number of nodes of <tree1>,
** and <index2> has to be a positive integer less or equal to the number of
** nodes of <tree2>.
*/
Int Equal(
Obj tree1,
Int index1,
Obj tree2,
Int index2 )
{
UInt k, schranke; /* loop variable */
/* Each node of tree(<tree1>, index1) is compared to the corresponding
** node of tree(<tree2>, index2) by testing the equality of the 1-st,
** 2-nd, 5-th and 6-th nodes. */
schranke = index1 + DT_LENGTH(tree1, index1);
for (k=index1; k < schranke; k++)
{
if ( DT_GEN(tree1, k) != DT_GEN(tree2, k + index2 - index1 ) )
return 0;
if ( DT_POS(tree1, k) != DT_POS(tree2, k + index2 - index1 ) )
return 0;
if ( DT_SIDE(tree1, k) !=
DT_SIDE(tree2, k + index2 - index1) )
return 0;
if ( DT_LENGTH(tree1, k) != DT_LENGTH(tree2, k + index2 - index1) )
return 0;
}
return 1;
}
/****************************************************************************
**
*F Mark2(<tree>,<index1>,<reftree>,<index2>) . . find all subtrees of
** tree(<tree>, index1) which
** are almost equal to
** tree(<reftree>, index2)
**
** 'Mark2' determines all subtrees of tree(<tree>, index1) that are almost
** equal to tree(<reftree>, index2). 'Mark2' marks the top nodes of these
** trees and returns a list of lists <list> such that <list>[i]
** for each subtree <a> of <tree> which is almost equal to
** tree(<reftree>, index2) and for which pos(<a>) = i holds contains an
** integer describing the position of the top node of <a> in <tree>.
** For example <list>[i] = [j, k] means that tree(<tree>, j) and
** tree(<tree>, k) are almost equal to tree(<reftree>, index2) and
** that pos(tree(<tree>, j) = pos(tree(<tree>, k) = i holds.
**
** <index1> has to be a positive integer less or equal to the number of nodes
** of <tree>, and <index2> has to be a positive integer less or equal to
** the number of nodes of <reftree>.
*/
Obj Mark2(
Obj tree,
Int index1,
Obj reftree,
Int index2 )
{
UInt i, /* loop variable */
len;
Obj new,
list, /* list to return */
refgen;
/* initialize <list> */
list = NEW_PLIST(T_PLIST, 0);
SET_LEN_PLIST(list, 0);
i = index1;
len = index1 + DT_LENGTH(tree, index1) - 1;
refgen = DT_GEN(reftree, index2);
while( i <= len )
{
/* skip all nodes (<tree>, i) with
** num(<tree>, i) > num(<reftree>, index) */
while( i < len &&
DT_GEN(tree, i) > refgen )
i++;
if ( AlmostEqual(tree, i, reftree, index2) )
{
DT_MARK(tree, i);
/* if <list> is too small grow it appropiately */
if ( LEN_PLIST(list) < INT_INTOBJ( DT_POS(tree, i) ) )
{
GROW_PLIST(list, INT_INTOBJ( DT_POS(tree, i) ) );
SET_LEN_PLIST(list, INT_INTOBJ( DT_POS(tree, i) ) );
}
/* if <list> has no entry at position pos(tree(<tree>, i))
** create a new list <new>, assign it to list at position
** pos(tree(<tree>, i)), and add i to <new> */
if ( ELM_PLIST(list, INT_INTOBJ( DT_POS(tree, i) ) ) == 0)
{
new = NEW_PLIST( T_PLIST, 1);
SET_LEN_PLIST(new, 1);
SET_ELM_PLIST(new, 1, INTOBJ_INT(i) );
SET_ELM_PLIST(list, INT_INTOBJ( DT_POS(tree, i) ), new);
/* tell gasman that list has changed */
CHANGED_BAG(list);
}
/* add i to <list>[ pos(tree(<tree>, i)) ] */
else
{
new = ELM_PLIST(list, INT_INTOBJ( DT_POS(tree, i) ) );
GROW_PLIST(new, LEN_PLIST(new) + 1);
SET_LEN_PLIST(new, LEN_PLIST(new) + 1);
SET_ELM_PLIST(new, LEN_PLIST(new), INTOBJ_INT(i) );
/* tell gasman that new has changed */
CHANGED_BAG(new);
}
}
/* Since num(a) < num(b) holds for all subtrees <a> of an arbitrary
** tree <b> we can now skip the whole tree rooted at (<tree>, i).
** If (<tree>, i) is the left subnode of another node we can even
** skip the tree rooted at that node, because of
** num( right(a) ) < num( left(a) ) for all trees <a>.
** Note that (<tree>, i) is the left subnode of another node, if and
** only if the previous node (<tree>, i-1) is not an atom. In this
** case (<tree>, i) is the left subnode of (<tree>, i-1). */
if ( DT_LENGTH(tree, i-1) == 1 )
/* skip tree(<tree>, i) */
i = i + DT_LENGTH(tree, i);
else
/* skip tree(<tree>, i-1) */
i = i - 1 + DT_LENGTH(tree, i-1);
}
return list;
}
/*****************************************************************************
**
*F FindTree(<tree>, <index>)
**
** 'FindTree' looks for a subtree <a> of tree(<tree>, index) such that
** the top node of
** <a> is not marked but all the other nodes of <a> are marked. It is
** assumed that if the top node of a subtree <b> of tree(<tree>, index)
** is marked, all
** nodes of of <b> are marked. Hence it suffices to look for a subtree <a>
** of <tree> such that the top node of <a> is unmarked and the left and the
** right node of <a> are marked. 'FindTree' returns an integer <i> such
** that tree(<tree> ,i) has the properties mentioned above. If such a tree
** does not exist 'Findtree' returns 0 (as C integer). Note that this holds
** if and only if tree(<tree>, index) is marked.
*/
UInt FindTree(
Obj tree,
Int indexx )
{
UInt i, len; /* loop variable */
/* return 0 if (<tree>, indexx) is marked */
if ( DT_IS_MARKED(tree, indexx) )
return 0;
i = indexx;
len = indexx + DT_LENGTH(tree, indexx);
/* loop over all nodes of tree(<tree>, indexx) to find a tree with the
** properties described above. */
while( i < indexx + DT_LENGTH(tree, indexx) )
{
/* skip all nodes that are unmarked and rooting non-atoms */
while( !( DT_IS_MARKED(tree, i) ) && DT_LENGTH(tree, i) > 1 )
i++;
/* if (<tree>, i) is unmarked we now know that tree(<tree>, i) is
** an atom and we can return i. Note that an unmarked atom has the
** desired properties. */
if ( !( DT_IS_MARKED(tree, i) ) )
return i;
/* go to the previous node */
i--;
/* If the right node of tree(<tree>, i) is marked return i.
** Else go to the right node of tree(<tree>, i). */
if ( DT_IS_MARKED(tree, DT_RIGHT(tree, i) ) )
return i;
i = DT_RIGHT(tree, i);
}
return 0;
}
/****************************************************************************
**
*F MakeFormulaVector(<tree>, <pr>) . . . . . . . . . compute the polynomial
** g_<tree> for <tree>
**
** 'MakeFormulaVector' returns the polynomial g_<tree> for a tree <tree>
** and a pc-presentation <pr> of a nilpotent group. This polynomial g_<tree>
** is a product of binomial coefficients with a coefficient c ( see the
** header of this file ).
**
** For the calculation of the coefficient c the top node of <tree> is ignored
** because it can happen that trees are equal exept for the top node.
** Hence it suffices to compute the formula vector for one of these trees.
** Then we get the "correct" coefficient for the polynomial for each <tree'>
** of those trees by multiplying the coefficient given by the formula vector
** with c_( num(left(<tree'>)), num(right(<tree'>)); num(<tree'>) ). This
** is also the reason for storing num(left(<tree>)) and num(right(<tree>))
** in the formula vector.
**
** 'MakeFormulaVector' only returns correct results if all nodes of <tree>
** are unmarked.
*/
Obj MakeFormulaVector(
Obj tree,
Obj pr )
{
UInt i, /* denominator of a binomial coefficient */
j, /* loop variable */
u; /* node index */
Obj rel, /* stores relations of <pr> */
vec, /* stores formula vector to return */
prod,/* stores the product of two integers */
gen;
/* initialize <vec> and set the first four elements */
vec = NEW_PLIST(T_PLIST, 4);
SET_LEN_PLIST(vec, 4);
SET_ELM_PLIST(vec, 1, INTOBJ_INT(0) );
SET_ELM_PLIST(vec, 2, INTOBJ_INT(1) );
SET_ELM_PLIST(vec, 3, DT_GEN(tree, DT_LEFT(tree, 1) ) );
SET_ELM_PLIST(vec, 4, DT_GEN(tree, DT_RIGHT(tree, 1) ) );
/* loop over all almost equal classes of subtrees of <tree> exept for
** <tree> itself. */
u = FindTree(tree, 1);
while( u > 1 )
{
/* mark all subtrees of <tree> almost equal to tree(<tree>, u) and
** get the number of different trees in this almost equal class */
i = Mark(tree, tree, u);
/* if tree(<tree>, u) is an atom from the Right-hand word append
** [ 0, i ] to <vec> */
if ( DT_SIDE(tree, u) == RIGHT )
{
GROW_PLIST(vec, LEN_PLIST(vec)+2);
SET_LEN_PLIST(vec, LEN_PLIST(vec)+2);
SET_ELM_PLIST(vec, LEN_PLIST(vec)-1, INTOBJ_INT(0) );
SET_ELM_PLIST(vec, LEN_PLIST(vec), INTOBJ_INT(i) );
}
/* if tree(<tree>, u) is an atom from the Left-hand word append
** [ num(tree(<tree>, u)), i ] to <vec> */
else if ( DT_SIDE(tree, u) == LEFT)
{
GROW_PLIST(vec, LEN_PLIST(vec)+2);
SET_LEN_PLIST(vec, LEN_PLIST(vec)+2);
SET_ELM_PLIST(vec, LEN_PLIST(vec)-1, DT_GEN(tree, u) );
SET_ELM_PLIST(vec, LEN_PLIST(vec), INTOBJ_INT(i) );
}
/* if tree(<tree>, u) is not an atom multiply
** <vec>[2] with binomial(d, i) where
** d = c_(num(left(<tree>,u)), num(right(<tree>,u)); num(<tree>,u)) */
else
{
j = 3;
rel = ELM_PLIST( ELM_PLIST(pr, INT_INTOBJ( DT_GEN(tree,
DT_LEFT(tree, u) ) ) ),
INT_INTOBJ( DT_GEN(tree, DT_RIGHT(tree, u) ) ) );
gen = DT_GEN(tree, u);
while ( 1 )
{
if ( ELM_PLIST(rel, j) == gen )
{
prod = ProdInt(ELM_PLIST(vec, 2),
binomial(ELM_PLIST(rel, j+1),
INTOBJ_INT(i) ) );
SET_ELM_PLIST(vec, 2, prod);
/* tell gasman that vec has changed */
CHANGED_BAG(vec);
break;
}
j+=2;
}
}
u = FindTree(tree, 1);
}
return vec;
}
/**************************************************************************
**
*F FuncMakeFormulaVector(<self>,<tree>,<pr>) . . . . . compute the formula
** vector for <tree>
**
** 'FuncMakeFormulaVector' implements the internal function
** 'MakeFormulaVector(<tree>, <pr>)'.
**
** 'MakeFormulaVector(<tree>, <pr>)'
**
** 'MakeFormulaVector' returns the formula vector for the tree <tree> and
** the pc-presentation <pr>.
*/
Obj FuncMakeFormulaVector(
Obj self,
Obj tree,
Obj pr )
{
if (LEN_PLIST(tree) == 5)
ErrorReturnVoid("<tree> has to be a non-atom", 0L, 0L,
"you can 'return;'");
return MakeFormulaVector(tree, pr);
}
/*****************************************************************************
**
*F binomial(<n>, <k>) . . . . . . . . . binomial coefficient of <n> and <k>
**
** 'binomial' returns the binomial coefficient of the integers <n> and <k>.
*/
Obj binomial( Obj n,
Obj k )
{
UInt j, kc;
Obj bin, help;
if ( LtInt( INTOBJ_INT(0), n) && LtInt(n, k) )
return INTOBJ_INT(0);
if ( IS_INTOBJ(n) && n == k )
return INTOBJ_INT(1);
kc = INT_INTOBJ(k);
bin = INTOBJ_INT(1);
help = DiffInt(n, k);
for (j=1; j<=kc; j++)
bin = ProdInt( bin, SumInt(help, INTOBJ_INT(j) ) );
for (j=1; j<=kc; j++)
bin = QuoInt(bin, INTOBJ_INT(j) );
return bin;
}
/****************************************************************************
**
*F Leftof(<tree1>,<index1>,<tree2>,<index2>) . . . . test if one tree is left
** of another tree
**
** 'Leftof' returns 1 if tree(<tree1>, index1) is left of tree(<tree2>,index2)
** in the word being collected at the first instance, that
** tree(<tree1>, index1) and tree(<tree2>, index2) both occur. It is assumed
** that tree(<tree1>, index1) is not equal to tree(<tree2>, index2).
*/
Int Leftof(
Obj tree1,
Int index1,
Obj tree2,
Int index2 )
{
if ( DT_LENGTH(tree1, index1) == 1 && DT_LENGTH(tree2, index2) == 1 ) {
if (DT_SIDE(tree1, index1) == LEFT && DT_SIDE(tree2, index2) == RIGHT)
return 1;
else if (DT_SIDE(tree1, index1) == RIGHT &&
DT_SIDE(tree2, index2) == LEFT )
return 0;
else if (DT_GEN(tree1, index1) == DT_GEN(tree2, index2) )
return ( DT_POS(tree1, index1) < DT_POS(tree2, index2) );
else
return ( DT_GEN(tree1, index1) < DT_GEN(tree2, index2) );
}
if ( DT_LENGTH(tree1, index1) > 1 &&
DT_LENGTH(tree2, index2) > 1 &&
Equal( tree1, DT_RIGHT(tree1, index1) ,
tree2, DT_RIGHT(tree2, index2) ) )
{
if ( Equal( tree1, DT_LEFT(tree1, index1),
tree2, DT_LEFT(tree2, index2) ) ) {
if ( DT_GEN(tree1, index1) == DT_GEN(tree2, index2) )
return ( DT_POS(tree1, index1) < DT_POS(tree2, index2) );
else
return ( DT_GEN(tree1, index1) < DT_GEN(tree2, index2) );
}
}
if( Earlier(tree1, index1, tree2, index2) )
return !Leftof2( tree2, index2, tree1, index1);
else
return Leftof2( tree1, index1, tree2, index2);
}
/*****************************************************************************
**
*F Leftof2(<tree1>,<index1>,<tree2>,<index2>) . . . . . test if one tree is
** left of another tree
**
** 'Leftof2' returns 1 if tree(<tree1>, index1) is left of
** tree(<tree2>,index2)in the word being collected at the first instance,
** that tree(<tree1>, index1) and tree(<tree2>, index2) both occur. It is
** assumed that tree(<tree2>, index2) occurs earlier than
** tree(<tree1>,index1). Furthemore it is assumed that if both
** tree(<tree1>, index1) and tree(<tree2>, index2) are non-atoms, then their
** right trees and their left trees are not equal.
*/
Int Leftof2(
Obj tree1,
Int index1,
Obj tree2,
Int index2 )
{
if ( DT_GEN(tree2, index2) < DT_GEN(tree1, DT_RIGHT(tree1, index1) ) )
return 0;
else if (Equal(tree1, DT_RIGHT(tree1, index1), tree2, index2 ) )
return 0;
else if (DT_GEN(tree2, index2) == DT_GEN(tree1, DT_RIGHT(tree1, index1)) )
return Leftof(tree1, DT_RIGHT(tree1, index1), tree2, index2 );
else if (Equal(tree1, DT_LEFT(tree1, index1), tree2, index2) )
return 0;
else
return Leftof(tree1, DT_LEFT(tree1, index1), tree2, index2);
}
/****************************************************************************
**
*F Earlier(<tree1>,<index1>,<tree2>,<index2>) . . . test if one tree occurs
** earlier than another
**
** 'Earlier' returns 1 if tree(<tree1>, index1) occurs strictly earlier than
** tree(<tree2>, index2). It is assumed that at least one of these trees
** is a non-atom. Furthermore it is assumed that if both of these trees are
** non-atoms, right(tree(<tree1>, index1) ) does not equal
** right(tree(<tree2>, index2) ) or left(tree(<tree1>, index1) ) does not
** equal left(tree(<tree2>, index2) ).
*/
Int Earlier(
Obj tree1,
Int index1,
Obj tree2,
Int index2 )
{
if ( DT_LENGTH(tree1, index1) == 1 )
return 1;
if ( DT_LENGTH(tree2, index2) == 1 )
return 0;
if ( Equal(tree1, DT_RIGHT(tree1, index1),
tree2, DT_RIGHT(tree2, index2) ) )
return Leftof(tree1, DT_LEFT(tree2, index2),
tree2, DT_LEFT(tree1, index1) );
if ( DT_GEN(tree1, DT_RIGHT(tree1, index1) ) ==
DT_GEN(tree2, DT_RIGHT(tree2, index2) ) )
return Leftof( tree1, DT_RIGHT(tree1, index1) ,
tree2, DT_RIGHT(tree2, index2) );
return (DT_GEN(tree1, DT_RIGHT(tree1, index1) ) <
DT_GEN(tree2, DT_RIGHT(tree2, index2) ) );
}
/****************************************************************************
**
** GetPols( <list>, <pr>, <pols> )
**
** GetPols computes all representatives which are represented by thr
** pseudorepresentative <list>, converts them all into the corresponding
** deep thought monomial and stores all these monomials in the list <pols>.
*/
/* See below: */
void GetReps( Obj list, Obj reps );
void FindNewReps2( Obj tree, Obj reps, Obj pr);
void GetPols(
Obj list,
Obj pr,
Obj pols )
{
Obj lreps,
rreps,
tree,
tree1;
UInt i,j,k,l, lenr, lenl, len;
lreps = NEW_PLIST(T_PLIST, 2);
rreps = NEW_PLIST(T_PLIST, 2);
SET_LEN_PLIST(lreps, 0);
SET_LEN_PLIST(rreps, 0);
/* get the representatives that are represented by <list>[1] and those
** which are represented by <list>[2]. */
GetReps( ELM_PLIST(list, 1), lreps );
GetReps( ELM_PLIST(list, 2), rreps );
lenr = LEN_PLIST(rreps);
lenl = LEN_PLIST(lreps);
for (i=1; i<=lenl; i++)
for (j=1; j<=lenr; j++)
{
/* now get all representatives, which can be constructed from
** <lreps>[<i>] and <rreps>[<j>] and add the corresponding
** deep thought monomials to <pols> */
k = LEN_PLIST( ELM_PLIST(lreps, i) )
+ LEN_PLIST( ELM_PLIST(rreps, j) ) + 5;/* m"ogliche Inkom-*/
tree = NEW_PLIST(T_PLIST, k); /* patibilit"at nach*/
SET_LEN_PLIST(tree, k); /*"Anderung der Datenstruktur */
SET_ELM_PLIST(tree, 1, INTOBJ_INT(1) );
SET_ELM_PLIST(tree, 2, ELM_PLIST( list, 3) );
SET_ELM_PLIST(tree, 3, INTOBJ_INT(0) );
SET_ELM_PLIST(tree, 4, INTOBJ_INT((int)(k/5)) );
SET_ELM_PLIST(tree, 5, INTOBJ_INT(0) );
tree1 = ELM_PLIST(lreps, i);
len = LEN_PLIST( tree1 );
for (l=1; l<=len; l++)
SET_ELM_PLIST(tree, l+5, ELM_PLIST(tree1, l) );
k = LEN_PLIST(tree1) + 5;
tree1 = ELM_PLIST(rreps, j);
len = LEN_PLIST( tree1 );
for (l=1; l<=len; l++)
SET_ELM_PLIST(tree, l+k, ELM_PLIST(tree1, l) );
UnmarkTree(tree);
FindNewReps2(tree, pols, pr);
}
}
/****************************************************************************
**
*F FuncGetPols( <self>, <list>, <pr>, <pols> )
**
** FuncGetPols implements the internal function GetPols.
*/
Obj FuncGetPols(
Obj self,
Obj list,
Obj pr,
Obj pols )
{
if (LEN_PLIST(list) != 4)
ErrorReturnVoid("<list> must be a generalised representative not a tree"
,0L, 0L, "you can 'return;'");
GetPols(list, pr, pols);
return (Obj) 0;
}
/****************************************************************************
**
*F GetReps( <list>, <reps> )
**
** GetReps computes all representatives which are represented by the
** pseudorepresentative <list> and adds them to the list <reps>.
*/
/* See below: */
void FindNewReps1( Obj tree, Obj reps);
void GetReps(
Obj list,
Obj reps )
{
Obj lreps,
rreps,
tree,
tree1;
UInt i,j,k,l, lenr, lenl, len;;
if ( LEN_PLIST(list) != 4 )
{
SET_ELM_PLIST(reps, 1, list);
SET_LEN_PLIST(reps, 1);
return;
}
lreps = NEW_PLIST(T_PLIST, 2);
rreps = NEW_PLIST(T_PLIST, 2);
SET_LEN_PLIST(lreps, 0);
SET_LEN_PLIST(rreps, 0);
/* now get all representatives which are represented by <list>[1] and
** all representatives which are represented by <list>[2]. */
GetReps( ELM_PLIST(list, 1), lreps );
GetReps( ELM_PLIST(list, 2), rreps );
lenl = LEN_PLIST( lreps );
lenr = LEN_PLIST( rreps );
for (i=1; i<=lenl; i++)
for (j=1; j<=lenr; j++)
{
/* compute all representatives which can be constructed from
** <lreps>[<i>] and <rreps>[<j>] and add them to <reps>. */
k = LEN_PLIST( ELM_PLIST(lreps, i) )
+ LEN_PLIST( ELM_PLIST(rreps, j) ) + 5;/* m"ogliche Inkom-*/
tree = NEW_PLIST(T_PLIST, k); /* patibilit"at nach*/
SET_LEN_PLIST(tree, k); /*"Anderung der Datenstruktur */
SET_ELM_PLIST(tree, 1, INTOBJ_INT(1) );
SET_ELM_PLIST(tree, 2, ELM_PLIST( list, 3) );
SET_ELM_PLIST(tree, 3, INTOBJ_INT(0) );
SET_ELM_PLIST(tree, 4, INTOBJ_INT((int)(k/5)) );
if ( TNUM_OBJ( ELM_PLIST(list, 4) ) == T_INT &&
CELM(list, 4) < 100 &&
CELM(list, 4) > 0 )
SET_ELM_PLIST(tree, 5, ELM_PLIST(list, 4) );
else
SET_ELM_PLIST(tree, 5, INTOBJ_INT(0) );
tree1 = ELM_PLIST(lreps, i);
len = LEN_PLIST( tree1 );
for (l=1; l<=len; l++)
SET_ELM_PLIST(tree, l+5, ELM_PLIST(tree1, l) );
k = LEN_PLIST(tree1) + 5;
tree1 = ELM_PLIST(rreps, j);
len = LEN_PLIST( tree1 );
for (l=1; l<=len; l++)
SET_ELM_PLIST(tree, l+k, ELM_PLIST(tree1, l) );
UnmarkTree(tree);
FindNewReps1(tree, reps);
}
}
/**************************************************************************
**
*F FindNewReps(<tree>,<reps>,<pr>,<max>) . . construct new representatives
**
** 'FindNewReps' constructs all trees <tree'> with the following properties.
** 1) left(<tree'>) is equivalent to left(<tree>).
** right(<tree'>) is equivalent to right(<tree>).
** num(<tree'>) = num(<tree>)
** 2) <tree'> is the least tree in its equivalence class.
** 3) for each marked node of (<tree>, i) of <tree> tree(<tree>, i) is equal
** to tree(<tree'>, i).
** There are three versions of FindNewReps. FindNewReps1 adds all found
** trees to the list <reps>. This version is called by GetReps.
** FindNewReps2 computes for each found tree the corresponding deep thought
** monomial adds these deep thought monomials to <reps>. This version
** is called from GetPols.
** The third version FindNewReps finally assumes that <reps> is the list of
** pseudorepresentatives. This Version adds all found trees to <reps> and
** additionally all trees, that fulfill 1), 2) and 3) except for
** num(<tree'>) = num(<tree>). This version is called from the library
** function calrepsn.
** It is assumed that both left(<tree>) and right(<tree>) are the least
** elements in their equivalence class.
*/
/* See below: */
void FindSubs1( Obj tree, Int x, Obj list1, Obj list2, Obj a, Obj b,
Int al, Int ar, Int bl, Int br, Obj reps );
void FindNewReps1(
Obj tree,
Obj reps
)
{
Obj y, /* stores a copy of <tree> */
lsubs, /* stores pos(<subtree>) for all subtrees of
** left(<tree>) in a given almost equal class */
rsubs, /* stores pos(<subtree>) for all subtrees of
** right(<tree>) in the same almost equal class */
llist, /* stores all elements of an almost equal class
** of subtrees of left(<tree>) */
rlist; /* stores all elments of the same almost equal
** class of subtrees of right(<tree>) */
Int a, /* stores a subtree of right((<tree>) */
n, /* Length of lsubs */
m, /* Length of rsubs */
i; /* loop variable */
/* get a subtree of right(<tree>) which is unmarked but whose
** subtrees are all marked */
a = FindTree(tree, DT_RIGHT(tree, 1) );
/* If we do not find such a tree we at the bottom of the recursion.
** If leftof(left(<tree>), right(<tree>) ) holds we add all <tree>
** to <reps>. */
if ( a == 0 )
{
if ( Leftof(tree, DT_LEFT(tree, 1), tree, DT_RIGHT(tree, 1) ) )
{
y = ShallowCopyPlist(tree);
GROW_PLIST(reps, LEN_PLIST(reps) + 1);
SET_LEN_PLIST(reps, LEN_PLIST(reps) + 1);
SET_ELM_PLIST(reps, LEN_PLIST(reps), y);
/* tell gasman that <reps> has changed */
CHANGED_BAG(reps);
}
return;
}
/* get all subtrees of left(<tree>) which are almost equal to
** tree(<tree>, a) and mark them */
llist = Mark2(tree, DT_LEFT(tree, 1), tree, a);
/* get all subtrees of right(<tree>) which are almost equal to
** tree(<tree>, a) and mark them */
rlist = Mark2(tree, DT_RIGHT(tree, 1), tree, a);
n = LEN_PLIST(llist);
m = LEN_PLIST(rlist);
/* if no subtrees of left(<tree>) almost equal to
** tree(<tree>, a) have been found there is no possibility
** to change the pos-argument in the trees stored in llist and
** rlist, so call FindNewReps without changing any pos-arguments.
*/
if ( n == 0 )
{
FindNewReps1(tree, reps);
/* unmark all top nodes of the trees stored in rlist */
UnmarkAEClass(tree, rlist);
return;
}
/* store all pos-arguments that occur in the trees of llist.
** Note that the set of the pos-arguments in llist actually
** equals {1,...,n}. */
lsubs = NEW_PLIST( T_PLIST, n );
SET_LEN_PLIST(lsubs, n);
for (i=1; i<=n; i++)
SET_ELM_PLIST(lsubs, i, INTOBJ_INT(i) );
/* store all pos-arguments that occur in the trees of rlist.
** Note that the set of the pos-arguments in rlist actually
** equals {1,...,m}. */
rsubs = NEW_PLIST( T_PLIST, m );
SET_LEN_PLIST(rsubs, m);
for (i=1; i<=m; i++)
SET_ELM_PLIST(rsubs, i, INTOBJ_INT(i) );
/* find all possibilities for lsubs and rsubs such that
** lsubs[1] < lsubs[2] <...<lsubs[n],
** rsubs[1] < rsubs[2] <...<rsubs[n],
** and set(lsubs concat rsubs) equals {1,...,k} for a positiv
** integer k. For each found lsubs and rsubs 'FindSubs' changes
** pos-arguments of the subtrees in llist and rlist accordingly
** and then calls 'FindNewReps' with the changed tree <tree>.
*/
FindSubs1(tree, a, llist, rlist, lsubs, rsubs, 1, n, 1, m, reps);
/* Unmark the subtrees of <tree> in llist and rlist and reset
** pos-arguments to the original state. */
UnmarkAEClass(tree, rlist);
UnmarkAEClass(tree, llist);
}
/* See below: */
void FindSubs2( Obj tree, Int x, Obj list1, Obj list2, Obj a, Obj b,
Int al, Int ar, Int bl, Int br, Obj reps, Obj pr );
void FindNewReps2(
Obj tree,
Obj reps,
Obj pr /* pc-presentation for a
** nilpotent group <G> */
)
{
Obj lsubs, /* stores pos(<subtree>) for all subtrees of
** left(<tree>) in a given almost equal class */
rsubs, /* stores pos(<subtree>) for all subtrees of
** right(<tree>) in the same almost equal class */
llist, /* stores all elements of an almost equal class
** of subtrees of left(<tree>) */
rlist; /* stores all elments of the same almost equal
** class of subtrees of right(<tree>) */
Int a, /* stores a subtree of right((<tree>) */
n, /* Length of lsubs */
m, /* Length of rsubs */
i; /* loop variable */
/* get a subtree of right(<tree>) which is unmarked but whose
** subtrees are all marked */
a = FindTree(tree, DT_RIGHT(tree, 1) );
/* If we do not find such a tree we at the bottom of the recursion.
** If leftof(left(<tree>), right(<tree>) ) holds we convert <tree>
** into the corresponding deep thought monomial and add that to
** <reps>. */
if ( a == 0 )
{
if ( Leftof(tree, DT_LEFT(tree, 1), tree, DT_RIGHT(tree, 1) ) )
{
/* get the formula vector of tree and add it to
** reps[ rel[1] ]. */
UnmarkTree(tree);
tree = MakeFormulaVector( tree, pr);
CALL_3ARGS(Dt_add, tree, reps, pr);
}
return;
}
/* get all subtrees of left(<tree>) which are almost equal to
** tree(<tree>, a) and mark them */
llist = Mark2(tree, DT_LEFT(tree, 1), tree, a);
/* get all subtrees of right(<tree>) which are almost equal to
** tree(<tree>, a) and mark them */
rlist = Mark2(tree, DT_RIGHT(tree, 1), tree, a);
n = LEN_PLIST(llist);
m = LEN_PLIST(rlist);
/* if no subtrees of left(<tree>) almost equal to
** tree(<tree>, a) have been found there is no possibility
** to change the pos-argument in the trees stored in llist and
** rlist, so call FindNewReps without changing any pos-arguments.
*/
if ( n == 0 )
{
FindNewReps2(tree, reps, pr);
/* unmark all top nodes of the trees stored in rlist */
UnmarkAEClass(tree, rlist);
return;
}
/* store all pos-arguments that occur in the trees of llist.
** Note that the set of the pos-arguments in llist actually
** equals {1,...,n}. */
lsubs = NEW_PLIST( T_PLIST, n );
SET_LEN_PLIST(lsubs, n);
for (i=1; i<=n; i++)
SET_ELM_PLIST(lsubs, i, INTOBJ_INT(i) );
/* store all pos-arguments that occur in the trees of rlist.
** Note that the set of the pos-arguments in rlist actually
** equals {1,...,m}. */
rsubs = NEW_PLIST( T_PLIST, m );
SET_LEN_PLIST(rsubs, m);
for (i=1; i<=m; i++)
SET_ELM_PLIST(rsubs, i, INTOBJ_INT(i) );
/* find all possibilities for lsubs and rsubs such that
** lsubs[1] < lsubs[2] <...<lsubs[n],
** rsubs[1] < rsubs[2] <...<rsubs[n],
** and set(lsubs concat rsubs) equals {1,...,k} for a positiv
** integer k. For each found lsubs and rsubs 'FindSubs' changes
** pos-arguments of the subtrees in llist and rlist accordingly
** and then calls 'FindNewReps' with the changed tree <tree>.
*/
FindSubs2(tree, a, llist, rlist, lsubs, rsubs, 1, n, 1, m, reps, pr);
/* Unmark the subtrees of <tree> in llist and rlist and reset
** pos-arguments to the original state. */
UnmarkAEClass(tree, rlist);
UnmarkAEClass(tree, llist);
}
void FindNewReps(
Obj tree,
Obj reps,
Obj pr, /* pc-presentation for a
** nilpotent group <G> */
Obj max /* every generator <g_i> of <G> with
** i > max lies in the center of <G> */
)
{
Obj y, /* stores a copy of <tree> */
lsubs, /* stores pos(<subtree>) for all subtrees of
** left(<tree>) in a given almost equal class */
rsubs, /* stores pos(<subtree>) for all subtrees of
** right(<tree>) in the same almost equal class */
llist, /* stores all elements of an almost equal class
** of subtrees of left(<tree>) */
rlist, /* stores all elments of the same almost equal
** class of subtrees of right(<tree>) */
list1, /* stores a sublist of <reps> */
rel; /* stores a commutator relation from <pr> */
Int a; /* stores a subtree of right((<tree>) */
UInt n, /* Length of lsubs */
m, /* Length of rsubs */
i, lenrel; /* loop variable */
/* get a subtree of right(<tree>) which is unmarked but whose
** subtrees are all marked */
a = FindTree(tree, DT_RIGHT(tree, 1) );
/* If we do not find such a tree we at the bottom of the recursion.
** If leftof(left(<tree>), right(<tree>) ) holds we add all trees
** <tree'> with left(<tree'>) = left(<tree>),
** right(<tree'>) = right(<tree>) to <reps>, and <tree'> is the
** least element in its equivalence calss. Note that for such a
** tree we have pos(<tree'>) = 1 and num(<tree'>) = j where j is a
** positive integer for which
** c_( num(left(<tree>), num(right(<tree>)), j ) does not equal
** 0. These integers are contained in the list
** pr[ num(left(<tree>)) ][ num(right(<tree>)) ]. */
if ( a == 0 )
{
if ( Leftof(tree, DT_LEFT(tree, 1), tree, DT_RIGHT(tree, 1) ) )
{
/* get pr[ num(left(<tree>)) ][ num(right(<tree>)) ] */
rel = ELM_PLIST( ELM_PLIST(pr, INT_INTOBJ( DT_GEN(tree,
DT_LEFT(tree, 1)))) ,
INT_INTOBJ( DT_GEN(tree, DT_RIGHT(tree, 1) ) ) );
if ( ELM_PLIST(rel, 3) > max )
{
UnmarkTree(tree);
tree = MakeFormulaVector(tree, pr);
list1 = ELM_PLIST(reps, CELM(rel, 3) );
GROW_PLIST(list1, LEN_PLIST(list1) + 1 );
SET_LEN_PLIST(list1, LEN_PLIST(list1) + 1 );
SET_ELM_PLIST(list1, LEN_PLIST(list1), tree);
CHANGED_BAG(list1);
}
else
{
y = ShallowCopyPlist(tree);
lenrel = LEN_PLIST(rel);
for ( i=3;
i < lenrel &&
ELM_PLIST(rel, i) <= max;
i+=2 )
{
list1 = ELM_PLIST(reps, CELM(rel, i) );
GROW_PLIST(list1, LEN_PLIST(list1) + 1);
SET_LEN_PLIST(list1, LEN_PLIST(list1) + 1);
SET_ELM_PLIST(list1, LEN_PLIST(list1), y);
/* tell gasman that <list1> has changed */
CHANGED_BAG(list1);
}
}
}
return;
}
/* get all subtrees of left(<tree>) which are almost equal to
** tree(<tree>, a) and mark them */
llist = Mark2(tree, DT_LEFT(tree, 1), tree, a);
/* get all subtrees of right(<tree>) which are almost equal to
** tree(<tree>, a) and mark them */
rlist = Mark2(tree, DT_RIGHT(tree, 1), tree, a);
n = LEN_PLIST(llist);
m = LEN_PLIST(rlist);
/* if no subtrees of left(<tree>) almost equal to
** tree(<tree>, a) have been found there is no possibility
** to change the pos-argument in the trees stored in llist and
** rlist, so call FindNewReps without changing any pos-arguments.
*/
if ( n == 0 )
{
FindNewReps(tree, reps, pr, max);
/* unmark all top nodes of the trees stored in rlist */
UnmarkAEClass(tree, rlist);
return;
}
/* store all pos-arguments that occur in the trees of llist.
** Note that the set of the pos-arguments in llist actually
** equals {1,...,n}. */
lsubs = NEW_PLIST( T_PLIST, n );
SET_LEN_PLIST(lsubs, n);
for (i=1; i<=n; i++)
SET_ELM_PLIST(lsubs, i, INTOBJ_INT(i) );
/* store all pos-arguments that occur in the trees of rlist.
** Note that the set of the pos-arguments in rlist actually
** equals {1,...,m}. */
rsubs = NEW_PLIST( T_PLIST, m );
SET_LEN_PLIST(rsubs, m);
for (i=1; i<=m; i++)
SET_ELM_PLIST(rsubs, i, INTOBJ_INT(i) );
/* find all possibilities for lsubs and rsubs such that
** lsubs[1] < lsubs[2] <...<lsubs[n],
** rsubs[1] < rsubs[2] <...<rsubs[n],
** and set(lsubs concat rsubs) equals {1,...,k} for a positiv
** integer k. For each found lsubs and rsubs 'FindSubs' changes
** pos-arguments of the subtrees in llist and rlist accordingly
** and then calls 'FindNewReps' with the changed tree <tree>.
*/
FindSubs(tree, a, llist, rlist, lsubs, rsubs, 1, n, 1, m, reps, pr, max);
/* Unmark the subtrees of <tree> in llist and rlist and reset
** pos-arguments to the original state. */
UnmarkAEClass(tree, rlist);
UnmarkAEClass(tree, llist);
}
/***************************************************************************
**
*F FuncFindNewReps(<self>,<args>) . . . . . . construct new representatives
**
** 'FuncFindNewReps' implements the internal function 'FindNewReps'.
*/
Obj FuncFindNewReps(
Obj self,
Obj tree,
Obj reps,
Obj pr,
Obj max )
{
/* test if <tree> is really a tree */
/* TestTree(tree); */
if ( LEN_PLIST(tree) < 15 )
ErrorReturnVoid("<tree> must be a tree not a plain list", 0L, 0L,
"you can 'return;'");
FindNewReps(tree, reps, pr, max);
return 0;
}
/***************************************************************************
**
*F TestTree(<obj>) . . . . . . . . . . . . . . . . . . . . . . test a tree
**
** 'TestTree' tests if <tree> is a tree. If <tree> is not a tree 'TestTree'
** signals an error.
*/
void TestTree(
Obj tree)
{
if ( TNUM_OBJ(tree) != T_PLIST || LEN_PLIST(tree) % 7 != 0)
ErrorReturnVoid("<tree> must be a plain list, whose length is a multiple of 7", 0L, 0L, "you can 'return;'");
if ( DT_LENGTH(tree, 1) != LEN_PLIST(tree)/7 )
ErrorReturnVoid("<tree> must be a tree, not a plain list.", 0L, 0L,
"you can 'return;'");
if ( DT_SIDE(tree, 1) >= DT_LENGTH(tree, 1) )
ErrorReturnVoid("<tree> must be a tree, not a plain list.", 0L, 0L,
"you can 'return;'");
if ( DT_LENGTH(tree, 1) == 1)
{
if ( DT_SIDE(tree, 1) != LEFT && DT_SIDE(tree, 1) != RIGHT )
ErrorReturnVoid("<tree> must be a tree, not a plain list.", 0L, 0L,
"you can 'return;'");
return;
}
if ( DT_SIDE(tree, 1) <= 1 )
ErrorReturnVoid("<tree> must be a tree, not a plain list.", 0L, 0L,
"you can 'return;'");
if (DT_LENGTH(tree, 1) !=
DT_LENGTH(tree, DT_LEFT(tree, 1)) +
DT_LENGTH(tree, DT_RIGHT(tree, 1)) +
1 )
ErrorReturnVoid("<tree> must be a tree, not a plain list.", 0L, 0L,
"you can 'return;'");
if ( DT_SIDE(tree, 1) != DT_LENGTH(tree, DT_LEFT(tree, 1) ) + 1 )
ErrorReturnVoid("<tree> must be a tree, not a plain list.", 0L, 0L,
"you can 'return;'");
TestTree( Part(tree, (DT_LEFT(tree, 1) - 1)*7,
(DT_RIGHT(tree, 1) - 1)*7 ) );
TestTree( Part(tree, (DT_RIGHT(tree, 1) - 1)*7, LEN_PLIST(tree) ) );
}
/****************************************************************************
**
*F Part(<list>, <pos1>, <pos2> . . . . . . . . . . . . return a part of list
**
** 'Part' returns <list>{ [<pos1>+1 .. <pos2>] }.
*/
Obj Part(
Obj list,
Int pos1,
Int pos2 )
{
Int i, length;
Obj part;
length = pos2 - pos1;
part = NEW_PLIST(T_PLIST, length);
SET_LEN_PLIST(part, length);
for (i=1; i <= length; i++)
{
SET_ELM_PLIST(part, i, ELM_PLIST(list, pos1+i) );
}
return part;
}
/***************************************************************************
**
*F FindSubs(<tree>,<x>,<list1>,<list2>,<a>,<b>,<al>,<ar>,<bl>,<br>,<reps>,
** <pr>,<max> ) . . . . . . . . . find possible pos-arguments for
** the trees in <list1> and <list2>
**
** 'FindSubs' finds all possibilities for a and b such that
** 1) a[1] < a[2] <..< a[ ar ]
** b[1] < b[2] <..< b[ br ]
** 2) set( a concat b ) = {1,..,k} for a positiv integer k.
** 3) a[1],...,a[ al-1 ] and b[1],..,b[ bl-1 ] remain unchanged.
** For each found possibility 'FindSubs' sets the pos-arguments in the
** trees of <list1> and <list2> according to the entries of <a> and
** <b>. Then it calls 'FindNewReps' with the changed tree <tree> as
v** argument.
**
** It is assumed that the conditions 1) and 2) hold for a{ [1..al-1] } and
** b{ [1..bl-1] }.
**
** There are three versions of FindSubs according to the three versions of
** FindNewReps. FindSubs1 is called from FindNewReps1 and calls
** FindNewReps1. FindSubs2 is called from FindNewReps2 and calls
** FindNewReps2. FindSubs is called from FindNewReps and calls FindNewReps.
*/
void FindSubs1(
Obj tree,
Int x, /* subtree of <tree> */
Obj list1, /* list containing all subtrees of
** left(<tree>) almost equal to
** tree(<tree>, x) */
Obj list2, /* list containing all subtrees of
** right(<tree>) almost equal to
** tree(<tree>, x) */
Obj a, /* list to change, containing the
** pos-arguments of the trees in list1 */
Obj b, /* list to change, containing tthe
** pos-arguments of the trees in list2 */
Int al,
Int ar,
Int bl,
Int br,
Obj reps /* list of representatives for all trees */
)
{
Int i; /* loop variable */
/* if <al> > <ar> or <bl> > <br> nothing remains to change. */
if ( al > ar || bl > br )
{
/* Set the pos-arguments of the trees in <list1> and <list2>
** according to the entries of <a> and <b>. */
SetSubs( list1, a, tree);
SetSubs( list2, b, tree);
FindNewReps1(tree, reps);
return;
}
/* If a[ ar] is bigger or equal to the boundary of pos(tree(<tree>, x)
** the execution of the statements in the body of this if-statement
** would have the consequence that some subtrees of <tree> in <list1>
** would get a pos-argument bigger than the boundary of
** pos(tree<tree>, x). But since the trees in <list1> are almost
** equal to tree(<tree>, x) they have all the same boundary for their
** pos-argument as tree(<tree>, x). So these statements are only
** executed when <a>[ar] is less than the boundary of
** pos(tree(<tree>, x).
*/
if ( INT_INTOBJ( DT_MAX(tree, x) ) <= 0 ||
ELM_PLIST(a, ar) < DT_MAX(tree, x) )
{
for (i=al; i<=ar; i++)
SET_ELM_PLIST(a, i, INTOBJ_INT( CELM(a,i) + 1 ) );
FindSubs1(tree, x, list1, list2, a, b, al, ar, bl+1, br, reps);
for (i=al; i<=ar; i++)
SET_ELM_PLIST(a, i, INTOBJ_INT( CELM(a, i) - 1 ) );
}
FindSubs1(tree, x, list1, list2, a, b, al+1, ar, bl+1, br, reps);
/* If b[ br] is bigger or equal to the boundary of pos(tree(<tree>, x)
** the execution of the statements in the body of this if-statement
** would have the consequence that some subtrees of <tree> in <list2>
** would get a pos-argument bigger than the boundary of
** pos(tree<tree>, x). But since the trees in <list2> are almost
** equal to tree(<tree>, x) they have all the same boundary for their
** pos-argument as tree(<tree>, x). So these statements are only
** executed when <b>[br] is less than the boundary of
** pos(tree(<tree>, x).
*/
if ( INT_INTOBJ( DT_MAX(tree, x) ) <= 0 ||
ELM_PLIST(b, br) < DT_MAX(tree, x) )
{
for (i=bl; i<=br; i++)
SET_ELM_PLIST(b, i, INTOBJ_INT( CELM(b, i) + 1 ) );
FindSubs1(tree, x, list1, list2, a, b, al+1, ar, bl, br, reps);
for (i=bl; i<=br; i++)
SET_ELM_PLIST(b, i, INTOBJ_INT( CELM(b, i) - 1 ) );
}
}
void FindSubs2(
Obj tree,
Int x, /* subtree of <tree> */
Obj list1, /* list containing all subtrees of
** left(<tree>) almost equal to
** tree(<tree>, x) */
Obj list2, /* list containing all subtrees of
** right(<tree>) almost equal to
** tree(<tree>, x) */
Obj a, /* list to change, containing the
** pos-arguments of the trees in list1 */
Obj b, /* list to change, containing tthe
** pos-arguments of the trees in list2 */
Int al,
Int ar,
Int bl,
Int br,
Obj reps, /* list of representatives for all trees */
Obj pr /* pc-presentation */
)
{
Int i; /* loop variable */
/* if <al> > <ar> or <bl> > <br> nothing remains to change. */
if ( al > ar || bl > br )
{
/* Set the pos-arguments of the trees in <list1> and <list2>
** according to the entries of <a> and <b>. */
SetSubs( list1, a, tree);
SetSubs( list2, b, tree);
FindNewReps2(tree, reps, pr);
return;
}
/* If a[ ar] is bigger or equal to the boundary of pos(tree(<tree>, x)
** the execution of the statements in the body of this if-statement
** would have the consequence that some subtrees of <tree> in <list1>
** would get a pos-argument bigger than the boundary of
** pos(tree<tree>, x). But since the trees in <list1> are almost
** equal to tree(<tree>, x) they have all the same boundary for their
** pos-argument as tree(<tree>, x). So these statements are only
** executed when <a>[ar] is less than the boundary of
** pos(tree(<tree>, x).
*/
if ( INT_INTOBJ( DT_MAX(tree, x) ) <= 0 ||
ELM_PLIST(a, ar) < DT_MAX(tree, x) )
{
for (i=al; i<=ar; i++)
SET_ELM_PLIST(a, i, INTOBJ_INT( CELM(a,i) + 1 ) );
FindSubs2(tree, x, list1, list2, a, b, al, ar, bl+1, br, reps, pr);
for (i=al; i<=ar; i++)
SET_ELM_PLIST(a, i, INTOBJ_INT( CELM(a, i) - 1 ) );
}
FindSubs2(tree, x, list1, list2, a, b, al+1, ar, bl+1, br, reps, pr);
/* If b[ br] is bigger or equal to the boundary of pos(tree(<tree>, x)
** the execution of the statements in the body of this if-statement
** would have the consequence that some subtrees of <tree> in <list2>
** would get a pos-argument bigger than the boundary of
** pos(tree<tree>, x). But since the trees in <list2> are almost
** equal to tree(<tree>, x) they have all the same boundary for their
** pos-argument as tree(<tree>, x). So these statements are only
** executed when <b>[br] is less than the boundary of
** pos(tree(<tree>, x).
*/
if ( INT_INTOBJ( DT_MAX(tree, x) ) <= 0 ||
ELM_PLIST(b, br) < DT_MAX(tree, x) )
{
for (i=bl; i<=br; i++)
SET_ELM_PLIST(b, i, INTOBJ_INT( CELM(b, i) + 1 ) );
FindSubs2(tree, x, list1, list2, a, b, al+1, ar, bl, br, reps, pr);
for (i=bl; i<=br; i++)
SET_ELM_PLIST(b, i, INTOBJ_INT( CELM(b, i) - 1 ) );
}
}
void FindSubs(
Obj tree,
Int x, /* subtree of <tree> */
Obj list1, /* list containing all subtrees of
** left(<tree>) almost equal to
** tree(<tree>, x) */
Obj list2, /* list containing all subtrees of
** right(<tree>) almost equal to
** tree(<tree>, x) */
Obj a, /* list to change, containing the
** pos-arguments of the trees in list1 */
Obj b, /* list to change, containing tthe
** pos-arguments of the trees in list2 */
Int al,
Int ar,
Int bl,
Int br,
Obj reps, /* list of representatives for all trees */
Obj pr, /* pc-presentation */
Obj max /* needed to call 'FindNewReps' */
)
{
Int i; /* loop variable */
/* if <al> > <ar> or <bl> > <br> nothing remains to change. */
if ( al > ar || bl > br )
{
/* Set the pos-arguments of the trees in <list1> and <list2>
** according to the entries of <a> and <b>. */
SetSubs( list1, a, tree);
SetSubs( list2, b, tree);
FindNewReps(tree, reps, pr, max);
return;
}
/* If a[ ar] is bigger or equal to the boundary of pos(tree(<tree>, x)
** the execution of the statements in the body of this if-statement
** would have the consequence that some subtrees of <tree> in <list1>
** would get a pos-argument bigger than the boundary of
** pos(tree<tree>, x). But since the trees in <list1> are almost
** equal to tree(<tree>, x) they have all the same boundary for their
** pos-argument as tree(<tree>, x). So these statements are only
** executed when <a>[ar] is less than the boundary of
** pos(tree(<tree>, x).
*/
if ( INT_INTOBJ( DT_MAX(tree, x) ) <= 0 ||
ELM_PLIST(a, ar) < DT_MAX(tree, x) )
{
for (i=al; i<=ar; i++)
SET_ELM_PLIST(a, i, INTOBJ_INT( CELM(a,i) + 1 ) );
FindSubs(tree, x, list1, list2, a, b, al, ar, bl+1, br, reps, pr, max);
for (i=al; i<=ar; i++)
SET_ELM_PLIST(a, i, INTOBJ_INT( CELM(a, i) - 1 ) );
}
FindSubs(tree, x, list1, list2, a, b, al+1, ar, bl+1, br, reps, pr, max);
/* If b[ br] is bigger or equal to the boundary of pos(tree(<tree>, x)
** the execution of the statements in the body of this if-statement
** would have the consequence that some subtrees of <tree> in <list2>
** would get a pos-argument bigger than the boundary of
** pos(tree<tree>, x). But since the trees in <list2> are almost
** equal to tree(<tree>, x) they have all the same boundary for their
** pos-argument as tree(<tree>, x). So these statements are only
** executed when <b>[br] is less than the boundary of
** pos(tree(<tree>, x).
*/
if ( INT_INTOBJ( DT_MAX(tree, x) ) <= 0 ||
ELM_PLIST(b, br) < DT_MAX(tree, x) )
{
for (i=bl; i<=br; i++)
SET_ELM_PLIST(b, i, INTOBJ_INT( CELM(b, i) + 1 ) );
FindSubs(tree, x, list1, list2, a, b, al+1, ar, bl, br, reps, pr, max);
for (i=bl; i<=br; i++)
SET_ELM_PLIST(b, i, INTOBJ_INT( CELM(b, i) - 1 ) );
}
}
/****************************************************************************
**
*F SetSubs(<list>, <a>, <tree>) . . . . . . . . . . .. . set pos-arguments
**
** 'SetSubs' sets the pos-arguments of the subtrees of <tree>, contained
** in <list> according to the entries in the list <a>.
*/
void SetSubs(
Obj list,
Obj a,
Obj tree )
{
UInt i,j; /* loop variables */
UInt len, len2;
len = LEN_PLIST(list);
for (i=1; i <= len; i++)
{
len2 = LEN_PLIST( ELM_PLIST(list, i) );
for (j=1; j <= len2; j++)
SET_DT_POS(tree, CELM( ELM_PLIST(list, i), j), ELM_PLIST(a, i) );
}
}
/****************************************************************************
**
*F UnmarkAEClass(<tree>, <list>) . . . . . . . . . . . . reset pos-arguments
**
** 'UnmarkAEClass' resets the pos arguments of the subtrees of <tree>,
** contained in <list> to the original state. Furthermore it unmarks the
** top node of each of those trees.
*/
void UnmarkAEClass(
Obj tree,
Obj list )
{
UInt i,j, len, len2;
len = LEN_PLIST(list);
for (i=1; i <= len; i++)
{
len2 = LEN_PLIST( ELM_PLIST(list, i) );
for (j=1; j <= len2; j++)
{
DT_UNMARK(tree, CELM( ELM_PLIST(list, i), j) );
SET_DT_POS(tree, CELM( ELM_PLIST(list, i), j), INTOBJ_INT(i) );
}
}
}
/****************************************************************************
**
*F Funcposition( <self>, <vector> )
**
** Funcposition implements the internal function
**
** DT_evaluation( <vector> ).
**
** DT_evaluation returns a positive integer which is used to sort the deep
** monomials. DT_evaluation is called from the library function dt_add.
*/
Obj Funcposition(Obj self,
Obj vector)
{
UInt res,i;
res = CELM(vector, 6)*CELM(vector, 6);
for (i=7; i < LEN_PLIST(vector); i+=2)
res += CELM(vector, i)*CELM(vector, i+1)*CELM(vector, i+1);
return INTOBJ_INT(res);
}
/****************************************************************************
**
*F * * * * * * * * * * * * * initialize package * * * * * * * * * * * * * * *
*/
/****************************************************************************
**
*V GVarFuncs . . . . . . . . . . . . . . . . . . list of functions to export
*/
static StructGVarFunc GVarFuncs [] = {
{ "MakeFormulaVector", 2, "tree, presentation",
FuncMakeFormulaVector, "src/dt.c:MakeFormulaVector" },
{ "FindNewReps", 4, "tree, representatives, presentation, maximum",
FuncFindNewReps, "src/dt.c:FindNewReps" },
{ "UnmarkTree", 1, "tree",
FuncUnmarkTree, "src/dt.c:UnmarkTree" },
{ "GetPols", 3, "list, presentation, polynomial",
FuncGetPols, "src/dt.c:GetPols" },
{ "DT_evaluation", 1, "vector",
Funcposition, "src/dt.c:DT_evaluation" },
{ 0 }
};
/****************************************************************************
**
*F InitKernel( <module> ) . . . . . . . . initialise kernel data structures
*/
static Int InitKernel (
StructInitInfo * module )
{
InitFopyGVar( "dt_add" , &Dt_add );
/* init filters and functions */
InitHdlrFuncsFromTable( GVarFuncs );
/* return success */
return 0;
}
/****************************************************************************
**
*F InitLibrary( <module> ) . . . . . . . initialise library data structures
*/
static Int InitLibrary (
StructInitInfo * module )
{
/* init filters and functions */
InitGVarFuncsFromTable( GVarFuncs );
/* return success */
return 0;
}
/****************************************************************************
**
*F InitInfoDeepThought() . . . . . . . . . . . . . . table of init functions
*/
static StructInitInfo module = {
MODULE_BUILTIN, /* type */
"dt", /* name */
0, /* revision entry of c file */
0, /* revision entry of h file */
0, /* version */
0, /* crc */
InitKernel, /* initKernel */
InitLibrary, /* initLibrary */
0, /* checkInit */
0, /* preSave */
0, /* postSave */
0 /* postRestore */
};
StructInitInfo * InitInfoDeepThought ( void )
{
module.revision_c = Revision_dt_c;
module.revision_h = Revision_dt_h;
FillInVersion( &module );
return &module;
}
/****************************************************************************
**
*E dt.c . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ends here
**
*/
|