Search Results for ""

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 (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...

Elder's theorem is a generalization of Stanley's theorem which states that the total number of occurrences of an integer k among all unordered partitions of n is equal to the ...

Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. ...

Scan the decimal expansion of a constant (including any digits to the left of the decimal point) until all n-digit strings have been seen (including 0-padded strings). The ...

A map projection. The inverse equations for phi are computed by iteration. Let the angle of the projection plane be theta_b. Define a={0 for theta_b=1/2pi; ...

A transformation in which vectors are transformed in a fixed coordinate system. In contrast, a transformation in which the coordinate system is changed, leaving vectors in ...

An object is amphichiral (also called reflexible) if it is superposable with its mirror image (i.e., its image in a plane mirror).

A hyperbolic linear map R^n->R^n with integer entries in the transformation matrix and determinant +/-1 is an Anosov diffeomorphism of the n-torus, called an Anosov ...

An antilinear operator A^~ satisfies the following two properties: A^~[f_1(x)+f_2(x)] = A^~f_1(x)+A^~f_2(x) (1) A^~cf(x) = c^_A^~f(x), (2) where c^_ is the complex conjugate ...