Search Results for ""

A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...

Let f_1(z), ..., f_m(z) for m>=1 be a set of E-functions that (1) form a solution of the system of differential equations y_k^'=q_(k0)+sum_(j=1)^mq_(kj)y_j for q_(kj) in C(z) ...

In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...

The combination of a central dilation and a rotation about the same center. However, the combination of a central dilation and a rotation whose centers are distinct is also a ...

Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...

Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...

A generalization of Ramsey theory to mathematical objects in which one would not normally expect structure to be found. For example, there exists a graph with very few ...

The set of all points x that can be put into one-to-one correspondence with sets of essentially distinct values of four homogeneous coordinates x_0:x_1:x_2:x_3, not all ...

In the theory of special functions, a class of functions is said to be "of the third kind" if it is similar to but distinct from previously defined functions already defined ...

Let m_1, m_2, ..., m_n be distinct primitive elements of a two-dimensional lattice M such that det(m_i,m_(i+1))>0 for i=1, ..., n-1. Each collection Gamma={m_1,m_2,...,m_n} ...