Search Results for ""
31 - 40 of 584 for Binary SplittingSearch Results
Take K a number field and m a divisor of K. A congruence subgroup H is defined as a subgroup of the group of all fractional ideals relative prime to m (I_K^m) that contains ...
A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...
The longest increasing (contiguous) subsequence of a given sequence is the subsequence of increasing terms containing the largest number of elements. For example, the longest ...
Consider the plane figure obtained by drawing each diagonal in a regular polygon. If each point of intersection is associated with a node and diagonals are split ar each ...
A specification of elements in a list as a list of pairs giving the element and number of times it occurs in a run. For example, given the list ...
A "split" extension G of groups N and F which contains a subgroup F^_ isomorphic to F with G=F^_N^_ and F^_ intersection N^_={e} (Ito 1987, p. 710). Then the semidirect ...
A short exact sequence of groups A, B, and C is given by two maps alpha:A->B and beta:B->C and is written 0->A->B->C->0. (1) Because it is an exact sequence, alpha is ...
Take K a number field and L an Abelian extension, then form a prime divisor m that is divided by all ramified primes of the extension L/K. Now define a map phi_(L/K) from the ...
The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...
Given a set P of primes, a field K is called a class field if it is a maximal normal extension of the rationals which splits all of the primes in P, and if P is the maximal ...
...
View search results from all Wolfram sites (5234 matches)

