Ideals in Morita Rings and Morita Semigroups

We characterize the lattice of all ideals of a Morita ring （semigroup） when the corresponding pair of rings （semigroups） in the Morita context are Morita equivalent s-unital （like-unitv） rings （semigroups）.     

Diameter,width, closest line pair,and parametric searching

We apply Megiddo's parametric searching technique to several geometric optimization problems and derive significantly improved solutions for them. We obtain, for any fixed ε>0, anO(n ^1+ε) algorithm for computing the diameter of a point set in 3-space, anO(^8/5+ε) algorithm for computing the width of such a set, and onO(n ^8/5+ε) algorithm for computing the closest pair in a set ofn lines in space. All these algorithms are deterministic. Work by Bernard Chazelle was supported by NSF Grant CCR-90-02352. Work by Herbert Edelsbrunner was supported by NSF Grant CCR-89-21421. Work by Leonidas Guibas and Micha Sharir was supported by a grant from the U.S.-Israeli Binational Science Foundation. Work by Micha Sharir was also supported by ONR Grant N00014-90-J-1284, by NSF Grant CCR-89-01484, and by grants from the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.     

A mixed forward-backward dynamic programming method using parallel computation

We consider optimization problems which can be solved by either forward or backward dynamic programming. We propose a method which reduces the computing time by a factor of two when two processors are used in parallel.This research was sponsored by the National Science Foundation, Grant No. INT-78-09263, while the author was visiting at the University of California, Berkeley, California.     

Cyclic homology of Dedekind domains

We compute the cyclic homology of the algebraR[t]/(P(t)) relative to an arbitrary integral domainR. As an application, we compute the cyclic homology of number rings.Supported by N.S.F. Grant No. DMS-8807203.     

Gr?bner bases in difference-differential modules and difference-differential dimension polynomials

In this paper we extend the theory of Gr?bner bases to difference-differential modules and present a new algorithmic approach for computing the Hilbert function of a finitely generated difference-differential module equipped with the natural filtration. We present and verify algorithms for constructing these Gr?bner bases counterparts. To this aim we introduce the concept of “generalized term order” on ℕ ^m ×ℤ ⁿ and on difference-differential modules. Using Gr?bner bases on difference-differential modules we present a direct and algorithmic approach to computing the difference-differential dimension polynomials of a difference-differential module and of a system of linear partial difference-differential equations. This work was supported by the National Natural Science Foundation of China (Grant No. 60473019) and the KLMM (Grant No. 0705)     

A uniformly differentiable approximation scheme for delay systems using splines

A new spline-based scheme is developed for linear retarded functional differential equations within the framework of semigroups on the Hilbert spaceR ⁿ ×L ². The approximating semigroups inherit in a uniform way the characterization for differentiable semigroups from the solution semigroup of the delay system (e.g., among other things the logarithmic sectorial property for the spectrum). We prove convergence of the scheme in the state spacesR ⁿ ×L ² andH ¹. The uniform differentiability of the approximating semigroups enables us to establish error estimates including quadratic convergence for certain classes of initial data. We also apply the scheme for computing the feedback solutions to linear quadratic optimal control problems.Work done by K. Ito was supported by AFOSR under Contract No. F-49620-86-C-0111, by NASA under Grant No. NAG-1-517, and by NSF under Grant No. UINT-8521208. Work done by F. Kappel was supported by AFOSR under Grant No. 84-0398 and by FWF(Austria) under Grants S3206 and P6005.     

Optimal recovery on the classes of functions with bounded mixed derivative

Temlyakov considered the optimal recovery on the classes of functions with bounded mixed derivative in the Lp metrics and gave the upper estimates of the optimal recovery errors. In this paper, we determine the asymptotic orders of the optimal recovery in Sobolev spaces by standard information, i.e., function values, and give the nearly optimal algorithms which attain the asymptotic orders of the optimal recovery.     

Gorenstein flatness and injectivity over Gorenstein rings

Let R be a Gorenstein ring.We prove that if I is an ideal of R such that R/I is a semi-simple ring,then the Gorenstein flat dimension of R/I as a right R-module and the Gorenstein injective dimension of R/I as a left R-module are identical.In addition,we prove that if R→S is a homomorphism of rings and SE is an injective cogenerator for the category of left S-modules,then the Gorenstein flat dimension of S as a right R-module and the Gorenstein injective dimension of E as a left R-module are identical.We also give some applications of these results.     

