Search Results for ""

Let M^n be an n-manifold and let F={F_alpha} denote a partition of M into disjoint pathwise-connected subsets. Then if F is a foliation of M, each F_alpha is called a leaf ...

A number triangle of order n with entries 1 to n such that entries are nondecreasing across rows and down columns and all entries in column j are less than or equal to j. An ...

When a closed interval [a,b] is partitioned by points a<x_1<x_2<...<x_(n-1)<b, the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ..., ...

A set of blocks, also called a resolution class, that partition the set V, where (V,B) is a balanced incomplete block design.

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.

The topological entropy of a map M is defined as h_T(M)=sup_({W_i})h(M,{W_i}), where {W_i} is a partition of a bounded region W containing a probability measure which is ...

A transversal design TD_lambda(k,n) of order n, block size k, and index lambda is a triple (V, G, B) such that 1. V is a set of kn elements, 2. G is a partition of V into k ...

A hexagon tiling is a tiling of the plane by identical hexagons. The regular hexagon forms a regular tessellation, also called a hexagonal grid, illustrated above. There are ...

Hoggatt and Denman (1961) showed that any obtuse triangle can be divided into eight acute isosceles triangles. There are 1, 4, 23, 180, 1806, 20198, ... (OEIS A056814) ...

Just as many interesting integer sequences can be defined and their properties studied, it is often of interest to additionally determine which of their elements are prime. ...