Search Results for ""

A random polygon containing the origin (Kovalenko 1999).

A polyhedral graph having 10 vertices. There are 32300 nonisomorphic nonahedral graphs, as first enumerated by Duijvestijn and Federico (1981).

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

A curve which can be turned continuously inside an equilateral triangle. There are an infinite number of delta curves, but the simplest are the circle and lens-shaped ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

The system of partial differential equations u_t = 3ww_x (1) w_t = 2w_(xxx)+2uw_x+u_xw. (2)

A set of points which do not lie on any of a certain class of hyperplanes.

The simplest algebraic language, denoted D. If X is the alphabet {x,x^_}, then D is the set of words u of X which satisfy 1. |u|_x=|u|_(x^_), where |u|_x is the numbers of ...

Let Jones and Smith be the only two contestants in an election that will end in a deadlock when all votes for Jones (J) and Smith (S) are counted. What is the expectation ...

If L^~ is a linear operator on a function space, then f is an eigenfunction for L^~ and lambda is the associated eigenvalue whenever L^~f=lambdaf. Renteln and Dundes (2005) ...