Ideals in a perfect closure, linear growth of primary decompositions, and tight closure

This paper is concerned with tight closure in a commutative Noetherian ring of prime characteristic , and is motivated by an argument of K. E. Smith and I. Swanson that shows that, if the sequence of Frobenius powers of a proper ideal of has linear growth of primary decompositions, then tight closure (of ) `commutes with localization at the powers of a single element'. It is shown in this paper that, provided has a weak test element, linear growth of primary decompositions for other sequences of ideals of that approximate, in a certain sense, the sequence of Frobenius powers of would not only be just as good in this context, but, in the presence of a certain additional finiteness property, would actually imply that tight closure (of ) commutes with localization at an arbitrary multiplicatively closed subset of .

Work of M. Katzman on the localization problem for tight closure raised the question as to whether the union of the associated primes of the tight closures of the Frobenius powers of has only finitely many maximal members. This paper develops, through a careful analysis of the ideal theory of the perfect closure of , strategies for showing that tight closure (of a specified ideal of ) commutes with localization at an arbitrary multiplicatively closed subset of and for showing that the union of the associated primes of the tight closures of the Frobenius powers of is actually a finite set. Several applications of the strategies are presented; in most of them it was already known that tight closure commutes with localization, but the resulting affirmative answers to Katzman's question in the various situations considered are believed to be new.

     

Robust Algorithms for the Stable Set Problem

The stable set problem is to find in a simple graph a maximum subset of pairwise non-adjacent vertices. The problem is known to be NP-hard in general and can be solved in polynomial time on some special classes, like cographs or claw-free graphs. Usually, efficient algorithms assume membership of a given graph in a special class. Robust algorithms apply to any graph G and either solve the problem for G or find in it special forbidden configurations. In the present paper we describe several efficient robust algorithms, extending some known results.     

Multivariate Polynomial Minimization and Its Application in Signal Processing

We make a conjecture that the number of isolated local minimum points of a 2n-degree or (2n+1)-degree r-variable polynomial is not greater than n ^r when n 2. We show that this conjecture is the minimal estimate, and is true in several cases. In particular, we show that a cubic polynomial of r variables may have at most one local minimum point though it may have 2^r critical points. We then study the global minimization problem of an even-degree multivariate polynomial whose leading order coefficient tensor is positive definite. We call such a multivariate polynomial a normal multivariate polynomial. By giving a one-variable polynomial majored below a normal multivariate polynomial, we show the existence of a global minimum of a normal multivariate polynomial, and give an upper bound of the norm of the global minimum and a lower bound of the global minimization value. We show that the quartic multivariate polynomial arising from broad-band antenna array signal processing, is a normal polynomial, and give a computable upper bound of the norm of the global minimum and a computable lower bound of the global minimization value of this normal quartic multivariate polynomial. We give some sufficient and necessary conditions for an even order tensor to be positive definite. Several challenging questions remain open.     

A functional equation arising from multiplication of quantum integers

For the quantum integer [n]_q=1+q+q²+?+qⁿ⁻¹ there is a natural polynomial multiplication such that [m]_q⊗_q[n]_q=[mn]_q. This multiplication leads to the functional equation f_m(q)f_n(q^m)=f_mn(q), defined on a given sequence of polynomials. This paper contains various results concerning the construction and classification of polynomial sequences that satisfy the functional equation, as well open problems that arise from the functional equation.     

Characterization of completions of reduced local rings

We find necessary and sufficient conditions for a complete local ring to be the completion of a reduced local ring. Explicitly, these conditions on a complete local ring with maximal ideal are (i) or , and (ii) for all , if is an integer of , then .

     

Commutativity of rings through a Streb's result

In this paper we investigate commutativity of rings with unity satisfying any one of the properties:

Approximation Constants in Equidistant Lagrange Interpolation

In this paper we present a new limit relation for the equidistant Lagrange interpolation polynomials to |x|, (0, 1] on the internal [–1, 1]. The result extends a well-known result of D. L. Berman and S. M. Losinskii. Furthermore, we briefly discuss on a possible connection of the limit relation to another prominent constant in best uniform polynomial approximation for |x| - the so-called Bernstein constant.     

Undecidability of the word problem in relatively free rings

An example of a series of varieties of rings with the finite basis property is constructed for which the word problem in the relatively free ring of rankn in the variety is decidable if and only ifn <p. Translated fromMatematicheskie Zametki, Vol. 67, No. 4, pp. 582–594, April, 2000.     

RRF rings which are not LRF

Define a ringA to be RRF (respectively LRF) if every right (respectively left)A-module is residually finite. We determine the necessary and sufficient conditions for a formal triangular matrix ring to be RRF (respectively LRF). Using this we give examples of RRF rings which are not LRF.     

Generalizations of Perfect, Semiperfect, and Semiregular Rings

For a ring R and a right R-module M, a submodule N of M is said to be -small in M if, whenever N + X = M with M/X singular, we have X = M. If there exists an epimorphism p: P M such that P is projective and Ker(p) is -small in P, then we say that P is a projective -cover of M. A ring R is called -perfect (resp., -semiperfect, -semiregular) if every R-module (resp., simple R-module, cyclically presented R-module) has a projective -cover. The class of all -perfect (resp., -semiperfect, -semiregular) rings contains properly the class of all right perfect (resp., semiperfect, semiregular) rings. This paper is devoted to various properties and characterizations of -perfect, -semiperfect, and -semiregular rings. We define (R) by (R)/Soc(R_R) = Jac(R/Soc(R_R)) and show, among others, the following results: