In this paper, we introduce the dual notion of strongly top modules and study some of the basic properties of this class of modules.

‎In this work‎, ‎we investigate admitting center map on multiplicative metric space‎ ‎and establish some fixed point theorems for such maps‎. ‎We modify the Banach contraction principle and‎ ‎the Caristi's fixed point theorem for M-contraction admitting center maps and we prove some‎ ‎useful theorems‎. ‎Our results on multiplicative metric space improve and modify‎ ‎s...

A ring $R$ is a strongly clean ring if every element in $R$ is the sum of an idempotent and a unit that commutate. We construct some classes of strongly clean rings which have stable range one. It is shown that such cleanness of $2 imes 2$ matrices over commutative local rings is completely determined in terms of solvability of quadratic equations.

We study recursive algorithm for computing DCT of lengths N = q 2m (m, q ∈ N, q is odd) due to C. W. Kok [16]. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor decomposition, when m 6 2. We also show that C. W. Kok’s factorization allows a simple conversion to a scaled form. We analyze complexity of such a scaled factorization, a...

This paper is devoted to dealing with global attitude synchronization problems for networked rigid bodies subjected directed topologies and arbitrary initial orientations. To avoid the asynchronous pitfall where only vector parts of reach agreement on some identical value but scalar do not, multiplicative quaternion errors are incorporated develop protocols absolute measurements. It shown that ...

For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as M1(G) = ∑ v∈V (G) dG(v) 2 where dG(v) is the degree of vertex v in G. The alternative expression for M1(G) is ∑ uv∈E(G)(dG(u)+dG(v)). Very recently, Eliasi, Iranmanesh and Gutman [7] introduced a new graphical invariant ∏∗ 1(G) = ∏ uv∈E(G)(dG(u) + dG(v)) as the multiplicative version of ...

Sell’s approach [32] to the construction of attractors for the Navier– Stokes equations in 3-dimensions is extended to the 3-D stochastic equations with a general multiplicative noise.

In this paper, the linear quadratic regulation problem for discrete-time systems with state delays and multiplicative noise is considered. The necessary and sufficient condition for the problem admitting a unique solution is given. Under this condition, the optimal feedback control and the optimal cost are presented via a set of coupled difference equations. Our approach is based on the maximum...