Tow   results  are  proved.  The  first  gives necessary  and   ullicient

conditions for a permutation group to have the prope1ty that each of its rational - valued character can be written as (integral) linear combination of characters induced from the principal characters of certain subgroup. The mher presents that this property is extendable to direct product of groups.

Examples give.

The transportation model is a well-recognized and applied algorithm in the distribution of products of logistics operations in enterprises. Multiple forms of solution are algorithmic and technological, which are applied to determine the optimal allocation of one type of product. In this research, the general formulation of the transport model by means of linear programming, where the optimal solution is integrated for different types of related products, and through a digital, dynamic, easy illustration Develops understanding of the Computer in Excel QM program. When choosing, the implementation of the form in the organization is provided.

The nonhomogeneous higher order linear complex differential equation (HOLCDE) with meromorphic (or entire) functions is considered in this paper. The results are obtained by putting some conditions on the coefficients to prove that the hyper order of any nonzero solution of this equation equals the order of one of its coefficients in case the coefficients are meromorphic functions. In this case, the conditions were put are that the lower order of one of the coefficients dominates the maximum of the convergence exponent of the zeros sequence of it, the lower order of both of the other coefficients and the nonhomogeneous part and that the solution has infinite order. Whiles in case the coefficients are entire functions, any nonzero solutio

This paper deals with the continuous classical optimal control problem for triple partial differential equations of parabolic type with initial and boundary conditions; the Galerkin method is used to prove the existence and uniqueness theorem of the state vector solution for given continuous classical control vector. The proof of the existence theorem of a continuous classical optimal control vector associated with the triple linear partial differential equations of parabolic type is given. The derivation of the Fréchet derivative for the cost function is obtained. At the end, the theorem of the necessary conditions for optimality of this problem is stated and is proved.

The aim of the paper is to compute projective maximum distance separable codes, -MDS of two and three dimensions with certain lengths and Hamming weight distribution from the arcs in the projective line and plane over the finite field of order twenty-five. Also, the linear codes generated by an incidence matrix of points and lines of  were studied over different finite fields.  

  Necessary and sufficient conditions for the operator equation I AXAX n  * , to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.

New metal ion complexes were synthesized with the general formula; K[PtLCl4], [ReLCl4] and K[ML(Cl)2] where M = Pd(II), Cd(II), Zn(II) and Hg(II), from the Azo ligand (HL) [2-Hydroxy-3-((5-mercapto-1,3,4-thiadiazol-2-yl)diazenyl)-1-naphth aldehyde] (HL) the ligand was synthesized from (2-hydroxy-1-naphthaldehyde) and (5-amino-1,3,4-thiadiazole-2-thiol). The ligand and its metal complexes are characterized by phisco- chemical spectroscopic techniques (FT.IR, UV-Vis and Mass spectra, elemental analysis, molar conductivity, Atomic Absorption, Chloride contain and magnetic susceptibility). The spectral data suggest that the (HL) behaves as a bidentate ligand in all complexes. These studies revealed tetrahedral geometries for all metal complexes

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.