A bound for orders in differential Nullstellensatz

We give the first known bound for orders of differentiations in differential Nullstellensatz for both partial and ordinary algebraic differential equations. This problem was previously addressed in [A. Seidenberg, An elimination theory for differential algebra, Univ. of California Publ. in Math. III (2) (1956) 31–66] but no complete solution was given. Our result is a complement to the corresponding result in algebraic geometry, which gives a bound on degrees of polynomial coefficients in effective Nullstellensatz [G. Hermann, Die Frage der endlich vielen Schritte in der Theorie der Polynomideale, Math. Ann. 95 (1) (1926) 736–788; E.W. Mayr, A.W. Meyer, The complexity of the word problems for commutative semigroups and polynomial ideals, Adv. Math. 46 (3) (1982) 305–329; W.D. Brownawell, Bounds for the degrees in the Nullstellensatz, Ann. of Math. 126 (3) (1987) 577–591; J. Kollár, Sharp effective Nullstellensatz, J. Amer. Math. Soc. 1 (4) (1988) 963–975; L. Caniglia, A. Galligo, J. Heintz, Some new effectivity bounds in computational geometry, in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Rome, 1988, in: Lecture Notes in Comput. Sci., vol. 357, Springer, Berlin, 1989, pp. 131–151; N. Fitchas, A. Galligo, Nullstellensatz effectif et conjecture de Serre (théorème de Quillen–Suslin) pour le calcul formel, Math. Nachr. 149 (1990) 231–253; T. Krick, L.M. Pardo, M. Sombra, Sharp estimates for the arithmetic Nullstellensatz, Duke Math. J. 109 (3) (2001) 521–598; Z. Jelonek, On the effective Nullstellensatz, Invent. Math. 162 (1) (2005) 1–17; T. Dubé, A combinatorial proof of the effective Nullstellensatz, J. Symbolic Comput. 15 (3) (1993) 277–296].This paper is dedicated to the memory of Eugeny Pankratiev, who was the advisor of the first three authors at Moscow State University.     

On residually ideals and projective dimension one modules

We prove that certain modules are faithful. This enables us to draw consequences about the reduction number and the integral closure of some classes of ideals.

     

Tight closure commutes with localization in binomial rings

It is proved that tight closure commutes with localization in any domain which has a module finite extension in which tight closure is known to commute with localization. It follows that tight closure commutes with localization in binomial rings, in particular in semigroup or toric rings.

     

On the number of generators of Cohen-Macaulay ideals

Several bounds on the number of generators of Cohen-Macaulay ideals known in the literature follow from a simple inequality which bounds the number of generators of such ideals in terms of mixed multiplicities. Results of Cohen and Akizuki, Abhyankar, Sally, Rees and Boratynski-Eisenbud-Rees are deduced very easily from this inequality.

     

Complemented ideals in the Fourier algebra of a locally compact group

In this paper we provide a necessary condition for a closed ideal in the Fourier algebra of a locally compact amenable group to be completely complemented. The classification of completely complemented ideals is completed in the case of an amenable discrete group. We also investigate the ideals possessing a bounded approximate identity.

     

The Pointwise Characterizations of Fuzzy Ideals and Fuzzy Prime Ideals

TheconceptofthefuzzysubgroupsintroducedinRosenfeld[l],wasappliedtogeneralizesomeofthebasicconceptsofalgebra.In[2,3,4]LuWangjindefinedfuzzysubringsandfuzzyideals,introducedtheoperationsonfuzzyidea1s.In[5]theautherdiscussedaboutthenatureoffuzzysubringsbythenestedsubring.Butthepointwisedefinitionsoffuzzysubgroupsandfuzzysubringsarerare.Inthispaper,theautherprogramsanddiscussesthefuzzysubrings,fuzzyidealsandfuzzyprimeidealsbyfuzzyPoints..5l.PreliminariesLetusrecallsomeconceptsoccurrjnginthe[2,3…     

格上TL理想的性质及生成

本文利用完备Ｂｒｏｕｗｅｒ格Ｌ及Ｌ上的无穷Ｖ－分配ｔ－模定义分配格Ｍ上的ＴＬ理想，讨论一些基本性质，并给出由Ｌ子集生成的ＴＬ理想的计算公式．     

Stickelberger Codes

Let p be an odd prime and be a primitive p th root of unity over . The Galois group G of over is a cyclic group of order p-1. The integral group ring [G] contains the Stickelberger ideal S _p which annihilates the ideal class group of K. In this paper we investigate the parameters of cyclic codes S _p (q) obtained as reductions of S _p modulo primes q which we call Stickelberger codes. In particular, we show that the dimension of S _p (p) is related to the index of irregularity of p, i.e., the number of Bernoulli numbers B _2k , , which are divisible by p. We then develop methods to compute the generator polynomial of S _p (p). This gives rise to anew algorithm for the computation of the index of irregularity of a prime. As an application we show that 20,001,301 is regular. This significantly improves a previous record of 8,388,019 on the largest explicitly known regular prime.