Maximum Monoreflections and Essential Extensions

An extension operator c in a category is an assignment, to each object A a monomorphism c _A : AcA. Seeking to approximate such a c by a functor, in our earlier paper Maximum monoreflections, we showed that with some hypotheses on the category, and on c, there is a monoreflection (c) maximum beneath c. Thus, in a suitable category of rings, using the complete ring of quotients operator Q, each object A has a maximum functorial ring of quotients (Q)A. But the proof gave no hint of how to calculate the general (c)A's, nor the particular (Q)A's. In the present paper, we give an explicit formula (and separate proof of existence) for the (c)A's, under more complicated hypotheses on the category and assuming the c _A 's are essential monomorphisms. We discuss briefly how the formula proves adequate to calculate the (Q)A's in Archimedean f-rings, and some related and necessary constructs in Archimedean l-groups.     

Congruences and ideals in ternary rings

A ternary ring is an algebraic structure R=(R,t0.1) of type (3, 0, 0) satisfying the identities t(0, x, y) = y = t(x, 0, y) and t(1, x, 0) = x = (x, l, 0) where, moreover, for any a, b, c R there exists a unique d R with t(a, b, d) = c. A congruence on R is called normal if R with t is a ternary ring again. We describe basic properties of the lattice of all normal congruences on R and establish connections between ideals (introduced earlier by the third author) and congruence kernels.     

On the Neighbourhood of a Subclass of Univalent Functions Related to Complex Order

We consider the class of functions R(A, B) introduced by Dixit and Pal, where b 0 is a complex number and A, B are fixed members –1 B < A 1. We will study the -neighbourhoods for functions belonging to R^b(A, B), by using convolution techniques.AMS Mathematics Classification (2000): 30C55     

Bounds for the singular set of solutions to non linear elliptic systems

We give new estimates for the Hausdorff dimension of the singular set of solutions to elliptic systems If the vector fields a and b are Hölder continuous with respect to the variables (x,u) with exponent , then, under suitable assumptions, the Hausdorff dimension of the singular set of any weak solution is at most . We consider natural growth assumptions on a(x,u,Du) with respect to u and critical ones on the right hand side b(x,u,Du), with respect to Du.Accepted: 12 March 2003, Published online: 16 May 2003     

Accurate Solution to Overdetermined Linear Equations with Errors Using L1 Norm Minimization

It has been known for many years that a robust solution to an overdetermined system of linear equations Ax b is obtained by minimizing the L1 norm of the residual error. A correct solution x to the linear system can often be obtained in this way, in spite of large errors (outliers) in some elements of the (m × n) matrix A and the data vector b. This is in contrast to a least squares solution, where even one large error will typically cause a large error in x. In this paper we give necessary and sufficient conditions that the correct solution is obtained when there are some errors in A and b. Based on the sufficient condition, it is shown that if k rows of [A b] contain large errors, the correct solution is guaranteed if (m – n)/n 2k/, where > 0, is a lower bound of singular values related to A. Since m typically represents the number of measurements, this inequality shows how many data points are needed to guarantee a correct solution in the presence of large errors in some of the data. This inequality is, in fact, an upper bound, and computational results are presented, which show that the correct solution will be obtained, with high probability, for much smaller values of m – n.     

On properties of the probabilistic constrained linear programming problem and its dual

In this paper, the two problems inf{inf{cx:x R ⁿ,A ₁ xy,A ₂ xb}:y suppF R ^m,F(y)p} and sup{inf{uy:y suppF R ^m,F(y)p}+vb:uA ₁+vA ₂=c, (u,v0} are investigated, whereA ₁,A ₂,b,c are given matrices and vectors of finite dimension,F is the joint probability distribution of the random variables ₁,..., _m, and 0<p<1. The first problem was introduced as the deterministic equivalent and the second problem was introduced as the dual of the probabilistic constrained linear programming problem inf{cx:P(A ₁ x)p,A ₂ xb}.b}. Properties of the sets and the functions involved in the two problems and regularity conditions of optimality are discussed.     

Numerical stability of descent methods for solving linear equations

Summary In this paper we perform a round-off error analysis of descent methods for solving a liner systemAx=b, whereA is supposed to be symmetric and positive definite. This leads to a general result on the attainable accuracy of the computed sequence {x _i } when the method is performed in floating point arithmetic. The general theory is applied to the Gauss-Southwell method and the gradient method. Both methods appear to be well-behaved which means that these methods compute an approximationx _i to the exact solutionA ^–1 b which is the exact solution of a slightly perturbed linear system, i.e. (A+A)x _i =b, A of order A, where is the relative machine precision and · denotes the spectral norm.     

Solving linear programs from sign patterns

This paper is an attempt to provide a connection between qualitative matrix theory and linear programming. A linear program is said to be sign-solvable if the set of sign patterns of the optimal solutions is uniquely determined by the sign patterns of A, b, and c. It turns out to be NP-hard to decide whether a given linear program is sign-solvable or not. We then introduce a class of sign-solvable linear programs in terms of totally sign-nonsingular matrices, which can be recognized in polynomial time. For a linear program in this class, we devise an efficient combinatorial algorithm to obtain the sign pattern of an optimal solution from the sign patterns of A, b, and c. The algorithm runs in O(mγ) time, where m is the number of rows of A and γ is the number of all nonzero entries in A, b, and c.     

Improved complexity results on solving real-number linear feasibility problems

