| dc.contributor.author | Thielman, Daniel Wilson | |
| dc.date.accessioned | 2012-04-25T13:05:35Z | |
| dc.date.available | 2012-04-25T13:05:35Z | |
| dc.date.issued | 2012-04-25 | |
| dc.identifier.uri | http://hdl.handle.net/10161/5213 | |
| dc.description | Senior thesis | en_US |
| dc.description.abstract | This work pertains to chemical reaction networks and their equilibria, called steady-states. Our main result states that for a cyclic chemical reaction net- work, there is a straightforward characterization for when a complex balancing steady state exists. We then extend our results to chemical reaction networks consisting of a closed path traversing each directed edge exactly once. | en_US |
| dc.language.iso | en | en_US |
| dc.subject | Chemical Reaction Network Theory | en_US |
| dc.subject | Graph | en_US |
| dc.subject | PRUV | en_US |
| dc.subject | Chemistry | en_US |
| dc.subject | Algebra | en_US |
| dc.subject | Cycle | en_US |
| dc.title | Complex-Balanced Steady States of Chemical Reaction Networks that Contain an Eulerian Cycle | en_US |
| dc.department | Mathematics | en_US |