English
Related papers

Related papers: The Treatment of conformable systems with second c…

200 papers

The adiabatic connection formalism, usually based on the first-order perturbation theory, has been generalized to an arbitrary order. The generalization stems from the observation that the formalism can be derived from a properly arranged…

Chemical Physics · Physics 2023-10-18 Andreas Savin , Jacek Karwowski

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…

Computational Physics · Physics 2026-01-01 Will Barker

In the paper "Constraint Quantization of Open String in Background $B$ field and Noncommutative D-brane", it is claimed that the boundary conditions lead to an infinite set of secondary constraints and Dirac brackets result in a…

High Energy Physics - Theory · Physics 2009-11-07 F. Loran

Generalized Dilaton Theories in two dimensions coupled to Dirac fermions are subjected to constraint analysis. Three first class secondary constraints are found, corresponding to one local Lorentz symmetry and two diffeomorphisms. Moreover,…

High Energy Physics - Theory · Physics 2007-05-23 Rene Meyer

Central issues of the Dirac constraint formalism are discussed in relation to the algorithmic methods of commutative algebra based on the Groebner basis techniques. For a wide class of finite dimensional polynomial degenerate Lagrangian…

Mathematical Physics · Physics 2007-05-23 V. Gerdt , A. Khvedelidze , Yu. Palii

We establish the unique solvability of a coupling problem for entire functions which arises in inverse spectral theory for singular second order ordinary differential equations/two-dimensional first order systems and is also of relevance…

Classical Analysis and ODEs · Mathematics 2019-02-26 Jonathan Eckhardt

For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…

Logic · Mathematics 2020-12-03 Manuel Bodirsky , Johannes Greiner

In this paper we explore the idea of looking at the Dirac quantisation conditions as $\hbar$-dependent constraints on the tangent bundle to phase-space. Starting from the path-integral version of classical mechanics and using the natural…

dg-ga · Mathematics 2016-08-31 Ennio Gozzi

Higher order conformal perturbation theory is studied for theories with and without boundaries. We identify systematically the universal quantities in the beta function equations, and we give explicit formulae for the universal coefficients…

High Energy Physics - Theory · Physics 2009-02-27 Matthias R. Gaberdiel , Anatoly Konechny , Cornelius Schmidt-Colinet

In this paper a class of conformal field theories with nonabelian and discrete group of symmetry is investigated. These theories are realized in terms of free scalar fields starting from the simple $b-c$ systems and scalar fields on…

High Energy Physics - Theory · Physics 2009-10-22 Franco Ferrari

The problem of exactly differentiating a signal with bounded second derivative is considered. A class of differentiators is proposed, which converge to the derivative of such a signal within a fixed, i.e., a finite and uniformly bounded…

Systems and Control · Electrical Eng. & Systems 2021-09-10 Richard Seeber , Hernan Haimovich , Martin Horn , Leonid Fridman , Hernán De Battista

The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…

Computational Complexity · Computer Science 2017-01-09 Hubie Chen , Benoit Larose

We consider optical systems where propagation of light can be described by a Dirac-like equation with $PT$-symmetric Hamiltonian. In order to construct exactly solvable configurations, we extend the confluent Crum-Darboux transformation for…

High Energy Physics - Theory · Physics 2017-03-15 Francisco Correa , Vit Jakubsky

After substantial progress over the last 15 years, the "algebraic CSP-dichotomy conjecture" reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if…

Logic in Computer Science · Computer Science 2023-06-22 Clifford Bergman , William DeMeo

We discuss the structure of 2D conformal field theories (CFT) at central charge c=0 describing critical disordered systems, polymers and percolation. We construct a novel extension of the c=0 Virasoro algebra, characterized by a number b…

Disordered Systems and Neural Networks · Physics 2015-06-25 V. Gurarie , A. W. W. Ludwig

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

Logic · Mathematics 2021-09-15 Saharon Shelah

A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language \Gamma. We study how hard it is to evaluate this number approximately. There is an…

Computational Complexity · Computer Science 2012-04-26 Colin McQuillan

We present a generalization of Dirac constraint theory based on the theory of Poisson-Dirac submanifolds. The theory is formulated in a coordinate-free manner while simultaneously relaxing the invertibility condition as seen in standard…

Mathematical Physics · Physics 2025-07-01 F. W. Pinto , J. W. Burby

Many natural decision problems can be formulated as constraint satisfaction problems for reducts $\mathbb{A}$ of finitely bounded homogeneous structures. This class of problems is a large generalisation of the class of CSPs over finite…

Logic · Mathematics 2023-06-22 Manuel Bodirsky , Antoine Mottet

In this paper, we investigate the hybrid tractability of binary Quantified Constraint Satisfaction Problems (QCSPs). First, a basic tractable class of binary QCSPs is identified by using the broken-triangle property. In this class, the…

Artificial Intelligence · Computer Science 2011-04-27 Jian Gao , Minghao Yin , Junping Zhou
‹ Prev 1 3 4 5 6 7 10 Next ›