Search Results for ""
11441 - 11450 of 13135 for General Number Field SieveSearch Results
The Radon-Nikodym theorem asserts that any absolutely continuous complex measure lambda with respect to some positive measure mu (which could be Lebesgue measure or Haar ...
Let the two-dimensional cylinder function be defined by f(x,y)={1 for r<R; 0 for r>R. (1) Then the Radon transform is given by ...
R(p,tau)=int_(-infty)^inftyint_(-infty)^inftyf(x,y)delta[y-(tau+px)]dydx, (1) where f(x,y)={1 for x,y in [-a,a]; 0 otherwise (2) and ...
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 ...
The ramp function is defined by R(x) = xH(x) (1) = int_(-infty)^xH(x^')dx^' (2) = int_(-infty)^inftyH(x^')H(x-x^')dx^' (3) = H(x)*H(x), (4) where H(x) is the Heaviside step ...
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 ...
...
View search results from all Wolfram sites (114405 matches)

