Search Results for ""

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

A maximal ideal of a ring R is an ideal I, not equal to R, such that there are no ideals "in between" I and R. In other words, if J is an ideal which contains I as a subset, ...

The McLaughlin group is the sporadic group McL of order |McL| = 898128000 (1) = 2^7·3^6·5^3·7·11. (2) It is implemented in the Wolfram Language as McLaughlinGroupMcL[].

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...

A modular inverse of an integer b (modulo m) is the integer b^(-1) such that bb^(-1)=1 (mod m). A modular inverse can be computed in the Wolfram Language using PowerMod[b, ...

The direct sum of modules A and B is the module A direct sum B={a direct sum b|a in A,b in B}, (1) where all algebraic operations are defined componentwise. In particular, ...

Möbius tetrahedra, also called Möbius tetrads (Baker 1922, pp. 61-62) are a pair of tetrahedra, each of which has all the vertices lying on the faces of the other: in other ...

If a complex function f is analytic in a disk contained in a simply connected domain D and f can be analytically continued along every polygonal arc in D, then f can be ...