Search Results for ""

The Newton-Cotes formulas are an extremely useful and straightforward family of numerical integration techniques. To integrate a function f(x) over some interval [a,b], ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

A connection on a vector bundle pi:E->M is a way to "differentiate" bundle sections, in a way that is analogous to the exterior derivative df of a function f. In particular, ...

The number of ways in which a group of n with weights sum_(i=1)^(n)w_i=1 can change a losing coalition (one with sumw_i<1/2) to a winning one, or vice versa. It was proposed ...

A face-centered cubic sphere packing obtained by placing layers of spheres one on top of another. Because there are two distinct ways to place each layer on top of the ...

A point which is a member of the set closure of a given set S and the set closure of its complement set. If A is a subset of R^n, then a point x in R^n is a boundary point of ...

The points on a line can be put into a one-to-one correspondence with the real numbers.

If Omega_1 and Omega_2 are bounded domains, partialOmega_1, partialOmega_2 are Jordan curves, and phi:Omega_1->Omega_2 is a conformal mapping, then phi (respectively, ...

Erdős proved that there exist at least one prime of the form 4k+1 and at least one prime of the form 4k+3 between n and 2n for all n>6.

Given two closed curves, the circuminscribed curve is simultaneously inscribed in the outer one and circumscribed on the inner one.