THE POINCARE-BENDIXSON THEOREM ON THE KLEIN BOTTLE FOR CONTINUOUS VECTOR FIELDS

We present a version of the Poincare-Bendixson Theorem on the Klein bottle K(2) for continuous vector fields. As a consequence, we obtain the fact that K(2) does not admit continuous vector fields having a omega-recurrent injective trajectory.

Limit sets and the Poincare-Bendixson Theorem in impulsive semidynamical systems

We consider semidynamical systems with impulse effects at variable times and we discuss some properties of the limit sets of orbits of these systems such as invariancy, compactness and connectedness. As a consequence we obtain a version of the Poincare-Bendixson Theorem for impulsive semidynamical systems. (C) 2008 Elsevier Inc. All rights reserved.

Uniform estimates in the Poincare-Aronszajn theorem on the separation of singularities of analytic functions

We study the possibility of splitting any bounded analytic function $f$ with singularities in a closed set $E\cup F$ as a sum of two bounded analytic functions with singularities in $E$ and $F$ respectively. We obtain some results under geometric restrictions on the sets $E$ and $F$ and we provide some examples showing the sharpness of the positive results.

Introdução à teoria de Poincaré-Bendixson para campos de vetores planares

O Teorema de Poincaré-Bendixson é um resultado muito importante no estudo de Sistemas Dinâmicos, pois ele estabelece para quais tipos de conjunto limite as trajetórias de um campo de vetores em IR2 deve convergir. Neste trabalho vamos abordar a Funç˜ao do primeiro Retorno de Poincaré, além de discutir a estabilidade de Ciclos Limites e provar o Teorema de Poincaré-Bendixson.

Estudo de conjuntos minimais para sistemas descontínuos em dimensões 2 e 3

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

Conjuntos minimais e caóticos em campos de vetores planares suaves por partes

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

On the Geometry of Rectifiable Sets with Carleson and Poincare-type inequlaities

Thesis (Ph.D.)--University of Washington, 2016-06

Computational mechanics of molecular systems:quantifying high-dimensional dynamics by distribution of Poincaré recurrence times

A framework that connects computational mechanics and molecular dynamics has been developed and described. As the key parts of the framework, the problem of symbolising molecular trajectory and the associated interrelation between microscopic phase space variables and macroscopic observables of the molecular system are considered. Following Shalizi and Moore, it is shown that causal states, the constituent parts of the main construct of computational mechanics, the e-machine, define areas of the phase space that are optimal in the sense of transferring information from the micro-variables to the macro-observables. We have demonstrated that, based on the decay of their Poincare´ return times, these areas can be divided into two classes that characterise the separation of the phase space into resonant and chaotic areas. The first class is characterised by predominantly short time returns, typical to quasi-periodic or periodic trajectories. This class includes a countable number of areas corresponding to resonances. The second class includes trajectories with chaotic behaviour characterised by the exponential decay of return times in accordance with the Poincare´ theorem.

Dynamical estimates of chaotic systems from Poincare recurrences

We show a function that fits well the probability density of return times between two consecutive visits of a chaotic trajectory to finite size regions in phase space. It deviates from the exponential statistics by a small power-law term, a term that represents the deterministic manifestation of the dynamics. We also show how one can quickly and easily estimate the Kolmogorov-Sinai entropy and the short-term correlation function by realizing observations of high probable returns. Our analyses are performed numerically in the Henon map and experimentally in a Chua's circuit. Finally, we discuss how our approach can be used to treat the data coming from experimental complex systems and for technological applications. (C) 2009 American Institute of Physics. [doi: 10.1063/1.3263943]

A Goldstone theorem in thermal relativistic quantum field theory

We prove a Goldstone theorem in thermal relativistic quantum field theory, which relates spontaneous symmetry breaking to the rate of spacelike decay of the two-point function. The critical rate of fall-off coincides with that of the massless free scalar field theory. Related results and open problems are briefly discussed. (C) 2011 American Institute of Physics. [doi:10.1063/1.3526961]

Twisted Poincare invariant quantum field theories

It is by now well known that the Poincare group acts on the Moyal plane with a twisted coproduct. Poincare invariant classical field theories can be formulated for this twisted coproduct. In this paper we systematically study such a twisted Poincare action in quantum theories on the Moyal plane. We develop quantum field theories invariant under the twisted action from the representations of the Poincare group, ensuring also the invariance of the S-matrix under the twisted action of the group. A significant new contribution here is the construction of the Poincare generators using quantum fields.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

A NEW PROOF OF OKAJI'S THEOREM FOR A CLASS OF SUM OF SQUARES OPERATORS

Let P be a linear partial differential operator with analytic coefficients. We assume that P is of the form ""sum of squares"", satisfying Hormander's bracket condition. Let q be a characteristic point; for P. We assume that q lies on a symplectic Poisson stratum of codimension two. General results of Okaji Show that P is analytic hypoelliptic at q. Hence Okaji has established the validity of Treves' conjecture in the codimension two case. Our goal here is to give a simple, self-contained proof of this fact.

On the Jager-Kaul theorem concerning harmonic maps

In 1983, Jager and Kaul proved that the equator map u*(x) = (x/\x\,0) : B-n --> S-n is unstable for 3 less than or equal to n less than or equal to 6 and a minimizer for the energy functional E(u, B-n) = integral B-n \del u\(2) dx in the class H-1,H-2(B-n, S-n) with u = u* on partial derivative B-n when n greater than or equal to 7. In this paper, we give a new and elementary proof of this Jager-Kaul result. We also generalize the Jager-Kaul result to the case of p-harmonic maps.

Exponential Rates of Convergence in the Ergodic Theorem: A Constructive Approach

We prove that, once an algorithm of perfect simulation for a stationary and ergodic random field F taking values in S(Zd), S a bounded subset of R(n), is provided, the speed of convergence in the mean ergodic theorem occurs exponentially fast for F. Applications from (non-equilibrium) statistical mechanics and interacting particle systems are presented.