On the duality between varieties and algebraic theories

It is proved that for any ultrametric space (X, d), the set L(X) of its closed balls is a lattice . It is complete, atomic, tree-like, and real graduated. For any such lattice , the set A(L) of its atoms can be naturally equipped with an ultrametric . These assignments are inverse of one another: where the first equality means an isometry while the second one is a lattice isomorphism. A similar correspondence established for morphisms, shows that there is an isomorphism of categories. The category ULTRAMETR of ultrametric spaces and non-expanding maps is isomorphic to the category LAT* of complete, atomic, tree-like, real graduated lattices and isotonic, semi-continuous, non-extensive maps. We describe properties of the isomorphism functor and its relations to the categorical operations and action of other functors. Basic properties of a space (such as completeness, spherical completeness, total boundedness, compactness, etc.) are translated into algebraic properties of the corresponding lattice L(X).     

On homology of real algebraic varieties

Let be a commutative ring with unity and an -oriented compact nonsingular real algebraic variety of dimension . If is any nonsingular complexification of , then the kernel, which we will denote by , of the induced homomorphism is independent of the complexification. In this work, we study and give some of its applications.

     

Non-special divisors on real algebraic curves and embeddings into real projective spaces

We show that there is a large class of non-special divisors of relatively small degree on a given real algebraic curve. If the real algebraic curve has many real components, such a divisor gives rise to an embedding (birational embedding, resp.) of the real algebraic curve into the real projective space ℙ ^r for r≥3 (r=2, resp.). We study these embeddings in quite some detail. Received: October 17, 2001?Published online: February 20, 2003     

On reduced convex QP formulations of monotone LCPs

Techniques for transforming convex quadratic programs (QPs) into monotone linear complementarity problems (LCPs) and vice versa are well known. We describe a class of LCPs for which a reduced QP formulation – one that has fewer constraints than the “standard” QP formulation – is available. We mention several instances of this class, including the known case in which the coefficient matrix in the LCP is symmetric. Received: May 2000 / Accepted: February 22, 2001?Published online April 12, 2001     

On Unavoidability of Trees with k Leaves

Graphs and Combinatorics - ?A digraph is said to be n-unavoidable if every tournament of order n contains it as a subgraph. Let f(n) be the smallest integer such that every oriented tree of...     

On the fundamental group of real toric varieties

LetX (Δ) be the real toric variety associated to a smooth fan Δ. The main purpose of this article is: (i) to determine the fundamental group and the universal cover ofX (Δ), (ii) to give necessary and sufficient conditions on Δ under which π₁(X(Δ)) is abelian, (iii) to give necessary and sufficient conditions on Δ under whichX(Δ) is aspherical, and when Δ is complete, (iv) to give necessary and sufficient conditions forC _Δ to be aK (π, 1) space whereC _Δ is the complement of a real subspace arrangement associated to Δ.     

On the Hamilton-Waterloo Problem

 The Hamilton-Waterloo problem asks for a 2-factorisation of K _v in which r of the 2-factors consist of cycles of lengths a ₁,a ₂,…,a _t and the remaining s 2-factors consist of cycles of lengths b ₁,b ₂,…,b _u (where necessarily ∑ _i=1 ^t a _i =∑ _j=1 ^u b _j =v). In this paper we consider the Hamilton-Waterloo problem in the case a _i =m, 1≤i≤t and b _j =n, 1≤j≤u. We obtain some general constructions, and apply these to obtain results for (m,n)∈{(4,6),(4,8),(4,16),(8,16),(3,5),(3,15),(5,15)}. Received: July 5, 2000     

On the Betti number of the image of a generic map

Let be a differentiable map of a closed m-dimensional manifold into an (m + k)-dimensional manifold with k > 0. We show, assuming that f is generic in a certain sense, that f is an embedding if and only if the (m - k + 1)-th Betti numbers with respect to the Čech homology of M and f(M) coincide, under a certain condition on the stable normal bundle of f. This generalizes the authors' previous result for immersions with normal crossings [BS1]. As a corollary, we obtain the converse of the Jordan-Brouwer theorem for codimension-1 generic maps, which is a generalization of the results of [BR, BMS1, BMS2, Sae1] for immersions with normal crossings. Received: January 3, 1996     

On the existence of a cooperative solution for a coalitional game with externalities

This paper analyzes a game in coalitional form that is derived from a simple economy with multilateral externalities. Following Chander and Tulkens (1997) we assume that agents react to a blocking coalition by choosing individual best reply strategies. A non-empty core of this game is established by showing that the game is balanced. The proof relies only on standard convexity assumptions and, therefore, substantially generalizes the results in Chander and Tulkens (1997). Received June 2000/Revised version March 2001     

On the curvature of algebraic hypersurfaces

Using algebraic residue theory, we try to generalize a theorem of Chasles about osculating circles of plane algebraic curves to algebraic hypersurfaces over algebraically closed fields of characteristic zero.     

On the relation between algebraic stability andB-convergence for Runge-Kutta methods

Summary This paper is concerned with the numerical solution of stiff initial value problems for systems of ordinary differential equations using Runge-Kutta methods. For these and other methods Frank, Schneid and Ueberhuber [7] introduced the important concept ofB-convergence, i.e. convergence with error bounds only depending on the stepsizes, the smoothness of the exact solution and the so-called one-sided Lipschitz constant . Spijker [19] proved for the case <0 thatB-convergence follows from algebraic stability, the well-known criterion for contractivity (cf. [1, 2]). We show that the order ofB-convergence in this case is generally equal to the stage-order, improving by one half the order obtained in [19]. Further it is proved that algebraic stability is not only sufficient but also necessary forB-convergence.This study was completed while this author was visiting the Oxford University Computing Laboratory with a stipend from the Netherlands Organization for Scientific Research (N.W.O.)     

On the core of ordered submodular cost games

A general ordertheoretic linear programming model for the study of matroid-type greedy algorithms is introduced. The primal restrictions are given by so-called weakly increasing submodular functions on antichains. The LP-dual is solved by a Monge-type greedy algorithm. The model offers a direct combinatorial explanation for many integrality results in discrete optimization. In particular, the submodular intersection theorem of Edmonds and Giles is seen to extend to the case with a rooted forest as underlying structure. The core of associated polyhedra is introduced and applications to the existence of the core in cooperative game theory are discussed. Received: November 2, 1995 / Accepted: September 15, 1999?Published online February 23, 2000