Diffusive Synchronization of Hyperchaotic Lorenz Systems

The synchronizing properties of two diffusively coupled hyperchaotic Lorenz 4D systems are investigated by calculating the transverse Lyapunov exponents and by observing the phase space trajectories near the synchronization hyperplane. The effect of parameter mismatch is also observed. A simple electrical circuit described by the Lorenz 4D equations is proposed. Some results from laboratory experiments with two coupled circuits are presented. Copyright (C) 2009 Ruy Barboza.

Controlling chaos in a Lorenz-like system using feedback

We demonstrate that the dynamics of an autonomous chaotic laser can be controlled to a periodic or steady state under self-synchronization. In general, past the chaos threshold the dependence of the laser output on feedback applied to the pump is submerged in the Lorenz-like chaotic pulsation. However there exist specific feedback delays that stabilize the chaos to periodic behavior or even steady state. The range of control depends critically on the feedback delay time and amplitude. Our experimental results are compared with the complex Lorenz equations which show good agreement.

Controlling the complex Lorenz equations by modulation

We demonstrate that a system obeying the complex Lorenz equations in the deep chaotic regime can be controlled to periodic behavior by applying a modulation to the pump parameter. For arbitrary modulation frequency and amplitude there is no obvious simplification of the dynamics. However, we find that there are numerous windows where the chaotic system has been controlled to different periodic behaviors. The widths of these windows in parameter space are narrow, and the positions are related to the ratio of the modulation frequency of the pump to the average pulsation frequency of the output variable. These results are in good agreement with observations previously made in a far-infrared laser system.

Genus and Braid Index Associated to Sequences of Renormalizable Lorenz Maps

We describe the Lorenz links generated by renormalizable Lorenz maps with reducible kneading invariant (K(f)(-), = K(f)(+)) = (X, Y) * (S, W) in terms of the links corresponding to each factor. This gives one new kind of operation that permits us to generate new knots and links from the ones corresponding to the factors of the *-product. Using this result we obtain explicit formulas for the genus and the braid index of this renormalizable Lorenz knots and links. Then we obtain explicit formulas for sequences of these invariants, associated to sequences of renormalizable Lorenz maps with kneading invariant (X, Y) * (S,W)*(n), concluding that both grow exponentially. This is specially relevant, since it is known that topological entropy is constant on the archipelagoes of renormalization.

Partial classification of Lorenz knots: Syllable permutations of torus knots words

We define families of aperiodic words associated to Lorenz knots that arise naturally as syllable permutations of symbolic words corresponding to torus knots. An algorithm to construct symbolic words of satellite Lorenz knots is defined. We prove, subject to the validity of a previous conjecture, that Lorenz knots coded by some of these families of words are hyperbolic, by showing that they are neither satellites nor torus knots and making use of Thurston's theorem. Infinite families of hyperbolic Lorenz knots are generated in this way, to our knowledge, for the first time. The techniques used can be generalized to study other families of Lorenz knots.

Nonautonomous Graphs and Topological Entropy of Nonautonomous Lorenz Systems

In this work, we associate a p-periodic nonautonomous graph to each p-periodic nonautonomous Lorenz system with finite critical orbits. We develop Perron-Frobenius theory for nonautonomous graphs and use it to calculate their entropy. Finally, we prove that the topological entropy of a p-periodic nonautonomous Lorenz system is equal to the entropy of its associated nonautonomous graph.

Renormalization and α-limit set for expanding Lorenz maps

We establish a one-to-one correspondence between the renormalizations and proper totally invariant closed sets (i.e., α-limit sets) of expanding Lorenz map, which enable us to distinguish periodic and non-periodic renormalizations. We describe the minimal renormalization by constructing the minimal totally invariant closed set, so that we can define the renormalization operator. Using consecutive renormalizations, we obtain complete topological characteriza- tion of α-limit sets and nonwandering set decomposition. For piecewise linear Lorenz map with slopes ≥ 1, we show that each renormalization is periodic and every proper α-limit set is countable.

Conjugacy of piecewise linear Lorenz map that expand on average

For piecewise linear Lorenz map that expand on average, we show that it admits a dichotomy: it is either periodic renormalizable or prime. As a result, such a map is conjugate to a ß-transformation.

Lorenz' Spezialkarte vom Schwarzwald. 2, Lorenz' Karte vom nördlichen und mittleren Schwarzwald. Blatt II : Renchen-Schiltach / Lith. Anst. v. F. Wirtz, ...

Échelle(s) : 1:75 000

The equity core and the Lorenz-maximal allocations in the equal division core

In this paper, we characterize the non-emptiness of the equity core (Selten, 1978) and provide a method, easy to implement, for computing the Lorenz-maximal allocations in the equal division core (Dutta-Ray, 1991). Both results are based on a geometrical decomposition of the equity core as a finite union of polyhedrons. Keywords: Cooperative game, equity core, equal division core, Lorenz domination. JEL classification: C71

The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.

The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.