Search Results for ""

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...

A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...

A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...

The triangular snake graph TS_n is the graph on n vertices with n odd defined by starting with the path graph P_(n-1) and adding edges (2i-1,2i+1) for i=1, ..., n-1. The ...

The number of data points which fall within a given class in a frequency distribution.

The portion of number theory concerned with expressing an integer as a sum of integers from some given set.

A group in which any decreasing chain of distinct subgroups terminates after a finite number.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

A class number formula is a finite series giving exactly the class number of a ring. For a ring of quadratic integers, the class number is denoted h(d), where d is the ...

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...