Counting derangements, involutions and unimodal elements in the wreath product Cr ? Sn

We count derangements, involutions and unimodal elements in the wreath product C _r ≀ S _n by the numbers of excedances, fixed points and 2-cycles. Properties of the generating functions, including combinatorial formulas, recurrence relations and real-rootedness are studied. The results obtained specialize to those on the symmetric group S _n and on the hyperoctahedral group B _n when r = 1, 2, respectively.     

A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem

The Redundancy Allocation Problem generally involves the selection of components with multiple choices and redundancy levels that produce maximum system reliability given various system level constraints as cost and weight. In this paper we investigate the series–parallel redundant reliability problems, when a mixing of components was considered. In this type of problem both the number of redundancy components and the corresponding component reliability in each subsystem are to be decided simultaneously so as to maximise the reliability of system. A hybrid algorithm is based on particle swarm optimization and local search algorithm. In addition, we propose an adaptive penalty function which encourages our algorithm to explore within the feasible region and near feasible region, and discourage search beyond that threshold. The effectiveness of our proposed hybrid PSO algorithm is proved on numerous variations of three different problems and compared to Tabu Search and Multiple Weighted Objectives solutions.     

A Numerical Study of Traveling Wave Fronts for a Reaction-Diffusion-Advection Model

This paper concerns with the traveling wave solutions of a nonlinear reaction-diffusion-advection model for describing the spatiotemporal evolution of bacterial colony pattern. We use different methods for computing the traveling wave fronts of the model equations. One of the methods involves the traveling wave equations. Numerical solutions of these equations as an initial-value problem lead to accurate computations of the wave profiles and speeds. The second method is to construct the time-dependent solutions by solving an initial-moving boundary-value problem for the PDE system, showing an approximation for such wave fronts, in particular, the minimum speed traveling wave.     

On multiple pattern avoiding set partitions

We study classes of set partitions determined by the avoidance of multiple patterns, applying a natural notion of partition containment that has been introduced by Sagan. We say that two sets S and T of patterns are equivalent if for each n the number of partitions of size n avoiding all the members of S is the same as the number of those that avoid all the members of T.