The principle of indirect elimination

The principle of indirect elimination states that an algorithm for solving discretized differential equations can be used to identify its own bad-converging modes. When the number of bad-converging modes of the algorithm is not too large, the modes thus identified can be used to strongly improve the convergence. The method presented here is applicable to any standard algorithm like Conjugate Gradient, relaxation or multigrid. An example from theoretical physics, the Dirac equation in the presence of almost-zero modes arising from instantons, is studied. Using the principle, bad-converging modes are removed efficiently. Applied locally, the principle is one of the main ingredients of the Iteratively Smooting Unigrid algorithm.Comment: 16 pages, LaTeX-style espart (elsevier preprint style). Three .eps-figures are now added with the figure command

Critical manifold of the kagome-lattice Potts model

Any two-dimensional infinite regular lattice G can be produced by tiling the plane with a finite subgraph B of G; we call B a basis of G. We introduce a two-parameter graph polynomial P_B(q,v) that depends on B and its embedding in G. The algebraic curve P_B(q,v) = 0 is shown to provide an approximation to the critical manifold of the q-state Potts model, with coupling v = exp(K)-1, defined on G. This curve predicts the phase diagram both in the ferromagnetic (v>0) and antiferromagnetic (v<0) regions. For larger bases B the approximations become increasingly accurate, and we conjecture that P_B(q,v) = 0 provides the exact critical manifold in the limit of infinite B. Furthermore, for some lattices G, or for the Ising model (q=2) on any G, P_B(q,v) factorises for any choice of B: the zero set of the recurrent factor then provides the exact critical manifold. In this sense, the computation of P_B(q,v) can be used to detect exact solvability of the Potts model on G. We illustrate the method for the square lattice, where the Potts model has been exactly solved, and the kagome lattice, where it has not. For the square lattice we correctly reproduce the known phase diagram, including the antiferromagnetic transition and the singularities in the Berker-Kadanoff phase. For the kagome lattice, taking the smallest basis with six edges we recover a well-known (but now refuted) conjecture of F.Y. Wu. Larger bases provide successive improvements on this formula, giving a natural extension of Wu's approach. The polynomial predictions are in excellent agreement with numerical computations. For v>0 the accuracy of the predicted critical coupling v_c is of the order 10^{-4} or 10^{-5} for the 6-edge basis, and improves to 10^{-6} or 10^{-7} for the largest basis studied (with 36 edges).Comment: 31 pages, 12 figure

Decoding by Embedding: Correct Decoding Radius and DMT Optimality

The closest vector problem (CVP) and shortest (nonzero) vector problem (SVP) are the core algorithmic problems on Euclidean lattices. They are central to the applications of lattices in many problems of communications and cryptography. Kannan's \emph{embedding technique} is a powerful technique for solving the approximate CVP, yet its remarkable practical performance is not well understood. In this paper, the embedding technique is analyzed from a \emph{bounded distance decoding} (BDD) viewpoint. We present two complementary analyses of the embedding technique: We establish a reduction from BDD to Hermite SVP (via unique SVP), which can be used along with any Hermite SVP solver (including, among others, the Lenstra, Lenstra and Lov\'asz (LLL) algorithm), and show that, in the special case of LLL, it performs at least as well as Babai's nearest plane algorithm (LLL-aided SIC). The former analysis helps to explain the folklore practical observation that unique SVP is easier than standard approximate SVP. It is proven that when the LLL algorithm is employed, the embedding technique can solve the CVP provided that the noise norm is smaller than a decoding radius $\lambda_1/(2\gamma)$, where $\lambda_1$ is the minimum distance of the lattice, and $\gamma \approx O(2^{n/4})$. This substantially improves the previously best known correct decoding bound $\gamma \approx {O}(2^{n})$. Focusing on the applications of BDD to decoding of multiple-input multiple-output (MIMO) systems, we also prove that BDD of the regularized lattice is optimal in terms of the diversity-multiplexing gain tradeoff (DMT), and propose practical variants of embedding decoding which require no knowledge of the minimum distance of the lattice and/or further improve the error performance.Comment: To appear in IEEE Transactions on Information Theor

Non-perturbative running of the average momentum of non-singlet parton densities

We determine non-perturbatively the anomalous dimensions of the second moment of non-singlet parton densities from a continuum extrapolation of results computed in quenched lattice simulations at different lattice spacings. We use a Schr\"odinger functional scheme for the definition of the renormalization constant of the relevant twist-2 operator. In the region of renormalized couplings explored, we obtain a good description of our data in terms of a three-loop expression for the anomalous dimensions. The calculation can be used for exploring values of the coupling where a perturbative expansion of the anomalous dimensions is not valid a priori. Moreover, our results provide the non-perturbative renormalization constant that connects hadron matrix elements on the lattice, renormalized at a low scale, with the experimental results, renormalized at much higher energy scales.Comment: Latex2e file, 6 figures, 25 pages, Corrected errors on linear fit in table 2 and discussion on anomalous dimension of f_

Two-Flavor Staggered Fermion Thermodynamics at N_t = 12

We present results of an ongoing study of the nature of the high temperature crossover in QCD with two light fermion flavors. These results are obtained with the conventional staggered fermion action at the smallest lattice spacing to date---approximately 0.1 fm. Of particular interest are a study of the temperature of the crossover a determination of the induced baryon charge and baryon susceptibility, the scalar susceptibility, and the chiral order parameter, used to test models of critical behavior associated with chiral symmetry restoration. From our new data and published results for N_t = 4, 6, and 8, we determine the QCD magnetic equation of state from the chiral order parameter using O(4) and mean field critical exponents and compare it with the corresponding equation of state obtained from an O(4) spin model and mean field theory. We also present a scaling analysis of the Polyakov loop, suggesting a temperature dependent ``constituent quark free energy.''Comment: LaTeX 25 pages, 15 Postscript figure

The scaling region of the lattice O(N) sigma model at finite temperature

We present results from numerical studies of the finite temperature phase transition of the $(3+1)d$ O(N)-symmetric non-linear sigma model for $N=1,2$ and 3. We study the dependence of the width of the 3d critical region on $N$ and we show that the broken phase scaling region is much wider for N=2 and 3 than for N=1. We also compare the widths of the critical region in the low $T$ and high $T$ phases of the O(2) model and we show that the scaling region in the broken phase is much wider than in the symmetric phase. We also report results for the width of the scaling regions in the low $T$ phase$(2+1)d$ Ising model and we show that the spatial correlation length has to be approximately twice the lattice temporal extent before the 2d scaling region is reached.Comment: 17 pages, 7 figure