相关论文: The Treatment of conformable systems with second c…

Optimization problems involving complex variables, when solved, are typically transformed into real variables, often at the expense of convergence rate and interpretability. This paper introduces a novel formalism for a prominent problem in…

The paper is concerned with the completeness property of root functions of the Dirac operator with summable complexvalued potential and non-regular boundary conditions. We also obtain explicit form for the fundamental solution system of the…

Following the symplectic approach we show how to embed the Abelian Proca model into a first-class system by extending the configuration space to include an additional pair of scalar fields, and compare it with the improved Dirac scheme. We…

Motivated by the Hamilton$-$Jacobi approach of fields with constraints, we analyse the classical structure of three different constrained field systems: (i) the scalar field coupled to two flavors of fermions through Yukawa couplings (ii)…

The gauge symmetries of a general dynamical system can be systematically obtained following either a Hamiltonean or a Lagrangean approach. In the former case, these symmetries are generated, according to Dirac's conjecture, by the first…

A minor change in the Barcelos-Wotzasek (BW) symplectic algorithm for constrained systems is proposed. The change addresses some criticism that formalism has received, placing it on the same footing as Dirac's algorithm.

In this work we exploit Dirac's Constraint Analysis (DCA) in Hamiltonian formalism to study different types of Superconducting Quantum Circuits (SQC) in a {\it{unified}} way. The Lagrangian of a SQC reveals the constraints, that are…

Answer-set programming (ASP) has emerged recently as a viable programming paradigm. We describe here an ASP system, DATALOG with constraints or DC, based on non-monotonic logic. Informally, DC theories consist of propositional clauses…

Classical constrained Hamiltonian theory assumes complete observability of system states, but in reality only partial state information is often available. This paper establishes a complete geometric theoretical framework for handling such…

Cooperative constraint solving is an area of constraint programming that studies the interaction between constraint solvers with the aim of discovering the interaction patterns that amplify the positive qualities of individual solvers.…

Functional constraints and bi-functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually…

We study singular perturbations of a class of two-scale stochastic control systems with unbounded data. The assumptions are designed to cover some relaxation problems for deep neural networks. We construct effective Hamiltonian and initial…

We present a number of second order maps, which pass the singularity confinement test commonly used to identify integrable discrete systems, but which nevertheless are non-integrable. As a more sensitive integrability test, we propose the…

Mathematical programs with disjunctive constraints (MPDCs for short) cover several different problem classes from nonlinear optimization including complementarity-, vanishing-, cardinality-, and switching-constrained optimization problems.…

This is part one of a two-part work that relates two different approaches to two-dimensional open-closed rational conformal field theory. In part one we review the definition of a Cardy algebra, which captures the necessary consistency…

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;…

We present a Hamiltonian derivation of a class of reduced plasma two-dimensional fluid models, an example being the Charney-Hasegawa-Mima equation. These models are obtained from the same parent Hamiltonian model, which consists of the ion…

We develop a Hamilton-Jacobi theory for singular lagrangian systems using the Gotay-Nester-Hinds constraint algorithm. The procedure works even if the system has secondary constraints.

This paper considers the higher derivative terms in the effective action of type II string theory and in particular the behaviour of the automorphic forms they contain in all the different possible limits of the string parameters. The…

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…