Skip to content

Python code computing the number of (liftable) transfer systems for [1] x [n]

Notifications You must be signed in to change notification settings

bifibrant/recursion

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

recursion

Python code computing the number of (liftable) transfer systems for [1] x [n]

About

Python code computing the number of (liftable) transfer systems for [1] x [n]

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages