In this paper, the study of vague structures of Γ-semigroups is initiated by introducing the concepts of vague subsemigroup, vague bi-ideal and vague (1, 2)-ideal in a Γ-semigroup and some fundamental results are obtained. Then the concept of vague weakly completely prime ideals in Γ-semigroups has been introduced and studied directly and via operator semigroups

We investigate the symmetry component of the center variety of polynomial differential systems, corresponding to systems with an axis of symmetry in the real plane. We give a general algorithm to find this component, compute its dimension and show that it is irreducible. We show that our methods provide a simple way to compute the radical of the ideal generated by the focus quantities and, ther...

In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on the classical technique of elimination of variables and colon ideals and uses a tricky choice of prime integers to work with. Thanks to this technique, we ca...

In the last twenty years several methods for computing primary decompositions of ideals in multivariate polynomial rings over fields (Seidenberg (1974), Lazard (1985), Kredel (1987), Eisenbud et al. (1992)), the integers (Seidenberg, 1978), factorially closed principal ideal domains (Ayoub (1982), Gianni et al. (1988)) and more general rings (Seidenberg, 1984) have been proposed. A related prob...

The diagonal in a product of projective spaces is cut out by the ideal of 2×2-minors of a matrix of unknowns. The multigraded Hilbert scheme which classifies its degenerations has a unique Borel-fixed ideal. This Hilbert scheme is generally reducible, and its main component is a compactification of PGL(d)/PGL(d). For n = 2 we recover the manifold of complete collineations. For projective lines ...

Let I be the defining ideal of a smooth irreducible complete intersection space curve C with defining equations of degrees a and b. We use the partial elimination ideals introduced by Mark Green to show that the lexicographic generic initial ideal of I has Castelnuovo-Mumford regularity 1+ ab(a− 1)(b− 1)/2 with the exception of the case a = b = 2, where the regularity is 4. Note that ab(a− 1)(b...

Montgomery multiplication in GF(2) is defined by a(x)b(x) r−1(x) mod f(x), where the field is generated by irreducible polynomial f(x), a(x) and b(x) are two field elements in GF(2), and r(x) is a fixed field element in GF(2). In this paper, first we present a generalized Montgomery multiplication algorithm in GF(2). Then by choosing r(x) according to f(x), we show that efficient architecture f...

Suppose that R is an analytically irreducible or excellent local domain with maximal ideal m . We consider multiplicities and mixed of by filtrations -primary ideals. show the theorem Teissier, Rees Sharp, Katz, characterizing equality in Minkowski inequality for ideals, true divisorial filtrations, larger category bounded filtrations. This not arbitrary

Let a be an ideal of holomorphic functions vanishing only at the origin in C. The type of a is an invariant that measures the order of vanishing of the functions in a along holomorphic curves; this invariant is of importance in the study of subelliptic estimates and subelliptic multiplier ideal sheaves. Recently there has been some interest in the question of which curves actually compute the t...

Montgomery multiplication in GF(2m) is defined by a(x)b(x)r 1(x) mod f(x), where the field is generated by irreducible polynomial f(x), a(x) and b(x) are two field elements in GF(2m), and r(x) is a fixed field element in GF(2m). In this paper, first we present a generalized Montgomery multiplication algorithm in GF(2m). Then by choosing r(X) according to f(x), we show that efficient architectur...