Search Results for ""

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

The graph strong product, also known as the graph AND product or graph normal product, is a graph product variously denoted G□AdjustmentBox[x, BoxMargins -> {{-0.65, ...

The Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...

A class formed by sets in R^n which have essentially the same structure, regardless of size, shape and dimension. The "essential structure" is what a set keeps when it is ...

The computation of points or values between ones that are known or tabulated using the surrounding points or values. In particular, given a univariate function f=f(x), ...

A polynomial is said to be irreducible if it cannot be factored into nontrivial polynomials over the same field. For example, in the field of rational polynomials Q[x] (i.e., ...

There are several versions of the Kaplan-Yorke conjecture, with many of the higher dimensional ones remaining unsettled. The original Kaplan-Yorke conjecture (Kaplan and ...

A tree with its nodes labeled. The number of labeled trees on n nodes is n^(n-2), the first few values of which are 1, 1, 3, 16, 125, 1296, ... (OEIS A000272). Cayley (1889) ...

Lagrange multipliers, also called Lagrangian multipliers (e.g., Arfken 1985, p. 945), can be used to find the extrema of a multivariate function f(x_1,x_2,...,x_n) subject to ...

The Laplace-Carson transform F of a real-valued function f is an integral transform defined by the formula F(p)=pint_0^inftye^(-pt)f(t)dt. (1) In most cases, the function F ...