‎let $g$ be a finite $p$-group and $n$ be a normal subgroup of $g$ with‎ ‎$|n|=p^n$ and $|g/n|=p^m$‎. ‎a result of ellis (1998) shows‎ ‎that the order of the schur multiplier of such a pair $(g,n)$ of finite $p$-groups is bounded‎ ‎by $ p^{frac{1}{2}n(2m+n-1)}$ and hence it is equal to $‎ ‎p^{frac{1}{2}n(2m+n-1)-t}$ for some non-negative integer $t$‎. ‎recently‎, ‎the authors have characterized...

Let Q denote the field of algebraic numbers in C. A discrete group G is said to have the σ-multiplier algebraic eigenvalue property, if for every matrix A ∈ Md(Q(G,σ)), regarded as an operator on l(G), the eigenvalues of A are algebraic numbers, where σ ∈ Z(G,U(Q)) is an algebraic multiplier, and U(Q) denotes the unitary elements of Q. Such operators include the Harper operator and the discrete...

This paper provides sensitivity and duality results for continuous-time optimal capital accumulation models where preferences belong to a class of recursive objectives. We combine the topology used by Becker, Boyd and Sung (1989) with a controllability condition to demonstrate that optimal paths are continuous with respect to changes in both the initial capital stock, and the rate of time prefe...

‎in [u‎. ‎dempwolff‎, ‎on extensions of elementary abelian groups of order $2^{5}$ by $gl(5,2)$‎, ‎textit{rend‎. ‎sem‎. ‎mat‎. ‎univ‎. ‎padova}‎, ‎textbf{48} (1972)‎, ‎359‎ - ‎364.] dempwolff proved the existence of a group of the‎ ‎form $2^{5}{^{cdot}}gl(5,2)$ (a non split extension of the‎ ‎elementary abelian group $2^{5}$ by the general linear group‎ ‎$gl(5,2)$)‎. ‎this group is the second l...

Based on the combination of the particle swarm algorithm and multiplier penalty function method for the constraint conditions, this paper proposes an improved hybrid particle swarm optimization algorithm which is used to solve nonlinear constraint optimization problems. The algorithm converts nonlinear constraint function into no-constraints nonlinear problems by constructing the multiplier pen...

Multiplication is a basic operation in any signal processing application. Multiplication is the most important one among the four arithmetic operations like addition, subtraction, and division. Multipliers are usually hardware intensive, and the main parameters of concern are high speed, low cost, and less VLSI area. The propagation time and power consumption in the multiplier are always high. ...

in this paper we give some general results on the non-splitextension group $overline{g}_{n} = 2^{2n}{^{cdot}}sp(2n,2), ngeq2.$ we then focus on the group $overline{g}_{4} =2^{8}{^{cdot}}sp(8,2).$ we construct $overline{g}_{4}$ as apermutation group acting on 512 points. the conjugacy classes aredetermined using the coset analysis technique. then we determine theinertia factor groups and fischer...