Computation of Almost Split Sequences with Applications to Relatively Projective and Prinjective Modules

Let be an Artin algebra, let mod be the category of finitely generated -modules, and let Amod be a contravariantly finite and extension closed subcategory. For an indecomposable and not Ext-projective module CA, we compute the almost split sequence 0ABC0 in A from the almost split sequence 0DTrCEC0 in mod. Since the computation is particularly simple if the minimal right A-approximation of DTrC is indecomposable for all indecomposable and not Ext-projective CA, we manufacture subcategories A with the desired property using orthogonal subcategories. The method of orthogonal subcategories is applied to compute almost split sequences for relatively projective and prinjective modules.     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

Jensen inequalities for functions with higher monotonicities

Summary We investigate generalizations of the classical Jensen and Chebyshev inequalities. On one hand, we restrict the class of functions and on the other we enlarge the class of measures which are allowed. As an example, consider the inequality (J)(f(x) d) A (f(x) d, d d = 1. Iff is an arbitrary nonnegativeL _x function, this holds if 0, is convex andA = 1. Iff is monotone the measure need not be positive for (J) to hold for all convex withA = 1. If has higher monotonicity, e.g., is also convex, then we get a version of (J) withA < 1 and measures that need not be positive.     

Endomorphism monoids of algebras whose subalgebra lattices are chains

A monoidM and a latticeL arealgebraic if there is an algebraA with endomorphism monoid EndA M and subalgebra lattice SuA L. For each chainC we characterize those monoidsM for whichM and C are algebraic. In particular we show that a finite monoidM is algebraic with the three-chain iff the equalizers ofM form a chainE 3. The same assertion however fails for infinite monoids. This generalizes the corresponding result for two-chains and solves a problem posed by B. Jónsson ([2], p. 147). We settle the same question for all longer chainsK. Presented by Ivo Rosenberg.     

Jordan axioms for C*-algebras

A complex Banach spaceA which is also an associative algebra provided with a conjugate linear vector space involution * satisfying (a ²)^*=(a ^*)², aa ^* a=a³ and ab+ba2ab for alla, b inA is shown to be a C^*-algebra. The assumptions onA can be expressed in terms of the Jordan algebra obtained by symmetrization of the product ofA and are satisfied by any C^*-algebra. Thus we obtain a purely Jordan characterization of C^*-algebras.     

Some homological properties of commutative semitrivial ring extensions

LetR be a commutative ring with 1 andM anR-module. If:M _R MR is anR-module homomorphism satisfying(mm)=(mm) and(mm)m=m(mm), the additive abelian groupRM becomes a commutative ring, if multiplication is defined by (r,m)(r,m)=(rr+(mm),rm+rm). This ring is called the semitrivial extension ofR byM and and it is denoted byR M. This generalizes the notion of a trivial extension and leads to a more interesting variety of examples. The purpose of this paper is to studyR M; in particular, we are interested in some homological properties ofR M as that of being Cohen-Macaulay, Gorenstein or regular. A sample result: Let (R,m) be a local Noetherian ring,M a finitely generatedR-module and Im() m. ThenR M is Gorenstein if and only if eitherRM is Gorenstein orR is Gorenstein,M is a maximal Cohen-Macaulay module andMM ^*, where the isomorphism is given by the adjoint of.     

Ergodic properties of Poisson processes with almost periodic intensity

Summary We discuss in this paper a non-homogeneous Poisson process A driven by an almost periodic intensity function. We give the stationary version A ^* and the Palm version A ⁰ corresponding to A ^*. Let (T _i ,i) be the inter-point distance sequence in A and (T _i ⁰ ,i) in A ⁰. We prove that forj, the sequence (T _i+j,i) converges in distribution to (T _i ⁰ ,i). If the intensity function is periodic then the convergence is in variation.     

Quadratically constrained quadratic programming: Some applications and a method for solution

The problem (QPQR) considered here is: minimizeQ ₁ (x) subject toQ _i (x) 0,i M ₁ {2,...,m},x P R ⁿ, whereQ _i (x), i M {1} M ₁ are quadratic forms with positive semi-definite matrices, andP a compact nonempty polyhedron of Rⁿ. Applications of (QPQR) and a new method to solve it are presented.Letu S={u R ^m;u 0, u _i= l}be fixed;then the problem:iM minimize u _iQ_i (x (u)) overP, always has an optimal solutionx (u), which is either feasible, iM i.e. u C₁ {u S;Q _i (x (u)) 0,i M ₁} or unfeasible, i.e. there exists ani M ₁ withu C {u S; Q_i(x(u)) 0}.Let us defineC _i C_i S _i withS _i {u S; u _i=0}, i M. A constructive method is used to prove that C _i is not empty and thatx (û) withiM û C _i characterizes an optimal solution to (QPQR). Quite attractive numerical results have been reached with this method.

---

Zusammenfassung Die vorliegende Arbeit befaßt sich mit Anwendungen und einer neuen Lösungsmethode der folgenden Aufgabe (QPQR): man minimiere eine konvexe quadratische ZielfunktionQ _i (x) unter Berücksichtigung konvexer quadratischer RestriktionenQ _i (x) 0, iM ₁ {2,...,m}, und/oder linearer Restriktionen.·Für ein festesu S {u R ^m;u 0, u _i=1},M {1} M₁ besitzt das Problem:iM minimiere die konvexe quadratische Zielfunktion u _i Q_i (x (u)) über dem durch die lineareniM Restriktionen von (QPQR) erzeugten, kompakten und nicht leeren PolyederP R ⁿ, immer eine Optimallösungx (u), die entweder zulässig ist: u C₁ {u S;Q ₁ (x (u)) 0,i M ₁} oder unzulässig ist, d.h. es existiert eini M ₁ mitu C_i {u S;Q _i (x(u))0}.Es seien folgende MengenC _i C_i S _i definiert, mitS _i {u S;u _i=0}, i M. Es wird konstruktiv bewiesen, daß C _i 0 undx (û) mitû C _i eine Optimallösung voniM iM (QPQR) ist; damit ergibt sich eine Methode zur Lösung von (QPQR), die sich als sehr effizient erwiesen hat. Ein einfaches Beispiel ist angegeben, mit dem alle Schritte des Algorithmus und dessen Arbeitsweise graphisch dargestellt werden können.

---

---

An earlier version of this paper was written during the author's stay at the Institute for Operations Research, Swiss Federal Institute of Technology, Zürich.     

Geometry and the Jones projection of a state

LetA be a von Neumann algebra and a faithful normal state. ThenO = { ºAd(g ¹) :g G _A }andU = { ºAd(u ^*) :u U _A are homogeneous reductive spaces. IfA is aC ^* algebra,e the Jones projection of the faithful state viewed as a conditional expectation, then we prove that the similarity orbit ofe by invertible elements ofA can be imbedded inAA in such a way thate is carried to 1 1 and the orbit ofe to a homogeneous reductive space and an analytic submanifold ofAA.     

Isomorphism of one-place functors Ext

Let be an associative ring with identity. One considers the category of left (unitary) -modules m and also the contravariant and the covariant functors Ext ¹ ( ,A) and Ext ¹ (A, ): M_z M. One proves the following results: (1) If the homomorphism of -modules A B induces an isomorphism Ext ¹ ( ,A)Ext ¹ ( ,B), then there exist injective -modules J₁ and J₂ such that AJ₁BJ₂. (2) Every functorial morphism Ext ¹ ( ,A)Ext ¹ ( ,B) induces a certain homomorphism of -modules AB. One also obtains a dual result.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 112, pp. 71–74, 1981.     

Concerning the solution set ofAx=b whereP≦A≦Q andp≦b≦q

Summary LetPQ ben×n real matrices so that ifPAQ for some matrixA, thenA is nonsingular. Letp andq ben-dimensional real column vectors. This paper determines the set of all solutionsx to the equationAx=b for allA andb so thatPAQ andpbq.     

Bang-bang optimal control for the dam problem

The dam problem with general geometry is considered. Fluid is drawn from the bottomS ₁ at a ratek where 0 k N, _{S 1} k M; the objective is to minimize the total pressure of the fluid in the dam. A bang-bang principle is established for any optimal controlk ₀, that is,k ₀ = 0 on a setA andk ₀ =N on the complement setS ₁ A. In the case of a rectangular dam the structure ofA is determined and the uniqueness of the minimizerk ₀ is established.This work is partially supported by National Science Foundation Grants DMS-8501397 and DMS-8420896.     

Properties of solutions of linear functional-differential equations depending on a parameter

On the segment 0 t1 we study the equation A(d/dt, )x(t) + [F()x](t)=f(t), whereA (d/dt, ) x=x( ⁿ )+A ₁ x(^n–1 +...+ ⁿ A _n x, the matrices A₁,...,A_n are of size m × m, x is an unknown and f a given function with values in the m-dimensional space ^m , F() is a linear operator acting from a Hölder space to a Lebesgue space of vectorfunctions with values in ^m and depending on a complex parameter . We find the set of those at which a one-to-one correspondence is established between the solutions of the given equation and the solutions of the equation A(d/dt, )x(t)=0.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 43, No. 9, pp. 1213–1231, September, 1991.     

A Note on a Paper by P. Amodio and F. Mazzia

In 1999 Amodio and Mazzia presented a new backward error analysis for LU factorization and introduced a new growth factor _n . Their very interesting approach allowed them to obtain sharp error bounds. In particular, they derive nice results assuming that partial pivoting is used. However, the forward error bound for the solution of a linear system whose coefficient matrix A is an M-atrix given in Theorem 4.1 of that paper is not correct. They first obtain a bound for the condition number (U) assuming that one has the LU factorization of an M-matrix and then they apply the bounds obtained when partial pivoting is used. But if P is the permutation associated with partial pivoting then PA = LU can fail to be an M-atrix and the bound for (U) can be false, as shown in our Example 1.1. We also prove that, for a pivoting strategy presented in the paper, the growth factor of an M-matrix A is _n(A) = 1 and (U) (A), where U is the upper triangular matrix obtained after applying such a pivoting strategy.This revised version was published online in October 2005 with corrections to the Cover Date.     

Isometries of symmetric operator spaces associated with AFD factors of typeII and symmetric vector-valued spaces

If is a surjective isometry of the separable symmetric operator spaceE(M, ) associated with the approximately finite-dimensional semifinite factorM and if · _E(M,) is not proportional to · _{L 2}, then there exist a unitary operatorUM and a Jordan automorphismJ ofM such that(x)=UJ(x) for allxME(M, ). We characterize also surjective isometries of vector-valued symmetric spacesF((0, 1), E(M, )).Research supported by the Australian Research Council     

Taut Distance-Regular Graphs of Odd Diameter

Let denote a bipartite distance-regular graph with diameter D 4, valency k 3, and distinct eigenvalues ₀ > ₁ > ··· > _D. Let M denote the Bose-Mesner algebra of . For 0 i D, let E _i denote the primitive idempotent of M associated with _i . We refer to E ₀ and E _D as the trivial idempotents of M. Let E, F denote primitive idempotents of M. We say the pair E, F is taut whenever (i) E, F are nontrivial, and (ii) the entry-wise product E F is a linear combination of two distinct primitive idempotents of M. We show the pair E, F is taut if and only if there exist real scalars , such that _{i + 1 i + 1} – _{i – 1 i – 1} = _i ( _{i + 1} – _{i – 1}) + _i ( _{i + 1} – _{i – 1}) + (1 i D – 1)where ₀, ₁, ..., _D and ₀, ₁, ..., _D denote the cosine sequences of E, F, respectively. We define to be taut whenever has at least one taut pair of primitive idempotents but is not 2-homogeneous in the sense of Nomura and Curtin. Assume is taut and D is odd, and assume the pair E, F is taut. We show

φ-Factors for Function Seminorms

Let (, A, ) be a measure space, a function seminorm on M, the space of measurable functions on , and M the space {f M : (f) < }. Every Borel measurable function : [0, ) [0, ) induces a function : M M by (f)(x) = (|f(x)|). We introduce the concepts of -factor and -invariant space. If is a -subadditive seminorm function, we give, under suitable conditions over , necessary and sufficient conditions in order that M be invariant and prove the existence of -factors for . We also give a characterization of the best -factor for a -subadditive function seminorm when is -finite. All these results generalize those about multiplicativity factors for function seminorms proved earlier.     

Über den algorithmischen Nachweis von Ungleichungen I

We shall develop a method to prove inequalities in a unified manner. The idea is as follows: It is quite often possible to find a continuous functional : ⁿ , such that the left- and the right-hand side of a given inequality can be written in the form (u)(v) for suitable points,v=v(u). If one now constructs a map ^{n n} , which is functional increasing (i.e. for each x ⁿ (which is not a fixed point of ) the inequality (x)<((x)) should hold) one specially gets the chain (u)( u))( ²(u))... ⁿ (u)). Under quite general conditions one finds that the sequence { ⁿ (u)} _n converges tov=v(u). As a consequence one obtains the inequality (u)(v).     

Two new bounds on the size of binary codes with a minimum distance of three

We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152.