Search Results for ""

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

A smooth function is a function that has continuous derivatives up to some desired order over some domain. A function can therefore be said to be smooth over a restricted ...

A roll of two 1s (the lowest roll possible) on a pair of six-sided dice. The probability of rolling snake eyes is 1/36, or 2.777...%.

The 6-polyiamond illustrated above.

The socle of a group G is the subgroup generated by its minimal normal subgroups. For example, the symmetric group S_4 has two nontrivial normal subgroups: A_4 and ...

Socrates is reported to have stated: "One thing I know is that I know nothing."

Let P(1/x) be a linear functional acting according to the formula <P(1/x),phi> = Pint(phi(x))/xdx (1) = ...

A surface harmonic of degree l which is premultiplied by a factor r^l. Confusingly, solid harmonics are also known as "spherical harmonics" (Whittaker and Watson 1990, p. ...

An odd composite number N is called a Somer-Lucas d-pseudoprime (with d>=1) if there exists a nondegenerate Lucas sequence U(P,Q) with U_0=0, U_1=1, D=P^2-4Q, such that ...

There are (at least) two equations known as Sommerfeld's formula. The first is J_nu(z)=1/(2pi)int_(-eta+iinfty)^(2pi-eta+iinfty)e^(izcost)e^(inu(t-pi/2))dt, where J_nu(z) is ...