NONTRIVIAL SOLUTIONS OF HARDY-HENON TYPE ELLIPTIC SYSTEMS

In this article,the authors investigate the existence problem for Hardy Hénon type strongly indefinite elliptic systems.Existence results are obtained for such systems with superlinear suberitical nonlinearities.     

Dynamics of a continuous Hénon model

We study a continuous Hénon system obtained by considering the discrete original model in continuous time. While the dynamics of the continuous model is trivial, we are able to recover the complexity of the discrete model by the introduction of time delays. In particular, high period limit cycles and chaotic attractors are observed. We illustrate the results with some numerical simulations.     

On the Hénon equation: asymptotic profile of ground states, I

This paper is concerned with the qualitative property of the ground state solutions for the Hénon equation. By studying a limiting equation on the upper half space , we investigate the asymptotic energy and the asymptotic profile of the ground states for the Hénon equation. The limiting problem is related to a weighted Sobolev type inequality which we establish in this paper.     

Asymptotic behavior of Solutions for Hénon systems with nearly critical exponent

We consider in this paper the problem

(0.1)

where Ω is the unit ball in centered at the origin, 0α<pN, β>0, N8, p>1, q_ε>1. Suppose q_ε→q>1 as ε→0⁺ and q_ε,q satisfy respectively

we investigate the asymptotic behavior of the ground state solutions (u_ε,v_ε) of (0.1) as ε→0⁺. We show that the ground state solutions concentrate at a point, which is located at the boundary. In addition, the ground state solution is non-radial provided that ε>0 is small.     

Adaptive synchronization of T–S fuzzy chaotic systems with unknown parameters

This paper presents a fuzzy model-based adaptive approach for synchronization of chaotic systems which consist of the drive and response systems. Takagi–Sugeno (T–S) fuzzy model is employed to represent the chaotic drive and response systems. Since the parameters of the drive system are assumed unknown, we design the response system that estimates the parameters of the drive system by adaptive strategy. The adaptive law is derived to estimate the unknown parameters and its stability is guaranteed by Lyapunov stability theory. In addition, the controller in the response system contains two parts: one part that can stabilize the synchronization error dynamics and the other part that estimates the unknown parameters. Numerical examples, including Duffing oscillator and Lorenz attractor, are given to demonstrate the validity of the proposed adaptive synchronization approach.     

A novel method of S-box design based on chaotic map and composition method

An efficient algorithm for obtaining random bijective S-boxes based on chaotic maps and composition method is presented. The proposed method is based on compositions of S-boxes from a fixed starting set. The sequence of the indices of starting S-boxes used is obtained by using chaotic maps. The results of performance test show that the S-box presented in this paper has good cryptographic properties. The advantages of the proposed method are the low complexity and the possibility to achieve large key space.     

On the symmetry analysis and conservation laws of the (1 + 1)‐dimensional Hénon–Lane–Emden system

We carry out a complete Lie symmetry analysis and Noether symmetry classification of the (1 + 1)‐dimensional H non–Lane–Emden system. It is shown that the principal Lie algebra, which is one dimensional, extends in several cases. It is also shown that four main cases transpire in the Noether classification with respect to the Lagrangian. In addition, conservation laws for the H non–Lane–Emden system are constructed. Furthermore, we briefly discuss the importance and the physical interpretation of these conserved vectors. Copyright © 2016 John Wiley & Sons, Ltd.     

Model reference adaptive synchronization of T–S fuzzy discrete chaotic systems using output tracking control

This paper presents a model reference adaptive control approach for the synchronization of a discrete-time chaotic systems using output tracking control. The reference model system is chosen using the output of master system and Takagi–Sugeno (T–S) fuzzy model is employed to represent the discrete-time chaotic slave system. Design the control input so that the controlled slave system achieves asymptotic synchronization with the reference system given that two systems start from different initial conditions, different parameters and/or different type of model. Using a gradient algorithm, the ideal controller gains which can stabilize the error equation are estimated. Simulation examples of two cases are given to demonstrate the validity of our proposed adaptive method.     

A hybrid method combining continuous tabu search and Nelder–Mead simplex algorithms for the global optimization of multiminima functions

