TOPICS
Search

Search Results for ""


7301 - 7310 of 13135 for Computational GeometrySearch Results
X fulfils the T1-separation axiom and is regular. A space satisfying the T_3-separation axiom is said to be a T3-space.
A topological space fulfilling the T3-separation axiom: X fulfils the T1-separation axiom and is regular. According to the terminology of Alexandroff and Hopf (1972), ...
A topological space X fulfils the T1-separation axiom and is normal. A space fulfilling the T_4-separation axiom is said to be a T4-space.
A topological space fulfilling the T_4-axiom: X fulfils the T1-separation axiom and is normal. In the terminology of Alexandroff and Hopf (1972), T_4-space are called Tietze ...
When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...
The tail of a vector AB^-> is the initial point A, i.e., the point at which the vector originates. The tails of a statistical distribution with probability density function ...
A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).
A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...
An (n,k)-talisman hexagon is an arrangement of nested hexagons containing the integers 1, 2, ..., H_n=3n(n-1)+1, where H_n is the nth hex number, such that the difference ...
An n×n array of the integers from 1 to n^2 such that the difference between any one integer and its neighbor (horizontally, vertically, or diagonally, without wrapping ...
1 ... 728|729|730|731|732|733|734 ... 1314 Previous Next

...