{"repository":{"description":"This Macaulay2 code is an implementation of the algorithm described in the paper (w/ C. Hillar ) “Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals.” ","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":120,"owner":"abrahammcs","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-10-09T12:21:12-07:00","pushed_at":"2013-10-09T12:28:13-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/abrahammcs/Finiteness-of-Laurent-lattice-ideals/compare/34ddcc2f99...ce3d45d644"}