English
Related papers

Related papers: Abelianization of First Class Constraints

200 papers

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Rings and Algebras · Mathematics 2023-07-14 Libor Barto , Antoine Mottet

We classify all finite-dimensional connected Hopf algebras with large abelian primitive spaces. We show that they are Hopf algebra extensions of restricted enveloping algebras of certain restricted Lie algebras. For any abelian matched pair…

Rings and Algebras · Mathematics 2015-07-02 Xingting Wang

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

Logic · Mathematics 2015-03-05 Norman Feldman

Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…

Logic in Computer Science · Computer Science 2007-05-23 Stefan Ratschan

The structure functions of the Lagrangian gauge algebra are given explicitly in terms of the hamiltonian constraints and the first order Hamiltonian structure functions and their derivatives.

Mathematical Physics · Physics 2015-05-27 Domingo J. Louis-Martinez

Employing the Batalin-Vilkovisky (BV) formalism, we present a systematic and simple prescription to derive (first-class) constraints including the Hamiltonian constraint (a.k.a. flow equation), which plays pivotal role in holographic…

High Energy Physics - Theory · Physics 2016-12-15 Ken Kikuchi

We describe in detail how to eliminate nonphysical degrees of freedom in the Lagrangian and Hamiltonian formulations of a constrained system. Two important and distinct steps in our method are the fixing of ambiguities in the dynamics and…

General Relativity and Quantum Cosmology · Physics 2010-04-06 J M Pons , L C Shepley

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

Logic in Computer Science · Computer Science 2021-08-24 Johannes Marti

We study the structure of Lie groups admitting left invariant abelian complex structures in terms of commutative associative algebras. If, in addition, the Lie group is equipped with a left invariant Hermitian structure, it turns out that…

Differential Geometry · Mathematics 2011-07-01 Adrian Andrada , Maria Laura Barberis , Isabel Dotti

When a Hamiltonian system is subject to constraints which depend explicitly on time, difficulties can arise in attempting to reduce the system to its physical phase space. Specifically, it is non-trivial to restrict the system in such a way…

High Energy Physics - Theory · Physics 2015-06-26 Jonathan M. Evans , Philip A. Tuckey

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2016-01-28 Andrei A. Bulatov

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

This work deals with the presence of topological structures in models of two real scalar fields in the two-dimensional spacetime. The subject concerns the presence of a geometric constriction, which appears with a modification of the…

High Energy Physics - Theory · Physics 2024-03-11 D. Bazeia , M. A. Feitosa , R. Menezes , G. S. Santiago

We investigate crossed products of Cuntz algebras by quasi-free actions of abelian groups. We prove that our algebras are AF-embeddable when actions satisfy a certain condition. We also give a necessary and sufficient condition that our…

Operator Algebras · Mathematics 2007-05-23 Takeshi Katsura

This paper establishes a constructive link between the first slope of Artin-Schreier curves X_f: y^p-y=f(x) and the p-adic weight of the support of f(x). If the maximal p-adic weight element v in Supp(f) is unique, we show that the first…

Algebraic Geometry · Mathematics 2026-05-15 Robert Moore , Hui June Zhu

The constraint satisfaction problem asks to decide if a set of constraints over a relational structure $\mathcal{A}$ is satisfiable (CSP$(\mathcal{A})$). We consider CSP$(\mathcal{A} \cup \mathcal{B})$ where $\mathcal{A}$ is a structure and…

Computational Complexity · Computer Science 2024-08-28 Peter Jonsson , Victor Lagerkvist , George Osipov

Optimization under structural constraints is typically analyzed through projection or penalty methods, obscuring the geometric mechanism by which constraints shape admissible dynamics. We propose an operator-theoretic formulation in which…

Optimization and Control · Mathematics 2026-03-10 Changkai Li

The algebra of constraints arising in the canonical quantization of N=1 supergravity in four dimensions is investigated. Using the holomorphic action, the structure functions of the algebra are given and it is shown that the algebra does…

General Relativity and Quantum Cosmology · Physics 2009-10-28 Matthias Wulf

We calculate the first homology group of the mapping class group with coefficients in the first rational homology group of the universal abelian $\Z / L \Z$-cover of the surface. If the surface has one marked point, then the answer is…

Geometric Topology · Mathematics 2020-06-08 Andrew Putman

Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…

Logic in Computer Science · Computer Science 2019-06-05 Albert Atserias , Szymon Toruńczyk
‹ Prev 1 3 4 5 6 7 10 Next ›