The gluon propagator from large asymmetric lattices

The Landau-gauge gluon propagator is computed for the SU(3) gauge theory on lattices up to a size of $32^3 \times 200$. We use the standard Wilson action at $\beta = 6.0$ and compare our results with previous computations using large asymmetric and symmetric lattices. In particular, we focus on the impact of the lattice geometry and momentum cuts to achieve compatibility between data from symmetric and asymmetric lattices for a large range of momenta.Comment: Poster presented at Lattice2007, Regensburg, July 30 - August 4, 200

Sound and complete axiomatizations of coalgebraic language equivalence

Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and complete with respect to behavioral equivalence can be extended to a coarser coalgebraic language equivalence, which arises from a generalised powerset construction that determinises coalgebras. We show that soundness and completeness are established by proving that expressions modulo axioms of a calculus form the rational fixpoint of the given type functor. Our main result is that the rational fixpoint of the functor $FT$, where $T$ is a monad describing the branching of the systems (e.g. non-determinism, weights, probability etc.), has as a quotient the rational fixpoint of the "determinised" type functor $\bar F$, a lifting of $F$ to the category of $T$-algebras. We apply our framework to the concrete example of weighted automata, for which we present a new sound and complete calculus for weighted language equivalence. As a special case, we obtain non-deterministic automata, where we recover Rabinovich's sound and complete calculus for language equivalence.Comment: Corrected version of published journal articl