Types, rings, and games
Publication Date
July 19, 2012
Creator
Abstract
Algebraic equations on complex numbers and functional equations on generating functions are often used to solve combinatorial problems. But the introduction of common arithmetic operators such as subtraction and division always causes panic in the world of objects which are generated from constants by applying products and coproducts. Over the years, researchers have been endeavouring to interpretate some absurd calculations on objects which lead to meaningful combinatorial results.
This thesis investigates connections between algebraic equations on complex numbers and isomorphisms of recursively defined objects. We are attempting to work out conditions under which isomorphisms between recursively defined objects can be decided by equalities between polynomials on multi-variables with integers as coefficients.
Item Type
ethesis
Thesis Type
PhD
Supervisors
Subjects (LC)
Associated Schools / Departments
School of Computer Science (UK)
eprints ID
12532
UoN Repository URI
Except where otherwise noted, this item's license is described as
File(s)![Thumbnail Image]()
Name
thesis.pdf
Type
Full-text
Size
828.81 KB
Format
Adobe PDF
Checksum ()