we define a new function-valued inner product on l2(g), called ?-bracket product, where g is a locally compact abelian group and ? is a topological isomorphism on g. we investigate the notion of ?-orthogonality, bessel's inequality and ?-orthonormal bases with respect to this inner product on l2(g).

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G ∼= H. The n barrier for group isomorphism has withstood all attacks — even for the special cases of p-groups and solvable groups — ever since the n generator-enumeration algorithm. Following a framework due to Wagner, we present the first significant improvement over ...

Following classical work by Freidlin [Trans. Amer. Math. Soc. (1988) 305 665–657] and subsequent works by Sowers [Ann. Probab. (1992) 20 504–537] and Peszat [Probab. Theory Related Fields (1994) 98 113–136], we prove large deviation estimates for the small noise limit of systems of stochastic reaction–diffusion equations with globally Lipschitz but unbounded diffusion coefficients, however, ass...

The characteristics of impulse bursts in remote sensing images are analyzed and a model for this noise is proposed. The model also takes into consideration other noise types, for example, the multiplicative noise present in radar images. As a case study, soft morphological filters utilizing a training-based optimization scheme are used for the noise removal. Different approaches for the trainin...

Let M be the space of even integer weight meromorphic modular forms on SL2(Z) with integer coefficients, leading coefficient equal to one, and whose zeros and poles are supported at cusps and imaginary quadratic irrationals. If r ≥ 0 is an integer, let M+r+1/2(Γ0(4)) be the space of modular forms of half-integral weight r + 1/2with respect to Γ0(4) which satisfy Kohnen’s plus-condition and whos...

It has been known that the graph isomorphism problem is polynomial-time many-one reducible to the ring isomorphism problem. In fact, two different reductions have already been proposed. For those reductions, rings of certain types have been used to represent a given graph. In this paper, we give yet another reduction, which is based on a simpler and more natural construction of a ring from a gr...

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G ∼= H . For several decades, the np n+O(1) generatorenumeration bound (where p is the smallest prime dividing the order of the group) has been the best worst-case result for general groups. In this work, we show the first improvement over the generator-enumeration boun...

‎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...

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative