TOPICS
Search

Search Results for ""


1861 - 1870 of 2130 for Matrix polynomialSearch Results
Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...
Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...
A rooted graph is a graph in which one node is labeled in a special way so as to distinguish it from other nodes. The special node is called the root of the graph. The rooted ...
Let N samples be taken from a population with central moments mu_n. The sample variance m_2 is then given by m_2=1/Nsum_(i=1)^N(x_i-m)^2, (1) where m=x^_ is the sample mean. ...
Let two spheres of radii R and r be located along the x-axis centered at (0,0,0) and (d,0,0), respectively. Not surprisingly, the analysis is very similar to the case of the ...
A piecewise polynomial function that can have a locally very simple form, yet at the same time be globally flexible and smooth. Splines are very useful for modeling arbitrary ...
An intrinsic property of a mathematical object which causes it to remain invariant under certain classes of transformations (such as rotation, reflection, inversion, or more ...
The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...
Trigonometric functions of npi/7 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 7 is not a ...
Roman (1984, p. 2) describes umbral calculus as the study of the class of Sheffer sequences. Umbral calculus provides a formalism for the systematic derivation and ...
1 ... 184|185|186|187|188|189|190 ... 213 Previous Next

...