Types, rings, and games

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

[img]PDF
828Kb

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:Thesis (PhD)
Supervisors:Backhouse, R.C.
Nilsson, H.
Faculties/Schools:UK Campuses > Faculty of Science > School of Computer Science
ID Code:2532
Deposited By:Mr Wei Chen
Deposited On:28 Sep 2012 10:49
Last Modified:28 Sep 2012 10:49

Archive Staff Only: item control page