Search Results for ""

A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...

The term "porism" is an archaic type of mathematical proposition whose historical purpose is not entirely known. It is used instead of "theorem" by some authors for a small ...

A quartic nonhamiltonian graph is a quartic graph that is nonhamiltonian. A number of such graphs are illustrated above. Van Cleemput and Zamfirescu (2018) gave a 39-vertex ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

The nth Ramanujan prime is the smallest number R_n such that pi(x)-pi(x/2)>=n for all x>=R_n, where pi(x) is the prime counting function. In other words, there are at least n ...

The quotient space K^__1A=K_1A/{0,[-1]} of the Whitehead group K_1A is known as the reduced Whitehead group. Here, the element [-1] in K_1A denotes the order-2 element ...

A method of proof which proceeds by stating a proposition and then showing that it results in a contradiction, thus demonstrating the proposition to be false. In the words of ...

Let X be a normed space and X^(**)=(X^*)^* denote the second dual vector space of X. The canonical map x|->x^^ defined by x^^(f)=f(x),f in X^* gives an isometric linear ...

Let a discrete distribution have probability function p_k, and let a second discrete distribution have probability function q_k. Then the relative entropy of p with respect ...

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...