TOPICS
Search

Search Results for ""


411 - 420 of 782 for Disc MethodSearch Results
The Rogers-Selberg identities are a set of three analytic q-series identities of Rogers-Ramanujan-type appearing as equation 33, 32, and 31 in Slater (1952), A(q) = ...
A stacked (or generalized) prism graph Y_(m,n) is a simple graph given by the graph Cartesian product Y_(m,n)=C_m square P_n (Gallian 2007) for positive integers m,n with ...
A Steiner quadruple system is a Steiner system S(t=3,k=4,v), where S is a v-set and B is a collection of k-sets of S such that every t-subset of S is contained in exactly one ...
A uniquely pancyclic graph is a graph that has exactly one cycle of each length between 3 and the graph's vertex count. Uniquely pancyclic graphs are therefore a special case ...
Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...
The Wythoff array is an interspersion array that can be constructed by beginning with the Fibonacci numbers {F_2,F_3,F_4,F_5,...} in the first row and then building up ...
A symbol consisting of three rational numbers that can be used to describe uniform polyhedra based on how a point C in a spherical triangle can be selected so as to trace the ...
Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...
A Lyapunov function is a scalar function V(y) defined on a region D that is continuous, positive definite, V(y)>0 for all y!=0), and has continuous first-order partial ...
A two-dimensional map also called the Taylor-Greene-Chirikov map in some of the older literature and defined by I_(n+1) = I_n+Ksintheta_n (1) theta_(n+1) = theta_n+I_(n+1) ...
1 ... 39|40|41|42|43|44|45 ... 79 Previous Next

...