Discrete morse theory and the cohomology ring

In [5], we presented a discrete Morse Theory that can be applied to general cell complexes. In particular, we defined the notion of a discrete Morse function, along with its associated set of critical cells. We also constructed a discrete Morse cocomplex, built from the critical cells and the gradient paths between them, which has the same cohomology as the underlying cell complex. In this paper we show how various cohomological operations are induced by maps between Morse cocomplexes. For example, given three discrete Morse functions, we construct a map from the tensor product of the first two Morse cocomplexes to the third Morse cocomplex which induces the cup product on cohomology. All maps are constructed by counting certain configurations of gradient paths. This work is closely related to the corresponding formulas in the smooth category as presented by Betz and Cohen [2] and Fukaya [11], [12].

     

Stochastic equations for linear random functionals and statistical problems

Linear Random Functionals have been introduced by the author [2] to develop the theory of Kalman filtering for infinite dimensional linear systems. It is reminiscent of the concept of stochastic integral, which it partly generalizes. We compare it to that of cylindrical Wiener processes, introduced by G. Da Prato- J. Zabczyk [4]. Like distributions, linearity limits the power of the tool. We can consider however some non-linear problems. We show that it is a powerful tool to deal with statistical problems in infinite dimensional spaces. For additional relevant references see [1], [6], [7], [3].     

The best quadrature based on given Hermite information for the Sobolev class KW~r[a,b]

As usual, denote by KWr[a,b] the Sobolev class consisting of every function whose (r-1)th derivative is absolutely continuous on the interval [a,b] and rth derivative is bounded by K a.e. in [a, b]. For a function f∈KWr[a, b], its values and derivatives up to r -1 order at a set of nodes x are known. These values are said to be the given Hermite information. This work reports the results on the best quadrature based on the given Hermite information for the class KWr[a. b]. Existence and concrete construction issue of the best quadrature are settled down by a perfect spline interpolation. It turns out that the best quadrature depends on a system of algebraic equations satisfied by a set of free nodes of the interpolation perfect spline. From our another new result, it is shown that the system can be converted in a closed form to two single-variable polynomial equations, each being of degree approximately r/2. As a by-product, the best interpolation formula for the class KWr[a, b] is also obtained.     

First-order and second-order ε-directional derivatives of a marginal function in convex programming with linear inequality constraints

Hiriart-Urruty gave formulas of the first-order and second-order -directional derivatives of a marginal function for a convex programming problem with linear equality constraints, that is, the image of a function under linear mapping (Ref. 1). In this paper, we extend his results to a problem with linear inequality constraints. The formula of the first-order derivative is given with the help of a duality theorem. A lower estimate for the second-order -directional derivative is given.The author wishes to thank Professor N. Furukawa and Dr. H. Kawasaki for their helpful comments and encouragements. He is also indebted to one referee for pointing out the proof of Proposition 3.1.     

凸函数和凹函数的幂平均不等式

文 [1 ]获得了当 α≥ 1时的凸函数的幂平均不等式 (3)、(4 ) [1] .本文指出文 [1 ]中的一个错误 ,并且得到了 α≤ 1时的凹函数的幂平均不等式 .修正和充实了文 [1 ]的定理 .同时讨论了当 α取其它值时不等式的情况 .     

On ℓp programming

Our paper treats the primal and dual program of ?_p programming. ?_p programming is a generalization of ?_p approximation problems. There is a strict connection between ?_p programming and geometrical programming, because in both of them geometrical inequality plays a fundamental role. The structure of our paper follows that of Klafszkys [1].In the first Sections duality theorems are proved, which play an important role in mathematical programming. Most of these results can be found in Petersons and Eckers [3,4,5], but our proofs are much more simple and we show these fundamental properties more detailed.Afterwards the relation between the Lagrange function and the optimal solution pair is investigated. Regularity is investigated as well and we show the marginal value of ?_p programming. In the end linear programming ?_p constrained ?_p approximation problems, the quadratically constrained quadratic programming and compromise programming are shown as special cases of ?_p programming.     

Nonlocal boundary value problems for discrete systems

Our goal in this paper is to provide sufficient conditions for the existence of solutions to discrete, nonlinear systems subject to multipoint boundary conditions. The criteria we present depends on the size of the nonlinearity and the set of solutions to the corresponding linear, homogeneous boundary value problems. Our analysis is based on the Lyapunov–Schmidt Procedure and Brouwer?s Fixed Point Theorem. The results presented extend the previous work of D. Etheridge and J. Rodríguez (1996, 1998) [5], [6] and J. Rodríguez and P. Taylor (2007) [18], [19].     

