Generalized Continuous Posets and a New Cartesian Closed Category

With every subset selection for posets, there is associated a certain ideal completion . As shown by Erné, such completions help to extend classical results on domains and similar structures in the absence of the required joins. Some results about –predistributive or –precontinuous posets and –continuous functions are summarized and supplemented. In particular, several central results on function spaces in domain theory are extended to the setting of productive closed subset selections. The category FSBP, in which objects are finitely separated and upper bounded posets and arrows are continuous functions between them, is shown to be cartesian closed. This research is supported by the National Natural Science Foundation of China, 10471035.     

Lawvere Completeness in Topology

It is known since 1973 that Lawvere’s notion of Cauchy-complete enriched category is meaningful for metric spaces: it captures exactly Cauchy-complete metric spaces. In this paper, we introduce the corresponding notion of Lawvere completeness for (\mathbbT,V)(\mathbb{T},\mathsf{V})-categories and show that it has an interesting meaning for topological spaces and quasi-uniform spaces: for the former ones it means weak sobriety while for the latter it means Cauchy completeness. Further, we show that V\mathsf{V} has a canonical (\mathbbT,V)(\mathbb{T},\mathsf{V})-category structure which plays a key role: it is Lawvere-complete under reasonable conditions on the setting; this structure permits us to define a Yoneda embedding in the realm of (\mathbbT,V)(\mathbb{T},\mathsf{V})-categories.     

Fundamentals for symplectic $$ \mathcal{A} $$-modules. Affine Darboux theorem

In his [9–11], the first author shows that the sheaf-theoreti-cally based Abstract Differential Geometry incorporates and generalizes classical differential geometry. Here, we undertake to explore the implications of Abstract Differential Geometry to classical symplectic geometry. The full investigation will be presented elsewhere.      

Quasilinearization and curvature of Aleksandrov spaces

We present a new distance characterization of Aleksandrov spaces of non-positive curvature. By introducing a quasilinearization for abstract metric spaces we draw an analogy between characterization of Aleksandrov spaces and inner product spaces; the quasi-inner product is defined by means of the quadrilateral cosine—a metric substitute for the angular measure between two directions at different points. Our main result states that a geodesically connected metric space is an Aleksandrov domain (also known as a CAT(0) space) if and only if the quadrilateral cosine does not exceed one for every two pairs of distinct points in . We also observe that a geodesically connected metric space is an domain if and only if, for every quadruple of points in , the quadrilateral inequality (known as Euler’s inequality in ) holds. As a corollary of our main result we give necessary and sufficient conditions for a semimetric space to be an domain. Our results provide a complete solution to the Curvature Problem posed by Gromov in the context of metric spaces of non-positive curvature.      

Inverse Conductivity Problem on Riemann Surfaces

An electrical potential U on a bordered Riemann surface X with conductivity function σ>0 satisfies equation d(σ d ^c U)=0. The problem of effective reconstruction of σ from electrical currents measurements (Dirichlet-to-Neumann mapping) on the boundary: U| _bX ↦ σ d ^c U| _bX is studied. We extend to the case of Riemann surfaces the reconstruction scheme given, firstly, by R. Novikov (Funkc. Anal. Ego Priloz. 22:11–22, 2008) for simply connected X. We apply for this new kernels for on the affine algebraic Riemann surfaces constructed in Henkin (, 2008).      

From light tails to heavy tails through multiplier

Let X and Y be two independent nonnegative random variables, of which X has a distribution belonging to the class or for some γ ≥ 0 and Y is unbounded. We study how their product XY inherits the tail behavior of X. Under some mild technical assumptions we prove that the distribution of XY belongs to the class or accordingly. Hence, the multiplier Y builds a bridge between light tails and heavy tails.      

Quasi-regular Dirichlet Forms and L^p-resolvents on Measurable Spaces

We prove that for any semi-Dirichlet form on a measurable Lusin space E there exists a Lusin topology with the given -algebra as the Borel -algebra so that becomes quasi-regular. However one has to enlarge E by a zero set. More generally a corresponding result for arbitrary -resolvents is proven.     

