Secondary nontwist phenomena in area-preserving maps

Phenomena as reconnection scenarios, periodic-orbit collisions, and primary shearless tori have been recognized as features of nontwist maps. Recently, these phenomena and secondary shearless tori were analytically predicted for generic maps in the neighborhood of the tripling bifurcation of an elliptic fixed point. In this paper, we apply a numerical procedure to find internal rotation number profiles that highlight the creation of periodic orbits within islands of stability by a saddle-center bifurcation that emerges out a secondary shearless torus. In addition to the analytical predictions, our numerical procedure applied to the twist and nontwist standard maps reveals that the atypical secondary shearless torus occurs not only near a tripling bifurcation of the fixed point but also near a quadrupling bifurcation. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4750040]

Nontwist symplectic maps in tokamaks

We review symplectic nontwist maps that we have introduced to describe Lagrangian transport properties in magnetically confined plasmas in tokamaks. These nontwist maps are suitable to describe the formation and destruction of transport barriers in the shearless region (i.e., near the curve where the twist condition does not hold). The maps can be used to investigate two kinds of problems in plasmas with non-monotonic field profiles: the first is the chaotic magnetic field line transport in plasmas with external resonant perturbations. The second problem is the chaotic particle drift motion caused by electrostatic drift waves. The presented analytical maps, derived from plasma models with equilibrium field profiles and control parameters that are commonly measured in plasma discharges, can be used to investigate long-term transport properties. (C) 2011 Elsevier B.V. All rights reserved.

TRANSITIVITY AND ROTATION SETS WITH NONEMPTY INTERIOR FOR HOMEOMORPHISMS OF THE 2-TORUS

We show that if f is a homeomorphism of the 2-torus isotopic to the identity and its lift (f) over tilde is transitive, or even if it is transitive outside the lift of the elliptic islands, then (0,0) is in the interior of the rotation set of (f) over tilde. This proves a particular case of Boyland's conjecture.

Periodic solutions of abstract neutral functional differential equations

We characterize the existence of periodic solutions of some abstract neutral functional differential equations with finite and infinite delay when the underlying space is a UMD space. (C) 2011 Elsevier Inc. All rights reserved.

SUPERLINEAR ELLIPTIC PROBLEMS WITH SIGN CHANGING COEFFICIENTS

Via variational methods, we study multiplicity of solutions for the problem {-Delta u = lambda b(x)vertical bar u vertical bar(q-2)u + au + g(x, u) in Omega, u - 0 on partial derivative Omega, where a simple example for g( x, u) is |u|(p-2)u; here a, lambda are real parameters, 1 < q < 2 < p <= 2* and b(x) is a function in a suitable space L-sigma. We obtain a class of sign changing coefficients b(x) for which two non-negative solutions exist for any lambda > 0, and a total of five nontrivial solutions are obtained when lambda is small and a >= lambda(1). Note that this type of results are valid even in the critical case.

On the zeros of polynomials: an extension of the Enestrom-Kakeya theorem

This paper presents an extension of the Enestrom-Kakeya theorem concerning the roots of a polynomial that arises from the analysis of the stability of Brown (K, L) methods. The generalization relates to relaxing one of the inequalities on the coefficients of the polynomial. Two results concerning the zeros of polynomials will be proved, one of them providing a partial answer to a conjecture by Meneguette (1994)[6]. (C) 2011 Elsevier Inc. All rights reserved.

Kleiner's theorem for unitary representations of posets

A subspace representation of a poset S = {s(1), ..., S-t} is given by a system (V; V-1, ..., V-t) consisting of a vector space V and its sub-spaces V-i such that V-i subset of V-j if s(i) (sic) S-j. For each real-valued vector chi = (chi(1), ..., chi(t)) with positive components, we define a unitary chi-representation of S as a system (U: U-1, ..., U-t) that consists of a unitary space U and its subspaces U-i such that U-i subset of U-j if S-i (sic) S-j and satisfies chi 1 P-1 + ... + chi P-t(t) = 1, in which P-i is the orthogonal projection onto U-i. We prove that S has a finite number of unitarily nonequivalent indecomposable chi-representations for each weight chi if and only if S has a finite number of nonequivalent indecomposable subspace representations; that is, if and only if S contains any of Kleiner's critical posets. (c) 2012 Elsevier Inc. All rights reserved.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

Remarks on the classification of a pair of commuting semilinear operators

Gelfand and Ponomarev [I.M. Gelfand, V.A. Ponomarev, Remarks on the classification of a pair of commuting linear transformations in a finite dimensional vector space, Funct. Anal. Appl. 3 (1969) 325-326] proved that the problem of classifying pairs of commuting linear operators contains the problem of classifying k-tuples of linear operators for any k. We prove an analogous statement for semilinear operators. (C) 2011 Elsevier Inc. All rights reserved.

Brazilian exchange rate complexity: Financial crisis effects

With the financial market globalization, foreign investments became vital for the economies, mainly in emerging countries. In the last decades, Brazilian exchange rates appeared as a good indicator to measure either investors' confidence or risk aversion. Here, some events of global or national financial crisis are analyzed, trying to understand how they influenced the "dollar-real" rate evolution. The theoretical tool to be used is the Lopez-Mancini-Calbet (LMC) complexity measure that, applied to real exchange rate data, has shown good fitness between critical events and measured patterns. (C) 2011 Elsevier B.V. All rights reserved.

Decay of energy and suppression of Fermi acceleration in a dissipative driven stadium-like billiard

The behavior of the average energy for an ensemble of non-interacting particles is studied using scaling arguments in a dissipative time-dependent stadium-like billiard. The dynamics of the system is described by a four dimensional nonlinear mapping. The dissipation is introduced via inelastic collisions between the particles and the moving boundary. For different combinations of initial velocities and damping coefficients, the long time dynamics of the particles leads them to reach different states of final energy and to visit different attractors, which change as the dissipation is varied. The decay of the average energy of the particles, which is observed for a large range of restitution coefficients and different initial velocities, is described using scaling arguments. Since this system exhibits unlimited energy growth in the absence of dissipation, our results for the dissipative case give support to the principle that Fermi acceleration seems not to be a robust phenomenon. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.3699465]

