Types, rings, and games
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...
| Main Author: | |
|---|---|
| Format: | Thesis (University of Nottingham only) |
| Language: | English |
| Published: |
2012
|
| Online Access: | https://eprints.nottingham.ac.uk/12532/ |
| _version_ | 1848791520108347392 |
|---|---|
| author | Chen, Wei |
| author_facet | Chen, Wei |
| author_sort | Chen, Wei |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T18:29:49Z |
| format | Thesis (University of Nottingham only) |
| id | nottingham-12532 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T18:29:49Z |
| publishDate | 2012 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-125322025-02-28T11:19:49Z https://eprints.nottingham.ac.uk/12532/ Types, rings, and games Chen, Wei 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. 2012-07-19 Thesis (University of Nottingham only) NonPeerReviewed application/pdf en arr https://eprints.nottingham.ac.uk/12532/1/thesis.pdf Chen, Wei (2012) Types, rings, and games. PhD thesis, University of Nottingham. |
| spellingShingle | Chen, Wei Types, rings, and games |
| title | Types, rings, and games |
| title_full | Types, rings, and games |
| title_fullStr | Types, rings, and games |
| title_full_unstemmed | Types, rings, and games |
| title_short | Types, rings, and games |
| title_sort | types, rings, and games |
| url | https://eprints.nottingham.ac.uk/12532/ |