GENERICITY OF NONDEGENERATE GEODESICS WITH GENERAL BOUNDARY CONDITIONS

Let M be a possibly noncompact manifold. We prove, generically in the C(k)-topology (2 <= k <= infinity), that semi-Riemannian metrics of a given index on M do not possess any degenerate geodesics satisfying suitable boundary conditions. This extends a result of L. Biliotti, M. A. Javaloyes and P. Piccione [6] for geodesics with fixed endpoints to the case where endpoints lie on a compact submanifold P subset of M x M that satisfies an admissibility condition. Such condition holds, for example, when P is transversal to the diagonal Delta subset of M x M. Further aspects of these boundary conditions are discussed and general conditions under which metrics without degenerate geodesics are C(k)-generic are given.

Financial time series analysis : Chaos and neurodynamics approach

This work aims at combining the Chaos theory postulates and Artificial Neural Networks classification and predictive capability, in the field of financial time series prediction. Chaos theory, provides valuable qualitative and quantitative tools to decide on the predictability of a chaotic system. Quantitative measurements based on Chaos theory, are used, to decide a-priori whether a time series, or a portion of a time series is predictable, while Chaos theory based qualitative tools are used to provide further observations and analysis on the predictability, in cases where measurements provide negative answers. Phase space reconstruction is achieved by time delay embedding resulting in multiple embedded vectors. The cognitive approach suggested, is inspired by the capability of some chartists to predict the direction of an index by looking at the price time series. Thus, in this work, the calculation of the embedding dimension and the separation, in Takens‘ embedding theorem for phase space reconstruction, is not limited to False Nearest Neighbor, Differential Entropy or other specific method, rather, this work is interested in all embedding dimensions and separations that are regarded as different ways of looking at a time series by different chartists, based on their expectations. Prior to the prediction, the embedded vectors of the phase space are classified with Fuzzy-ART, then, for each class a back propagation Neural Network is trained to predict the last element of each vector, whereas all previous elements of a vector are used as features.

Fred: An approach to generating real, correct, reusable programs from proofs

In this paper we describe our system for automatically extracting "correct" programs from proofs using a development of the Curry-Howard process. Although program extraction has been developed by many authors, our system has a number of novel features designed to make it very easy to use and as close as possible to ordinary mathematical terminology and practice. These features include 1. the use of Henkin's technique to reduce higher-order logic to many-sorted (first-order) logic; 2. the free use of new rules for induction subject to certain conditions; 3. the extensive use of previously programmed (total, recursive) functions; 4. the use of templates to make the reasoning much closer to normal mathematical proofs and 5. a conceptual distinction between the computational type theory (for representing programs)and the logical type theory (for reasoning about programs). As an example of our system we give a constructive proof of the well known theorem that every graph of even parity, which is non-trivial in the sense that it does not consist of isolated vertices, has a cycle. Given such a graph as input, the extracted program produces a cycle as promised.

Protocols between programs and proofs

In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and the programs extracted from it. This protocol leads to the expansion of the theory and the production of more powerful programs. The methodology we use for automatically extracting “correct” programs from proofs is a development of the well-known Curry-Howard process. Program extraction has been developed by many authors, but our presentation is ultimately aimed at a practical, usable system and has a number of novel features. These include 1. a very simple and natural mimicking of ordinary mathematical practice and likewise the use of established computer programs when we obtain programs from formal proofs, and 2. a conceptual distinction between programs on the one hand, and proofs of theorems that yield programs on the other. An implementation of our methodology is the Fred system. As an example of our protocol we describe a constructive proof of the well-known theorem that every graph of even parity can be decomposed into a list of disjoint cycles. Given such a graph as input, the extracted program produces a list of the (non-trivial) disjoint cycles as promised.

Quantified Interference: Information Theory and Information Flow

The paper investigates which of Shannon’s measures (entropy, conditional entropy, mutual information) is the right one for the task of quantifying information flow in a programming language. We examine earlier relevant contributions from Denning, McLean and Gray and we propose and motivate a specific quantitative definition of information flow. We prove results relating equivalence relations, interference of program variables, independence of random variables and the flow of confidential information. Finally, we show how, in our setting, Shannon’s Perfect Secrecy theorem provides a sufficient condition to determine whether a program leaks confidential information.

Análise de treliças planas viscoelásticas com deformações finitas e pórticos planos viscoelásticos com vigas mistas

Este trabalho compõe-se de duas partes. A primeira parte propõe-se a apresentar um estudo e um programa computacional para a análise não linear geométrica de treliças planas com propriedades: viscoelásticas. Na segunda parte, tem-se o estudo e um programa sobre pórticos planos com propriedades viscoelásticas, usando o modelo reológico standard e o dado pelo CEB. Leva-se em consideração o efeito de temperatura e retração nesta análise. Estende-se o trabalho sobre pórtico para o estudo sobre vigas mistas, levando em consideração a mudança da linha neutra. A formulação está baseada no método dos elementos finitos para grandes deformações, particularizada para treliça e pórtico. É feita a descrição de ambos os programas e rodados diversos exemplos.

Local concavifiability of preferences and determinacy of equilibrium

