Search Results for ""
2421 - 2430 of 4277 for Graphing FunctionsSearch Results
A map phi:M->M where M is a manifold is C^r structurally stable if any C^r perturbation is topologically conjugate to phi. Here, C^r perturbation means a function psi such ...
The tail of a vector AB^-> is the initial point A, i.e., the point at which the vector originates. The tails of a statistical distribution with probability density function ...
The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...
A transform which localizes a function both in space and scaling and has some desirable properties compared to the Fourier transform. The transform is based on a wavelet ...
The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...
A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...
If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...
Given an n-ball B^n of radius R, find the distribution of the lengths s of the lines determined by two points chosen at random within the ball. The probability distribution ...
Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess countable monotonicity provided that, whenever a set E in S is covered by ...
A set function mu is said to possess countable subadditivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...
...
View search results from all Wolfram sites (500312 matches)

