Search Results for ""

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess countable monotonicity provided that, whenever a set E in S is covered by ...

A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...

A labeled graph whose nodes are indexed by the generators of a Coxeter group having (P_i,P_j) as an graph edge labeled by M_(ij) whenever M_(ij)>2, where M_(ij) is an element ...

An infinite sequence of circles such that every four consecutive circles are mutually tangent, and the circles' radii ..., R_(-n), ..., R_(-1), R_0, R_1, R_2, R_3, R_4, ..., ...

The Cramér conjecture is the unproven conjecture that lim sup_(n->infty)(p_(n+1)-p_n)/((lnp_n)^2)=1, where p_n is the nth prime.

A curve whose name means skull-like. It is given by the polar equation r=asint+bsqrt(1-pcos^2t)+csqrt(1-qcos^2t), where a,b,c>0, a<b+c, 0<p<1, 0<q<1, and p!=q. The top of the ...

Consider a convex plane curve K with perimeter L, and the set of points P exterior to K. Further, let t_1 and t_2 be the perpendicular distances from P to K (with ...

A cross-handle is a topological structure which can be thought of as the object produced by puncturing a surface twice, attaching a zip around each puncture travelling in the ...

A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...