In this paper we consider strictly convex monotone continuous complete preorderings on R+n that are locally representable by a concave utility function. By Alexandroff 's (1939) theorem, this function is twice dífferentiable almost everywhere. We show that if the bordered hessian determinant of a concave utility representation vanishes on a null set. Then demand is countably rectifiable, that is, except for a null set of bundles, it is a countable union of c1 manifolds. This property of consumer demand is enough to guarantee that the equilibrium prices of apure exchange economy will be locally unique, for almost every endowment. We give an example of an economy satisfying these conditions but not the Katzner (1968) - Debreu (1970, 1972) smoothness conditions.

Solving the non-convexity problem in some shopping-time and human-capital models

Several works in the shopping-time and in the human-capital literature, due to the nonconcavity of the underlying Hamiltonian, use Örst-order conditions in dynamic optimization to characterize necessity, but not su¢ ciency, in intertemporal problems. In this work I choose one paper in each one of these two areas and show that optimality can be characterized by means of a simple aplication of Arrowís (1968) su¢ ciency theorem.

On a uniform turnpike of the third kind in the Robinson-Solow-Srinivasan model

On using McKenzie’s taxonomy of optimal accumulation in the longrun, we report a “uniform turnpike” theorem of the third kind in a model original to Robinson, Solow and Srinivasan (RSS), and further studied by Stiglitz. Our results are presented in the undiscounted, discrete-time setting emphasized in the recent work of Khan-Mitra, and they rely on the importance of strictly concave felicity functions, or alternatively, on the value of a “marginal rate of transformation”, ξσ, from one period to the next not being unity. Our results, despite their specificity, contribute to the methodology of intertemporal optimization theory, as developed in economics by Ramsey, von Neumann and their followers.

Oligopolistic competition under knightian uncertainty

This artic/e applies a theorem of Nash equilibrium under uncertainty (Dow & Werlang, 1994) to the classic Coumot model of oligopolistic competition. It shows, in particular, how one can map all Coumot equilibrium (which includes the monopoly and the null solutions) with only a function of uncertainty aversion coefficients of producers. The effect of variations in these parameters over the equilibrium quantities are studied, also assuming exogenous increases in the number of matching firms in the game. The Cournot solutions under uncertainty are compared with the monopolistic one. It shows principally that there is an uncertainty aversion level in the industry such that every aversion coefficient beyond it induces firms to produce an aggregate output smaller than the monopoly output. At the end of the artic/e equilibrium solutions are specialized for Linear Demand and for Coumot duopoly. Equilibrium analysis in the symmetric case allows to identify the uncertainty aversion coefficient for the whole industry as a proportional lack of information cost which would be conveyed by market price in the perfect competition case (Lerner Index).

Two additions to Lucas's "inflation and welfare"

This work adds to Lucas (2000) by providing analytical solutions to two problems that are solved only numerically by the author. The first part uses a theorem in control theory (Arrow' s sufficiency theorem) to provide sufficiency conditions to characterize the optimum in a shopping-time problem where the value function need not be concave. In the original paper the optimality of the first-order condition is characterized only by means of a numerical analysis. The second part of the paper provides a closed-form solution to the general-equilibrium expression of the welfare costs of inflation when the money demand is double logarithmic. This closed-form solution allows for the precise calculation of the difference between the general-equilibrium and Bailey's partial-equilibrium estimates of the welfare losses due to inflation. Again, in Lucas's original paper, the solution to the general-equilibrium-case underlying nonlinear differential equation is done only numerically, and the posterior assertion that the general-equilibrium welfare figures cannot be distinguished from those derived using Bailey's formula rely only on numerical simulations as well.

Pure strategy equilibria of multidimensional and non-monotonic auctions

We give necessary and sufficient conditions for the existence of symmetric equilibrium without ties in interdependent values auctions, with multidimensional independent types and no monotonic assumptions. In this case, non-monotonic equilibria might happen. When the necessary and sufficient conditions are not satisfied, there are ties with positive probability. In such case, we are still able to prove the existence of pure strategy equilibrium with an all-pay auction tie-breaking rule. As a direct implication of these results, we obtain a generalization of the Revenue Equivalence Theorem. From the robustness of equilibrium existence for all-pay auctions in multidimensional setting, an interpretation of our results can give a new justification to the use of tournaments in practice.

Environmental protection and economic growth

This paper explores the link between environmental policy and economic growth by employing an extension of the AK Growth Model. We include a state equation for renewable natural resources. We assume that the change in environmental regulations induces costs and that economic agents also derive some utility from capital stock accumulation vis-`a-vis the environment. Using the Hopf bifurcation theorem, we show that cyclical environmental policy strategies are optimal, providing theoretical support for the Environmental Kuznets Curve.

Escolha social e valores irredutíveis: uma aproximação da economia política e a ideologia

No presente paper, nós provamos que qualquer função da escolha social satisfaz o princípio da independência das alternativas irrelevantes (IIA) de Arrow se o comportamento individual é menu-dependente. Portanto, o 'Teorema da Possibilidade Geral' de Arrow não é válido quando as preferências individuais são determinadas por valores irredutíveis. Nesse contexto, qualquer instrumento de agregação que satisfaça os princípios não-ditatoriais e paretianos de unanimidade (maioria simples, por exemplo) também faz IIA. Esse poderia ser um resultado importante para a teoria da escolha social, enquanto um comportamento individual determinado por valores irredutíveis (interesse próprio, ideologia, Ética e normas sociais, por exemplo) podendo validar democracia representativa. A importância relativa de tais valores e da possibilidade de reversão da preferência determina a dinâmica da escolha social, de acordo com os princípios democráticos.