Search Results for ""
1111 - 1120 of 3024 for Well Ordered SetSearch Results
Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...
The pathological function f_a(x)=sum_(k=1)^infty(sin(pik^ax))/(pik^a) (originally defined for a=2) that is continuous but differentiable only on a set of points of measure ...
A bar (also called an overbar) is a horizontal line written above a mathematical symbol to give it some special meaning. If the bar is placed over a single symbol, as in x^_ ...
The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...
The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...
In the field of functional analysis, the Krein-Milman theorem is a result which characterizes all (nonempty) compact convex subsets K of "sufficiently nice" topological ...
A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...
Baire's category theorem, also known as Baire's theorem and the category theorem, is a result in analysis and set theory which roughly states that in certain spaces, the ...
A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...
A sequence of positive integers 1<=a_1<a_2<a_3<... (1) is a nonaveraging sequence if it contains no three terms which are in an arithmetic progression, i.e., terms such that ...
...
View search results from all Wolfram sites (37299 matches)

