Changeset dfa15b in git
- Timestamp:
- Feb 11, 2019, 1:47:34 PM (5 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 5bccbab76d678f9334a22ed665fd3dab33eb614ba9cc0df15d51a9d109f5ce94030146c1f9168173
- Parents:
- c012cdb589e1d8374fa0ae69e9dc817138933b2b
- Location:
- Singular/LIB
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/fpadim.lib
rc012cdb rdfa15b 15 15 16 16 KEYWORDS: finitely presented algebra; Letterplace Groebner basis; K-basis; K-dimension; Hilbert series 17 18 PROCEDURES:19 lpKDimCheck(G); checks whether the K-dimension of A/<G> is finite20 lpKDim(G[,d,n]); computes the K-dimension of A/<G>21 lpMonomialBasis(d, donly, J); computes a list of monomials not contained in J22 lpHilbert(G[,d,n]); computes the truncated Hilbert series of A/<G>23 lpSickleDim(G[,d,n]); computes the mistletoes and the K-dimension of A/<G>24 17 25 18 NOTE: … … 73 66 [Stu] G. Studzinski: Dimension computations in non-commutative, 74 67 associative algebras, Diploma thesis, RWTH Aachen, 2010. 68 69 PROCEDURES: 70 lpKDimCheck(G); checks whether the K-dimension of A/<G> is finite 71 lpKDim(G[,d,n]); computes the K-dimension of A/<G> 72 lpMonomialBasis(d, donly, J); computes a list of monomials not contained in J 73 lpHilbert(G[,d,n]); computes the truncated Hilbert series of A/<G> 74 lpSickleDim(G[,d,n]); computes the mistletoes and the K-dimension of A/<G> 75 75 76 76 SEE ALSO: freegb_lib, fpaprops_lib, ncHilb_lib -
Singular/LIB/fpalgebras.lib
rc012cdb rdfa15b 78 78 RETURN: ideal 79 79 ASSUME: basering has a letterplace ring structure and 80 @*A is a generalized Cartan matrix with integer entries80 A is a generalized Cartan matrix with integer entries 81 81 PURPOSE: compute the ideal of Serre's relations associated to A 82 82 EXAMPLE: example serreRelations; shows examples … … 145 145 RETURN: ring (and ideal) 146 146 PURPOSE: compute the inhomogeneous Serre's relations associated to A in given 147 @*variable names147 variable names 148 148 ASSUME: three ideals in the input are of the same sizes and contain merely 149 @*variables which are interpreted as follows: N resp. P stand for negative150 @*resp. positive roots, C stand for Cartan elements. d is the degree bound for151 @*letterplace ring, which will be returned.152 @*The matrix A is a generalized Cartan matrix with integer entries153 @*The result is the ideal called 'fsRel' in the returned ring.149 variables which are interpreted as follows: N resp. P stand for negative 150 resp. positive roots, C stand for Cartan elements. d is the degree bound for 151 letterplace ring, which will be returned. 152 The matrix A is a generalized Cartan matrix with integer entries 153 The result is the ideal called 'fsRel' in the returned ring. 154 154 EXAMPLE: example fullSerreRelations; shows examples 155 155 " … … 363 363 RETURN: ring (and exports ideal) 364 364 PURPOSE: compute the ideal of Adem relations for i<2j in characteristic 0 365 @*the ideal is exported under the name AdemRel in the output ring365 the ideal is exported under the name AdemRel in the output ring 366 366 EXAMPLE: example ademRelations; shows examples 367 367 " -
Singular/LIB/fpaprops.lib
rc012cdb rdfa15b 55 55 "USAGE: lpNoetherian(G); G an ideal in a Letterplace ring 56 56 RETURN: int 57 @*0 not Noetherian58 @*1 left Noetherian59 @*2 right Noetherian60 @*3 Noetherian61 @*4 weak Noetherian57 0 not Noetherian 58 1 left Noetherian 59 2 right Noetherian 60 3 Noetherian 61 4 weak Noetherian 62 62 PURPOSE: Check whether the monomial algebra A/<LM(G)> is (left/right) noetherian 63 63 ASSUME: - basering is a Letterplace ring 64 @*- G is a Groebner basis64 - G is a Groebner basis 65 65 THEORY: lpNoetherian works with the monomial algebra A/<LM(G)>. 66 66 If it gives an affirmative answer for one of the properties, then it … … 644 644 start. The parameter visited, cyclic and path should be 0. 645 645 RETURN: int 646 @*:Maximal number of distinct cycles646 Maximal number of distinct cycles 647 647 PURPOSE: Calculate the maximal number of distinct cycles in a single path starting at v 648 648 ASSUME: Basering is a Letterplace ring … … 730 730 proc lpUfGraph(ideal G, list #) 731 731 "USAGE: lpUfGraph(G); G a set of monomials in a letterplace ring. 732 @* lpUfGraph(G,1); G a set of monomials in a letterplace ring.733 732 RETURN: intmat or list 734 733 NOTE: lpUfGraph(G); returns intmat. lpUfGraph(G,1); returns list L with L[1] an intmat and L[2] an ideal. … … 882 881 RETURN: int 883 882 PURPOSE: Determines the Gelfand Kirillov dimension of A/<G> 884 @*-1 means positive infinite883 -1 means positive infinite 885 884 ASSUME: - basering is a Letterplace ring 886 @*- G is a Groebner basis885 - G is a Groebner basis 887 886 " 888 887 { -
Singular/LIB/freegb.lib
rc012cdb rdfa15b 26 26 lpDegBound(R); returns the degree bound of a letterplace ring 27 27 lpVarBlockSize(R); returns the size of the letterplace blocks 28 29 letplaceGBasis(I); (deprecated, use twostd) two-sided Groebner basis of a letterplace ideal I 30 28 letplaceGBasis(I); (deprecated) two-sided Groebner basis of a letterplace ideal I 31 29 lpDivision(f,I); two-sided division with remainder 32 30 lpGBPres2Poly(L,I); reconstructs a polynomial from the output of lpDivision 33 34 31 lieBracket(a,b[, N]); Lie bracket ab-ba of two letterplace polynomials 35 32 isOrderingShiftInvariant(i); tests shift-invariance of the monomial ordering 36 33 isVar(p); check whether p is a power of a single variable 37 38 makeLetterplaceRing(d); (deprecated, use freeAlgebra) creates a Letterplace ring out of given data 34 makeLetterplaceRing(d); (deprecated) creates a Letterplace ring out of given data 39 35 setLetterplaceAttributes(R,d,b); (for testing purposes) supplies ring R with the letterplace structure 40 36 … … 91 87 RETURN: ring with special attributes set 92 88 PURPOSE: sets attributes for a letterplace ring: 93 @*'isLetterplaceRing' = true, 'uptodeg' = d, 'lV' = b, where94 @*'uptodeg' stands for the degree bound,95 @*'lV' for the number of variables in the block 0.89 'isLetterplaceRing' = true, 'uptodeg' = d, 'lV' = b, where 90 'uptodeg' stands for the degree bound, 91 'lV' for the number of variables in the block 0. 96 92 NOTE: Activate the resulting ring by using @code{setring} 97 93 " … … 331 327 RETURN: int 332 328 PURPOSE: check, whether leading monomial of p is a power of a single variable 333 @*from the basering. Returns the exponent or 0 if p is multivariate.329 from the basering. Returns the exponent or 0 if p is multivariate. 334 330 EXAMPLE: example isVar; shows examples 335 331 " … … 374 370 "USAGE: letplaceGBasis(I); I an ideal/module 375 371 RETURN: ideal/module 376 ASSUME: basering is a Letterplace ring, input consists of Letterplace 377 @* polynomials 378 PURPOSE: compute the two-sided Groebner basis of I via Letterplace 379 @* algorithm (legacy routine) 372 ASSUME: basering is a Letterplace ring, input consists of Letterplace polynomials 373 PURPOSE: compute the two-sided Groebner basis of I via Letterplace algorithm (legacy routine) 380 374 NOTE: the degree bound for this computation is read off the letterplace 381 @*structure of basering375 structure of basering 382 376 EXAMPLE: example letplaceGBasis; shows examples 383 377 " … … 418 412 PURPOSE:compute the Lie bracket [a,b] = ab - ba between letterplace polynomials 419 413 NOTE: if N>1 is specified, then the left normed bracket [a,[...[a,b]]]] is 420 @*computed.414 computed. 421 415 EXAMPLE: example lieBracket; shows examples 422 416 " … … 515 509 RETURN: ring 516 510 ASSUME: L has a special form. Namely, it is a list of modules, where 517 518 511 - each generator of every module stands for a monomial times coefficient in 519 @* free algebra, 520 512 free algebra, 521 513 - in such a vector generator, the 1st entry is a nonzero coefficient from the 522 @* ground field 523 514 ground field 524 515 - and each next entry hosts a variable from the basering. 525 516 PURPOSE: compute the two-sided Groebner basis of an ideal, encoded by L 526 @*in the free associative algebra, up to degree d517 in the free associative algebra, up to degree d 527 518 NOTE: Apply @code{lst2str} to the output in order to obtain a better readable 528 @*presentation519 presentation 529 520 EXAMPLE: example freeGBasis; shows examples 530 521 " … … 3160 3151 RETURN: int 3161 3152 NOTE: Tests whether the ordering of the current ring is shift invariant, which is the case, when LM(p) > LM(p') for all p and p' where p' is p shifted by any number of places. 3162 @* If withHoles != 0 even Letterplace polynomials with holes (eg. x(1)*y(4)) are considered. 3153 3154 If withHoles != 0 even Letterplace polynomials with holes (eg. x(1)*y(4)) are considered. 3163 3155 ASSUME: - basering is a Letterplace ring. 3164 3156 " -
Singular/LIB/nctools.lib
rc012cdb rdfa15b 1764 1764 RETURN: ring 1765 1765 PURPOSE: create a copy of a given ring equipped with the 1766 @*elimination ordering for module components @code{(c,<)}1766 elimination ordering for module components @code{(c,<)} 1767 1767 NOTE: usually the list argument contains a ring to work with 1768 1768 EXAMPLE: example makeModElimRing; shows an example
Note: See TracChangeset
for help on using the changeset viewer.