The Algebraic Perturbation Method for Generalized Inverses

Algebraic perturbation methods were first proposed for the solution of nonsingular linear systems by R. E. Lynch and T. J. Aird [2]. Since then, the algebraic perturbation methods for generalized inverses have been discussed by many scholars [3]-[6]. In [4], a singular square matrix was perturbed algebraically to obtain a nonsingular matrix, resulting in the algebraic perturbation method for the Moore-Penrose generalized inverse. In [5], some results on the relations between nonsingular perturbations and generalized inverses of $m\times n$ matrices were obtained, which generalized the results in [4]. For the Drazin generalized inverse, the author has derived an algebraic perturbation method in [6]. In this paper, we will discuss the algebraic perturbation method for generalized inverses with prescribed range and null space, which generalizes the results in [5] and [6]. We remark that the algebraic perturbation methods for generalized inverses are quite useful. The applications can be found in [5] and [8]. In this paper, we use the same terms and notations as in [1].     

Homology of proof-nets

This work defines homology groups for proof-structures in multiplicative linear logic (see [Gir1], [Gir2], [Dan]). We will show that these groups characterize proof-nets among arbitrary proof-structures, thus obtaining a new correctness criterion and of course a new polynomial algorithm for testing correctness. This homology also bears information on sequentialization. An unexpected geometrical interpretation of the linear connectives is given in the last section. This paper exclusively focuses onabstract proof-structures, i.e. paired-graphs. The relation with actual proofs is investigated in [Gir1], [Gir2], [Dan], [Ret] and [Tro].     

再生核空间中的一类最佳逼近及其应用

在[1-2]中分别定义了具有再生极的Hilbert空间W_2~1[a,b]和W,并给出再生核的解析式。本文讨论再生核空间中线性算子的一类最佳逼近,给出逼近算子的表达式及误差估计,作为特例得到类似于[1-4]中的插值近似公式,数值积分公式和数值原函数公式,但本文的公式计算更简便。     

Nonsymmetric values under Hart-Mass-Colell consistency

Let f be a single valued solution for cooperative TU games that satisfies inessential game property, efficiency, Hart Mas-Colell consistency and for two person games is strictly monotonic and individually unbounded. Then there exists a family of strictly increasing functions associated with players that completely determines f. For two person games, both players have equal differences between their functions at the solution point and at the values of characteristic function of their singletons. This solution for two person games is uniquely extended to n person games due to consistency and efficiency. The extension uses the potential with respect to the family of functions and generalizes potentials introduced by Hart and Mas Colell [6]. The weighted Shapley values, the proportional value described by Ortmann [11], and new values generated by power functions are among these solutions. The author is grateful to anonymous referee and Associate Editor for their comments and suggestions.     

Studies on the squaring construction

The code formulas for the iterated squaring construction for a finite group partition chain, derived by Forney [2], are extended to the case with a bi-infinite group partition chain, and the derivation presented here is much simpler than the one given by Forney for the finite case. It is also proven that the iterated squaring construction indeed generates the Reed-Muller codes. Moreover, the generalization of the code formulas to the bi-infinite case is used to derive code formulas for the lattices Λ(r,n) andRΛ(r,n), which correct some errors in [2]. Further, Gaussian integer lattices are discussed. A definition of their dual lattices is given, which is more general than the definition given by Forney [1]. Using this definition, some interesting properties of dual lattices and the squaring construction are obtained and then formulas of the duals of the Barnes-Wall lattices and their principal sublattices are derived, and one assumption from the derivation given by Forney [2] can be eliminated.     

Projective connections in CR geometry

Holomorphic invariants of an analytic real hypersurface in ⁿ⁺¹ can be computed by several methods, coefficients of the Moser normal form [4], pseudo-con-formal curvature and its covariant derivatives [4], and projective curvature and its covariant derivatives [3]. The relation between these constructions is given in terms of reduction of the complex projective structure to a real form and exponentiation of complex vectorfields to give complex coordinate systems and corresponding Moser normal forms. Although the results hold for hypersurfaces with non-degenerate Levi-form, explicit formulas will be given only for the positive definite case.A. P. Sloan Fellow partially supported by N. S. F.     

