K-非常凸空间

本文引入了一种新的K凸空间K-非常凸空间,及其对偶空间K-非常光滑空间,它们分别是非常凸空间和非常光滑空间的推广但又严格弱于非常凸空间和非常光滑空间,因此它们又有许多独特的性质.本文讨论了它们的一些特性及与其它K凸性和K光滑性的关系,推广了[3]、[6]、[7]、[8]中的一些结果.     

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems. Work of the authors was partially supported by FCAR, MITACS and NSERC grants.     

Discrepancy operators and numerical integration on compact groups

In this paper we establish an inequality of Koksma-Hlawka-type for compact groups. We first define a discrepancy for compact groups based on discrepancy operators introduced by W. Fleischer and show the relation to the classicalL ²-discrepancy. Then we prove the inequality for functions in a weightedL ²-space.     

Primary abelian <Emphasis Type="Italic">n</Emphasis>-Σ-groups

We prove the following theorem: Any abelian p-group is an n-Σ-group which is a strong ω-elongation of a totally projective group by a p ^ω+n -projective group precisely when it is totally projective. In particular, each p-torsion p ^ω+n -projective n-Σ-group is a direct sum of countable p-groups of length not exceeding ω + n and vice versa. These two claims generalize our recent results in [6] and [7]. Published in Lietuvos Matematikos Rinkinys, Vol. 47, No. 2, pp. 155–162, April–June, 2007.     

A p-version finite element method for nonlinear elliptic variational inequalities in 2D

This article introduces and analyzes a p-version FEM for variational inequalities resulting from obstacle problems for some quasi-linear elliptic partial differential operators. We approximate the solution by controlling the obstacle condition in images of the Gauss–Lobatto points. We show existence and uniqueness for the discrete solution u _p from the p-version for the obstacle problem. We prove the convergence of u _p towards the solution with respect to the energy norm, and assuming some additional regularity for the solution we derive an a priori error estimate. In numerical experiments the p-version turns out to be superior to the h-version concerning the convergence rate and the number of unknowns needed to achieve a certain exactness of the approximation.     

Prime Fano threefolds and integrable systems

For a general K3 surface S of genus g, with 2 ≤ g ≤ 10, we prove that the intermediate Jacobians of the family of prime Fano threefolds of genus g containing S as a hyperplane section, form generically an algebraic completely integrable Hamiltonian system. The first author is partially supported by grant MI1503/2005 of the Bulgarian Foundation for Scientific Research.     

Exponential decay rate of survival probability in a disastrous random environment

Summary. We study the exponential decay rate of the survival probability up to time t>0 of a random walker moving in Zopf; ^d in a temporally and spatially fluctuating random environment. When the random walker has a speed parameter κ>0, we investigate the influence of κ on the exponential decay rate λ(d,κ). In particular we prove that for any fixed d≥1, λ(d,κ) behaves like as logκ as κ↘0. Received: 21 May 1996 / In revised form: 2 February 1997     

Asymptotic Distribution of Nodes for Near-Optimal Polynomial Interpolation on Certain Curves in R 2

Let E\subset \Bbb R ^s be compact and let d _n ^E denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ _n ={ \bf x _k,n } _k=1 ^dnE , n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R ² . It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore, for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes. November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001.