Search Results for ""

A graph for which every node has finite degree.

If every component L of X/O_(p^')(X) satisfies the "Schreler property," then L_(p^')(Y)<=L_(p^')(X) for every p-local subgroup Y of X, where L_(p^') is the p-layer.

Let f(x) be a finite and measurable function in (-infty,infty), and let epsilon be freely chosen. Then there is a function g(x) such that 1. g(x) is continuous in ...

The Lyons group is the sporadic group Ly of order |Ly| = 51765179004000000 (1) = 2^8·3^7·5^6·7·11·31·37·67. (2) It is implemented in the Wolfram Language as LyonsGroupLy[].

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).

A theorem which treats constructions of fields of field characteristic p.

It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

If a matrix group is reducible, then it is completely reducible, i.e., if the matrix group is equivalent to the matrix group in which every matrix has the reduced form ...

A group in which the elements are square matrices, the group multiplication law is matrix multiplication, and the group inverse is simply the matrix inverse. Every matrix ...