Search Results for ""

For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...

Let R+B be the number of monochromatic forced triangles (where R and B are the number of red and blue triangles) in an extremal graph. Then R+B=(n; 3)-|_1/2n|_1/4(n-1)^2_|_|, ...

There exist infinitely many n>0 with p_n^2>p_(n-i)p_(n+i) for all i<n, where p_n is the nth prime. Also, there exist infinitely many n>0 such that 2p_n<p_(n-i)+p_(n+i) for ...

An expression which is a sentence or which contains variables and becomes a sentence upon appropriate substitutions for these variables (Carnap 1958, p. 24). Sentential ...

A sentential variable, also called a propositional variable, that can be substituted for in arbitrary sentential formulas (Carnap 1958, p. 24).

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

A morphism f:X->Y is said to be separable if K(X) is a separable extension of K(Y).

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

One of the disjoint subsets making up a set partition. A block containing n elements is called an n-block. The partitioning of sets into blocks can be denoted using a ...

The definition of a set by enumerating its members. An extensional definition can always be reduced to an intentional one. An extension field is sometimes also called simply ...