TOPICS
Search

Search Results for ""


21 - 30 of 584 for Binary SplittingSearch Results
The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...
The determinant of a binary quadratic form Au^2+2Buv+Cv^2 is defined as D=AC-B^2. It is equal to 1/4 of the corresponding binary quadratic form discriminant. Unfortunately, ...
The discriminant of a binary quadratic form au^2+buv+cv^2 is defined by d=4ac-b^2. It is equal to four times the corresponding binary quadratic form determinant. ...
The binary quadratic form F=<a,b,c> is said to be reduced if the following conditions hold. Let D=b^2-4ac be the discriminant, then 1. If D is negative, F is reduced if ...
A polynomial p(x)=sumc_ix^i is said to split over a field K if p(x)=aproduct_(i)(x-alpha_i) where a and alpha_i are in K. Then the polynomial is said to split into linear ...
A flow defined analogously to the axiom A diffeomorphism, except that instead of splitting the tangent bundle into two invariant sub-bundles, they are split into three (one ...
A flow defined analogously to the Anosov diffeomorphism, except that instead of splitting the tangent bundle into two invariant sub-bundles, they are split into three (one ...
Let L be a finite-dimensional split semisimple Lie algebra over a field of field characteristic 0, H a splitting Cartan subalgebra, and Lambda a weight of H in a ...
A short exact sequence of groups 0-->A-->B-->C-->0 (1) is called split if it essentially presents B as the direct sum of the groups A and C. More precisely, one can construct ...
A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...
1|2|3|4|5|6 ... 59 Previous Next

...