Related papers: Note on irreducible approach to reducible second-c…
An irreducible canonical approach to second-order reducible second-class constraints is given. The procedure is exemplified on gauge-fixed three-forms.
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-…
A covariant quantization method for physical systems with reducible constraints is presented.
We propose a systematic method of dealing with the canonical constrained structure of reducible systems in the Dirac and symplectic approaches which involves an enlargement of phase and configuration spaces, respectively. It is not…
We introduce "chain by chain" method for constructing the constraint structure of a system possessing both first and second class constraints. We show that the whole constraints can be classified into completely irreducible first or second…
Reducible constrained Hamiltonian systems are quantized accordingly an irreducible BRST manner. Our procedure is based on the construction of an irreducible theory which is physically equivalent with the original one. The equivalence…
In the context of the variational bi-complex, we re-explain that irreducible gauge systems define a particular example of a Lie algebroid. This is used to review some recent and not so recent results on gauge, global and asymptotic…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
We examine the convexity and tractability of the two-sided linear chance constraint model under Gaussian uncertainty. We show that these constraints can be applied directly to model a larger class of nonlinear chance constraints as well as…
We argue that reducing nonlinear programming problems to a simple canonical form is an effective way to analyze them, specially when the problem is degenerate and the usual linear independence hypothesis does not hold. To illustrate this…
Irreducible gauge theories in both the Lagrangian and Hamiltonian versions of the Sp(2)-covariant quantization method are studied. Solutions to generating equations are obtained in the form of expansions in power series of ghost and…
An approach to stabilization of control systems with ultimately wide ranges of uncertainly disturbed parameters is offered. The method relies on using of nonlinear structurally stable functions from catastrophe theory as controllers.…
A gauge independent method of obtaining the reduced space of constrained dynamical systems is discussed in a purely lagrangian formalism. Implications of gauge fixing are also considered.
In this paper we reformulate Abelian and non-Abelian noninvariant systems as gauge invariant theories using a new constraint conversion scheme, developed on the symplectic framework. This conversion method is not plagued by the ambiguity…
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.
We describe how geometrical methods can be applied to a system with explicitly time-dependent second-class constraints so as to cast it in Hamiltonian form on its physical phase space. Examples of particular interest are systems which…
An irreducible Hamiltonian BRST approach to topologically coupled p- and (p+1)-forms is developed. The irreducible setting is enforced by means of constructing an irreducible Hamiltonian first-class model that is equivalent from the BRST…
We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…
We apply the supplementation trick [26] to the Green-Schwarz superstring. For type IIB theory both first and second class constraints are covariantly separated and then arranged into irreducible sets in the initial formulation. For N=1…
We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way Bijections both implicitly, concerning their computational complexity, and with zero-garbage.