Results 11 to 20 of about 533 (145)
Associative-Commutative Deducibility Constraints [PDF]
, 2007 We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associative and commutative symbols. We show that deciding such Diophantine systems is, in general, undecidable. Then, we consider a simple subclass, which we show decidable.
Sergiu Bursuc +2 more
openaire +1 more source
Commutative idempotent groupoids and the constraint satisfaction problem
Algebra universalis, 2015 A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulates that if a finite algebra A possesses a weak near-unanimity term, then the corresponding constraint satisfaction problem is tractable. A binary operation is weak near-unanimity if and only if it is both commutative and idempotent. Thus if the dichotomy conjecture
Bergman, Clifford, Failing, David
openaire +6 more sources
The role of commutativity in constraint propagation algorithms [PDF]
ACM Transactions on Programming Languages and Systems, 2000 Constraing propagation algorithms form an important part of most of the constraint programming systems. We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In this framework we proceed in two steps.
openaire +4 more sources
On commutativity of rings with some polynomial constraints [PDF]
Bulletin of the Australian Mathematical Society, 1990 Let R be an associative ring with unity 1, N(R) the set of nilpotents, J(R) the Jacobson radical of R and n > 1 be a fixed integer. We prove that R is commutative if and only if it satisfies (xy)n = ynxn for all x, y ∈ R \ N(R) and commutators in R are n(n + 1)-torsion free. Moreover, we extend the same result in the case when x, y ∈ R\J(R).
Ashraf, Mohd., Quadri, Murtaza A.
openaire +2 more sources
Commutativity of Rings with Constraints Involving a Subset [PDF]
Czechoslovak Mathematical Journal, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Commutativity results for rings with certain constraints on commutators
Proyecciones (Antofagasta), 2018 We investigate here the commutativity of a left (resp. right) s-unital ring R satisfying the polynomial identity yr [xny] xt = ±y3 [x, ym] (resp. yr [xn, y] xt = ± [x, ym] ys ) for some non-negative integers m >0, n > 0, r, s and t such that n + t > 1 (resp. m + s > 1 for r = 0). For such a ring R, we prove the commutativity if n + t > 1,
Hamza A. S. Abujabal, Veselin Peric
openaire +2 more sources
Commutativity of rings with contraints on nilpotents and nonnilpotents [PDF]
International Journal of Mathematics and Mathematical Sciences, 1989 Let R be a ring, N its set of nilpotent elements, and \(n>1\) a fixed positive integer. It is proved that R is commutative if it satisfies the following conditions: (i) N is commutative; (ii) \(x^ ny=xy^ n\) for all \(x,y\in R\setminus N\); (iii) if \(a\in N\), \(b\in R\) and \(n![a,b]=0\), then \([a,b]=0\). None of the three conditions can be deleted.
Mohamad Hasanali, Adil Yaqub
openaire +3 more sources
Commutativity of rings with polynomial constraints [PDF]
Czechoslovak Mathematical Journal, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Fractal and FractionalIn this study, we present a unified symmetry-conservation solution analysis of a well-posed resonant nonlinear Schrödinger (NLS)-type equation incorporating spatio-temporal dispersion and inter-modal dispersion.
Funda Turk
doaj +1 more source
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
Advanced Intelligent Discovery, EarlyView.The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source