Tabu search (TS) is a metaheuristic, which proved efficient to solve various combinatorial optimization problems. However, few works deal with its application to the global minimization of functions depending on continuous variables. To perform this task, we propose an hybrid method combining tabu search and simplex search (SS). TS allows to cover widely the solution space, to stimulate the search towards solutions far from the current solution, and to avoid the risk of trapping into a local minimum. SS is used to accelerate the convergence towards a minimum. The Nelder–Mead simplex algorithm is a classical very powerful local descent algorithm, making no use of the objective function derivatives. A “simplex” is a geometrical figure consisting, in n-dimensions, of (n+1) points. If any point of a simplex is taken as the origin, the n other points define vector directions that span the n-dimension vector space. Through a sequence of elementary geometric transformations (reflection, contraction and extension), the initial simplex moves, expands or contracts. To select the appropriate transformation, the method only uses the values of the function to be optimized at the vertices of the simplex considered. After each transformation, the current worst vertex is replaced by a better one. Our algorithm called continuous tabu simplex search (CTSS) implemented in two different forms (CTSS_single, CTSS_multiple) is made up of two steps: first, an adaptation of TS to continuous optimization problems, allowing to localize a “promising area”; then, intensification within this promising area, involving SS. The efficiency of CTSS is extensively tested by using analytical test functions of which global and local minima are known. A comparison is proposed with several variants of tabu search, genetic algorithms and simulated annealing. CTSS is applied to the design of a eddy current sensor aimed at non-destructive control.     

On a conjecture of Graham and Häggkvist with the polynomial method

A conjecture of Graham and Häggkvist states that every tree with m edges decomposes every 2m-regular graph and every bipartite m-regular graph. Let T be a tree with a prime number p of edges. We show that if the growth ratio of T at some vertex v₀ satisfies ρ(T,v₀)≥^1/2, where is the golden ratio, then T decomposes K_2p,2p. We also prove that if T has at least p/3 leaves then it decomposes K_2p,2p. This improves previous results by Häggkvist and by Lladó and López. The results follow from an application of Alon’s Combinatorial Nullstellensatz to obtain bigraceful labelings.     

Efficacy of variational iteration method for chaotic Genesio system – Classical and multistage approach

This is a case study of solving the Genesio system by using the classical variational iteration method (VIM) and a newly modified version called the multistage VIM (MVIM). VIM is an analytical technique that grants us a continuous representation of the approximate solution, which allows better information of the solution over the time interval. Unlike its counterpart, numerical techniques, such as the Runge–Kutta method, provide solutions only at two ends of the time interval (with condition that the selected time interval is adequately small for convergence). Furthermore, it offers approximate solutions in a discretized form, making it complicated in achieving a continuous representation. The explicit solutions through VIM and MVIM are compared with the numerical analysis of the fourth-order Runge–Kutta method (RK4). VIM had been successfully applied to linear and nonlinear systems of non-chaotic in nature and this had been testified by numerous scientists lately. Our intention is to determine whether VIM is also a feasible method in solving a chaotic system like Genesio. At the same time, MVIM will be applied to gauge its accuracy compared to VIM and RK4. Since, for most situations, the validity domain of the solutions is often an issue, we will consider a reasonably large time frame in our work.     

Geometric and arithmetic properties of the Hénon map

Research partially supported by NSF DMS-9121727     

Symbolic language in early modern mathematics: The Algebra of Pierre Hérigone (1580–1643)

The creation of a formal mathematical language was fundamental to making mathematics algebraic. A landmark in this process was the publication of In artem analyticem isagoge by François Viète (1540–1603) in 1591. This work was diffused through many other algebra texts, as in the section entitled Algebra in the Cursus mathematicus (Paris, 1634, 1637, 1642; second edition 1644) by Pierre Hérigone (1580–1643). The aim of this paper is to analyze several features of Hérigone's Algebra. Hérigone was one of the first mathematicians to consider that symbolic language might be used as a universal language for dealing with pure and mixed mathematics. We show that, although Hérigone generally used Viète's statements, his notation, presentation style, and procedures in his algebraic proofs were quite different from Viète's. In addition, we emphasize how Hérigone handled algebraic operations and geometrical procedures by making use of propositions from Euclid's Elements formulated in symbolic language.     

