Search Results for ""
6491 - 6500 of 13135 for Computational GeometrySearch Results
A broad area of mathematics connected with functional analysis, differential equations, index theory, representation theory, and mathematical physics.
The illusion illustrated above in which the bounding rectangle and inner square both appear distorted.
The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...
A tree is planted at each lattice point in a circular orchard which has center at the origin and radius r. If the radius of trees exceeds 1/r units, one is unable to see out ...
A topology defined on a totally ordered set X whose open sets are all the finite intersections of subsets of the form {x in X|x>a} or {x in X|x<a}, where a in X. The order ...
The number of nondecreasing lists {a_1,a_2,...,a_n} consisting of n elements 1<=a_i<=k is given by the binomial coefficient N(n,k)=(n+k-1; n-1). For example, there are six ...
A pair of quantities (a, b) where ordering is significant, so (a, b) is considered distinct from (b, a) for a!=b.
An ambiguous term which is sometimes used to mean a partially ordered set and sometimes to mean a totally ordered set.
A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.
The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...
...
View search results from all Wolfram sites (173967 matches)

