Search Results for ""

Formulas obtained from differentiating Newton's forward difference formula, where R_n^'=h^nf^((n+1))(xi)d/(dp)(p; n+1)+h^(n+1)(p; n+1)d/(dx)f^((n+1))(xi), (n; k) is a ...

For s_1,s_2=+/-1, lim_(epsilon_1->0; epsilon_2->0)1/(x_1-is_1epsilon_1)1/(x_2-is_2epsilon_2) =[PV(1/(x_1))+ipis_1delta(x_1)][PV(1/(x_2))+ipis_2delta(x_2)] ...

The quotient space K^__1A=K_1A/{0,[-1]} of the Whitehead group K_1A is known as the reduced Whitehead group. Here, the element [-1] in K_1A denotes the order-2 element ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

In this work, the name Pythagoras's constant will be given to the square root of 2, sqrt(2)=1.4142135623... (1) (OEIS A002193), which the Pythagoreans proved to be ...

The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...

An abundant number, sometimes also called an excessive number, is a positive integer n for which s(n)=sigma(n)-n>n, (1) where sigma(n) is the divisor function and s(n) is the ...

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...