Search Results for ""

Two curves phi and psi satisfying phi+psi=0 are said to be linearly dependent. Similarly, n curves phi_i, i=1, ..., n are said to be linearly dependent if sum_(i=1)^nphi_i=0.

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

Let pi_n(x)=product_(k=0)^n(x-x_k), (1) then f(x)=f_0+sum_(k=1)^npi_(k-1)(x)[x_0,x_1,...,x_k]+R_n, (2) where [x_1,...] is a divided difference, and the remainder is ...

An operator which describes the time evolution of densities in phase space. The operator can be defined by rho_(n+1)=L^~rho_n, where rho_n are the natural invariants after ...

If mu=(mu_1,mu_2,...,mu_n) is an arbitrary set of positive numbers, then all eigenvalues lambda of the n×n matrix a=a_(ij) lie on the disk |z|<=m_mu, where ...

For a point y in Y, with f(y)=x, the ramification index of f at y is a positive integer e_y such that there is some open neighborhood U of y so that x has only one preimage ...

For P and Q polynomials in n variables, |P·Q|_2^2=sum_(i_1,...,i_n>=0)(|P^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n)|_2^2)/(i_1!...i_n!), where D_i=partial/partialx_i, |X|_2 ...

The structure factor S_Gamma of a discrete set Gamma is the Fourier transform of delta-scatterers of equal strengths on all points of Gamma, S_Gamma(k)=intsum_(x in ...