Search Results for ""

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

An affine variety V is an algebraic variety contained in affine space. For example, {(x,y,z):x^2+y^2-z^2=0} (1) is the cone, and {(x,y,z):x^2+y^2-z^2=0,ax+by+cz=0} (2) is a ...

The set R union {+infty,-infty} obtained by adjoining two improper elements to the set R of real numbers is normally called the set of (affinely) extended real numbers. ...

Consider decomposition the factorial n! into multiplicative factors p_k^(b_k) arranged in nondecreasing order. For example, 4! = 3·2^3 (1) = 2·3·4 (2) = 2·2·2·3 (3) and 5! = ...

The Banach-Saks theorem is a result in functional analysis which proves the existence of a "nicely-convergent" subsequence for any sequence {f_n}={f_n}_(n in Z^*) of ...

Barycentric coordinates are triples of numbers (t_1,t_2,t_3) corresponding to masses placed at the vertices of a reference triangle DeltaA_1A_2A_3. These masses then ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

A catacaustic is a curve that is the envelope of rays emanating from a specified point (or a point at infinite distance producing parallel rays) for a given mirror shape. The ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...