Exchange Rings Satisfying the <Emphasis Type="Italic">n</Emphasis>-Stable Range Condition,II

This is a continuation of the paper [14]. It is shown that any finite subdirect product of exchange rings satisfying the n-stable range condition is still an exchange ring satisfying the n-stable range condition. Furthermore, we give necessary and sufficient conditions on matrices over an exchange ring R, under which R satisfies the n-stable range condition. This generalizes the corresponding results for unit-regular rings and the stable range one condition.2000 Mathematics Subject Classification: 19B10, 16E50This work was supported by the National Natural Science Foundation of China (Grant No. 19801012) and the Ministry of Education of China.     

Radicals coinciding with the von Neumann regular radical on artinian rings

We study radicals which coincide on artinian rings with Jacobson semisimple rings or equivalently with von Neumann regular rings. Exact lower and upper bounds for strong coincidence are given. For weak coincidence the exact lower bound is that for strong coincidence. We determine the smallest homomorphically closed class which contains all radicals coinciding in the weak sense with the von Neumann regular radical on artinian rings, but we do not know even the existence of the upper bound for weak coincidence. If a radical coincides with the von Neumann regular radical on artinian rings in the strong sense, then (A) is a direct summand inA for every aritian ringA.Research carried out within the Austro-Hungarian Bilateral Intergovernmental Cooperation Program A-31. Research partially supported by Hungarian National Foundations for Scientific Research Grant No. T4265The second author gratefully acknowledges the support of the Carnegie Trust for Universities of Scotland     

Harmonicity and minimality of oriented distributions

We consider an oriented distribution as a section of the corresponding Grassmann bundle and, by computing the tension of this map for conveniently chosen metrics, we obtain the conditions which the distribution must satisfy in order to be critical for the functionals related to the volume or the energy of the map. We show that the three-dimensional distribution ofS ^4m+3 tangent to the quaternionic Hopf fibration defines a harmonic map and a minimal immersion and we extend these results to more general situations coming from 3-Sasakian and quaternionic geometry. Partially supported by DGI Grant No. BFM2001-3548.     

Look-back policies for two-stage,pull-type production/inventory systems

We consider a two-stage, pull-type production/inventory system with a known service mechanism at the first stage. Set-ups and start-ups are involved in the operation of the second stage. We develop a production control policy for the second stage, within the class of (R, r) continuous-review policies, that minimizes the long run average total cost. We use a semi-Markov decision model to obtain an optimal policy for the operation of the second stage. The structure of the optimal policy suggests the use of a suboptimal look-back policy that delays the set-up at the second stage if the buffer lacks sufficient raw material. The performance of the system and the average total cost under the suboptimal policy can be obtained approximately using a decomposition algorithm. We show examples justifying the use of this suboptimal policy.This research is supported by the NSF Grant No. NSF-NCR-9110105, NSF Grant No. NSF-DDM-9014868 and by the North Atlantic Treaty Organization Grant No. NATO-CRG-900580.     

New results from an algorithm for counting posets

In this paper we report on the success of a new technique for computing the number of unlabeled partial orders on n elements based on the partial order of partial orders ordered by containment. In addition to the number of partial orders, we obtain complete enumerations of the number of partial orders on n elements with r relations for n<-11, where r takes on all possible values. We point out some interesting sequences that arise in these tables.Supported by Natural Sciences and Engineering Research Council Grant No. OGP8053.     

Global dimension and left derived functors of Hom

It is well known that the right global dimension of a ring R is usually computed by the right derived functors of Hom and the left projective resolutions of right R-modules. In this paper, for a left coherent and right perfect ring R, we characterize the right global dimension of R, from another point of view, using the left derived functors of Hom and the right projective resolutions of right R-modules. It is shown that rD(R)≤n (n≥2) if and only if the gl right Proj-dim MR≤n - 2 if and only if Extn-1(N, M) = 0 for all right R-modules N and M if and only if every (n - 2)th Proj-cosyzygy of a right R-module has a projective envelope with the unique mapping property. It is also proved that rD(R)≤n (n≥1) if and only if every (n-1)th Proj-cosyzygy of a right R-module has an epic projective envelope if and only if every nth Vroj-cosyzygy of a right R-module is projective. As corollaries, the right hereditary rings and the rings R with rD(R)≤2 are characterized.     

