A Langevin equation with multiplicative noise is an equation schematically of the form dq/dt=-F(q)+e(q)xi, where e(q)xi is Gaussian white noise whose amplitude e(q) depends on q itself. I show how to convert such equations into path integrals. The definition of the path integral depends crucially on the convention used for discretizing time, and I specifically derive the correct path integral w...

We consider nonequilibrium probabilistic dynamics in logisticlike maps x(t+1)=1-a|x(t)|(z), (z>1) at their chaos threshold: We first introduce many initial conditions within one among W>>1 intervals partitioning the phase space and focus on the unique value q(sen)<1 for which the entropic form S(q) identical with (1- summation operator Wp(q)(i))/(q-1) linearly increases with time. We then verif...

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

‎Suppose G is a group of order p^2q^2 where p>q are prime numbers and suppose P and Q are Sylow p-subgroups and Sylow q-subgroups of G, ‎respectively‎. ‎In this paper‎, ‎we show that up to isomorphism‎, ‎there are four groups of order p^2q^2 when Q and P are cyclic‎, ‎three groups when Q is a cyclic and P is an elementary ablian group‎, ‎p^2+3p/2+7 groups when Q is an elementary ablian group an...

In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number and the harmonious chromatic number of P4-tidy graphs and (q, q − 4)-graphs, for every fixed q. These classes include cographs, P4-sparse and P4-lite graphs. We also obtain a polynomial time algorithm to determine the Grundy number of (q, q − 4)-graphs. All these coloring pro...

lexicographic ordering by spectral moments ($s$-order) among all trees is discussed in this‎ ‎paper‎. ‎for two given positive integers $p$ and $q$ with $pleqslant q$‎, ‎we denote $mathscr{t}_n^{p‎, ‎q}={t‎: ‎t$ is a tree of order $n$ with a $(p‎, ‎q)$-bipartition}‎. furthermore, ‎the last four trees‎, ‎in the $s$-order‎, ‎among $mathscr{t}_n^{p‎, ‎q},(4leqslant pleqslant q)$ are characterized‎.

Playing a recorded audio signal at faster rate than its original rate results not only in shortening the message but also in changing its spectral contents. Time scaling aims at changing the replay rate of an audio signal without impairing the signal’s spectral contents. Traditional phase vocoders used to perform this operation do not take into account the nonuniform characteristics of the huma...