Classical Turnpike Theory and the Economics of Forestry

Classical turnpike theory, as originally conceived by Samuelson, pertains to optimal growth theory over a large but infinite time horizon with given initial and terminal stocks. In this paper, we present two turnpike results in the context of the economics of forestry with given initial and terminal forest configurations. Our results depart from the general theory in that they pertain to a transitional production set which does not satisfy the assumptions of inaction and free disposal, and rely on a recently-discovered non-interiority assumption on concave (not necessarily differentiable) benefit functions that implies, and is implied by, the asymptotic convergence of good programs.

Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination

This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting mathematical structure. In particular we try to indicate some dynamical and combinatorial aspects of cut elimination, as well as its connections to complexity theory. We discuss two concrete examples where one can see the structure of short proofs with cuts, one concerning feasible numbers and the other concerning "bounded mean oscillation" from real analysis

A constructive interpretation of Ramsey's theorem via the product of selection functions

a

A machine learning approach to constructing Ramsey graphs leads to the Trahtenbrot-Zykov problem.

Attempts at approaching the well-known and difficult problem of constructing Ramsey graphs via machine learning lead to another difficult problem posed by Zykov in 1963 (now commonly referred to as the Trahtenbrot-Zykov problem): For which graphs F does there exist some graph G such that the neighborhood of every vertex in G induces a subgraph isomorphic to F? Chapter 1 provides a brief introduction to graph theory. Chapter 2 introduces Ramsey theory for graphs. Chapter 3 details a reinforcement learning implementation for Ramsey graph construction. The implementation is based on board game software, specifically the AlphaZero program and its success learning to play games from scratch. The chapter ends with a description of how computing challenges naturally shifted the project towards the Trahtenbrot-Zykov problem. Chapter 3 also includes recommendations for continuing the project and attempting to overcome these challenges. Chapter 4 defines the Trahtenbrot-Zykov problem and outlines its history, including proofs of results omitted from their original papers. This chapter also contains a program for constructing graphs with all neighborhood-induced subgraphs isomorphic to a given graph F. The end of Chapter 4 presents constructions from the program when F is a Ramsey graph. Constructing such graphs is a non-trivial task, as Bulitko proved in 1973 that the Trahtenbrot-Zykov problem is undecidable. Chapter 5 is a translation from Russian to English of this famous result, a proof not previously available in English. Chapter 6 introduces Cayley graphs and their relationship to the Trahtenbrot-Zykov problem. The chapter ends with constructions of Cayley graphs Γ in which the neighborhood of every vertex of Γ induces a subgraph isomorphic to a given Ramsey graph, which leads to a conjecture regarding the unique extremal Ramsey(4, 4) graph

Analysis of methods for extraction of programs from non-constructive proofs

The present thesis compares two computational interpretations of non-constructive proofs: refined A-translation and Gödel's functional "Dialectica" interpretation. The behaviour of the extraction methods is evaluated in the light of several case studies, where the resulting programs are analysed and compared. It is argued that the two interpretations correspond to specific backtracking implementations and that programs obtained via the refined A-translation tend to be simpler, faster and more readable than programs obtained via Gödel's interpretation. Three layers of optimisation are suggested in order to produce faster and more readable programs. First, it is shown that syntactic repetition of subterms can be reduced by using let-constructions instead of meta substitutions abd thus obtaining a near linear size bound of extracted terms. The second improvement allows declaring syntactically computational parts of the proof as irrelevant and that this can be used to remove redundant parameters, possibly improving the efficiency of the program. Finally, a special case of induction is identified, for which a more efficient recursive extracted term can be defined. It is shown the outcome of case distinctions can be memoised, which can result in exponential improvement of the average time complexity of the extracted program

Towards an epistemic theory of probability.

The main concern of this thesis is to develop an epistemic conception of probability. In chapter one we look at Ramsey's work. In addition to his claim that the axioms of probability ace laws of consistency for partial beliefs, we focus attention on his view that the reasonableness of our probability statements does not consist merely in such coherence, but is to be assessed through the vindication of the habits which give rise to them. In chapter two we examine de Finetti's account, and compare it with Ramsey's. One significant point of divergence is de Finetti's claim that coherence is the only valid form of appraisal for probability statements. His arguments for this position depend heavily on the implementation of a Bayesian model for belief change; we argue that such an approach fails to give a satisfactory account of the relation between probabilities and objective facts. In chapter three we stake out the ground for oar own positive proposals - for an account which is non-objective in so far as it does not require the postulation of probabilistic facts, but non-subjective in the sense that probability statements are open to objective forms of appraisal. we suggest that a certain class of probability statements are best interpreted as recommendations of partial belief; these being measurable by the betting quotients that one judges to be fair. Moreover, we argue that these probability statements are open to three main forms of appraisal (each quantifiable through the use of proper scoring rules), namely: (i) Coherence (ii) Calibration (iii) Refinement. The latter two forms of appraisal are applicable both in an ex ante sense (relative to the information known by the forecaster) and an ex post one (relative to the results of the events forecast). In chapters four and five we consider certain problems which confront theories of partial belief; in particular, (1) difficulties surrounding the justification of the rule to maximise one's information, and (2) problems with the ascription of probabilities to mathematical propositions. Both of these issues seem resolvable; the first through the principle of maximising expected utility (SEU), and the second either by amending the axioms of probability, or by making use of the notion that probabilities are appraisable via scoring rules. There do remain, however, various difficulties with SEU, in particular with respect to its application in real-life situations. These are discussed, but no final conclusion reached, except that an epistemic theory such as ours is not undermined by the inapplicability of SEU in certain situations

Connected matchings in special families of graphs.

A connected matching in a graph is a set of disjoint edges such that, for any pair of these edges, there is another edge of the graph incident to both of them. This dissertation investigates two problems related to finding large connected matchings in graphs. The first problem is motivated by a famous and still open conjecture made by Hadwiger stating that every k-chromatic graph contains a minor of the complete graph Kk . If true, Hadwiger\u27s conjecture would imply that every graph G has a minor of the complete graph K n/a(C), where a(G) denotes the independence number of G. For a graph G with a(G) = 2, Thomassé first noted the connection between connected matchings and large complete graph minors: there exists an ? \u3e 0 such that every graph G with a( G) = 2 contains K ?+, as a minor if and only if there exists a positive constant c such that every graph G with a( G) = 2 contains a connected matching of size cn. In Chapter 3 we prove several structural properties of a vertexminimal counterexample to these statements, extending work by Blasiak. We also prove the existence of large connected matchings in graphs with clique size close to the Ramsey bound by proving: for any positive constants band c with c \u3c ¼, there exists a positive integer N such that, if G is a graph with n =: N vertices, 0\u27( G) = 2, and clique size at most bv(n log(n) )then G contains a connected matching of size cn. The second problem concerns computational complexity of finding the size of a maximum connected matching in a graph. This problem has many applications including, when the underlying graph is chordal bipartite, applications to the bipartite margin shop problem. For general graphs, this problem is NP-complete. Cameron has shown the problem is polynomial-time solvable for chordal graphs. Inspired by this and applications to the margin shop problem, in Chapter 4 we focus on the class of chordal bipartite graphs and one of its subclasses, the convex bipartite graphs. We show that a polynomial-time algorithm to find the size of a maximum connected matching in a chordal bipartite graph reduces to finding a polynomial-time algorithm to recognize chordal bipartite graphs that have a perfect connected matching. We also prove that, in chordal bipartite graphs, a connected matching of size k is equivalent to several other statements about the graph and its biadjacency matrix, including for example, the statement that the complement of the latter contains a k x k submatrix that is permutation equivalent to strictly upper triangular matrix