A scheme for synchronizing clocks connected by a packet communication network

Consider a communication system in which a transmitter equipment sends fixed-size packets of data at a uniform rate to a receiver equipment. Consider also that these equipments are connected by a packet-switched network, which introduces a random delay to each packet. Here we propose an adaptive clock recovery scheme able of synchronizing the frequencies and the phases of these devices, within specified limits of precision. This scheme for achieving frequency and phase synchronization is based on measurements of the packet arrival times at the receiver, which are used to control the dynamics of a digital phase-locked loop. The scheme performance is evaluated via numerical simulations performed by using realistic parameter values. (C) 2011 Elsevier By. All rights reserved.

Hero's journey in bifurcation diagram

The hero's journey is a narrative structure identified by several authors in comparative studies on folklore and mythology. This storytelling template presents the stages of inner metamorphosis undergone by the protagonist after being called to an adventure. In a simplified version, this journey is divided into three acts separated by two crucial moments. Here we propose a discrete-time dynamical system for representing the protagonist's evolution. The suffering along the journey is taken as the control parameter of this system. The bifurcation diagram exhibits stationary, periodic and chaotic behaviors. In this diagram, there are transition from fixed point to chaos and transition from limit cycle to fixed point. We found that the values of the control parameter corresponding to these two transitions are in quantitative agreement with the two critical moments of the three-act hero's journey identified in 10 movies appearing in the list of the 200 worldwide highest-grossing films. (C) 2011 Elsevier B.V. All rights reserved.

Period adding cascades: Experiment and modeling in air bubbling

Period adding cascades have been observed experimentally/numerically in the dynamics of neurons and pancreatic cells, lasers, electric circuits, chemical reactions, oceanic internal waves, and also in air bubbling. We show that the period adding cascades appearing in bubbling from a nozzle submerged in a viscous liquid can be reproduced by a simple model, based on some hydrodynamical principles, dealing with the time evolution of two variables, bubble position and pressure of the air chamber, through a system of differential equations with a rule of detachment based on force balance. The model further reduces to an iterating one-dimensional map giving the pressures at the detachments, where time between bubbles come out as an observable of the dynamics. The model has not only good agreement with experimental data, but is also able to predict the influence of the main parameters involved, like the length of the hose connecting the air supplier with the needle, the needle radius and the needle length. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.3695345]

Double point curves for corank 2 map germs from C-2 to C-3

We characterize finite determinacy of map germs f : (C-2, 0) -> (C-3, 0) in terms of the Milnor number mu(D(f)) of the double point curve D(f) in (C-2, 0) and we provide an explicit description of the double point scheme in terms of elementary symmetric functions. Also we prove that the Whitney equisingularity of 1-parameter families of map germs f(t) : (C-2, 0) -> (C-3, 0) is equivalent to the constancy of both mu(D(f(t))) and mu(f(t)(C-2)boolean AND H) with respect to t, where H subset of C-3 is a generic plane. (C) 2011 Elsevier B.V. All rights reserved.