Search Results for ""

An n-he (a term coined by Brendan Owen) is a shape formed from a polyhex by removing half of each hexagon in such a way that the remaining pieces are connected (Clarke). The ...

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 ...

Polykites are polyforms obtained from a regular triangular grid superposed on a regular hexagonal grid (its dual), illustrated above. The monokite is therefore a ...

There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...

A map defined by one or more polynomials. Given a field K, a polynomial map is a map f:K^n->K^m such that for all points (x_1,...,x_n) in K^n, ...

For a polynomial P=sum_(k=0)^na_kz^k, (1) several classes of norms are commonly defined. The l_p-norm is defined as ||P||_p=(sum_(k=0)^n|a_k|^p)^(1/p) (2) for p>=1, giving ...

The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

A polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...