Related papers: Simplifying the algebra of first class constraints…

This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…

The Einstein equations have proven surprisingly difficult to solve numerically. A standard diagnostic of the problems which plague the field is the failure of computational schemes to satisfy the constraints, which are known to be…

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…

An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…

We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…

The notion of singular reduction modules, i.e., of singular modules of nonclassical (conditional) symmetry, of differential equations is introduced. It is shown that the derivation of nonclassical symmetries for differential equations can…

In this paper we study the satisfiability and solutions of group equations when combinatorial, algebraic and language-theoretic constraints are imposed on the solutions. We show that the solutions to equations with length, lexicographic…

An extension of the Legendre transform to non-convex functions with vanishing Hessian as a mix of envelope and general solutions of the Clairaut equation is proposed. Applying this to systems with constraints, the procedure of finding a…

The collective coordinates expansion of the Skyrme soliton particle model gives rise to the second class constraints. We use the non-abelian BFFT formalism to convert this system into the one with only first class constraints. Choosing two…

We investigate refined algebraic quantisation within a family of classically equivalent constrained Hamiltonian systems that are related to each other by rescaling a momentum-type constraint. The quantum constraint is implemented by a…

Albert algebras, a specific kind of Jordan algebra, are naturally distinguished objects among commutative non-associative algebras and also arise naturally in the context of simple affine group schemes of type $F_4$, $E_6$, or $E_7$. We…

We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…

We propose a practical inexact augmented Lagrangian method (iALM) for nonconvex problems with nonlinear constraints. We characterize the total computational complexity of our method subject to a verifiable geometric condition, which is…

We exhibit a new method of constructing non-Lorentzian models by applying a method we refer to as starting from a so-called seed Lagrangian. This method typically produces additional constraints in the system that can drastically alter the…

We revisit Akbulut and King's first example of a compact semialgebraic set which satisfies Sullivan's local Euler characteristic condition, but which is not homeomorphic to an algebraic set. A nontrivial obstruction is computed using the…

We perform a canonical analysis of the bimetric theory in the metric formulation, computing the constraints and their algebra explicitly. In particular, we compute a secondary constraint, that has been argued to exist earlier, and show that…

We extend the loop algebra construction for algebras graded by abelian groups to study graded-simple algebras over the field of real numbers (or any real closed field). As an application, we classify up to isomorphism the graded-simple…

This paper's central theme is to prove the existence of an n-algebra whose multiplication cannot be expressed employing any binary operation. Furthermore, to prove if two algebras are not isomorphic, this property does not hold for…

A first-order gauge invariant formulation for the two-dimensional quantum rigid rotor is long known in the theoretical physics community as an isolated peculiar model. Parallel to that fact, the longstanding constraints abelianization…

Metabelian algebras are introduced and it is shown that an algebra $A$ is metabelian if and only if $A$ is a nilpotent algebra having the index of nilpotency at most $3$, i.e. $x y z t = 0$, for all $x$, $y$, $z$, $t \in A$. We prove that…