We introduce normalised rewriting, a new rewrite relation. It generalises former notions of rewriting modulo E, dropping some conditions on E. For example , E can now be the theory of identity, idempo-tency, the theory of Abelian groups, the theory of com-mutative rings. We give a new completion algorithm for normalised rewriting. It contains as an instance the usual AC completion algorithm, bu...

Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated binomial ideal, which defines a toric subvariety in a product of projective lines. Connections to graphic arrangements and to Beilinson’s spectral sequence ...

In this paper we generalize the notion of Semi-continuity and MS-continuity and go on to study Semi-compactness, Semi-cocompactness, Semi-stability and Semi-costability in a ditopological texture space. We also extends the notion of Semi-compactness and Semi-cocompactness to a ditopological texture space modulo an ideal [13].

We prove a version of the five lemma which is useful for the study of boundary value problems for partial differential equations. The results are given in the category % of Banach spaces and bounded linear operators, and all conditions are stated modulo an arbitrary ideal of 9>. We also show that the results are valid in more general categories.

this study included 81 samples which belonged to 13 speices from myriophyllum genus. both nrdna its1 and its2 and cpdna matk, rbcl and trnh-psba loci were used for diagnose of invasive from native plant. the nrdna its1and its2 data proved highly variable and could differentiate between all but had low pcr amplification success,based on these result they would not recommend as a suitable barcode...

We introduce the notion of well-founded recursive order-sorted equational logic (OS) theories modulo axioms. Such theories de ne functions by well-founded recursion and are inherently terminating. Moreover, for well-founded recursive theories important properties such as con uence and su cient completeness are modular for so-called fair extensions. This enables us to incrementally check these p...

Monico published in [Journal of Symbolic Computation, 34(5):451–459, 2002] an algorithm to compute the primary decomposition of a zero-dimensional ideal, that mostly relies on a characteristic polynomial computation modulo the input ideal, and its factorization. We revisit this algorithm, and discuss Maple and Magma implementations that contradict the somehow pessimistic conclusions of Monico’s...