Lattice discretisation errors in the Landau gauge condition are examined. An improved gauge fixing algorithm in which O(a 2) errors are removed is presented. O(a 2) improvement of the gauge fixing condition displays the secondary benefit of reducing the size of higher-order errors. These results emphasise the importance of implementing an improved gauge fixing condition.

Lattice discretisation errors in the Landau gauge condition are examined. An improved gauge fixing algorithm in which O(a 2) errors are removed is presented. O(a 2) improvement of the gauge fixing condition displays the secondary benefit of reducing the size of higher-order errors. These results emphasise the importance of implementing an improved gauge fixing condition.

A useful choice of gauge when including null infinity in the computational domain is scri-fixing, that is, fixing the spatial coordinate location of null infinity. This choice allows us to avoid the introduction of artificial timelike outer boundaries in numerical calculations. We construct manifestly stationary scri-fixing coordinates explicitly on Minkowski, Schwarzschild and Kerr spacetimes....

We introduce an elementary method using only property of polynomials to give unified proofs of the Dyson, Morris, and Aomoto constant term identities. Such constant terms are polynomial in one parameter when fixing the others, and hence can be proved by finding the roots. When applying our method to the Forrester conjecture, we confirm many roots. As consequences, we reprove the cases N1 = 2, 3...

The celebrated LAMBDA method has been widely used in GNSS for fixing integer ambiguities. For real time kinematic GNSS applications with high dimensions, the computational speed is crucial. In this paper a modified LAMBDA method (MLAMBDA) is presented. Several strategies are proposed to reduce the computational complexity. Numerical simulations show that MLAMBDA is (much) faster than LAMBDA. IO...