Search Results for ""

The p×p square matrix formed by setting s_(ij)=xi^(ij), where xi is a pth root of unity. The Schur matrix has a particularly simple determinant given by ...

The Sombor matrix A_(Sombor) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the graph. In ...

The exponential factorial is defined by the recurrence relation a_n=n^(a_(n-1)), (1) where a_0=1. The first few terms are therefore a_1 = 1 (2) a_2 = 2^1=2 (3) a_3 = ...

The exponential function has two different natural q-extensions, denoted e_q(z) and E_q(z). They are defined by e_q(z) = sum_(n=0)^(infty)(z^n)/((q;q)_n) (1) = _1phi_0[0; ...

The Jordan matrix decomposition is the decomposition of a square matrix M into the form M=SJS^(-1), (1) where M and J are similar matrices, J is a matrix of Jordan canonical ...

Let S={x_1,...,x_n} be a set of n distinct positive integers. Then the matrix [S]_n having the least common multiple LCM(x_i,x_j) of x_i and x_j as its i,jth entry is called ...

If the Tutte polynomial T(x,y) of a graph G is given by sumt_(rs)x^ry^s, then the matrix (t_(rs)) is called the rank matrix of G. For example, the Tutte matrix of the ...

A (-1,0,1)-matrix is a matrix whose elements consist only of the numbers -1, 0, or 1. The number of distinct (-1,0,1)-n×n matrices (counting row and column permutations, the ...

An upper triangular matrix U is defined by U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... ...

A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...