Search Results for ""

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

A cycle double cover of an undirected graph is a collection of cycles that cover each edge of the graph exactly twice. For a polyhedral graph, the faces of a corresponding ...

A vector v on a Hilbert space H is said to be cyclic if there exists some bounded linear operator T on H so that the set of orbits {T^iv}_(i=0)^infty={v,Tv,T^2v,...} is dense ...

A natural number n>3 such that n|(a^(n-2)-a) whenever (a,n)=1 (a and n are relatively prime) and a<=n. (Here, n|m means that n divides m.) There are an infinite number of ...

A wavelet used for filtering signals. Daubechies (1988, p. 980) has tabulated the numerical values up to order p=10.

A figurate number of the form 4n^2-3n. The first few are 1, 10, 27, 52, 85, ... (OEIS A001107). The generating function giving the decagonal numbers is ...

A Ramsey number of the form R(k,k;2).

Let G be group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...

Given a real number x, find the powers of a base b that will shift the digits of x a number of places n to the left. This is equivalent to solving b^x=b^nx (1) or x=n+log_bx. ...

Let s_b(n) be the sum of the base-b digits of n, and epsilon(n)=(-1)^(s_2(n)) the Thue-Morse sequence, then product_(n=0)^infty((2n+1)/(2n+2))^(epsilon(n))=1/2sqrt(2).