Search Results for ""

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

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.

If f(x) is positive and decreases to 0, then an Euler constant gamma_f=lim_(n->infty)[sum_(k=1)^nf(k)-int_1^nf(x)dx] can be defined. For example, if f(x)=1/x, then ...

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 number triangle of order n with entries 1 to n such that entries are nondecreasing across rows and down columns and all entries in column j are less than or equal to j. An ...

Let K be a field of field characteristic 0 (e.g., the rationals Q) and let {u_n} be a sequence of elements of K which satisfies a difference equation of the form ...