Search Results for ""

Given a general second tensor rank tensor A_(ij) and a metric g_(ij), define theta = A_(ij)g^(ij)=A_i^i (1) omega^i = epsilon^(ijk)A_(jk) (2) sigma_(ij) = ...

An algebraic variety is called irreducible if it cannot be written as the union of nonempty algebraic varieties. For example, the set of solutions to xy=0 is reducible ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...

Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...

The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...

A relation R on a set S is irreflexive provided that no element is related to itself; in other words, xRx for no x in S.

If p divides the numerator of the Bernoulli number B_(2k) for 0<2k<p-1, then (p,2k) is called an irregular pair. For p<30000, the irregular pairs of various forms are p=16843 ...

In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...

Consider a second-order ordinary differential equation y^('')+P(x)y^'+Q(x)y=0. If P(x) and Q(x) remain finite at x=x_0, then x_0 is called an ordinary point. If either P(x) ...