Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

'In Charge of the Truffula Seeds' : On Children's Literature, Rationality and Children's Voices in Philosophy

In this paper I investigate how philosophy can speak for children and how children can have a voice in philosophy and speak for philosophy. I argue that we should understand children as responsible rational individuals who are involved in their own philosophical inquiries and who can be involved in our own philosophical investigations-not because of their rational abilities, but because we acknowledge them as conversational partners, acknowledge their reasons as reasons, and speak for them as well as let them speak for us and our rational community. In order to argue this I turn, first, to Gareth Matthews' philosophy of childhood and suggest a reconstruction of some of his concepts in line with the philosophy of Stanley Cavell. Second, in order to examine more closely our conceptions of rationality and our pictures of children, I consider the children's books, The Lorax and Where is My Sister? and Henrik Ibsen's play, The Wild Duck.

Aprendizagem, racionalidade limitada e comportamento econômico

O objetivo desta pesquisa é discutir a idéia de aprendizagem em Economia. A idéia básica a ser considerada é que a hipótese das expectativas Racionais não é consistente com tal idéia e que a fim de incluí-la em nossa disciplina será necessário substituí-la por uma espécie do raciocínio indutivo. Será considerado também como tal raciocínio e pode ser aplicado com alguns modelos técnico e de política econômico.

Endogenous collateral: arbitrage and equilibrium without bounded short sales

We study the implications of the absence of arbitrage in an two period economy where default is allowed and assets are secured by collateral choosen by the borrowers. We show that non arbitrage sale prices of assets are submartingales, whereas non arbitrage purchase prices of the derivatives (secured by the pool of collaterals) are supermartingales. We use these non arbitrage conditions to establish existence of equilibrium, without imposing bounds on short sales. The nonconvexity of the budget set is overcome by considering a continuum of agents. Our results are particularly relevant for the collateralized mortgage obligations(CMO) markets.

A bounded upwinding scheme for computing convection-dominated transport problems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Evaluation of a bounded high order upwind scheme for 3D incompressible free surface flow computations

fit the context of normalized variable formulation (NVF) of Leonard and total variation diminishing (TVD) constraints of Harten. this paper presents an extension of it previous work by the authors for solving unsteady incompressible flow problems. The main contributions of the paper are threefold. First, it presents the results of the development and implementation of a bounded high order upwind adaptative QUICKEST scheme in the 3D robust code (Freeflow), for the numerical solution of the full incompressible Navier-Stokes equations. Second, it reports numerical simulation results for 1D hock tube problem, 2D impinging jet and 2D/3D broken clam flows. Furthermore, these results are compared with existing analytical and experimental data. and third, it presents the application of the numerical method for solving 3D free surface flow problems. (C) 2007 IMACS. Published by Elsevier B.V. All rights reserved,