TOPICS
Search

Search Results for ""


10261 - 10270 of 13135 for Computational GeometrySearch Results
A proper ideal I of a ring R is called semiprime if, whenever J^n subset I for an ideal J of R and some positive integer, then J subset I. In other words, the quotient ring ...
A Lie algebra over a field of characteristic zero is called semisimple if its Killing form is nondegenerate. The following properties can be proved equivalent for a ...
A Lie group is called semisimple if its Lie algebra is semisimple. For example, the special linear group SL(n) and special orthogonal group SO(n) (over R or C) are ...
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 ...
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 ...
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 separating family is a set of subsets in which each pair of adjacent elements are found separated, each in one of two disjoint subsets. The 26 letters of the alphabet can ...
A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...
A sequence is an ordered set of mathematical objects. Sequences of object are most commonly denoted using braces. For example, the symbol {2n}_(n=1)^infty denotes the ...
A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...

...