TOPICS
Search

Search Results for ""


21 - 30 of 223 for electronic configurationSearch Results
An ordered finite configuration with certain pairs of points, called cables, which are constrained not to get further apart and certain other pairs of points, called struts, ...
If the three straight lines joining the corresponding vertices of two triangles ABC and A^'B^'C^' all meet in a point (the perspector), then the three intersections of pairs ...
The Reye graph is the transposition graph G_4 of order 4.
Let DeltaA^'B^'C^' be a triangle perspective to a reference triangle DeltaABC with perspector D^(''). Let A^('') be the intersection of lines BC^' and CB^', B^('') the ...
The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...
Let F(n) be a family of partitions of n and let F(n,d) denote the set of partitions in F(n) with Durfee square of size d. The Durfee polynomial of F(n) is then defined as the ...
A distribution of error such that the error remaining is always given approximately by the last term dropped.
Let D be a planar Abelian difference set and t be any divisor of n. Then t is a numerical multiplier of D, where a multiplier is defined as an automorphism alpha of a group G ...
A Meeussen sequence is an increasing sequence of positive integers (m_1, m_2, ...) such that m_1=1, every nonnegative integer is the sum of a subset of the {m_i}, and each ...
A 1-form omega=sum_(i=1)^na_i(x)dx_i such that omega=0.
1|2|3|4|5|6 ... 23 Previous Next

...