File: isSquareFree-doc.m2

package info (click to toggle)
macaulay2 1.21%2Bds-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 133,096 kB
  • sloc: cpp: 110,377; ansic: 16,306; javascript: 4,193; makefile: 3,821; sh: 3,580; lisp: 764; yacc: 590; xml: 177; python: 140; perl: 114; lex: 65; awk: 3
file content (42 lines) | stat: -rw-r--r-- 1,368 bytes parent folder | download | duplicates (2)
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
--- status: Draft
--- author(s): Gregory G. Smith
--- notes: 

document { 
     Key => {isSquareFree, (isSquareFree,MonomialIdeal)},
     Headline => "whether something is square free monomial ideal",
     Usage => "isSquareFree I",
     Inputs => {
	  "I" => MonomialIdeal
	  },
     Outputs => {
	  Boolean => {TO "true", " if ", TT "I", " is a square free ", 
	       TO2("MonomialIdeal", "monomial ideal"), 
	       " and ", TO "false", " otherwise"}	  
	  },
     "A square free ", TO2("MonomialIdeal", "monomial ideal"), " is an ideal generated 
     by products of variables; in other words, a radical
     monomial ideal.",
     EXAMPLE {
	  "QQ[x,y,z];",
	  "J = monomialIdeal(x^3*y^5*z, y^5*z^4, y^3*z^5, 
	       x*y*z^5, x^2*z^5, x^4*z^3, x^4*y^2*z^2, 
	       x^4*y^4*z)",
	  "isSquareFree J",
	  "radical J",
	  "isSquareFree radical J"
	  },    
     "Square free monomial ideals correspond both to 
     simplicial complexes and to unions of coordinate 
     subspaces.",     
     EXAMPLE {
	  "needsPackage \"SimplicialComplexes\"",
	  "R = QQ[a..d]",
	  "D = simplicialComplex {a*b*c,a*b*d,a*c*d,b*c*d}",
	  "I = monomialIdeal D",
	  "isSquareFree I"
	  },
     PARA{},
     "Implemented by Greg Smith.",	       
     SeeAlso => {"MinimalPrimes::radical", "PrimaryDecomposition::associatedPrimes", "SimplicialComplexes::SimplicialComplexes"}
     }