Search Results for ""

A projection of a figure by parallel rays. In such a projection, tangencies are preserved. Parallel lines project to parallel lines. The ratio of lengths of parallel segments ...

The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...

Three types of n×n matrices can be obtained by writing Pascal's triangle as a lower triangular matrix and truncating appropriately: a symmetric matrix S_n with (S)_(ij)=(i+j; ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

For a permutation alpha in the symmetric group S_p, the alpha-permutation graph of a labeled graph G is the graph union of two disjoint copies of G (say, G_1 and G_2), ...

A plesiohedron is the Voronoi cell of a so-called symmetric Delone set. Plesiohedra are space-filling polyhedra which have special symmetries that take any copy of the ...

The statistics h_(r,s,...) defined such that <h_(r,s,...)>=mu_rmu_s..., where mu_r is a central moment. These statistics generalize h-statistics and were originally called ...

The symmetric statistic k_(r,s,...) defined such that <k_(r,s,...)>=kappa_rkappa_s..., (1) where kappa_r is a cumulant. These statistics generalize k-statistic and were ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

The Pythagoras tree is a fractal constructed iteratively from a right triangle with squares erected on each of the sides. Subsequent iterations add additional similar right ...