Search Results for ""

The incidence matrix of a graph gives the (0,1)-matrix which has a row for each vertex and column for each edge, and (v,e)=1 iff vertex v is incident upon edge e (Skiena ...

Infinity, most often denoted as infty, is an unbounded quantity that is greater than every real number. The symbol infty had been used as an alternative to M (1000) in Roman ...

The proof theories of propositional calculus and first-order logic are often referred to as classical logic. Intuitionistic propositional logic can be described as classical ...

The Knuth-Bendix completion algorithm attempts to transform a finite set of identities into a finitely terminating, confluent term rewriting system whose reductions preserve ...

Let lim stand for the limit lim_(x->c), lim_(x->c^-), lim_(x->c^+), lim_(x->infty), or lim_(x->-infty), and suppose that lim f(x) and lim g(x) are both zero or are both ...

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

Let L=<L, v , ^ > and K=<K, v , ^ > be lattices, and let h:L->K. Then h is a lattice homomorphism if and only if for any a,b in L, h(a v b)=h(a) v h(b) and h(a ^ b)=h(a) ^ ...

Macdonald's plane partition conjecture proposes a formula for the number of cyclically symmetric plane partitions (CSPPs) of a given integer whose Ferrers diagrams fit inside ...

Let kappa_1 and kappa_2 be the principal curvatures, then their mean H=1/2(kappa_1+kappa_2) (1) is called the mean curvature. Let R_1 and R_2 be the radii corresponding to ...

Dickson states "In a letter to Tanner [L'intermediaire des math., 2, 1895, 317] Lucas stated that Mersenne (1644, 1647) implied that a necessary and sufficient condition that ...