Isoperimetric estimates in products

In a product M ₁ × M ₂ of Riemannian manifolds, the least perimeter required to enclose given volume among general regions is at least 1/√ 2 times that among regions of product form, assuming that the isoperimetric profiles of M ₁ and M ₂ are concave. This result sharpens earlier work of Grigor'yan, generalizes results of Bollobás and Leader and of Barthe, and yields a lower bound on the Cheeger isoperimetric constant of a product.     

An implicit method for linear ill‐posed problems with perturbed operators

An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.     

Mixed Elastico-Plasticity Problems with Partially Unknown Boundaries

In this paper,we study mixed elastico-plasticity problems in which part of the boundary is known,while the other part of the boundary is unknown and is a free boundary.Under certain conditions,this problemcan be transformed into a Riemann-Hilbert boundary value problem for analytic functions and a mixed boundaryvalue problem for complex equations.Using the theory of generalized analytic functions,the solvability of theproblem is discussed.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

加权微分建模的初步研究

加权建模是必要的,微分建模是重要的,把二者结合起来,进行加权微分建模既必要也重要.给出了常用模型的微分建模结果,讨论了加权建模中的计算和权重选择问题,探讨了加权微分建模的思路和方法,并结合典型数据验证了该方法的有效性和稳定性.象加权建模一样,加权微分建模的精度、实用价值等,是和权重确定得合理与否紧密相联;应先进行模拟,以与近期实际值或典型样本相差最小的参数所对应的模型为准.     

Some conformally flat spin manifolds, Dirac operators and automorphic forms

In this paper we study Clifford and harmonic analysis on some examples of conformal flat manifolds that have a spinor structure, or more generally, at least a pin structure. The examples treated here are manifolds that can be parametrized by U/Γ where U is a subdomain of either Sn or Rn and Γ is a Kleinian group acting discontinuously on U. The examples studied here include RPn and the Hopf manifolds S¹×Sn−1. Also some hyperbolic manifolds will be treated. Special kinds of Clifford-analytic automorphic forms associated to the different choices of Γ are used to construct explicit Cauchy kernels, Cauchy integral formulas, Green's kernels and formulas together with Hardy spaces and Plemelj projection operators for Lp spaces of hypersurfaces lying in these manifolds.     

Sobolev-Type Classes of Functions with Values in a Metric Space. II

We prove equivalence of the definitions by the author and by Korevaar and Schoen of the Sobolev classes of mappings of a domain of an arithmetic n-dimensional space to a metric space.     

Infra-Mackey spaces, weak barrelledness and barrelledness

A weaker Mackey topology, infra-Mackey topology, is introduced. For an infra-Mackey space, dual local quasi-completeness, c₀-quasi-barrelledness, Ruess' property (quasi-L) and C-quasi-barrelledness are equivalent to each other. Inspired by the definition of Mazur spaces, locally convex spaces are classified according to various conditions ensuring linear functionals continuous. In the classification, every class of special locally convex spaces is characterized by some completeness of the duals. From this, some new characterizations of quasi-barrelledness and barrelledness are given.     

Computational Complexity in Algebraic Systems

Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems.     

GENERALIZED CIRCLES AND THEIR CONFORMAL MAPPING IN A SUBSPACE OF A WEYL SPACE

The authors give the necessary and sufficient conditions for a generalized circle in a Weyl hypersurface to be generalized circle in the enveloping Weyl space. They then obtain the neccessary and sufficient conditions under which a generalized concircular transformation of one Weyl space onto another induces a generalized transformation oil its subspaces. Finally, it is shown that any totally geodesic or totally umbilical hypersurface of a generalized concircularly flat Weyl space is also generalized concircularly flat.