The problem of placing resources in a k-ary n-cube (k > 2) is considered in this paper. For a given j 1, resources are placed such that each non-resource node is adjacent to j resource nodes. We rst prove that perfect j-adjacency placements are impossible in k-ary n-cubes if n < j < 2n. Then, we show that a perfect j-adjacency placement is possible in k-ary n-cubes when one of the following two...

In this article, we will show the complex inversion formula for the inversion of the L2-transform and also some applications of the L2, and Post Widder transforms for solving singular integral equation with trigonometric kernel. Finally, we obtained analytic solution for a partial differential equation with non-constant coefficients.

this paper presents an efficient modification of the variational iteration method for solvingboundary value problems using the chebyshev polynomials. the proposed method can be applied to linearand nonlinear models. the scheme is tested for some examples and the obtained results demonstrate thereliability and efficiency of the proposed method.

in this paper, we use modified laplace decomposition method to solving initial value problems (ivp) of the second order ordinary differential equations. theproposed method can be applied to linear and nonlinearproblems

The aim of this research work is to define and characterize a new class of n-ary multialgebra that may be called canonical (m, n)&minus hypermodules. These are a generalization of canonical n-ary hypergroups, that is a generalization of hypermodules in the sense of canonical and a subclasses of (m, n)&minusary hypermodules. In addition, three isomorphism theorems of module theory and canonical ...

An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...

Abstract We show that for a fixed $q$ , the number of -ary $t$ -error correcting codes length $n$ is at most $2^{(1 + o(1)) H_q(n,t)}$ all $t \leq (1 - q^{-1})n 2\sqrt{n \log n}$ where $H_q(n, t) = q^n/ V_q(n,t)$ Hamming bound and $V_q(n,t)$ cardinality radius ball. This proves conjecture Balogh, Treglown, Wagner, who showed result o(n^{1/3} (\log n)^{-2/3})$ .

We propose a new branch-and-bound algorithm to solve hard instances of set covering problems arising from Steiner triple systems.