Center Dominance in SU(2) Gauge-Higgs Theory

We study the SU(2) gauge-Higgs system in D=4 dimensions, and analyze the influence of the fundamental-representation Higgs field on the vortex content of the gauge field. It is shown that center projected Polyakov lines, at low temperature, are finite in the infinite volume limit, which means that the center vortex distribution is consistent with color screening. In addition we confirm and further investigate the presence of a "Kertesz-line" in the strong-coupling region of the phase diagram, which we relate to the percolation properties of center vortices. It is shown that this Kertesz-line separates the gauge-Higgs phase diagram into two regions: a confinement-like region, in which center vortices percolate, and a Higgs region, in which they do not. The free energy of the gauge-Higgs system, however, is analytic across the Kertesz line.Comment: 7 pages, 10 figure

Remarks on the Gribov Problem in Direct Maximal Center Gauge

We review the equivalence of maximal center gauge fixing to the problem of finding the best fit, to a given lattice gauge field, by a thin vortex configuration. This fit is necessarily worst at the location of P-plaquettes. We then compare the fits achieved in Gribov copies generated by (i) over-relaxation; (ii) over-relaxation after Landau gauge preconditioning; and (iii) simulated annealing. Simulated annealing yields the best fit if all links on the lattice are included, but the situation changes if we consider only the lattice volume exterior to P-plaquettes. In this exterior region, the fit is best for Gribov copies generated by over-relaxation, and worst for Gribov copies generated after Landau gauge preconditioning. The two fitting criteria (including or not including the P-plaquettes) yield string tensions differing by -34% to +20% respectively, relative to the full string tension. Our usual procedure (``quenched minimization'') seems to be a compromise between these criteria, and yields string tensions at an intermediate value close to the full string tension.Comment: 14 pages, 6 figure

A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem

We propose and test a new pricing procedure for solving large-scale structured linear programs. The procedure interactively solves a relaxed subproblem to identify potential entering basic columns. The subproblem is chosen to exploit special structure, rendering it easy to solve. The effect of the procedure is the reduction of the number of pivots needed to solve the problem. Our approach is motivated by the column-generation approach of Dantzig-Wolfe decomposition. We test our procedure on two sets of multicommodity flow problems. One group of test problems arises in routing telecommunications traffic and the second group is a set of logistics problem which have been widely used to test multicommodity flow algorithms.linear programming, multicommodity flows, optimization