PURE SUBMODULES AND TORSION FREE IMAGES OF COMPLETELY DECOMPOSABLE TORSION FREE MODULES

ABSTRACT

Prebalanced and precobalanced sequences play an important role in the investigation of Butler Modules. For Butler groups (modules over the integers), they are equivalent conditions. This is not the case for modules over integral domains in general. We investigate conditions when one type of exactness would imply the other. We show that for analytically unramified domains, the equivalence of prebalanced and precobalanced exactness will hold if and only if every maximal ideal has a unique maximal ideal lying over it in the domain's integral closure.     

Algorithms for core stability,core largeness,exactness, and extendability of flow games

We study core stability and some related properties of flow games defined on simple networks (all edge capacities are equal) from an algorithmic point of view. We first present a sufficient and necessary condition that can be tested efficiently for a simple flow game to have a stable core. We also prove the equivalence of the properties of core largeness, extendability, and exactness of simple flow games and provide an equivalent graph theoretic characterization which allows us to decide these properties in polynomial time.     

Exactness Property of the Exact Absolute Value Penalty Function Method for Solving Convex Nondifferentiable Interval-Valued Optimization Problems

In the paper, the classical exact absolute value function method is used for solving a nondifferentiable constrained interval-valued optimization problem with both inequality and equality constraints. The property of exactness of the penalization for the exact absolute value penalty function method is analyzed under assumption that the functions constituting the considered nondifferentiable constrained optimization problem with the interval-valued objective function are convex. The conditions guaranteeing the equivalence of the sets of LU-optimal solutions for the original constrained interval-valued extremum problem and for its associated penalized optimization problem with the interval-valued exact absolute value penalty function are given.     

Stable functors of derived equivalences and Gorenstein projective modules

From certain triangle functors, called nonnegative functors, between the bounded derived categories of abelian categories with enough projective objects, we introduce their stable functors which are certain additive functors between the stable categories of the abelian categories. The construction generalizes a previous work by Hu and Xi. We show that the stable functors of nonnegative functors have nice exactness property and are compatible with composition of functors. This allows us to compare conveniently the homological properties of objects linked by the stable functors. In particular, we prove that the stable functor of a derived equivalence between two arbitrary rings provides an explicit triangle equivalence between the stable categories of Gorenstein projective modules. This generalizes a result of Y. Kato. Our results can also be applied to provide shorter proofs of some known results on homological conjectures.     

Cubature Formulas Invariant under the Icosahedral Group of Rotations with Inversion on a Sphere

In this paper, an algorithm of search for the best (in a sense) cubature formulas on a sphere that are invariant with respect to the icosahedral group of rotations with inversion is described. This algorithm is used to find the parameters of all best cubature formulas of this symmetry type up to the 79th degree of exactness. Some parameters of the new cubature formulas of the 21st, 25th, and 29th orders of exactness are given to 16 significant digits.     

A Nonlinear Spencer Complex for the Group of Invertible Differential Operators and Its Applications

A nonlinear Spencer complex for the group of invertible C-differential operators is constructed on an arbitrary infinitely prolonged equation. The exactness of this complex is proved in neighborhoods of generic points. Necessary and sufficient conditions for flatness of systems of differential equations are implied by the exactness. A method for the search of nonlinear compatibility operators is presented. Other applications of the obtained result are discussed.     

Assignment games with stable core

We prove that the core of an assignment game (a two-sided matching game with transferable utility as introduced by Shapley and Shubik, 1972) is stable (i.e., it is the unique von Neumann-Morgenstern solution) if and only if there is a matching between the two types of players such that the corresponding entries in the underlying matrix are all row and column maximums. We identify other easily verifiable matrix properties and show their equivalence to various known sufficient conditions for core-stability. By these matrix characterizations we found that on the class of assignment games, largeness of the core, extendability and exactness of the game are all equivalent conditions, and strictly imply the stability of the core. In turn, convexity and subconvexity are equivalent, and strictly imply all aformentioned conditions. Final version: April 1, 2001     

五行系统与群的结构

利用二元关系讨论五行系统,建立了五行系统与五阶循环群之间的一一对应关系,作为推广,提出了多重关系系统的概念并讨论了其相容性、完备性和恰当性.     

Orbit equivalence,flow equivalence and ordered cohomology

We study self-homeomorphisms of zero dimensional metrizable compact Hausdorff spaces by means of the ordered first cohomology group, particularly in the light of the recent work of Giordano Putnam, and Skau on minimal homeomorphisms. We show that flow equivalence of systems is analogous to Morita equivalence between algebras, and this is reflected in the ordered cohomology group. We show that the ordered cohomology group is a complete invariant for flow equivalence between irreducible shifts of finite type; it follows that orbit equivalence implies flow equivalence for this class of systems. The cohomology group is the (pre-ordered) Grothendieck group of the C^*-algebra crossed product, and we can decide when the pre-ordering is an ordering, in terms of dynamical properties.     

A class of exactness properties characterized via left Kan extensions

We consider a general class of exactness properties on a finitely complete category, all of which can be expressed as the condition that a certain morphism in a diagram is a strong epimorphism. For each such exactness property, we characterize finitely bicomplete categories having the property by restricting the condition to those diagrams built from only one object in the category via a left Kan extension. In the regular context, this generalizes the theory of approximate co-operations introduced by D. Bourn and Z. Janelidze. As an application, we deduce from this a characterization of (essentially) algebraic categories satisfying such a given exactness property. The pointed version of these exactness properties is also studied.     

样条函数精度的某些问题研究

样条函数的精度是Schoenberg于1946年在[20]中首次提到的．本文在Schoenberg 工作的基础上,进一步讨论了这种样条的精度和跨度之间的联系,并且构造了某些特殊样条满足精度最大条件下的跨度最小．然后,我们还讨论了当一元样条的问题推广到多元的时候,如何将所要考虑的问题用多元的工具加以描述,从而能够将某些特殊的多元box样条的精度和跨度之间的联系做进一步的研究．     

Clean-正合和Clean-导出范畴

在交换环R上,引入了Clean-正合以及Clean-导出范畴的概念,分别给出了Clean-短正合列和Clean-正合复形的等价刻画,研究了Clean-导出范畴的性质.特别地,证明了有界Clean-导出范畴可以实现为特殊的同伦范畴.     

A Unified Approach to the Global Exactness of Penalty and Augmented Lagrangian Functions I: Parametric Exactness

In this two-part study, we develop a unified approach to the analysis of the global exactness of various penalty and augmented Lagrangian functions for constrained optimization problems in finite-dimensional spaces. This approach allows one to verify in a simple and straightforward manner whether a given penalty/augmented Lagrangian function is exact, i.e., whether the problem of unconstrained minimization of this function is equivalent (in some sense) to the original constrained problem, provided the penalty parameter is sufficiently large. Our approach is based on the so-called localization principle that reduces the study of global exactness to a local analysis of a chosen merit function near globally optimal solutions. In turn, such local analysis can be performed with the use of optimality conditions and constraint qualifications. In the first paper, we introduce the concept of global parametric exactness and derive the localization principle in the parametric form. With the use of this version of the localization principle, we recover existing simple, necessary, and sufficient conditions for the global exactness of linear penalty functions and for the existence of augmented Lagrange multipliers of Rockafellar–Wets’ augmented Lagrangian. We also present completely new necessary and sufficient conditions for the global exactness of general nonlinear penalty functions and for the global exactness of a continuously differentiable penalty function for nonlinear second-order cone programming problems. We briefly discuss how one can construct a continuously differentiable exact penalty function for nonlinear semidefinite programming problems as well.     

Exactness and algorithm of an objective penalty function

Penalty function is an important tool in solving many constrained optimization problems in areas such as industrial design and management. In this paper, we study exactness and algorithm of an objective penalty function for inequality constrained optimization. In terms of exactness, this objective penalty function is at least as good as traditional exact penalty functions. Especially, in the case of a global solution, the exactness of the proposed objective penalty function shows a significant advantage. The sufficient and necessary stability condition used to determine whether the objective penalty function is exact for a global solution is proved. Based on the objective penalty function, an algorithm is developed for finding a global solution to an inequality constrained optimization problem and its global convergence is also proved under some conditions. Furthermore, the sufficient and necessary calmness condition on the exactness of the objective penalty function is proved for a local solution. An algorithm is presented in the paper in finding a local solution, with its convergence proved under some conditions. Finally, numerical experiments show that a satisfactory approximate optimal solution can be obtained by the proposed algorithm.     

On the asymptotic exactness of error estimators for linear triangular finite elements

Summary This paper deals with a-posteriori error estimates for piecewise linear finite element approximations of elliptic problems. We analyze two estimators based on recovery operators for the gradient of the approximate solution. By using superconvergence results we prove their asymptotic exactness under regularity assumptions on the mesh and the solution.One of the estimators can be easily computed in terms of the jumps of the gradient of the finite element approximation. This estimator is equivalent to the error in the energy norm under rather general conditions. However, we show that for the asymptotic exactness, the regularity assumption on the mesh is not merely technical. While doing this, we analyze the relation between superconvergence and asymptotic exactness for some particular examples.     

Equivalence relations of AF-algebra extensions

In this paper, we consider equivalence relations of C*-algebra extensions and describe the relationship between the isomorphism equivalence and the unitary equivalence. We also show that a certain group homomorphism is the obstruction for these equivalence relations to be the same.     

Resolvent convergence and spectral approximations of sequences of self-adjoint subspaces

This paper studies resolvent convergence and spectral approximations of sequences of self-adjoint subspaces (relations) in complex Hilbert spaces. Concepts of strong resolvent convergence, norm resolvent convergence, spectral inclusion, and spectral exactness are introduced. Fundamental properties of resolvents of subspaces are studied. By applying these properties, several equivalent and sufficient conditions for convergence of sequences of self-adjoint subspaces in the strong and norm resolvent senses are given. It is shown that a sequence of self-adjoint subspaces is spectrally inclusive under the strong resolvent convergence and spectrally exact under the norm resolvent convergence. A sufficient condition is given for spectral exactness of a sequence of self-adjoint subspaces in an open interval lacking essential spectral points. In addition, criteria are established for spectral inclusion and spectral exactness of a sequence of self-adjoint subspaces that are defined on proper closed subspaces.     

Rethinking geometrical exactness

A crucial concern of early modern geometry was fixing appropriate norms for deciding whether some objects, procedures, or arguments should or should not be allowed into it. According to Bos, this is the exactness concern. I argue that Descartes’s way of responding to this concern was to suggest an appropriate conservative extension of Euclid’s plane geometry (EPG). In Section 2, I outline the exactness concern as, I think, it appeared to Descartes. In Section 3, I account for Descartes’s views on exactness and for his attitude towards the most common sorts of constructions in classical geometry. I also explain in which sense his geometry can be conceived as a conservative extension of EPG. I conclude by briefly discussing some structural similarities and differences between Descartes’s geometry and EPG.     

Graded quaternion symbol equivalence of function fields

We present criteria for a pair of maps to constitute a quaternion-symbol equivalence (or a Hilbert-symbol equivalence if we deal with global function fields) expressed in terms of vanishing of the Clifford invariant. In principle, we prove that a local condition of a quaternion-symbol equivalence can be transcribed from the Brauer group to the Brauer-Wall group.