Related papers: Simplifying the algebra of first class constraints…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…
We construct non-isogenous simple ordinary abelian varieties over an algebraic closure of a finite field with isomorphic endomorphism algebras.
We study two principle minimizing problems, subject of different constraints. Our open sets are assumed bounded, except mentioning otherwise;precisely $\Omega=]0,1[^n \in {\mathbb{R}}^n , n=1 $ or $n=2$.
We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…
We show that the discrete anomaly constraints governing popular non-Abelian symmetries of use in (e.g.) flavoured, supersymmetric, and dark matter model building typically subdivide into two classes differentiated by the simple restrictions…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
In a quaternion order of class number one, an element can be factored in multiple ways depending on the order of the factorization of its reduced norm. The fact that multiplication is not commutative causes an element to induce a…
Dynamical systems, described by Lagrangians with first- and second-class constraints, are investigated. In the Dirac approach to the generalized Hamiltonian formalism, the classification and separation of the first- and second-class…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
We finish the classification, begun in two earlier papers, of all simple fusion systems over finite nonabelian $p$-groups with an abelian subgroup of index $p$. In particular, this gives many new examples illustrating the enormous variety…
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…
Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…
We propose a method for reduction of quantum systems with arbitrary first class constraints. An appropriate mathematical setting for the problem is homology of associative algebras. For every such an algebra $A$ and its subalgebra B with an…
New measures for the quantization of systems with constraints are discussed and applied to several examples, in particular, examples of alternative but equivalent formulations of given first-class constraints, as well as a comparison of…
The classification of gradings by abelian groups on finite direct sums of simple finite-dimensional nonassociative algebras over an algebraically closed field is reduced, by means of the use of loop algebras, to the corresponding problem…
A systematic method is presented for the construction and classification of algebras of gauge transformations for arbitrary high rank tensor gauge fields. For every tensor gauge field of a given rank, the gauge transformation will be…
We use cobordism theory to analyse anomalies of finite non-abelian symmetries in 4 spacetime dimensions. By applying the method of `anomaly interplay', which uses functoriality of cobordism and naturality of the $\eta$-invariant to relate…
In the paper "An Abelian Loop for Non-Composites" (arXiv:110.14716), we introduced a group-like structure consisting of odd prime numbers and 1, with properties that allowed us to prove analogous results to well known theorems in Number…
A version of non-Abelian monopole equations is explored through dimensional reductions, with often the addition of algebraic conditions. On zero curvature spaces, spinor related extensions of integrable systems have been generated, and…