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

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

Let $R$ be a reversible ring which is $alpha$-compatible for an endomorphism $alpha$ of $R$ and $f(X)=a_0+a_1X+cdots+a_nX^n$ be a nonzero skew polynomial in $R[X;alpha]$. It is proved that if there exists a nonzero skew polynomial $g(X)=b_0+b_1X+cdots+b_mX^m$ in $R[X;alpha]$ such that $g(X)f(X)=c$ is a constant in $R$, then $b_0a_0=c$ and there exist nonzero elements $a$ and $r$ in $R$ such tha...

in the present work, the effects of operating conditions including ph, transmembrane pressure, oil concentration, and temperature on fouling resistance and the rejection of turbidity for a polymeric membrane in an ultrafiltration system of wastewater treatment were studied. a new modeling technique called evolutionary polynomial regression (epr) was investigated. epr is a method based on regres...

The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.

A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

Suppose ai indicates the number of orbits size i in graph G. A new counting polynomial, namely an orbit is defined as OG(x) = ?i aixi. Its modified version obtained by subtracting polynomial from 1. In present paper, we studied conditions under which integer can arise a graph. Additionally, surveyed graphs with small and characterized several classes respect to their polynomials.

Abstract. We show that multivariable colored link invariants are derived from the roots of unity representations of Uq(g). We propose a property of the Clebsch-Gordan coefficients of Uq(g), which is important for defining the invariants of colored links. For Uq(sl2) we explicitly prove the property, and then construct invariants of colored links and colored ribbon graphs, which generalize the m...

It is known that a stochastic differential equation (SDE) induces two probabilistic objects, namely a difusion process and a stochastic flow. While the diffusion process is determined by the innitesimal mean and variance given by the coefficients of the SDE, this is not the case for the stochastic flow induced by the SDE. In order to characterize the stochastic flow uniquely the innitesimal cov...