نتایج جستجو برای: generalized memory polynomial
تعداد نتایج: 510061 فیلتر نتایج به سال:
for a finite group $g$, we study the total character $tau_g$ afforded by the direct sum of all the non-isomorphic irreducible complex representations of $g$. we resolve for several classes of groups (the camina $p$-groups, the generalized camina $p$-groups, the groups which admit $(g,z(g))$ as a generalized camina pair), the problem of existence of a polynomial $f(x) in mathbb...
Abstract Introduction: The objective of this research was to determine memory problems (episodic memory, memory bias and memory confidence) in checking type obsessive-compulsive disorder (OCD). Method: Sixty individuals with OCD (30 checking and 30 washing types) were selected, together with 60 control individuals (30 with generalized anxiety disorder and 30 normal). The groups matched the che...
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
In this paper, a remedial measure is first proposed to eliminate the effect of autocorrelation in phase-ІІ monitoring of autocorrelated polynomial profiles, where there is a first order autoregressive (AR(1)) relation between the error terms in each profile. Then, a control chart based on the generalized linear test (GLT) is proposed to monitor the coefficients of polynomial profiles and an R-c...
The focus of this paper is to study the HOMFLY polynomial of (2, n)-torus link as a generalized Fibonacci polynomial. For this purpose, we first introduce a form of generalized Fibonacci and Lucas polynomials and provide their some fundamental properties. We define the HOMFLY polynomial of (2, n)-torus link with a way similar to our generalized Fibonacci polynomials and provide its fundamental ...
Recently, generalized digital nets were introduced and shown to achieve almost optimal convergence rates when used in a quasi-Monte Carlo algorithm to approximate high-dimensional integrals over the unit cube. Since their inception, one method of constructing generalized digital nets from classical digital nets has been known. However, the desirable features of generalized digital nets motivate...
We show how generalized Zagreb indices $M_1^k(G)$ can be computed by using a simple graph polynomial and Stirling numbers of the second kind. In that way we explain and clarify the meaning of a triangle of numbers used to establish the same result in an earlier reference.
In this paper a numerical method for solving second order fuzzy differential equations under generalized differentiability is proposed. This method is based on the interpolating a solution by piecewise polynomial of degree 4 in the range of solution. Moreover we investigate the existence, uniqueness and convergence of approximate solutions. Finally the accuracy of piecewise approximate method b...
In this paper a numerical method for solving forth order fuzzy dierentialequations under generalized differentiability is proposed. This method is basedon the interpolating a solution by piecewise polynomial of degree 8 in the rangeof solution . We investigate the existence and uniqueness of solutions. Finally anumerical example is presented to illustrate the accuracy of the new technique.
in this paper, we consider an arbitrary binary polynomial sequence {a_n} and then give a lower triangular matrix representation of this sequence. as main result, we obtain a factorization of the innite generalized pascal matrix in terms of this new matrix, using a riordan group approach. further some interesting results and applications are derived.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید