Search Results for ""

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a local polarity if and only if for each finite set X subset= L, there is a finitely generated ...

A circle having a given number of lattice points on its circumference. The Schinzel circle having n lattice points is given by the equation {(x-1/2)^2+y^2=1/45^(k-1) for n=2k ...

Let A be the area of a simply closed lattice polygon. Let B denote the number of lattice points on the polygon edges and I the number of points in the interior of the ...

Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

A Dyck path is a staircase walk from (0,0) to (n,n) that lies strictly below (but may touch) the diagonal y=x. The number of Dyck paths of order n is given by the Catalan ...

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 ...

Consider a collection of diagonal matrices H_1,...,H_k, which span a subspace h. Then the ith eigenvalue, i.e., the ith entry along the diagonal, is a linear functional on h, ...

A lattice polygon formed by a three-choice walk. The anisotropic perimeter and area generating function G(x,y,q)=sum_(m>=1)sum_(n>=1)sum_(a>=a)C(m,n,a)x^my^nq^a, where ...

In a lattice, any two elements a and b have a least upper bound. This least upper bound is often called the join of a and b, and is denoted by a v b. One can also speak of ...