Search Results for ""

A regular graph that is edge-transitive but not vertex-transitive is called a semisymmetric graph (Marušič and Potočnik 2001). In contrast, any graph that is both ...

The Sendov conjecture, proposed by Blagovest Sendov circa 1958, that for a polynomial f(z)=(z-r_1)(z-r_2)...(z-r_n) with n>=2 and each root r_k located inside the closed unit ...

The probability that a statistical test will be positive for a true statistic.

A sentence is a logic formula in which every variable is quantified. The concept of a sentence is important because formulas with variables that are not quantified are ...

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 separable extension K of a field F is one in which every element's algebraic number minimal polynomial does not have multiple roots. In other words, the minimal polynomial ...

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

A polynomial with coefficients in a field is separable if its factors have distinct roots in some extension field.