Search results for "Lattic"
showing 10 items of 3315 documents
Hyperidentities of some generalizations of lattices
1998
In the paper we present bases and hyperbases of hyperidentities of some generalizations of the variety L of all lattices and the variety D of distributive lattices. We describe the form of hyperidentities of some varieties with two binary operations.
Novel patterns for vector mesons from the large-Nc limit
2008
We report on a relation between the decay constants of \rho-like J^{PC}=1^{--} vector mesons, which arises solely from the perturbative analysis of the VV, TT and VT correlators at order \alpha_s^0 in the large-N_c limit. We find f_{V}^T/f_{V}=1/\sqrt{2} for highly excited states together with a pattern of alternation in sign. Quite remarkably, recent lattice determinations reported f_{\rho}^T/f_{\rho}=0.72(2), in excellent agreement with our large-N_c result. This seems to suggest a pattern like f_{Vn}^T/f_{Vn}=(-1)^n/\sqrt{2} for the whole (1^{--}) states. In order to test this conjecture in real QCD we construct a set of spectral sum rules, which turn out to comply nicely with this scena…
Markov Chains and Electrical Networks
2020
There is a natural connection between electrical networks and so called reversible Markov chains. An example for such a chain is the symmetric graph random walk which, in each step, jumps to a randomly chosen graph neighbor at equal probability. This connection is studied here in some detail. As an application, we prove the statement that if such a graph random walk is recurrent, then it is recurrent also on each subgraph. (Although this statement is rather plausible, it is hard to show by different means.) In particular, the graph random walk on a percolation cluster of the planar integer lattice is recurrent.
Commutator anomalies and the Fock bundle
1990
We show that the anomalous finite gauge transformations can be realized as linear operators acting on sections of the bundle of fermionic Fock spaces parametrized by vector potentials, and more generally, by splittings of the fermionic one-particle space into a pair of complementary subspaces. On the Lie algebra level we show that the construction leads to the standard formula for the relevant commutator anomalies.
Estimation of the photon production rate using imaginary momentum correlators
2023
The thermal photon emission rate is determined by the spatially transverse, in-medium spectral function of the electromagnetic current. Accessing the spectral function using Euclidean data is, however, a challenging problem due to the ill-posed nature of inverting the Laplace transform. In this contribution, we present the first results on implementing the proposal of directly computing the analytic continuation of the retarded correlator at fixed, vanishing virtuality of the photon via the calculation of the appropriate Euclidean correlator at imaginary spatial momentum. We employ two dynamical O(a)-improved Wilson fermions at a temperature of 250 MeV.
Noise correlations of the ultracold Fermi gas in an optical lattice
2008
In this paper we study the density noise correlations of the two component Fermi gas in optical lattices. Three different type of phases, the BCS-state (Bardeen, Cooper, and Schieffer), the FFLO-state (Fulde, Ferrel, Larkin, and Ovchinnikov), and BP (breach pair) state, are considered. We show how these states differ in their noise correlations. The noise correlations are calculated not only at zero temperature, but also at non-zero temperatures paying particular attention to how much the finite temperature effects might complicate the detection of different phases. Since one-dimensional systems have been shown to be very promising candidates to observe FFLO states, we apply our results als…
Comparison of implementations of the lattice-Boltzmann method
2008
AbstractSimplicity of coding is usually an appealing feature of the lattice-Boltzmann method (LBM). Conventional implementations of LBM are often based on the two-lattice or the two-step algorithm, which however suffer from high memory consumption and poor computational performance, respectively. The aim of this work was to identify implementations of LBM that would achieve high computational performance with low memory consumption. Effects of memory addressing schemes were investigated in particular. Data layouts for velocity distribution values were also considered, and they were found to be related to computational performance. A novel bundle data layout was therefore introduced. Address…
(Approximate) Low-Mode Averaging with a new Multigrid Eigensolver
2015
We present a multigrid based eigensolver for computing low-modes of the Hermitian Wilson Dirac operator. For the non-Hermitian case multigrid methods have already replaced conventional Krylov subspace solvers in many lattice QCD computations. Since the $\gamma_5$-preserving aggregation based interpolation used in our multigrid method is valid for both, the Hermitian and the non-Hermitian case, inversions of very ill-conditioned shifted systems with the Hermitian operator become feasible. This enables the use of multigrid within shift-and-invert type eigensolvers. We show numerical results from our MPI-C implementation of a Rayleigh quotient iteration with multigrid. For state-of-the-art lat…
Reduction of the number of spectral bands in Landsat images: a comparison of linear and nonlinear methods
2006
We describe some applications of linear and nonlinear pro- jection methods in order to reduce the number of spectral bands in Land- sat multispectral images. The nonlinear method is curvilinear component analysis CCA, and we propose an adapted optimization of it for image processing, based on the use of principal-component analysis PCA, a linear method. The principle of CCA consists in reproducing the topol- ogy of the original space projection points in a reduced subspace, keep- ing the maximum of information. Our conclusions are: CCA is an im- provement for dimension reduction of multispectral images; CCA is really a nonlinear extension of PCA; CCA optimization through PCA called CCAinitP…
An efficient swap algorithm for the lattice Boltzmann method
2007
During the last decade, the lattice-Boltzmann method (LBM) as a valuable tool in computational fluid dynamics has been increasingly acknowledged. The widespread application of LBM is partly due to the simplicity of its coding. The most well-known algorithms for the implementation of the standard lattice-Boltzmann equation (LBE) are the two-lattice and two-step algorithms. However, implementations of the two-lattice or the two-step algorithm suffer from high memory consumption or poor computational performance, respectively. Ultimately, the computing resources available decide which of the two disadvantages is more critical. Here we introduce a new algorithm, called the swap algorithm, for t…