Restricted even permutations and Chebyshev polynomials

We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.     

Fourth-Order p-Laplacian Nonlinear Systems via the Vector Version of Krasnosel’skiĭ’s Fixed Point Theorem

In this paper, existence results for a fourth-order nonlinear system are obtained. Both classical and vector versions of the Krasnosel’skiĭ’s fixed point theorem are used and a comparison of the obtained results to those from the literature is provided.     

A combinatorial proof of a result for permutation pairs

In this paper, a direct combinatorial proof is given of a result on permutation pairs originally due to Carlitz, Scoville, and Vaughan and later extended. It concerns showing that the series expansion of the reciprocal of a certain multiply exponential generating function has positive integer coefficients. The arguments may then be applied to related problems, one of which concerns the reciprocal of the exponential series for Fibonacci numbers.     

Separable d-Permutations and Guillotine Partitions

We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula, and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a bijection between separable d-dimensional permutations and guillotine partitions of a 2 ^d-1-dimensional box is constructed. We also study enumerating problems related to guillotine partitions under certain restrictions revealing connections to other combinatorial structures. This allows us to obtain several results on patterns in permutations.     

Adaptive fuzzy control‐based projective synchronization of uncertain nonaffine chaotic systems

This article aims to introduce a projective synchronization approach based on adaptive fuzzy control for a class of perturbed uncertain multivariable nonaffine chaotic systems. The fuzzy‐logic systems are employed to approximate online the uncertain functions. A Lyapunov approach is used to design the parameter adaptation laws and to demonstrate the boundedness of all signals of the closed‐loop system as well as the convergence of the synchronization errors to bounded residual sets. Finally, numerical simulation results are presented to verify the feasibility and effectiveness of the proposed synchronization system based on fuzzy adaptive controller. © 2014 Wiley Periodicals, Inc. Complexity 21: 180–192, 2015     

Recurrence relations with two indices and even trees

Recently, the author, Mansour, introduced a combinatorial problem, called Hobby's problem, to study different types of recurrence relations with two indices. Moreover, he presented several recurrence relations with two indices related to Dyck paths and Schröder paths. In this paper, we generalize Hobby's problem to study other types of recurrence relations with two indices for which a combinatorial method provides a complete solution. Combinatorially, we describe these recurrence relations as a set of lattice paths in the second octant of the plane integer lattice, and then we map bijectively these lattice paths to the set of even trees. Analytically, we use the kernel method technique to solve these recurrence relations.     

Noncrossing Normal Ordering for Functions of Boson Operators

Normally ordered forms of functions of boson operators are important in many contexts in particular concerning Quantum Field Theory and Quantum Optics. Beginning with the seminal work of Katriel (Lett. Nuovo Cimento 10(13):565–567, 1974), in the last few years, normally ordered forms have been shown to have a rich combinatorial structure, mainly in virtue of a link with the theory of partitions. In this paper, we attempt to enrich this link. By considering linear representations of noncrossing partitions, we define the notion of noncrossing normal ordering. Given the growing interest in noncrossing partitions, because of their many unexpected connections (like, for example, with free probability), noncrossing normal ordering appears to be an intriguing notion. We explicitly give the noncrossing normally ordered form of the functions (a ^r (a ^† ) ^s ) ⁿ ) and (a ^r +(a ^† ) ^s ) ⁿ , plus various special cases. We are able to establish for the first time bijections between noncrossing contractions of these functions, k-ary trees and sets of lattice paths.