Related papers: Gauge Fixing in the Chain by Chain Method
Gauge fixing is an essential step in lattice QCD calculations, particularly for studying gauge-dependent observables. Traditional iterative algorithms are computationally expensive and often suffer from critical slowing down and scaling…
The chain graph model admits both undirected and directed edges in one graph, where symmetric conditional dependencies are encoded via undirected edges and asymmetric causal relations are encoded via directed edges. Though frequently…
We investigate two methods to reconstruct Hamiltonians of quantum matter, using a quantum spin chain to test them. The first method uses correlation functions and the second method uses entanglement spectra. The two methods are not specific…
A detailed program is proposed in the Lagrangian formalism to investigate the dynamical behavior of a theory with singular Lagrangian. This program goes on, at different levels, parallel to the Hamiltonian analysis. In particular, we…
In this paper we examine an alternative formulation of the gauge principle in which the emphasis is shifted from the symmetry transformations to their generators. We show that the gauge principle can be entirely reformulated in terms of…
The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…
We consider stopping criteria that balance algebraic and discretization errors for the conjugate gradient algorithm applied to high-order finite element discretizations of Poisson problems. Firstly, we introduce a new stopping criterion…
Gauge fixing is a frequent task encountered in practical lattice gauge theory calculations. We review the performance characteristics of some standard gauging procedures for non-abelian gauge theories, implemented on the parallel machines…
The family of methods collectively known as classifier chains has become a popular approach to multi-label learning problems. This approach involves linking together off-the-shelf binary classifiers in a chain structure, such that class…
Gauge fixing and the observable fields for both abelian and non-abelian gauge theories with spontaneous breaking of gauge symmetry are studied. We explicitly show that it is possible to globally fix the gauge in the broken sector and hence…
Lattice regularizations are pivotal in the non-perturbative quantization of gauge field theories. Wilson's proposal to employ group-valued link fields simplifies the regularization of gauge fields in principal fiber bundles, preserving…
When using graphs and graph transformations to model systems, consistency is an important concern. While consistency has primarily been viewed as a binary property, i.e., a graph is consistent or inconsistent with respect to a set of…
New gauge fixing condition with single gauge parameter proposed by the authors is applied to the level truncated analysis of tachyon condensation in cubic open string field theory. It is found that the only one real non-trivial extremum…
The problem of gauge symmetry in higher derivative Lagrangian systems is discussed from a Hamiltonian point of view. The number of independent gauge parameters is shown to be in general {\it{less}} than the number of independent primary…
We study quantum chains whose Hamiltonians are perturbations by bounded interactions of short range of a Hamiltonian that does not couple the degrees of freedom located at different sites of the chain and has a strictly positive energy gap…
Ensuring safety in industrial control systems usually involves imposing constraints at the design stage of the control algorithm. Enforcing constraints is challenging if the underlying functional form is unknown. The challenge can be…
In the study of alternative or extended theories of gravity, Dirac's Hamiltonian constraint algorithm is invaluable for enumerating the propagating modes and gauge symmetries. For gravity, this canonical approach is frequently applied as a…
For interacting classical field theories such as general relativity exact solutions typically can only be found by imposing physically motivated (Killing) {\it symmetry} assumptions. Such highly symmetric solutions are then often used as…
Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…
We study Ising chains with arbitrary multispin finite-range couplings, providing an explicit solution of the associated inverse Ising problem, i.e. the problem of inferring the values of the coupling constants from the correlation…