On the calculation of the Kauffman bracket polynomial

In this paper, we present a new algorithm to evaluate the Kauffman bracket polynomial. The algorithm uses cyclic permutations to count the number of states obtained by the application of ‘A’ and ‘B’ type smoothings to the each crossing of the knot. We show that our algorithm can be implemented easily by computer programming.     

HIGHER ORDER SINGULAR INTEGRAL EQUATIONS ON COMPLEX HYPERSPHERE

A theory of a class of higher order singular integral under the operator(Lf)(u)=1/(ū [ū1 f u 1(u) 1 f ū1(u)+f(u)] is given.We transform the higher order singular integral to a usual Cauchy integral,extend the permutation formula of the higher order singular integral deduced by Qian and Zhong in [4] to a general case,and discuss the regularization problem of the higher order singular integral equations with Cauchy kernel and variable coefficients on complex hypersphere.     

A Study of Local Sign Change Adjustment in Balancing Structures

The adjustment of signed structures (symmetric positive and negative relations) under a local (myopic) sign-change dynamic is studied both analytically and through simulation. Models deriving from various theories but notably balance theory are inspected to determine the convergent properties of the dynamic process.     

Discrete unbounded sets in a finite dimensional space and beyond

Discrete infinite sets in a finite dimensional space, i.e., infinite sets without finite limit points appear in various branches of analysis (zero and pole sets of meromorphic functions, various models in the mathematical theory of quasicrystals, and so on). Here we introduce some notions and present some new theorems connected with such sets.     

Applying the cluster method to count occurrences of generalized permutation patterns

We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingrímsson. In particular, we consider those patterns with three letters and one internal dash, as well as permutation statistics composed of counting the number of occurrences of multisets of such patterns. Counting is done via recurrences which simplify in the case of permutations. A collection of Maple procedures implementing these recurrences accompanies the article.     

Imprimitive non-powerful sign pattern matrices with maximum base

You et al. [L.H. You, J.Y. Shao, and H.Y. Shan, Bounds on the bases of irreducible generalized sign pattern matrices, Linear Algebra Appl. 427 (2007), pp. 285–300], obtained an upper bound of the bases for imprimitive non-powerful sign pattern matrices. In this article, we characterize those imprimitive non-powerful sign pattern matrices whose bases reach this upper bound.     

A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem

This paper presents a genetic algorithm for solving the resource-constrained project scheduling problem. The innovative component of the algorithm is the use of a magnet-based crossover operator that can preserve up to two contiguous parts from the receiver and one contiguous part from the donator genotype. For this purpose, a number of genes in the receiver genotype absorb one another to have the same order and contiguity they have in the donator genotype. The ability of maintaining up to three contiguous parts from two parents distinguishes this crossover operator from the powerful and famous two-point crossover operator, which can maintain only two contiguous parts, both from the same parent. Comparing the performance of the new procedure with that of other procedures indicates its effectiveness and competence.     

The Primitive Sharp Permutation Groups of Twisted Wreath Type

A permutation group G ≤ Sym(X) on a finite set X is sharp if |G|=∏ _l?L(G)(|X| ? l), where L(G) = {|fix(g)| | 1 ≠ g ? G}. We show that no finite primitive permutation groups of twisted wreath type are sharp.