Search Results for ""

A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...

Let a divisor d of n be called a 1-ary (or unitary) divisor if d_|_n/d (i.e., d is relatively prime to n/d). Then d is called a k-ary divisor of n, written d|_kn, if the ...

Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...

A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...

A branch point whose neighborhood of values wrap around the range a finite number of times p as their complex arguments theta varies from 0 to a multiple of 2pi is called an ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

An attractor is a set of states (points in the phase space), invariant under the dynamics, towards which neighboring states in a given basin of attraction asymptotically ...

If, for n>=0, beta_n=sum_(r=0)^n(alpha_r)/((q;q)_(n-r)(aq;q)_(n+r)), (1) then beta_n^'=sum_(r=0)^n(alpha_r^')/((q;q)_(n-r)(aq;q)_(n+r)), (2) where alpha_r^' = ...

A bar (also called an overbar) is a horizontal line written above a mathematical symbol to give it some special meaning. If the bar is placed over a single symbol, as in x^_ ...

The finite zeros of the derivative r^'(z) of a nonconstant rational function r(z) that are not multiple zeros of r(z) are the positions of equilibrium in the field of force ...