相关论文: Classification of constraints using chain by chain…

A general framework for the solutions of the constraints of pure gravity is constructed. It provides with well defined mathematical criteria to classify their solutions in four classes. Complete families of solutions are obtained in some…

In this article we show that boundary conditions can be treated as Lagrangian and Hamiltonian constraints. Using the Dirac method, we find that boundary conditions are equivalent to an infinite chain of second class constraints which is a…

This paper presents a new column-and-constraint generation method for two-stage robust mixed-integer programs with finite uncertainty sets. Our method combines and extends speed-up techniques used in previous column-and-constraint…

Constraints can be interpreted in a broad sense as any kind of explicit restriction over the parameters. While some constraints are defined directly on the parameter space, when they are instead defined by known behaviour on the model,…

This paper explores in some detail a recent proposal (the Rieffel induction/refined algebraic quantization scheme) for the quantization of constrained gauge systems. Below, the focus is on systems with a single constraint and, in this…

We discuss the quantization of the restricted gauge theory of SU(2) QCD regarding it as a second-class constraint system, and construct the BRST symmetry of the constrained system in the framework of the improved Dirac quantization scheme.…

The jet bundle description of time-dependent mechanics is revisited. The constraint algorithm for singular Lagrangians is discussed and an exhaustive description of the constraint functions is given. By means of auxiliary connections we…

In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…

Two families of symplectic methods specially designed for second-order time-dependent linear systems are presented. Both are obtained from the Magnus expansion of the corresponding first-order equation, but otherwise they differ in…

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…

The systematic method for the conversion of first class constraints to the equivalent set of Abelian one based on the Dirac equivalence transformation is developed. The representation for the corresponding matrix performing this…

Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tractability is crucial for efficiently solving large-scale…

It is shown that an arbitrary singular Lagrangian theory (with first and second class constraints up to $N$-th stage in the Hamiltonian formulation) can be reformulated as a theory with at most third-stage constraints. The corresponding…

In this paper we attack the Erdos-Straus conjecture by means of the structure of its solutions, extending and improving the results of a previous paper. Using previous results and supported by the works of Elsholtz and Tao and Monks and…

We present a Lagrangian approach to counting degrees of freedom in first-order field theories. The emphasis is on the systematic attainment of a complete set of constraints. In particular, we provide the first comprehensive procedure to…

We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple…

Many real world problems naturally appear as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two techniques: some direct propagation of constraints between…

Designing component-based constraint solvers is a complex problem. Some components are required, some are optional and there are interdependencies between the components. Because of this, previous approaches to solver design and…

The conversion of second-class constraints into first-class constraints is used to extend the coordinate-free path integral quantization, achieved by a flat-space Brownian motion regularization of the coherent-state path integral measure,…

Model transformations operate on models conforming to precisely defined metamodels. Consequently, it often seems relatively easy to chain them: the output of a transformation may be given as input to a second one if metamodels match.…