Search Results for ""

A Maurer rose is a plot of a "walk" along an n- (or 2n-) leafed rose curve in steps of a fixed number d degrees, including all cosets.

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=max_(i)(a_i+a_(n-i)).

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

Let (A,<=) be a partially ordered set. Then an element m in A is said to be maximal if, for all a in A, m!<=a. Alternatively, an element m in A is maximal such that if m<=a ...

A maximal ideal of a ring R is an ideal I, not equal to R, such that there are no ideals "in between" I and R. In other words, if J is an ideal which contains I as a subset, ...

Let A be a commutative complex Banach algebra. The space of all characters on A is called the maximal ideal space (or character space) of A. This space equipped with the ...

The proposition that every proper ideal of a Boolean algebra can be extended to a maximal ideal. It is equivalent to the Boolean representation theorem, which can be proved ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...