Search Results for ""

A vector bundle is special class of fiber bundle in which the fiber is a vector space V. Technically, a little more is required; namely, if f:E->B is a bundle with fiber R^n, ...

A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...

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 ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

A Latin square is said to be odd if it contains an odd number of rows and columns that are odd permutations. Otherwise, it is said to be even. Let the number of even Latin ...

The alternating factorial is defined as the sum of consecutive factorials with alternating signs, a(n)=sum_(k=1)^n(-1)^(n-k)k!. (1) They can be given in closed form as ...

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...

An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...

A number k such that nk^2 has its last digit(s) equal to k is called n-automorphic. For example, 1·5__^2=25__ (Wells 1986, pp. 58-59) and 1·6__^2=36__ (Wells 1986, p. 68), so ...

It is thought that the totient valence function N_phi(m)>=2, i.e., if there is an n such that phi(n)=m, then there are at least two solutions n. This assertion is called ...