Scales, networks and uncertainty : an examination of environmental policy-making in Ontario

Through a case-study analysis of Ontario's ethanol policy, this thesis addresses a number of themes that are consequential to policy and policy-making: spatiality, democracy and uncertainty. First, I address the 'spatial debate' in Geography pertaining to the relevance and affordances of a 'scalar' versus a 'flat' ontoepistemology. I argue that policy is guided by prior arrangements, but is by no means inevitable or predetermined. As such, scale and network are pragmatic geographical concepts that can effectively address the issue of the spatiality of policy and policy-making. Second, I discuss the democratic nature of policy-making in Ontario through an examination of the spaces of engagement that facilitate deliberative democracy. I analyze to what extent these spaces fit into Ontario's environmental policy-making process, and to what extent they were used by various stakeholders. Last, I take seriously the fact that uncertainty and unavoidable injustice are central to policy, and examine the ways in which this uncertainty shaped the specifics of Ontario's ethanol policy. Ultimately, this thesis is an exercise in understanding sub-national environmental policy-making in Canada, with an emphasis on how policy-makers tackle the issues they are faced with in the context of environmental change, political-economic integration, local priorities, individual goals, and irreducible uncertainty.

Prime Rational Functions and Integral Polynomials

Let f(x) be a complex rational function. In this work, we study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we derive some conditions for the case of complex polynomials. We consider also the divisibility of integral polynomials, and we present a generalization of a theorem of Nieto. We show that if f(x) and g(x) are integral polynomials such that the content of g divides the content of f and g(n) divides f(n) for an integer n whose absolute value is larger than a certain bound, then g(x) divides f(x) in Z[x]. In addition, given an integral polynomial f(x), we provide a method to determine if f is irreducible over Z, and if not, find one of its divisors in Z[x].