We present complexity results on solving real-number standard linear programs LP(A,b,c), where the constraint matrix the right-hand-side vector and the objective coefficient vector are real. In particular, we present a two-layered interior-point method and show that LP(A,b,0), i.e., the linear feasibility problem A x = b and x ≥ 0, can be solved in in O(n ^2.5 c(A)) interior-point method iterations. Here 0 is the vector of all zeros and c(A) is the condition measure of matrix A defined in [25]. This complexity iteration bound is reduced by a factor n from that for general LP(A, b, c) in [25]. We also prove that the iteration bound will be further reduced to O(n ^1.5 c(A)) for LP(A, 0, 0), i.e., for the homogeneous linear feasibility problem. These results are surprising since the classical view has been that linear feasibility would be as hard as linear programming. This author was supported in part by NSF Grants DMS-9703490 and DMS-0306611     

On the exceptional set for the equationn=p+k 2

Denote byE(X) the number of integersn X which are not a sum of a prime and a square. Set = 1 – 0.994428b, whereb min(0.9365/c ₃, 0.02578/c ₄),c ₃,c ₄ being given in Lemma 8. The resultE(x) x is proved in this paper.Project Supported by the National Natural Science Foundation of China.     

Proof of Oppenheim's area inequalities for triangles and quadrilaterals

Leta ₁,b ₁,c ₁,A ₁ anda ₂,b ₂,c ₂,A ₂ be the sides and areas of two triangles. Ifa=(a ₁ ^p +a ₂ ^p )^1/p ,b=(b ₁ ^p +b ₂ ^p )^1/p ,c=(c ₁ ^p +c ₂ ^p )^1/p , and 1p4, thena, b, c are the sides of a triangle and its area satisfiesA ^p/2A ₁ ^p/2 +A ₂ ^p/2 . If obtuse triangles are excluded,p>4 is allowed. For convex cyclic quadrilaterals, a similar inequality holds. Also, leta, b, c, A be the sides and area of an acute or right triangle. Iff(x) satisfies certain conditions,f(a),f(b),f(c) are the sides of a triangle having areaA _f, which satisfies (4A _f/3)^1/2f((4A/3)^1/2).     

A Finite Algorithm for Solving Infinite Dimensional Optimization Problems

We consider the general optimization problem (P) of selecting a continuous function x over a -compact Hausdorff space T to a metric space A, from a feasible region X of such functions, so as to minimize a functional c on X. We require that X consist of a closed equicontinuous family of functions lying in the product (over T) of compact subsets Y _t of A. (An important special case is the optimal control problem of finding a continuous time control function x that minimizes its associated discounted cost c(x) over the infinite horizon.) Relative to the uniform-on-compacta topology on the function space C(T,A) of continuous functions from T to A, the feasible region X is compact. Thus optimal solutions x ^* to (P) exist under the assumption that c is continuous. We wish to approximate such an x ^* by optimal solutions to a net {P _i }, iI, of approximating problems of the form min_{xX i} c i(x) for each iI, where (1) the net of sets {X _i } _I converges to X in the sense of Kuratowski and (2) the net {c _i } _I of functions converges to c uniformly on X. We show that for large i, any optimal solution x ^* _i to the approximating problem (P _i ) arbitrarily well approximates some optimal solution x ^* to (P). It follows that if (P) is well-posed, i.e., limsupX _i ^* is a singleton {x ^*}, then any net {x _i ^*} _I of (P _i )-optimal solutions converges in C(T,A) to x ^*. For this case, we construct a finite algorithm with the following property: given any prespecified error and any compact subset Q of T, our algorithm computes an i in I and an associated x _i ^* in X _i ^* which is within of x ^* on Q. We illustrate the theory and algorithm with a problem in continuous time production control over an infinite horizon.     

Quasiminima of degenerate functionals with non polynomial growth

We prove a regularity theorem for quasiminima of a degenerate functional of the type , whereA (t) has non polynomial growth andb(x) is a weight belonging to theA, class of Muckenhoupt. Si dimostra un teorema di regolarità per i quasiminimi di un funzionale degenere del tipo , conA(t) ad andamento non polinomiale eb(x) peos della classeA, di Muckenhoupt.

---

(Conferenza tenuta il 13 novembre 1989)     

Closed form solution of a periodically forced logistic model

We give the exact closed form solution of the following ordinary differential equation:

Monotone optimal decision rules and their computation

For a given objective functionw(x, a) onX × A, a maximizinga=(x) has to be determined for eachx in the totally ordered setX. We give conditions onw such that there is a monotone which can be computed recursively ifA is finite.     

The Number of Lattice Points Above the Catenary

For fixed c > 1 and for arbitrary and independent a,b ≧ 1 let Z ²|b( cosh(x/a)−c) ≦ y < 0}. We investigate the asymptotic behaviour of R(a,b) for a,b → ∞. In the special case b = o(a ^5/6) the lattice rest has true order of magnitude . This revised version was published online in June 2006 with corrections to the Cover Date.     

An example of the Cauchy problem well posed in any Gevrey class

We study the Cauchy problem for second order hyperbolic operators in the Gevrey classes where H(t,x) is given by the limit of a finite sum of functions such as a(t)b(x) with a(t) ≥ 0, b(x) ≥ 0. As a result, for any given positive integer N, we give an example H(t,x) which depends not only on t but also on x such that the Cauchy problem for P is well posed in the Gevrey class of order N.     

Traveling fronts in space–time periodic media

This paper is concerned with the existence of pulsating traveling fronts for the equation:

(1)

∂_tu−(A(t,x)u)+q(t,x)u=f(t,x,u),