Additive Completion of Lacunary Sequences

To the memory of Pál Erdős Thirty years ago I read the following question of Erdőos [4]: "Does there exist a sequence with so that every sufficiently large number is of the form ? $10" I sent my solution to Erdős in a letter (in Hungarian). He translated my letter into English and sent it to the Canadian Math. Bulletin; this became my first paper to appear. In this paper we will find, among others, the best value of the constant c in the above question, which was also asked by Erdős. Received March 30, 2000 RID="*" ID="*" Supported by Hungarian National Foundation for Scientific Research, Grants No. T 025617 and T 29759.     

On the convergence of the Weiszfeld algorithm

In this work we analyze the paper “Brimberg, J. (1995): The Fermat-Weber location problem revisited. Mathematical Programming 71, 71–76” which claims to close the question on the conjecture posed by Chandrasekaran and Tamir in 1989 on the convergence of the Weiszfeld algorithm. Some counterexamples are shown to the proofs showed in Brimberg’s paper. Received: January 1999 / Accepted: December 2001?Published online April 12, 2002 RID="*" ID="*"Partially supported by PB/11/FS/97 of Fundación Séneca of the Comunidad Autónoma de la Región de Murcia RID="**" ID="**"Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica (I+I+D), project TIC2000-1750-C06-06 RID="*" RID="**"     

Small Universal Graphs for Bounded-Degree Planar Graphs

For all positive integers N and k, let denote the family of planar graphs on N or fewer vertices, and with maximum degree k. For all positive integers N and k, we construct a -universal graph of size . This construction answers with an explicit construction the previously open question of the existence of such a graph. Received July 8, 1998 RID="*" ID="*" Supported by NSF grant CCR98210-58 and ARO grant DAAH04-96-1-0013.     

Ramsey-type Theorems with Forbidden Subgraphs

Dedicated to the memory of Paul Erdős   A graph is called H-free if it contains no induced copy of H. We discuss the following question raised by Erdős and Hajnal. Is it true that for every graph H, there exists an such that any H-free graph with n vertices contains either a complete or an empty subgraph of size at least ? We answer this question in the affirmative for a special class of graphs, and give an equivalent reformulation for tournaments. In order to prove the equivalence, we establish several Ramsey type results for tournaments. Received August 22, 1999 RID="*" ID="*" Supported by a USA Israeli BSF grant, by a grant from the Israel Science Foundation and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University. RID="†" ID="†" Supported by NSF grant CR-9732101, PSC-CUNY Research Award 663472, and OTKA-T-020914. RID="‡" ID="‡" Supported by TKI grant Stochastics@TUB, and OTKA-T-026203.     

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.     

On the Oka principle in a Banach space,I

 Let X be a complex Banach space with a countable unconditional basis, Ω⊂X pseudoconvex open, G a complex Banach Lie group. We show that a Runge–type approximation hypothesis on X, G (which we also prove for G a solvable Lie group) implies that any holomorphic cocycle on Ω with values in G can be resolved holomorphically if it can be resolved continuously. Received: 1 March 2002 / Published online: 28 March 2003 Mathematics Subject Classification (2000): 32L05, 32E30, 46G20 RID="*" ID="*" Kedves Szímuskának. RID="*" ID="*" To my dear Wife.     

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     

Dense subgroups of <Emphasis Type="Italic">n</Emphasis>-dimensional Möbius groups

We will derive a new discreteness condition for n-dimensional M?bius subgroups as well as obtain some results concerning classification of such groups. We will also discuss dense subgroups of n-dimensional M?bius groups. The main result is that any dense group of an n-dimensional M?bius group contains a dense subgroup which is generated by at most n elements if . Received: 5 June 2001 / Published online: 24 February 2003 RID="*" ID="*" The research was partly supported by FNS of China, grant number 19801011     

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.     

Skew loops and quadric surfaces

A skew loop is a closed curve without parallel tangent lines. We prove: The only complete surfaces in R ³ with a point of positive curvature and no skew loops are the quadrics. In particular: Ellipsoids are the only closed surfaces without skew loops. Our efforts also yield results about skew loops on cylinders and positively curved surfaces. Received: January 7, 2002 RID="*" ID="*"The first author was partially supported by the NSF grant DMS-0204190.     

Uniqueness of positive multi-lump bound states of nonlinear Schrödinger equations

In this paper we are concerned with multi-lump bound states of the nonlinear Schr?dinger equation for sufficiently small , where for and for . V is bounded on . For any finite collection of nondegenerate critical points of V, we show the uniqueness of solutions of the form for , where u is positive on and is a small perturbation of a sum of one-lump solutions concentrated near , respectively for sufficiently small . Received: 30 October 2001; in final form: 10 June 2002 /Published online: 2 December 2002 RID="*" ID="*" Research supported by Alexander von Humboldt Foundation in Germany and NSFC in China     

Cycles of Nonzero Elements in Low Rank Matrices

