Search Results for ""
331 - 340 of 1833 for Disk_covering_problemSearch Results
A point where a stable and an unstable separatrix (invariant manifold) from the same fixed point or same family intersect. Therefore, the limits lim_(k->infty)f^k(X) and ...
Let S be a subset of a metric space. Then the set S is open if every point in S has a neighborhood lying in the set. An open set of radius r and center x_0 is the set of all ...
There are at least two integrals called the Poisson integral. The first is also known as Bessel's second integral, ...
Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...
A subset S of a topological space X is compact if for every open cover of S there exists a finite subcover of S.
Conditions at an initial time t=t_0 from which a given set of mathematical equations or physical system evolves. A system with initial conditions specified is known as an ...
A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.
A cycle double cover of an undirected graph is a collection of cycles that cover each edge of the graph exactly twice. For a polyhedral graph, the faces of a corresponding ...
Let the characteristic polynomial of an n×n complex matrix A be written in the form P(lambda) = |lambdaI-A| (1) = ...
If the knot K is the boundary K=f(S^1) of a singular disk f:D->S^3 which has the property that each self-intersecting component is an arc A subset f(D^2) for which f^(-1)(A) ...
...
View search results from all Wolfram sites (161691 matches)

