Search Results for ""

A monoid that is commutative i.e., a monoid M such that for every two elements a and b in M, ab=ba. This means that commutative monoids are commutative, associative, and have ...

An equation of the form y=ax^3+bx^2+cx+d, (1) where the three roots of the equation coincide (and are therefore real), i.e., y=a(x-r)^3=a(x^3-3rx^2-3r^2x-r^3). (2) Loomis ...

A Fredholm integral equation of the first kind is an integral equation of the form f(x)=int_a^bK(x,t)phi(t)dt, (1) where K(x,t) is the kernel and phi(t) is an unknown ...

Let phi_x^((k)) denote the recursive function of k variables with Gödel number x, where (1) is normally omitted. Then if g is a partial recursive function, there exists an ...

A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...

The Prelle-Singer method is a semi-decision procedure for solving nonlinear first-order ordinary differential equations of the form y^'=P(x,y)/Q(x,y), where P and Q are ...

There are three types of so-called fundamental forms. The most important are the first and second (since the third can be expressed in terms of these). The fundamental forms ...

A Proth number that is prime, i.e., a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. Factors of Fermat numbers are of this form as long as they ...

A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...