Search Results for ""

A polynomial is said to be irreducible if it cannot be factored into nontrivial polynomials over the same field. For example, in the field of rational polynomials Q[x] (i.e., ...

An irreducible representation of a group is a group representation that has no nontrivial invariant subspaces. For example, the orthogonal group O(n) has an irreducible ...

A ring in which the zero ideal is an irreducible ideal. Every integral domain R is irreducible since if I and J are two nonzero ideals of R, and a in I, b in J are nonzero ...

A submodule N of a module M that is not the intersection of two submodules of M in which it is properly contained. In other words, for all submodules N_1 and N_2 of M, N=N_1 ...

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] ...