A Priori Estimate for the Discontinuous Oblique Derivative Problem for Elliptic Systems

Recently [6] an existence as well as a uniqueness theorem for the discontinuous oblique derivative problem for nonlinear elliptic system of first order in the plane, see [12, 19, 23] was proved, based on some a priori estimate from [20]. This estimate, however, is deduced by reductio ad absurdum. Therefore the constants in this estimate are unknown so that the estimate cannot be used for numerical procedures, e.g. for approximating the solution of a nonlinear problem by solutions of related linear problems, see [24, 3, 4]. In this paper a direct proof of an a priori estimate is given using some variations of results from [14], see also [11], where the constants can explicitely be estimated. For related a priori estimates see [1 – 5, 8, 16, 17, 20, 21, 24 – 26]. A basic reference for the oblique derivative problem is [9].     

On the Determination of a Density Function by Its Autoconvolution Coefficient

We investigate eigenvalues and eigenvectors of certain linear variational eigenvalue inequalities where the constraints are defined by a convex cone as in [4], [7], [8], [10]-[12], [17]. The eigenvalues of those eigenvalue problems are of interest in connection with bifurcation from the trivial solution of nonlinear variational inequalities. A rather far reaching theory is presented for the case that the cone is given by a finite number of linear inequalities, where an eigensolution corresponds to a (+)-Kuhn-Tucker point of the Rayleigh quotient. Application to an unlaterally supported beam are discussed and numerical results are given.     

Weak via strong Stackelberg problem: New results

We are concerned with weak Stackelberg problems such as those considered in [19], [23] and [25]. Based on a method due to Molodtsov, we present new results to approximate such problems by sequences of strong Stackelberg problems. Results related to convergence of marginal functions and approximate solutions are given. The case of data perturbations is also considered.     

一个修正的SQP方法-滤子方法

序列二次规划方法（SQP）是解决非线性规划问题最有效的算法之一，但是当QP子问题不可行时算法可能会失败．而且线搜索中的罚参数的选择通常比较困难．在文献[1]中，SQP方法得到了修正，使得QP子问题可行．在本文中，我们利用滤子技术避免了罚函数的使用同时提出了带线搜索的滤子方法，最终保证了SQP方法总是可行的，而且得到了方法的全局收敛性．     

The Inverse Scattering Transform for the Benjamin-Ono Equation—A Pivot to Multidimensional Problems

The initial value problem associated with the Benjamin-Ono equation is linearized by a suitable extension of the inverse scattering transform. Essential is the formulation and solution of an associated nonlocal Riemann-Hilbert problem in terms of initial scattering data. Solitons are given a definitive spectral characterization. Pure soliton solutions are obtained by solving a linear algebraic system whose coefficients depend linearly on [INLINEEQUATION], [INLINEEQUATION].     

Solving generalized equations via homotopies

Global Newton methods for computing solutions of nonlinear systems of equations have recently received a great deal of attention. By using the theory of generalized equations, a homotopy method is proposed to solve problems arising in complementarity and mathematical programming, as well as in variational inequalities. We introduce the concepts of generalized homotopies and regular values, characterize the solution sets of such generalized homotopies and prove, under boundary conditions similar to Smale’s [10], the existence of a homotopy path which contains an odd number of solutions to the problem. We related our homotopy path to the Newton method for generalized equations developed by Josephy [3]. An interpretation of our results for the nonlinear programming problem will be given.     

State of stress of nonuniformly heated plates loaded along the boundary surfaces : PMM vol. 43. no. 6, 1979, pp. 1065–1072

The general solution of ati elasticity theory problem for a constant thickness plate is constructed under the condition that a force and a nonuniformly heated plate are applied normally to the boundary planes. The solution is obtained as a result of applying the M.E. Vashchenko-Zakharchenko expansion formulas to the infinitely high-order differential equations obtained by A.I. Lur'e by a symbolic method [1,2], by a separate analysis of the symmetric and antisymmetric elasticity theory problems relative to the middle plane: 1) for constant temperature and given forces on the boundary planes; 2) for a given nonuniform heating and no forces. Simple formulas are presented to determine the state of stress in the case of a slowly varying external load and temperature of the unbounded plate. For a bounded plate the general solution for no forces on the boundary planes and heating resulted in the A.I. Lur'e solution [1].