Search Results for ""

A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...

The Casoratian of sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) is defined by the k×k determinant C(x_n^((1)),x_n^((2)),...,x_n^((k))) =|x_n^((1)) x_n^((2)) ... x_n^((k)); ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

A rational number expressed in the form a/b (in-line notation) or a/b (traditional "display" notation), where a is called the numerator and b is called the denominator. When ...

Let G be a Lie group and let rho be a group representation of G on C^n (for some natural number n), which is continuous in the sense that the function G×C^n->C^n defined by ...

The tetrix is the three-dimensional analog of the Sierpiński sieve illustrated above, also called the Sierpiński sponge or Sierpiński tetrahedron. The nth iteration of the ...

Consider the family of ellipses (x^2)/(c^2)+(y^2)/((1-c)^2)-1=0 (1) for c in [0,1]. The partial derivative with respect to c is -(2x^2)/(c^3)+(2y^2)/((1-c)^3)=0 (2) ...

The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...

The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...