Search Results for ""
1701 - 1710 of 2474 for Set PartitionSearch Results

A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...
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 ...
A foliation which has no Reeb components is said to be Reebless.
A Reinhardt domain with center c is a domain D in C^n such that whenever D contains z_0, the domain D also contains the closed polydisk.
A relation is any subset of a Cartesian product. For instance, a subset of A×B, called a "binary relation from A to B," is a collection of ordered pairs (a,b) with first ...
A topological space is second countable if it has a countable topological basis.
A sigma-compact topological space is a topological space that is the union of countably many compact subsets.
Let X and Y be topological spaces. Then their join is the factor space X*Y=(X×Y×I)/∼, (1) where ∼ is the equivalence relation (x,y,t)∼(x^',y^',t^')<=>{t=t^'=0 and x=x^'; or ; ...
A function f is topologically transitive if, given any two intervals U and V, there is some positive integer k such that f^k(U) intersection V!=emptyset. Vaguely, this means ...
A mathematical relationship transforming a function f(x) to the form f(x+a).

...