Search Results for ""
71 - 80 of 464 for Combinatorial designSearch Results
A method to obtain a signal C_l(z) with a flat spectrum c(theta;z) (such as a pulse), but having a smaller amplitude than the pulse. ...
One of the disjoint subsets making up a set partition. A block containing n elements is called an n-block. The partitioning of sets into blocks can be denoted using a ...
A polygon whose vertices do not all lie in a plane.
The placement of n points on a sphere so as to minimize the maximum distance of any point on the sphere from the closest one of the n points.
A parallelogram (parallelepiped) containing the minimum repeatable elements of a circle (sphere) packing.
A polygon whose interior consists of all points in the plane which are closer to a particular lattice point than to any other. The generalization to n dimensions is called a ...
The Andrews-Gordon identity (Andrews 1974) is the analytic counterpart of Gordon's combinatorial generalization of the Rogers-Ramanujan identities (Gordon 1961). It has a ...
A block is a maximal connected subgraph of a given graph G that has no articulation vertex (West 2000, p. 155). If a block has more than two vertices, then it is biconnected. ...
A demiregular tessellation, also called a polymorph tessellation, is a type of tessellation whose definition is somewhat problematical. Some authors define them as orderly ...
A Room square (named after T. G. Room) of order n (for n even) is an arrangement in an (n-1)×(n-1) square matrix of n objects such that each cell is either empty or holds ...
...