Search Results for ""

Let V be a variety, and write G(V) for the set of divisors, G_l(V) for the set of divisors linearly equivalent to 0, and G_a(V) for the group of divisors algebraically equal ...

A two-dimensional binary (k=2) totalistic cellular automaton with a von Neumann neighborhood of range r=1. It has a birth rule that at least 2 of its 4 neighbors are alive, ...

The parity of an integer is its attribute of being even or odd. Thus, it can be said that 6 and 14 have the same parity (since both are even), whereas 7 and 12 have opposite ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...

The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...

The Euler-Maclaurin integration and sums formulas can be derived from Darboux's formula by substituting the Bernoulli polynomial B_n(t) in for the function phi(t). ...

Marion's theorem (Mathematics Teacher 1993, Maushard 1994, Morgan 1994) states that the area of the central hexagonal region determined by trisection of each side of a ...

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 module M over a unit ring R is called faithful if for all distinct elements a, b of R, there exists x in M such that ax!=bx. In other words, the multiplications by a and by ...

A quartic symmetric graph is a symmetric graph that is also quartic (i.e., regular of degree 4). The numbers of symmetric quartic graphs on n=1, 2, ... are 0, 0, 0, 0, 1, 1, ...