The \bar \partial -Neumann operator and commutators of the Bergman projection and multiplication operators

We prove that compactness of the canonical solution operator to restricted to (0, 1)-forms with holomorphic coefficients is equivalent to compactness of the commutator defined on the whole L _(0,1)²(Ω), where is the multiplication by and is the orthogonal projection of L _(0,1)²(Ω) to the subspace of (0, 1) forms with holomorphic coefficients. Further we derive a formula for the -Neumann operator restricted to (0, 1) forms with holomorphic coefficients expressed by commutators of the Bergman projection and the multiplications operators by z and . Partially supported by the FWF grant P19147-N13.     

The Gold Partition Conjecture

We present the Gold Partition Conjecture which immediately implies the – Conjecture and tight upper bound for sorting. We prove the Gold Partition Conjecture for posets of width two, semiorders and posets containing at most elements. We prove that the fraction of partial orders on an -element set satisfying our conjecture converges to when approaches infinity. We discuss properties of a hypothetical counterexample.     

Canonical connections on paracontact manifolds

The canonical paracontact connection is defined and it is shown that its torsion is the obstruction the paracontact manifold to be paraSasakian. A -homothetic transformation is determined as a special gauge transformation. The η-Einstein manifold are defined, it is proved that their scalar curvature is a constant, and it is shown that in the paraSasakian case these spaces can be obtained from Einstein paraSasakian manifolds with -homothetic transformations. It is shown that an almost paracontact structure admits a connection with totally skew-symmetric torsion if and only if the Nijenhuis tensor of the paracontact structure is skew-symmetric and the defining vector field is Killing.      

On the expansion of the resolvent for elliptic boundary contact problems

Let A be an elliptic operator on a compact manifold with boundary , and let be a covering map, where Y is a closed manifold. Let A _C be a realization of A subject to a coupling condition C that is elliptic with parameter in the sector Λ. By a coupling condition we mean a nonlocal boundary condition that respects the covering structure of the boundary. We prove that the resolvent trace for N sufficiently large has a complete asymptotic expansion as . In particular, the heat trace has a complete asymptotic expansion as , and the -function has a meromorphic extension to .      

Compactness and local compactness for {\mathbb{R}}-trees

We establish (geometric) criteria for an -tree to be compact and to be locally compact. It follows that locally compact -trees are separable. Received: 10 September 2007     

Two-parameter p, q-variation Paths and Integrations of Local Times

In this paper, we prove two main results. The first one is to give a new condition for the existence of two-parameter -variation path integrals. Our condition of locally bounded -variation is more natural and easy to verify than those of Young. This result can be easily generalized to multi-parameter case. The second result is to define the integral of local time pathwise and then give generalized It’s formula when is only of bounded -variation in . In the case that is of locally bounded variation in , the integral is the Lebesgue–Stieltjes integral and was used by Elworthy, Truman and Zhao. When is of only locally -variation, where , , and , the integral is a two-parameter Young integral of -variation rather than a Lebesgue–Stieltjes integral. In the special case that is independent of , we give a new condition for Meyer's formula and is defined pathwise as a Young integral. For this we prove the local time is of -variation in for each , for each almost surely (-variation in the sense of Lyons and Young, i.e. ).     

Pseudomonotone$${_{\ast}}$$ maps and the cutting plane property

Pseudomonotone maps are a generalization of paramonotone maps which is very closely related to the cutting plane property in variational inequality problems (VIP). In this paper, we first generalize the so-called minimum principle sufficiency and the maximum principle sufficiency for VIP with multivalued maps. Then we show that pseudomonotonicity of the map implies the “maximum principle sufficiency” and, in fact, is equivalent to it in a sense. We then present two applications of pseudomonotone maps. First we show that pseudomonotone maps can be used instead of the much more restricted class of pseudomonotone₊ maps in a cutting plane method. Finally, an application to a proximal point method is given.      

