Search Results for ""

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

Another name for the confluent hypergeometric function of the second kind, defined by where Gamma(x) is the gamma function and _1F_1(a;b;z) is the confluent hypergeometric ...

An algebraic ring which appears in treatments of duality in algebraic geometry. Let A be a local Artinian ring with m subset A its maximal ideal. Then A is a Gorenstein ring ...

A decomposition of a module into a direct sum of submodules. The index set for the collection of submodules is then called the grading set. Graded modules arise naturally in ...

A unit of angular measure in which the angle of an entire circle is 400 gradians. A right angle is therefore 100 gradians. A gradian is sometimes also called a gon or a grade.

The determinant G(f_1,f_2,...,f_n)=|intf_1^2dt intf_1f_2dt ... intf_1f_ndt; intf_2f_1dt intf_2^2dt ... intf_2f_ndt; | | ... |; intf_nf_1dt intf_nf_2dt ... intf_n^2dt|.

Given a set V of m vectors (points in R^n), the Gram matrix G is the matrix of all possible inner products of V, i.e., g_(ij)=v_i^(T)v_j. where A^(T) denotes the transpose. ...

Let f_1(x), ..., f_n(x) be real integrable functions over the closed interval [a,b], then the determinant of their integrals satisfies

The term in rigidity theory for the edges of a graph.

The composition G=G_1[G_2] of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with point vertex V_1×V_2 and u=(u_1,u_2) ...