Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability
Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory,...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholar Commons
2014
|
| Subjects: | |
| Online Access: | https://scholarcommons.usf.edu/etd/5193 https://scholarcommons.usf.edu/cgi/viewcontent.cgi?article=6389&context=etd |