Types, rings, and games

Chen, Wei (2012) Types, rings, and games. PhD thesis, University of Nottingham.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (848kB) | Preview


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: Thesis (University of Nottingham only) (PhD)
Supervisors: Backhouse, R.C.
Nilsson, H.
Subjects: Q Science > QA Mathematics > QA150 Algebra
Faculties/Schools: UK Campuses > Faculty of Science > School of Computer Science
Item ID: 12532
Depositing User: EP, Services
Date Deposited: 28 Sep 2012 09:49
Last Modified: 20 Dec 2017 17:25
URI: https://eprints.nottingham.ac.uk/id/eprint/12532

Actions (Archive Staff Only)

Edit View Edit View