Search Results for ""

Just as the ratio of the arc length of a semicircle to its radius is always pi, the ratio P of the arc length of the parabolic segment formed by the latus rectum of any ...

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

The Jacobian conjecture in the plane, first stated by Keller (1939), states that given a ring map F of C[x,y] (the polynomial ring in two variables over the complex numbers ...

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...

Consider the Euler product zeta(s)=product_(k=1)^infty1/(1-1/(p_k^s)), (1) where zeta(s) is the Riemann zeta function and p_k is the kth prime. zeta(1)=infty, but taking the ...

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

One form of van der Waerden's theorem states that for all positive integers k and r, there exists a constant n(r,k) such that if n_0>=n(r,k) and {1,2,...,n_0} subset C_1 ...

Let L be a nontrivial bounded lattice (or a nontrivial complemented lattice, etc.). If every nonconstant lattice homomorphism defined on L is 0,1-separating, then L is a ...