A unimodularly invariant theory for immersions into the affine space

We develop a unimodularly invariant theory for immersions with higher codimension into the affine space. Received: 6 September 2001; in final form: 22 November 2001 / Published online: 29 April 2002 RID="*" ID="*" Supported by the Deutsche Forschungsgemeinschaft     

Additive stable solutions on perfect cones of cooperative games

Closed kernel systems of the coalition matrix turn out to correspond to cones of games on which the core correspondence is additive and on which the related barycentric solution is additive, stable and continuous. Different perfect cones corresponding to closed kernel systems are described. Received: December 2001/Revised: July 2002 RID="*" ID="*"  This note contains the new results, which were presented by the first author in an invited lecture at the XIV Italian Meeting on Game Theory and Applications in Ischia, July 2001. The lecture was dedicated to Irinel Dragan on the occasion of his seventieth birthday.     

Locally Well-Dominated and Locally Independent Well-Dominated Graphs

 In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irredundance number, the domination number and the independent domination number can be computed in polynomial time within several classes of graphs, e.g., the class of locally well-dominated graphs. Received: September 13, 2001 Final version received: May 17, 2002 RID="*" ID="*" Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093) RID="†" ID="†" Supported by RUTCOR RID="*" ID="*" Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093) 05C75, 05C69 Acknowledgments. The authors thank the referees for valuable suggestions.     

Simple and immune relations on countable structures

 Let 𝒜 be a computable structure and let R be a new relation on its domain. We establish a necessary and sufficient condition for the existence of a copy ℬ of 𝒜 in which the image of R (?R, resp.) is simple (immune, resp.) relative to ℬ. We also establish, under certain effectiveness conditions on 𝒜 and R, a necessary and sufficient condition for the existence of a computable copy ℬ of 𝒜 in which the image of R (?R, resp.) is simple (immune, resp.). Received: 4 February 2001 Published online: 5 November 2002 RID="*" ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899. RID="*" ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899. RID="*" ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899.     

Convergence analysis and error estimates for a parallel algorithm for solving the Navier-Stokes equations

Summary. This paper is concerned with the analysis of the convergence and the derivation of error estimates for a parallel algorithm which is used to solve the incompressible Navier-Stokes equations. As usual, the main idea is to split the main differential operator; this allows to consider independently the two main difficulties, namely nonlinearity and incompressibility. The results justify the observed accuracy of related numerical results. Received April 20, 2001 / Revised version received May 21, 2001 / Published online March 8, 2002 RID="*" ID="*" Partially supported by D.G.E.S. (Spain), Proyecto PB98–1134 RID="**" ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986 RID="**" ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986 RID="*" ID="*" Partially supported by D.G.E.S. (Spain), Proyecto PB98–1134 RID="**" ID="**" Partially supported by D.G.E.S. (Spain), Proyecto PB96–0986 RID="**" ID="**" Partially supported by D.G.E.S. (Spain) Proyecto PB96–0986     

On Dwork's accessory parameter problem

We study the question which ordinary second order linear differential equation allows power series solutions whose p-adic radius of convergence is at least one, a question raised by B.Dwork. In particular we shall consider the case of Fuchsian equations with four singularities and local exponent differences 0. Received: 28 August 2000; final form: 20 November 2001/ Published online: 17 June 2002 RID="*" ID="*" Part of this work was supported by EPSRC grant L99920     

A primal all-integer algorithm based on irreducible solutions

 This paper introduces an exact primal augmentation algorithm for solving general linear integer programs. The algorithm iteratively substitutes one column in a tableau by other columns that correspond to irreducible solutions of certain linear diophantine inequalities. We prove that various versions of our algorithm are finite. It is a major concern in this paper to show how the subproblem of replacing a column can be accomplished effectively. An implementation of the presented algorithms is given. Computational results for a number of hard 0/1 integer programs from the MIPLIB demonstrate the practical power of the method. Received: April 23, 2001 / Accepted: May 2002 Published online: March 21, 2003 RID="*" ID="*" Supported by grants FKZ 0037KD0099 and FKZ 2495A/0028G of the Kultusministerium of Sachsen-Anhalt. RID="*" ID="*" Supported by grants FKZ 0037KD0099 and FKZ 2495A/0028G of the Kultusministerium of Sachsen-Anhalt. RID="*" ID="*" Supported by grants FKZ 0037KD0099 and FKZ 2495A/0028G of the Kultusministerium of Sachsen-Anhalt. RID="#" ID="#"Supported by a Gerhard-Hess-Preis and grant WE 1462 of the Deutsche Forschungsgemeinschaft, and by the European DONET program TMR ERB FMRX-CT98-0202. Mathematics Subject Classification (1991): 90C10     

Convergent adaptive finite elements for the nonlinear Laplacian

Summary. The numerical solution of the homogeneous Dirichlet problem for the p-Laplacian, , is considered. We propose an adaptive algorithm with continuous piecewise affine finite elements and prove that the approximate solutions converge to the exact one. While the algorithm is a rather straight-forward generalization of those for the linear case p=2, the proof of its convergence is different. In particular, it does not rely on a strict error reduction. Received December 29, 2000 / Revised version received August 30, 2001 / Published online December 18, 2001 RID="*" ID="*" Current address: Dipartimento di Matematica, Università degli Studi di Milano, Via C. Saldini 50, 20133 Milano, Italy; e-mail: veeser@mat.unimi.it     

On the Classification of Self-Dual Codes over 𝔽5

 In this paper, we give the classification of self-dual 𝔽₅-codes of lengths 14 and 16. Up to equivalence, there are 53 and 535 such codes, respectively. It is also shown that there is no self-dual [18, 9, 8] code over 𝔽₅. Received: June 18, 2001 Final version received: April 9, 2002 RID="*" ID="*" Supported in part by the Academy of Finland under grants 44517 and 100500     

Gaussian estimates and L p -boundedness of Riesz means

We show that suitable upper estimates of the heat kernel are sufficient to imply the L ^p boundedness of several families of operators associated with the Schr?dinger group in various situations. This generalizes results by Sj?strand and others in the Euclidean case, and by Alexopoulos in the case of Lie groups and Riemannian manifolds. RID="*" ID="*"Research partially supported by the European Commission (European TMR Network "Harmonic Analysis" 1998-2001, Contract ERBFMRX-CT97-0159).