Related papers: Simplifying the algebra of first class constraints…
Use of certain non-commuting variables is considered in first-order differential equations. Superspace variables are discussed within the setting of first-order ordinary differential equations and n-ary algebras. Results on quadratic…
An algebraic telic problem is a decision problem in $\textsf{NP}_\mathbb{R}$ formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the existence of "natural" mapping reductions between algebraic…
We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…
It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…
In the Dirac approach to the generalized Hamiltonian formalism, dynamical systems with first- and second-class constraints are investigated. The classification and separation of constraints into the first- and second-class ones are…
We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
The algebraic matrix hierarchy approach based on affine Lie $sl (n)$ algebras leads to a variety of 1+1 soliton equations. By varying the rank of the underlying $sl (n)$ algebra as well as its gradation in the affine setting, one…
The question of which separable C*-algebras have abelian central sequence algebras was raised and studied by Phillips ([Ph88]) and Ando-Kirchberg ([AK14]). In this paper we give a complete answer to their question: A separable C*-algebra…
Numerical analysis has no satisfactory method for the more realistic optimization models. However, with constraint programming one can compute a cover for the solution set to arbitrarily close approximation. Because the use of constraint…
Changes of variables giving the dual model are constructed explicitly for sigma-models without isotropy. In particular, the jacobian is calculated to give the known results. The global aspects of the abelian case as well as some of those of…
Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations and third order quintically semi-linear ordinary differential equations, we extend to the fourth order by differentiating…
We show that with every classical system possessing first class constraints that form a natural Lie algebra, we can associate a superalgebra that admits the constraint Lie algebra as a subalgebra. An odd generator of this superalgebra that…
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…
The method of refined algebraic quantization of constrained systems which is based on modification of the inner product of the theory rather than on imposing constraints on the physical states is generalized to the case of constrained…
Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…
We show that a wide class of $W$-(super)algebras, including $W_N^{(N-1)}$, $U(N)$-superconformal as well as $W_N$ nonlinear algebras, can be linearized by embedding them as subalgebras into some {\em linear} (super)conformal algebras with…
We study the Modular Isomorphism Problem applying a combination of existing and new techniques. We make use of the small group algebra to give a positive answer for two classes of groups of nilpotency class 3. We also introduce a new…
The motivating question for this work is a long standing open problem, posed by Nisan (1991), regarding the relative powers of algebraic branching programs (ABPs) and formulas in the non-commutative setting. Even though the general question…
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…