Lattice NRQCD with leading finite lattice spacing errors removed is used to simulate heavy-heavy vector decay constants. Quenched simulations are performed at three values of the coupling and fifteen values of the quark mass. The improved gauge action with plaquettes and rectangles is used. Landau link improvement is used throughout. “Perturbative” and nonperturbative meson masses are compared....

As a function of applied field, we find a rich variety of ordered and partially ordered vortex lattice configurations in systems with square or triangular arrays of pinning sites. We present formulas that predict the matching fields at which commensurate vortex configurations occur and the vortex lattice orientation with respect to the pinning lattice. Our results are in excellent agreement wit...

We develop the theory of stability for aggregate matchings used in empirical studies and establish fundamental properties stable including result that set is a non-empty, complete, distributive lattice. Aggregate are relevant as matching data revealed preference theory. present on rationalizing median matching.

This work provides a detailed study on the growth of AlxIn1-xAsySb1-y lattice-matched to InAs by Molecular Beam Epitaxy. In order to find the conditions which lead to high crystal quality deep within the miscibility gap, AlxIn1-xAsySb1-y with x = 0.462 was grown at different growth temperatures as well as As2 and Sb2 beam equivalent pressures. The crystal quality of the grown layers was examine...

Using a generalized notion of matching in a simplicial complex and circuits of vector configurations, we compute lower bounds for the minimum number of generators, the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Prime lattice ideals are toric ideals, i.e. the defining ideals of toric varieties. © 2006 Elsevier Inc. All rights reserved.

Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of near-regular textures in real images. The underlying lattice of a near-regular texture identifies all of the texels as well as the global topology among the texels. A key contribution of this paper is to formulate lattice-finding...

A stable matching for an instance of the stable marriages problem or the stable roommates problem is bistable if it is also a stable matching when the ordering of the input preference lists is reversed. For the stable marriages problem, it is shown that the bistable matchings are a sublattice of the distributive lattice of stable matchings. In addition, the Gale Shapley algorithm is modified to...

We study a natural generalization of stable matching to the maximumweight stable matching problem and we obtain a combinatorial polynomial time algorithm for it by reducing it to the problem of finding a maximum weight ideal cut in a DAG. We give the first polynomial time algorithm for the latter problem; this algorithm is also combinatorial. The combinatorial nature of our algorithms not only ...

Consider independent fair coin-flips at each site of the lattice Z d. A translation-equivariant matching rule is a perfect matching of heads to tails that commutes with translations of Z d and is given by a deterministic function of the coin-flips. Let Z Φ be the distance from the origin to its partner, under the translation-equivariant matching rule Φ. Holroyd and Peres [9] asked what is the o...

A one-loop matching calculation between Lattice NRQCD and full QCD for the heavy-light axial current is described and the effects of renormalization on fB are discussed.