Search Results for ""

Let X be a set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A in V(X) be a finitary algebra with finitely many fundamental operations. Then ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...

A free idempotent monoid is a monoid that satisfies the identity x^2=x and is generated by a set of elements. If the generating set of such a monoid is finite, then so is the ...

Given a real m×n matrix A, there are four associated vector subspaces which are known colloquially as its fundamental subspaces, namely the column spaces and the null spaces ...

A geometric series sum_(k)a_k is a series for which the ratio of each two consecutive terms a_(k+1)/a_k is a constant function of the summation index k. The more general case ...

A natural extension of the Riemann p-differential equation given by (d^2w)/(dx^2)+(gamma/x+delta/(x-1)+epsilon/(x-a))(dw)/(dx)+(alphabetax-q)/(x(x-1)(x-a))w=0 where ...

A set-theoretic term having a number of different meanings. Fraenkel (1953, p. 37) used the term as a synonym for "finite set." However, according to Russell's definition ...