One of the main themes in current management control literature is study systems practices. While several studies have examined pairwise (‘dyadic’) complementarities practices to investigate whether a system exists, may also be comprised more than two (‘nondyadic systems’). We examine organizations use complementary three performance measurement uses mitigate problem effort direction. illustrat...

Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem solving are interleaved, and fit naturally within constraint logic programming. However, in general, filtering that is sound for a global constraint can be unso...

In this article we investigate homological aspects of a skew complete intersection R, i.e. polynomial ring modulo an ideal generated by sequence regular normal elements. We compute the derived braided Hochschild cohomology R relative to and show its action on ExtR(M,N) is noetherian for finitely R-modules M N respecting braiding R. When parameters defining are roots unity use define support the...

We define and study the Milnor K-ring of a field F modulo a subgroup of the multiplicative group of F . We compute it in several arithmetical situations, and study the reflection of orderings and valuations in this ring. Introduction Let F be a field and let F× be its multiplicative group. The Milnor K-ring K ∗ (F ) of F is the tensor (graded) algebra of the Z-module F× modulo the homogenous id...

Let $f: Arightarrow B$ be a ring homomorphism and let $J$ be an ideal of $B$. In this paper, we investigate the transfer of the property of coherence to the amalgamation $Abowtie^{f}J$. We provide necessary and sufficient conditions for $Abowtie^{f}J$ to be a coherent ring.

For a graph G, we construct two algebras, whose dimensions are both equal to the number of spanning trees of G. One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ring modulo certain powers of linear forms. We describe the set of monomials that forms a linear basis in each of these two algebras. The basis...

Factorization algorithms over Q[X] and Fp[X] are key tools of computational number theory. Many algorithms over number fields rely on the possibility of factoring polynomials in those fields. Because of the recent development of relative methods in computational number theory, see for example (Cohen et al. 1998, Daberkow and Pohst 1995), efficient generalizations of factorization algorithms to ...