TOPICS
Search

Search Results for ""


10291 - 10300 of 13135 for Probability Generating FunctionSearch Results
Any set of n+2 points in R^n can always be partitioned in two subsets V_1 and V_2 such that the convex hulls of V_1 and V_2 intersect.
Given a straight segment of track of length l, add a small segment Deltal so that the track bows into a circular arc. Find the maximum displacement d of the bowed track. The ...
Let ad=bc, then (1) This can also be expressed by defining (2) (3) Then F_(2m)(a,b,c,d)=a^(2m)f_(2m)(x,y), (4) and identity (1) can then be written ...
Oloa (2010, pers. comm., Jan. 20, 2010) has considered the following integrals containing nested radicals of 1/2 plus terms in theta^2 and ln^2costheta: R_n^- = (1) R_n^+ = ...
Ramsey's theorem is a generalization of Dilworth's lemma which states for each pair of positive integers k and l there exists an integer R(k,l) (known as the Ramsey number) ...
The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.
The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...
The Randić matrix A_(Randic) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=1/(sqrt(d_id_j)), (1) where d_i are the vertex degrees of the graph. In ...
The Randić spectral radius rho_(Randic) of a graph is defined as the largest eigenvalue of its Randić matrix.
A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...

...