Search Results for ""

An axiom proposed by Huntington (1933) as part of his definition of a Boolean algebra, H(x,y)=!(!x v y) v !(!x v !y)=x, (1) where !x denotes NOT and x v y denotes OR. Taken ...

Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary perfect number is a number n such that sigma_infty(n)=2n. The first few are 6, 60, 90, ...

The notion of an inverse is used for many types of mathematical constructions. For example, if f:T->S is a function restricted to a domain S and range T in which it is ...

Some elements of a group G acting on a space X may fix a point x. These group elements form a subgroup called the isotropy group, defined by G_x={g in G:gx=x}. For example, ...

The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...

The Janko-Kharaghani graphs are two strongly regular graph on 936 and 1800 vertices. They have regular parameters (nu,k,lambda,mu)=(936,375,150,150) and (1800,1029,588,588), ...

The Kauffman X-polynomial, also called the normalized bracket polynomial, is a 1-variable knot polynomial denoted X (Adams 1994, p. 153), L (Kauffman 1991, p. 33), or F ...

The l^2-norm (also written "l^2-norm") |x| is a vector norm defined for a complex vector x=[x_1; x_2; |; x_n] (1) by |x|=sqrt(sum_(k=1)^n|x_k|^2), (2) where |x_k| on the ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...