We state and prove several theorems that demonstrate how the coordinate Bethe Ansatz for the eigenvectors of suitable transfer matrices of a generalised inhomogeneous five-vertex model on the square lattice, given certain conditions hold, is equivalent to the Gessel-Viennot determinant for the number of configurations of N non-intersecting directed lattice paths, or vicious walkers, with variou...

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process, we show that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs. In higher dimensions, we show NP-completeness ...

A novel approach to the design and implementation of four-channel paraunitary filter banks is presented. It utilizes hypercomplex number theory, which has not yet been employed in these areas. Namely, quaternion multipliers are presented as alternative paraunitary building blocks, which can be regarded as generalizations of Givens (planar) rotations. The corresponding quaternionic lattice struc...

The main problem in (planar) lattice point theory consists in counting lattice points under the graph of positive functions supported on [0,M] and with radius of curvature comparable to M . We prove that, in some sense motivated by Feynman path integral formulation of Quantum Mechanics, for “most” functions the lattice error term in the area approximation is O(M1/2+ε). This complements Jarník c...

Employing a novel type of non-commutative product in the Dirac-Kähler twisted superspace on a lattice, we formulate a field theoretically rigid framework of extended supersymmetry on a lattice. As a first example of this treatment, we calculate one-loop (in some cases any loops) quantum corrections for a twisted Wess-Zumino model with N × N hermitian matrix superfields on a two dimensional latt...

The striking boundary dependency (the Arctic Circle phenomenon) exhibited in the ice model on the square lattice extends to other planar set-ups. We present these findings for the triangular and the Kagomé lattices. Critical connectivity results guarantee that ice configurations can be generated using the simplest and most efficient local actions. Height functions are utilized throughout the an...

We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice graphs such as those on which the game is normally played. We also find bounds on limiting constants that describe the behaviour of the number of legal positions on these lattice graphs as the dimensions of the lattices t...

Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p = 1/2 bond percolation on the square lattice) from general results on the uniqueness of an infinite open cluster when it exists; this argument requires some symmetry. Here we show that a simple modification of Zhang’s argument requires only 2-fold (...