Search Results for ""

For a partial order, the size of the longest chain is called the length.

For a partial order, the size of the longest antichain is called the width.

A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...

Let c=(c_1,...,c_n) be a point in C^n, then the open polydisk is defined by S={z:|z_j-c_j|<|z_j^0-c_j|} for j=1, ..., n.

A function f defined on a subset S subset R^n is said to be pseudoconcave if -f is pseudoconvex.

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 ...