Search Results for ""

A ring is called left (respectively, right) Noetherian if it does not contain an infinite ascending chain of left (respectively, right) ideals. In this case, the ring in ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a path polynomial whose coefficients are the numbers of paths of ...

Let (X,A,mu) and (Y,B,nu) be measure spaces, let R be the collection of all measurable rectangles contained in X×Y, and let lambda be the premeasure defined on R by ...

A projective space is a space that is invariant under the group G of all general linear homogeneous transformation in the space concerned, but not under all the ...

Given the generating functions defined by (1+53x+9x^2)/(1-82x-82x^2+x^3) = sum_(n=1)^(infty)a_nx^n (1) (2-26x-12x^2)/(1-82x-82x^2+x^3) = sum_(n=0)^(infty)b_nx^n (2) ...

Given a map f:S->T between sets S and T, the map g:T->S is called a right inverse to f provided that f degreesg=id_T, that is, composing f with g from the right gives the ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...

For a graph vertex x of a graph, let Gamma_x and Delta_x denote the subgraphs of Gamma-x induced by the graph vertices adjacent to and nonadjacent to x, respectively. The ...

An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...

A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...