Search Results for ""

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

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

A power mean is a mean of the form M_p(a_1,a_2,...,a_n)=(1/nsum_(k=1)^na_k^p)^(1/p), (1) where the parameter p is an affinely extended real number and all a_k>=0. A power ...

For X a topological space, the presheaf F of Abelian groups (rings, ...) on X is defined such that 1. For every open subset U subset= X, an Abelian group (ring, ...) F(U), ...

The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

The radius of curvature is given by R=1/(|kappa|), (1) where kappa is the curvature. At a given point on a curve, R is the radius of the osculating circle. The symbol rho is ...

Let ad=bc, then (1) This can also be expressed by defining (2) (3) Then F_(2m)(a,b,c,d)=a^(2m)f_(2m)(x,y), (4) and identity (1) can then be written ...

A technique for computing eigenfunctions and eigenvalues. It proceeds by requiring J=int_a^b[p(x)y_x^2-q(x)y^2]dx (1) to have a stationary value subject to the normalization ...

For a set of n numbers or values of a discrete distribution x_i, ..., x_n, the root-mean-square (abbreviated "RMS" and sometimes called the quadratic mean), is the square ...