Analysis on adjoint non-recurrent property of nonlinear time series in random environment domain

By introducing a random interference into the typical of nonlinear time series model, this paper establishes a RENLAR model: . The author introduces the definition of adjoint non-recurrence, and utilizing general state space Markov chain theorem, we obtain some criteria for non-recurrence and adjoint non-recurrence of nonlinear time series models in random environment domain and analyze adjoint non-recurrence of some models by using these criteria. Research supported Science Foundation of China (10171009).     

A combinatorial algorithm for the TDMA message scheduling problem

In this paper, we introduce a combinatorial algorithm for the message scheduling problem on Time Division Multiple Access (TDMA) networks. In TDMA networks, time is divided in to slots in which messages are scheduled. The frame length is defined as the total number of slots required for all stations to broadcast without message collisions. The objective is to provide a broadcast schedule of minimum frame length which also provides the maximum throughput. This problem is known to be -hard, thus efficient heuristics are needed to provide solutions to real-world instances. We present a two-phase algorithm which exploits the combinatorial structure of the problem in order to provide high quality solutions. The first phase finds a feasible frame length in which the throughput is maximized in phase two. Computational results are provided and compared with other heuristics in the literature as well as to the optimal solutions found using a commercial integer programming solver. Experiments on 63 benchmark instances show that the proposed method is able to provide optimal frame lengths for all cases with near optimal throughput.     

On a sheaf-theoretic version of the Witt’s decomposition theorem. A Lagrangian perspective

The approach to a counterpart, in Abstract Geometric Algebra, that is, Geometric Algebra via sheaves of modules, of the classical Witt’s decomposition theoremis based on the axiomatization of the classical context, which however leads to the formulation of a specific subcategory of the category of sheaves of modules: the full subcategory of convenient sheaves of modules. Convenient sheaves of modules turn out, by the very essence of the matter at hand, to be of further importance as far as the setting of results leading to the sheaf-theoretic aspect of several forms of the Witt’s theorem is concerned. Further versions of the Witt’s theorem are still to be treated elsewhere.      

Some problems in metric fixed point theory

Three papers, published coincidentally and independently by Felix Browder, Dietrich G?hde, and W. A. Kirk in 1965, triggered a branch of mathematical research now called metric fixed point theory. This is a survey of some of the highlights of that theory, with a special emphasis on some of the problems that remain open. Dedicated to Felix Browder on the occasion of his 80th birthday     

Global error bounds for the extended vertical LCP

A new necessary and sufficient condition for the row -property is given. By using this new condition and a special row rearrangement, we provide two global error bounds for the extended vertical linear complementarity problem under the row -property, which extend the error bounds given in Chen and Xiang (Math. Program. 106:513–525, 2006) and Mathias and Pang (Linear Algebra Appl. 132:123–136, 1990) for the P-matrix linear complementarity problem, respectively. We show that one of the new error bounds is sharper than the other, and it can be computed easily for some special class of the row -property block matrix. Numerical examples are given to illustrate the error bounds. The work was in part supported by a Grant-in-Aid from Japan Society for the Promotion of Science, and the National Natural Science Foundation of China (10671010).     

Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning

In this paper, we propose a modification of Benson’s algorithm for solving multiobjective linear programmes in objective space in order to approximate the true nondominated set. We first summarize Benson’s original algorithm and propose some small changes to improve computational performance. We then introduce our approximation version of the algorithm, which computes an inner and an outer approximation of the nondominated set. We prove that the inner approximation provides a set of -nondominated points. This work is motivated by an application, the beam intensity optimization problem of radiotherapy treatment planning. This problem can be formulated as a multiobjective linear programme with three objectives. The constraint matrix of the problem relies on the calculation of dose deposited in tissue. Since this calculation is always imprecise solving the MOLP exactly is not necessary in practice. With our algorithm we solve the problem approximately within a specified accuracy in objective space. We present results on four clinical cancer cases that clearly illustrate the advantages of our method.