we introduce a new concept of general $g$-$eta$-monotone operator generalizing the general $(h,eta)$-monotone operator cite{arvar2, arvar1}, general $h-$ monotone operator cite{xiahuang} in banach spaces, and also generalizing $g$-$eta$-monotone operator cite{zhang}, $(a, eta)$-monotone operator cite{verma2}, $a$-monotone operator cite{verma0}, $(h, eta)$-monotone operator cite{fanghuang}, $h$-...

Let S be a subset of the positive integers, and let σ be a permutation of S. We say that σ is a k-avoiding permutation of S if σ does not contain any k-term AP as a subsequence. Similarly, the set S is said to be k-avoidable if there exists a k-avoiding permutation of S.

the recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. one of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...

Let V be a vertex operator algebra. It is shown that the categories of weak, admissible and ordinary g-twisted modules for the tensor product VOA V ⊗k are isomorphic to the categories of weak, admissible and ordinary V -modules respectively where g is a k cycle automorphism of V ⊗k. For arbitrary permutation automorphism g of V ⊗k the category of admissible g-twisted modules for V ⊗k is semi si...

The use of a genetic algorithm for the minimum thickness design of composite laminated plates is explored. A previously developed genetic algorithm for laminate design is thoroughly revised and improved, by incorporating knowledge of the physics of the problem iota the genetic algorithm. Constraints are accounted for by combining fixed and progressive penalty functions. Improved selection, muta...

We present three improvements to Perlin’s gradient noise algorithm. First, a small change in the permutation hash function combined with separate pseudorandom tables yields significantly better axial decorrelation. Second, a modification to the reconstruction kernel approximating a global higher-order differencing operator produces better bandlimitation. Third, the quality of 2D surfaces using ...

Real-world versions of the permutation flowshop scheduling problem (PFSP) have a variety of objective criteria to be optimized simultaneously. Multi-objective PFSP is also a relevant combinatorial multi-objective optimization problem. In this paper we propose a multiobjective evolutionary algorithm for PFSPs by extending the previously proposed discrete differential evolution scheme for single-...

In these notes we solve a class of Riemann-Hilbert (inverse monodromy) problems with an arbitrary quasi-permutation monodromy group. The solution is given in terms of Szegö kernel on the underlying Riemann surface. In particular, our construction provides a new class of solutions of the Schlesinger system. We present some results on explicit calculation of the corresponding tau-function, and de...

In this paper a new metaheuristic method is proposed to solve the classical permutation flowshop scheduling problem with the objective of minimizing sum of completion times. The representative neighbourhood combines the stochastic sampling method mainly used in Simulated Annealing and the best descent method elaborated in Tabu Search and integrates them naturally into a single method. The metho...