Search Results for ""

For a general second-order linear recurrence equation f_(n+1)=xf_n+yf_(n-1), (1) define a multiplication rule on ordered pairs by (A,B)(C,D)=(AD+BC+xAC,BD+yAC). (2) The ...

Given a sequence of independent random variates X_1, X_2, ..., if sigma_k^2=var(X_k) and rho_n^2=max_(k<=n)((sigma_k^2)/(s_n^2)), then lim_(n->infty)rho_n^2=0. This means ...

A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...

The fibonomial coefficient (sometimes also called simply the Fibonacci coefficient) is defined by [m; k]_F=(F_mF_(m-1)...F_(m-k+1))/(F_1F_2...F_k), (1) where [m; 0]_F=1 and ...

The eigenvector corresponding to the second smallest eigenvalue (i.e., the algebraic connectivity) of the Laplacian matrix of a graph G. The Fiedler vector is used in ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...

The first Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_1=sum_(i=1)^nd_i^2. The notations Z_1 (e.g., Lin et al. 2023) ...

Five point geometry is a finite geometry subject to the following three axioms: 1. there exist exactly five points, 2. each two distinct points have exactly one line on both ...

For a particular format in the IEEE 754-2008 framework, a normal number is a finite nonzero floating-point number with magnitude greater than or equal to a minimum value ...