English
Related papers

Related papers: Simplifying the algebra of first class constraints…

200 papers

Dirac's conjecture, that secondary first-class constraints generate transformations that do not change the physical system's state, has various counterexamples. Since no matching gauge conditions can be imposed, the Dirac bracket cannot be…

Quantum Physics · Physics 2023-06-14 Mauricio Valenzuela

Constrained Hamiltonian systems fall into the realm of presymplectic geometry. We show, however, that also Poisson geometry is of use in this context. For the case that the constraints form a closed algebra, there are two natural Poisson…

High Energy Physics - Theory · Physics 2014-11-18 Martin Bojowald , Thomas Strobl

A conjecture of Coleman implies that only finitely many quaternion algebras over the rational numbers can be the endomorphism $\mathbf{Q}$-algebras of abelian surfaces over the complex numbers which can be defined over $\mathbf{Q}$. One may…

Number Theory · Mathematics 2017-01-24 James Stankewicz

We give explicit formulas proving restrictedness of the following Lie (super)algebras: known exceptional simple vectorial Lie (super)algebras in characteristic 3, deformed Lie (super)algebras with indecomposable Cartan matrix, and (under…

Representation Theory · Mathematics 2024-09-17 Sofiane Bouarroudj , Andrey Krutov , Alexei Lebedev , Dimitry Leites , Irina Shchepochkina

We propose a single-step non-generational conjecture of all first class constraints,(involving only variables compatible with canonical Poisson brackets), for a realistic gauge singular field theory. We verify our proposal for the free…

Mathematical Physics · Physics 2009-10-03 K. Rasem Qandalji

Let $\mathcal{A}$ be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number $p$. Denote by ${\rm A}$ an abelian variety over a finite field of characteristic $p$, obtained by the reduction…

Algebraic Geometry · Mathematics 2018-10-02 Artyom Smirnov , Alexey Zaytsev

Constrained optimization problems exist in many domains of science, such as thermodynamics, mechanics, economics, etc. These problems are classically solved with the help of the Lagrange multipliers and the Lagrangian function. However, the…

Optimization and Control · Mathematics 2021-01-12 Cyril Cayron

We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…

Computational Complexity · Computer Science 2018-09-26 Albert Atserias , Joanna Ochremiak

The dynamical systems invariant under gauge transformations with higher order time derivatives of the gauge parameter are considered from the Hamiltonian point of view. We investigate the consequences of the basic requirements that the…

High Energy Physics - Theory · Physics 2009-11-13 M. N. Stoilov

The textbook Newton's iteration is practically inapplicable on solutions of nonlinear systems with singular Jacobians. By a simple modification, a novel extension of Newton's iteration regains its local quadratic convergence toward…

Numerical Analysis · Mathematics 2024-04-22 Zhonggang Zeng

We give a criterion in terms of period matrices for an arbitrary polarized abelian variety to be non-simple. Several examples are worked out.

Algebraic Geometry · Mathematics 2016-10-18 Robert Auffarth , Herbert Lange , Anita Rojas

In this paper we study higher order weakly hyperbolic equations with time dependent non-regular coefficients. The non-regularity here means less than H\"older, namely bounded coefficients. As for second order equations in \cite{GR:14} we…

Analysis of PDEs · Mathematics 2015-04-16 Claudia Garetto

We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…

Information Theory · Computer Science 2021-04-01 Yves Aubry , Elena Berardini , Fabien Herbaut , Marc Perret

This is the continuation of the article by the author that proves a broader class of families admitting the theorem of restriction of sections other than Abelian varieties and gives new examples of pseudo-N\'eron models. In this work, we…

Algebraic Geometry · Mathematics 2019-09-18 Santai Qu

A classification of (super) $W$ algebras arising from non Abelian Toda and super Toda theories is presented. This classification is based on the $Sl(2)$ or $OSp(1|2)$ sub(super)algebras of the simple Lie (super)algebra underlying the model.…

High Energy Physics - Theory · Physics 2007-05-23 L. Frappat , E. Ragoucy , P. Sorba

The recently modified Faddeev-Jackiw formalism for systems having one chain of four levels of only second-class constraints is applied to the non-trivial a=1 bosonized chiral Schwinger model in (1+1) dimensions as well as to one mechanical…

Mathematical Physics · Physics 2008-11-26 Ozlem Defterli , Dumitru Baleanu

In this paper, we establish lower bounds for the oracle complexity of the first-order methods minimizing regularized convex functions. We consider the composite representation of the objective. The smooth part has H\"older continuous…

Optimization and Control · Mathematics 2022-02-10 Nikita Doikov

In this short paper we identify special systems of (an arbitrary number) N of first-order Difference Equations with nonlinear homogeneous polynomials of arbitrary degree M in their right-hand sides, which feature very simple explicit…

Dynamical Systems · Mathematics 2021-09-28 Francesco Calogero , Farrin Payandeh

Lagrangian systems with nonholonomic constraints may be considered as singular differential equations defined by some constraints and some multipliers. The geometry, solutions, symmetries and constants of motion of such equations are…

Mathematical Physics · Physics 2009-11-10 Xavier Gracia , Ruben Martin

We illustrate the strength of Algebraic Methods, adapting Gaussian Elimination and Substitution to the problem of Exact Boolean Satisfiability. For 1-in-3 SAT with non-negated literals we are able to obtain considerably smaller equivalent…

Computational Complexity · Computer Science 2020-11-02 Valentin Bura