Search Results for ""

Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...

A parallelogram polyomino is a polyomino such that the intersection with every line perpendicular to the main diagonal is a connected segment. The number of parallelogram ...

A lattice polygon consisting of a closed self-avoiding walk on a square lattice. The perimeter, horizontal perimeter, vertical perimeter, and area are all well-defined for ...

Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...

Let (L,<=) be any complete lattice. Suppose f:L->L is monotone increasing (or isotone), i.e., for all x,y in L, x<=y implies f(x)<=f(y). Then the set of all fixed points of f ...

A bivariate polynomial is a polynomial in two variables. Bivariate polynomials have the form f(x,y)=sum_(i,j)a_(i,j)x^iy^j. A homogeneous bivariate polynomial, also called a ...

Let a_n>=0 and suppose sum_(n=1)^inftya_ne^(-an)∼1/a as a->0^+. Then sum_(n<=x)a_n∼x as x->infty. This theorem is a step in the proof of the prime number theorem, but has ...

The statistical index P_H=(sumv_0)/(sum(v_0p_0)/(p_n))=(sump_0q_0)/(sum(p_0^2q_0)/(p_n)), where p_n is the price per unit in period n, q_n is the quantity produced in period ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...

The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...