A RANDOM FIXED POINT ITERATION FOR THREE RANDOM OPERATORS ON UNIFORMLY CONVEX BANACH SPACES

In the present paper we introduce a random iteration scheme for three random operators defined on a closed and convex subset of a uniformly convex Banach space and prove its convergence to a common fixed point of three random operators. The result is also an extersion of a known theorem in the corresponding non-random case.     

Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

Comparison of volumes by means of the areas of central sections

The Busemann–Petty problem asks whether origin-symmetric convex bodies in Rⁿ with smaller areas of all central hyperplane sections necessarily have smaller n-dimensional volume. The solution was completed in the end of the 1990s, and the answer is affirmative if n4 and negative if n5. Since the answer is negative in most dimensions, it is natural to ask what information about the volumes of central sections of two bodies does allow to compare the n-dimensional volumes of these bodies in all dimensions. In this article we give an answer to this question in terms of certain powers of the Laplace operator applied to the section function of the body.     

A new proof for Rockafellar's characterization of maximal monotone operators

We provide a new and short proof for Rockafellar's characterization of maximal monotone operators in reflexive Banach spaces based on S. Fitzpatrick's function and a technique used by R. S. Burachik and B. F. Svaiter for proving their result on the representation of a maximal monotone operator by convex functions.

     

Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers V_λ^⊗N of an irreducible representation V_λ of a compact connected Lie group G. The weights are allowed to depend on N, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope.     

Separating the solution sets of analytical and polynomial systems

A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval. This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system. Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. Research supported by CONACyT of Mexico, Grant 130036. Research partially supported by CONACyT of Mexico, Grant 44003.     

Generalized Equilibrium Problems and Generalized Complementarity Problems

From a general minimax inequality or an abstract lopsided saddle-point theorem, we deduce general Karamardian-type equilibrium theorems and generalized complementarity theorems. Our new results extend a number of well-known earlier works of many authors.     

A new approach to potential flow around axisymmetric bodies

A new method is introduced to solve potential flow problems around axisymmetric bodies. The approach relies on expressing the infinite series expansion of the Laplace equation solution in terms of a finite sum which preserves the Laplace solution for the potential function under a Neumann-type boundary condition. Then the coefficients of the finite sum are calculated in a least squares approximation sense using the Gram-Schmidt orthonormalization method. Sample benchmark problems are presented and discussed in some detail. The solutions are accurate and converged faster when a rather small number of terms were used. The method is simple and can be easily programmed.     

一类与凸函数有关的不等式的概率证法

通过构造随机变量的方法,并结合凸函数的性质,证明了数学分析中的一些著名不等式,证明方法简明、独特.