A linear-time algorithm for computing the voronoi diagram of a convex polygon

We present an algorithm for computing certain kinds of three-dimensional convex hulls in linear time. Using this algorithm, we show that the Voronoi diagram ofn sites in the plane can be computed in (n) time when these sites form the vertices of a convex polygon in, say, counterclockwise order. This settles an open problem in computational geometry. Our techniques can also be used to obtain linear-time algorithms for computing the furthest-site Voronoi diagram and the medial axis of a convex polygon and for deleting a site from a general planar Voronoi diagram.This research began while the first and fourth authors were visiting the Mathematical Sciences Research Institute in Berkeley, California. Work by the fourth author was supported in part by NSF Grant No. 8120790.     

A new proof of <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> estimates for the parabolic polyharmonic equations

In this paper we obtain local L ^p estimates for the parabolic polyharmonic equations by a straightforward approach. Yao was supported by the Innovation Foundation of Shanghai University (Grant No. A10-0101-08-905), Shanghai Leading Academic Discipline Project (Grant No. J50101) and Key Disciplines of Shanghai Municipality (Grant No. S30104). Zhou was supported by the National Basic Research Program of China (Grant No. 2006CB705700), National Natural Science Foundation of China (Grant No. 60532080), and the Key Project of Chinese Ministry of Education (Grant No. 306017)     

Bi-Lipschitz maps in <Emphasis Type="Italic">Q</Emphasis>-regular Loewner spaces

By applying the theory of quasiconformal maps in measure metric spaces that was introduced by Heinonen-Koskela, we characterize bi-Lipschitz maps by modulus inequalities of rings and maximal, minimal derivatives in Q-regular Loewner spaces. Meanwhile the sufficient and necessary conditions for quasiconformal maps to become bi-Lipschitz maps are also obtained. These results generalize Rohde’s theorem in ℝ ⁿ and improve Balogh’s corresponding results in Carnot groups. This research is supported by China NSF (Grant No. 10271077)     

On the optimum design of piston rings

We study a family of control problems that arise in the design of dynamically loaded bearings which have a minimum power loss; in particular, we study the design of piston rings with minimum parasitic power loss.This research was partially supported by NSF Grant No. MCS-77-05624.     

Gaining efficiency via weighted estimators for multivariate failure time data

Multivariate failure time data arise frequently in survival analysis. A commonly used technique is the working independence estimator for marginal hazard models. Two natural questions are how to improve the efficiency of the working independence estimator and how to identify the situations under which such an estimator has high statistical efficiency. In this paper, three weighted estimators are proposed based on three different optimal criteria in terms of the asymptotic covariance of weighted estimators. Simplified close-form solutions are found, which always outperform the working independence estimator. We also prove that the working independence estimator has high statistical efficiency, when asymptotic covariance of derivatives of partial log-likelihood functions is nearly exchangeable or diagonal. Simulations are conducted to compare the performance of the weighted estimator and working independence estimator. A data set from Busselton population health surveys is analyzed using the proposed estimators. This work was supported by National Natural Science Foundation of China (Grant No. 10628104), Fan was also supported by National Institutes of Health (Grant No. R01-GM072611) and Natural Science Foundation (Grant No. DMS-0714554), Zhou was supported by National Natural Science Funds for Distinguisheel Young Scholar (Grant No. 70825004), National Natural Science Foundation of China (Grant Nos. 10731010, 10628104), the National Basic Research Program (Grant No. 2007CB814902), Creative Research Groups of China (Grant No. 10721101) and Leading Academic Disipline Program, the 10 ^th five year plan of 211 Project for Shanghai University of Finance and Economics (the 3 ^rd phase), Cai was supported by National Institutes of Health (Grant No. R01-HL57444)     

On the structure of stationary sets

We isolate several classes of stationary sets of [k]ωand investigate implications among them. Under a large cardinal assumption, we prove a structure theorem for stationary sets.