Search Results for ""

The Zernike polynomials are a set of orthogonal polynomials that arise in the expansion of a wavefront function for optical systems with circular pupils. The odd and even ...

A graph G on more than two vertices is said to be k-connected (or k-vertex connected, or k-point connected) if there does not exist a vertex cut of size k-1 whose removal ...

The ABC (atom-bond connectivity) energy of a graph is defined as the graph energy of its ABC matrix, i.e., the sum of the absolute values of the eigenvalues of its ABC matrix.

An abnormal number is a hypothetical number which can be factored into primes in more than one way. Hardy and Wright (1979) prove the fundamental theorem of arithmetic by ...

A function f(x) is absolutely monotonic in the interval a<x<b if it has nonnegative derivatives of all orders in the region, i.e., f^((k))(x)>=0 (1) for a<x<b and k=0, 1, 2, ...

A quantity to be added to another, also called a summand. For example, in the expression a+b+c, a, b, and c are all addends. The first of several addends, or "the one to ...

The identity element of an additive group G, usually denoted 0. In the additive group of vectors, the additive identity is the zero vector 0, in the additive group of ...

The restricted topological group direct product of the group G_(k_nu) with distinct invariant open subgroups G_(0_nu).

A class of knots containing the class of alternating knots. Let c(K) be the link crossing number. Then for knot sum K_1#K_2 which is an adequate knot, ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.