Dedicated to the memory of Paul Erdős We consider the problem of finding some structure in the zero-nonzero pattern of a low rank matrix. This problem has strong motivation from theoretical computer science. Firstly, the well-known problem on rigidity of matrices, proposed by Valiant as a means to prove lower bounds on some algebraic circuits, is of this type. Secondly, several problems in communication complexity are also of this type. The special case of this problem, where one considers positive semidefinite matrices, is equivalent to the question of arrangements of vectors in euclidean space so that some condition on orthogonality holds. The latter question has been considered by several authors in combinatorics [1, 4]. Furthermore, we can think of this problem as a kind of Ramsey problem, where we study the tradeoff between the rank of the adjacency matrix and, say, the size of a largest complete subgraph. In this paper we show that for an real matrix with nonzero elements on the main diagonal, if the rank is o(n), the graph of the nonzero elements of the matrix contains certain cycles. We get more information for positive semidefinite matrices. Received September 9, 1999 RID="*" ID="*" Partially supported by grant A1019901 of the Academy of Sciences of the Czech Republic and by a cooperative research grant INT-9600919/ME-103 from the NSF (USA) and the MŠMT (Czech Republic).     

Valuation theory of exponential Hardy fields I

We describe the valuation theoretic properties of the Hardy fields associated to models of , where T is the theory of a polynomially bounded o-minimal expansion of the reals and is the real exponential function. We deduce that has levels with parameters and is exponentially bounded. We establish a maximality property of , the Hardy field of the expansion by the restricted analytic functions and power functions. Received: 10 July 2000 ; in final form: 15 April 2002/Published online: 24 February 2003 RID="*" ID="*" This paper was written while both authors were partially supported by a Canadian NSERC research grant.     

On the structure of rotation-invariant semigroups

 We generalize the notions of Girard algebras and MV-algebras by introducing rotation-invariant semigroups. Based on a geometrical characterization, we present five construction methods which result in rotation-invariant semigroups and in particular, Girard algebras and MV-algebras. We characterize divisibility of MV-algebras, and point out that integrality of Girard algebras follows from their other axioms. Received: 7 January 2002 / Revised version: 4 April 2002 / Published online: 19 December 2002 RID="*" ID="*" Supported by the National Scientific Research Fund Hungary (OTKA F/032782). Mathematics Subject Classification (2000): 20M14, 06F05 Key words or phrases: Residuated lattice – Conjunction for non-classical logics     

Van Kampen’s embedding obstruction for discrete groups

We give a lower bound to the dimension of a contractible manifold on which a given group can act properly discontinuously. In particular, we show that the n-fold product of nonabelian free groups cannot act properly discontinuously on ℝ^{2 n −1}. Oblatum 19-I-2001 & 29-V-2002?Published online: 5 September 2002 RID="*" ID="*"All three authors gratefully acknowledge the support by the National Science Foundation.     

Differentiable functions defined in closed sets. A problem of Whitney

In 1934, Whitney raised the question of how to recognize whether a function f defined on a closed subset X of ℝ ⁿ is the restriction of a function of class 𝒞 ^p . A necessary and sufficient criterion was given in the case n=1 by Whitney, using limits of finite differences, and in the case p=1 by Glaeser (1958), using limits of secants. We introduce a necessary geometric criterion, for general n and p, involving limits of finite differences, that we conjecture is sufficient at least if X has a “tame topology”. We prove that, if X is a compact subanalytic set, then there exists q=q _X (p) such that the criterion of order q implies that f is 𝒞 ^p . The result gives a new approach to higher-order tangent bundles (or bundles of differential operators) on singular spaces. Oblatum 21-XI-2001 & 3-VII-2002?Published online: 8 November 2002 RID="*" ID="*"Research partially supported by the following grants: E.B. – NSERC OGP0009070, P.M. – NSERC OGP0008949 and the Killam Foundation, W.P. – KBN 5 PO3A 005 21.     

Semiconvexity of invariant functions of rectangular matrices

The paper deals with the semiconvexity properties (i.e., the rank 1 convexity, quasiconvexity, polyconvexity, and convexity) of rotationally invariant functions f of matrices. For the invariance with respect to the proper orthogonal group and the invariance with respect to the full orthogonal group coincide. With each invariant f one can associate a fully invariant function of a square matrix of type where It is shown that f has the semi convexity of a given type if and only if has the semiconvexity of that type. Consequently the semiconvex hulls of f can be determined by evaluating the corresponding hulls of and then extending them to matrices by rotational invariance. Received: 10 October 2001 / Accepted: 23 January 2002 // Published online: 6 August 2002 RID="*" ID="*" This research was supported by Grant 201/00/1516 of the Czech Republic.     

A generalization of the Dual Ellentuck Theorem

 We prove versions of the Dual Ramsey Theorem and the Dual Ellentuck Theorem for families of partitions which are defined in terms of games. Received: 8 July 1999 Published online: 19 December 2002 RID="*" ID="*" The author wishes to thank the Swiss National Science Foundation for supporting him. The authors thank the referee for helpful comments. Mathematics Subject Classification (2000): 03E02, 05D10, 03E35 Key words or phrases: Dual Ramsey Theorem – Dual Ellentuck Theorem – Partitions – Games