Related papers: Classification of constraints using chain by chain…
In a recent work we showed that for a Hamiltonian system with constraints, the set of constraints can be investigated in first and second class constraint chains. We show here that using this "chain by chain" method for an arbitrary system…
We show that the constraint structure in the chain by chain method can be investigated within the symplectic analysis of Faddeev-Jackiw formalism.
The second class constraints algebra of the abelian Chern-Simons theory is rigorously studied in terms of the Hamiltonian embedding in order to obtain the first class constraint system. The symplectic structure of fields due to the second…
In the Dirac approach to the generalized Hamiltonian formalism, dynamical systems with first- and second-class constraints are investigated. The classification and separation of constraints into the first- and second-class ones are…
We show that after mapping each element of a set of second class constraints to the surface of the other ones, half of them form a subset of abelian first class constraints. The explicit form of the map is obtained considering the most…
The recently modified Faddeev-Jackiw formalism for systems having one chain of four levels of only second-class constraints is applied to the non-trivial a=1 bosonized chiral Schwinger model in (1+1) dimensions as well as to one mechanical…
The way of finding all the constraints in the Hamiltonian formulation of singular (in particular, gauge) theories is called the Dirac procedure. The constraints are naturally classified according to the correspondig stages of this…
In this note we study systems with a closed algebra of second class constraints. We describe a construction of the reduced theory that resembles the conventional treatment of first class constraints. It suggests, in particular, to compute…
An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…
We show that in modified Faddeev-Jackiw formalism, first and second class constraints appear at each level, and the whole constraint structure is in exact correspondence with level by level method of Dirac formalism.
The equivalence of the chain method and Hamilton-Jacobi formalism is demonstrated. The stabilization algorithm of Hamilton-Jacobi formalism is clariffied and two examples are presented in details.
In this Part II, we apply the general theory developed in Part I to a detailed analysis of the Constraint Satisfaction Problem (CSP). We show how specific types of resolution rules can be defined. In particular, we introduce the general…
We show that a given set of first class constraints becomes abelian if one maps each constraint to the surface of other constraints. There is no assumption that first class constraints satisfy a closed algebra. The explicit form of the…
An irreducible canonical approach to reducible second-class constraints is given. The procedure is illustrated on gauge-fixed two-forms.
Motivated by the grid search method and Bayesian optimization, we introduce the concept of contractibility and its applications in model-based optimization. First, a basic framework of contraction methods is established to construct a…
We study the problem of multi-class classification under system-level constraints expressible as linear functionals over randomized classifiers. We propose a post-processing approach that adjusts a given base classifier to satisfy general…
An irreducible canonical approach to second-order reducible second-class constraints is given. The procedure is exemplified on gauge-fixed three-forms.
New measures for the quantization of systems with constraints are discussed and applied to several examples, in particular, examples of alternative but equivalent formulations of given first-class constraints, as well as a comparison of…
We perform a canonical analysis of the bimetric theory in the metric formulation, computing the constraints and their algebra explicitly. In particular, we compute a secondary constraint, that has been argued to exist earlier, and show that…
The generic chaining method provides a sharp description of the suprema of many random processes in terms of the geometry of their index sets. The chaining functionals that arise in this theory are however notoriously difficult to control…