A new construction of the unstable manifold for the measure-preserving Hénon map

Let denote the measure-preserving Hénon map with the parameter . The map has a hyperbolic fixed point . The main result of this paper is that the unstable mainfold of is the iterated limit of a very simple set. Informally,

where is the line and denotes the unstable manifold of .

     

Sections of the regular simplex – Volume formulas and estimates

We state a general formula to compute the volume of the intersection of the regular n‐simplex with some k‐dimensional subspace. It is known that for central hyperplanes the one through the centroid containing vertices gives the maximal volume. We show that, for fixed small distances of a hyperplane to the centroid, the hyperplane containing vertices is still volume maximizing. The proof also yields a new and short argument for the result on central sections. With the same technique we give a partial result for the minimal central hyperplane section. Finally, we obtain a bound for k‐dimensional sections.     

The Hirota’s bilinear method and the tanh–coth method for multiple-soliton solutions of the Sawada–Kotera–Kadomtsev–Petviashvili equation

In this work we derive a new completely integrable dispersive equation. The equation is obtained by combining the Sawada–Kotera (SK) equation with the sense of the Kadomtsev–Petviashvili (KP) equation. The newly derived Sawada–Kotera–Kadomtsev–Petviashvili (SK–KP) equation is studied by using the tanh–coth method, to obtain single-soliton solution, and by the Hirota bilinear method, to determine the N-soliton solutions. The study highlights the significant features of the employed methods and its capability of handling completely integrable equations.     

Generalizing the modeling of fuzzy logic controllers by parameterized aggregation operators

We describe the type of reasoning used in the typical fuzzy logic controller, the Mamdani reasoning method. We point out the basic assumptions in this model. We discuss the S-OWA operators which provide families of parameterized “andlike” and “orlike” operators. We generalize the Mamdani model by introducing these operators. We introduce a method, which we call Direct Fuzzy Reasoning (DFR), which results from one choice of the parameters. We develop some learning algorithms for the new method. We show how the Takagi-Sugeno-Kang (TSK) method of reasoning is an example of this DFR method.     

Approximate solutions and chaotic motions of a piecewise nonlinear–linear oscillator

A global symmetric period-1 approximate solution is analytically constructed for the non-resonant periodic response of a periodically excited piecewise nonlinear–linear oscillator. The approximate solutions are found to be in good agreement with the exact solutions that are obtained from the numerical integration of the original equations. In addition, the dynamic behaviour of the oscillator is numerically investigated with the help of bifurcation diagrams, Lyapunov exponents, Poincare maps, phase portraits and basins of attraction. The existence of subharmonic and chaotic motions and the coexistence of four attractors are observed for some combinations of the system parameters.     

On the solutions of the Moisil–Théodoresco system

A structure theorem is proved for the solutions to the Moisil–Théodoresco system in open subsets of ?³. Furthermore, it is shown that the Cauchy transform maps L₂(?², ?_{0, 2}⁺) isomorphically onto H²(?₊³, ?_{0, 3}⁺), thus proving an elegant generalization to ?² of the classical notion of an analytic signal on the real line. Copyright © 2008 John Wiley & Sons, Ltd.     

B-splines and Hermite–Padé approximants to the exponential function

This paper is the continuation of a work initiated in [P. Sablonnière, An algorithm for the computation of Hermite–Padé approximations to the exponential function: divided differences and Hermite–Padé forms. Numer. Algorithms 33 (2003) 443–452] about the computation of Hermite–Padé forms (HPF) and associated Hermite–Padé approximants (HPA) to the exponential function. We present an alternative algorithm for their computation, based on the representation of HPF in terms of integral remainders with B-splines as Peano kernels. Using the good properties of discrete B-splines, this algorithm gives rise to a great variety of representations of HPF of higher orders in terms of HPF of lower orders, and in particular of classical Padé forms. We give some examples illustrating this algorithm, in particular, another way of constructing quadratic HPF already described by different authors. Finally, we briefly study a family of cubic HPF.