Search Results for ""

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

The quasiperiodic function defined by d/(dz)lnsigma(z;g_2,g_3)=zeta(z;g_2,g_3), (1) where zeta(z;g_2,g_3) is the Weierstrass zeta function and lim_(z->0)(sigma(z))/z=1. (2) ...

The Zernike polynomials are a set of orthogonal polynomials that arise in the expansion of a wavefront function for optical systems with circular pupils. The odd and even ...

Let Xi be the xi-function defined by Xi(iz)=1/2(z^2-1/4)pi^(-z/2-1/4)Gamma(1/2z+1/4)zeta(z+1/2). (1) Xi(z/2)/8 can be viewed as the Fourier transform of the signal ...

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

The constant e with decimal expansion e=2.718281828459045235360287471352662497757... (OEIS A001113) can be computed to 10^9 digits of precision in 10 CPU-minutes on modern ...

A graph G on more than two vertices is said to be k-connected (or k-vertex connected, or k-point connected) if there does not exist a vertex cut of size k-1 whose removal ...

The q-binomial coefficient is a q-analog for the binomial coefficient, also called a Gaussian coefficient or a Gaussian polynomial. A q-binomial coefficient is given by [n; ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...