Bergman polynomials on an archipelago: Estimates, zeros and shape reconstruction

Growth estimates of complex orthogonal polynomials with respect to the area measure supported by a disjoint union of planar Jordan domains (called, in short, an archipelago) are obtained by a combination of methods of potential theory and rational approximation theory. The study of the asymptotic behavior of the roots of these polynomials reveals a surprisingly rich geometry, which reflects three characteristics: the relative position of an island in the archipelago, the analytic continuation picture of the Schwarz function of every individual boundary and the singular points of the exterior Green function. By way of explicit example, fine asymptotics are obtained for the lemniscate archipelago |z^m−1|<r^m, 0<r<1, which consists of m islands. The asymptotic analysis of the Christoffel functions associated to the same orthogonal polynomials leads to a very accurate reconstruction algorithm of the shape of the archipelago, knowing only finitely many of its power moments. This work naturally complements a 1969 study by H. Widom of Szegő orthogonal polynomials on an archipelago and the more recent asymptotic analysis of Bergman orthogonal polynomials unveiled by the last two authors and their collaborators.     

Riemannian manifolds carrying a pair of skew symmetric conformal vector fields

We deal with a Riemannian manifoldM carrying a pair of skew symmetric conformal vector fields (X, Y). The existence of such a pairing is determined by an exterior differential system in involution (in the sense of Cartan). In this case,M is foliated by 3-dimensional totally geodesic submanifolds. Additional geometric properties are proved. Supported by a JSPS postdoctoral fellowship.     

Finsler vector bundles -- Metrizable connections

Periodica Mathematica Hungarica -     

On a class of nonlinear problems involving a p(x)-Laplace type operator

We study the boundary value problem in Ω, u = 0 on ∂Ω, where Ω is a smooth bounded domain in ℝ ^N . Our attention is focused on two cases when , where m(x) = max{p ₁(x), p ₂(x)} for any x ∈ or m(x) < q(x) < N · m(x)/(N − m(x)) for any x ∈ . In the former case we show the existence of infinitely many weak solutions for any λ > 0. In the latter we prove that if λ is large enough then there exists a nontrivial weak solution. Our approach relies on the variable exponent theory of generalized Lebesgue-Sobolev spaces, combined with a ℤ₂-symmetric version for even functionals of the Mountain Pass Theorem and some adequate variational methods.     

Parallel distributed-memory simplex for large-scale stochastic LP problems

We present a parallelization of the revised simplex method for large extensive forms of two-stage stochastic linear programming (LP) problems. These problems have been considered too large to solve with the simplex method; instead, decomposition approaches based on Benders decomposition or, more recently, interior-point methods are generally used. However, these approaches do not provide optimal basic solutions, which allow for efficient hot-starts (e.g., in a branch-and-bound context) and can provide important sensitivity information. Our approach exploits the dual block-angular structure of these problems inside the linear algebra of the revised simplex method in a manner suitable for high-performance distributed-memory clusters or supercomputers. While this paper focuses on stochastic LPs, the work is applicable to all problems with a dual block-angular structure. Our implementation is competitive in serial with highly efficient sparsity-exploiting simplex codes and achieves significant relative speed-ups when run in parallel. Additionally, very large problems with hundreds of millions of variables have been successfully solved to optimality. This is the largest-scale parallel sparsity-exploiting revised simplex implementation that has been developed to date and the first truly distributed solver. It is built on novel analysis of the linear algebra for dual block-angular LP problems when solved by using the revised simplex method and a novel parallel scheme for applying product-form updates.     

Hierarchical approach for survivable network design

A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specified edge costs and (integer) connectivity requirements between pairs of nodes, the SND problem seeks the minimum cost set of edges that interconnects each node pair with at least as many edge-disjoint paths as the connectivity requirement of the nodes. We develop a hierarchical approach for solving the problem that integrates ideas from decomposition, tabu search, randomization, and optimization. The approach decomposes the SND problem into two subproblems, Backbone design and Access design, and uses an iterative multi-stage method for solving the SND problem in a hierarchical fashion. Since both subproblems are NP-hard, we develop effective optimization-based tabu search strategies that balance intensification and diversification to identify near-optimal solutions. To initiate this method, we develop two heuristic procedures that can yield good starting points. We test the combined approach on large-scale SND instances, and empirically assess the quality of the solutions vis-à-vis optimal values or lower bounds. On average, our hierarchical solution approach generates solutions within 2.7% of optimality even for very large problems (that cannot be solved using exact methods), and our results demonstrate that the performance of the method is robust for a variety of problems with different size and connectivity characteristics.     

A Variational Characterization of the Effective Yield Set for Ionic Polycrystals

The effective yield set of ionic polycrystals is characterized by means of variational principles in $L^\infty $ associated to supremal functionals acting on matrix-valued divergence-free fields.     

Fixed point results on a metric space endowed with a finite number of graphs and applications

In this paper, we consider self-mappings defined on a metric space endowed with a finite number of graphs. Under certain conditions imposed on the graphs, we establish a new fixed point theorem for such mappings. The obtained result extends, generalizes and improves many existing contributions in the literature including standard fixed point theorems, fixed point theorems on a metric space endowed with a partial order and fixed point theorems for cyclic mappings.     

Generalized (anti) Yetter-Drinfeld modules as components of a braided T-category

If H is a Hopf algebra with bijective antipode and α, β ∈ Aut _Hopf (H), we introduce a category , generalizing both Yetter-Drinfeld modules and anti-Yetter-Drinfeld modules. We construct a braided T-category having all the categories as components, which, if H is finite dimensional, coincides with the representations of a certain quasitriangular T-coalgebra DT(H) that we construct. We also prove that if (α, β) admits a so-called pair in involution, then is isomorphic to the category of usual Yetter-Drinfeld modules . Research partially supported by the programme CERES of the Romanian Ministry of Education and Research, contract no. 4-147/2004.