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 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     

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.     

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.     

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     

Pathwidth of Planar and Line Graphs

 We prove that for every 2-connected planar graph the pathwidth of its geometric dual is less than the pathwidth of its line graph. This implies that pathwidth(H)≤ pathwidth(H ^*)+1 for every planar triangulation H and leads us to a conjecture that pathwidth(G)≤pathwidth(G ^*)+1 for every 2-connected graph G. Received: May 8, 2001 Final version received: March 26, 2002 RID="*" ID="*" I acknowledge support by EC contract IST-1999-14186, Project ALCOM-FT (Algorithms and Complexity - Future Technologies) and support by the RFBR grant N01-01-00235. Acknowledgments. I am grateful to Petr Golovach, Roland Opfer and anonymous referee for their useful comments and suggestions.     

Numerical schemes for Hamilton-Jacobi equations on unstructured meshes

Summary.  In this paper, a numerical scheme is presented by applying the finite element method to the viscosity equations of the Hamilton-Jacobi equations on unstructured meshes. By improving the finite element scheme, another numerical scheme is constructed. Under certain limitations, the numerical solutions of the two schemes converge to the viscosity solutions of the Hamilton-Jacobi equations. The latter numerical scheme has weaker restrictions than the former scheme for convergence. Numerical examples are provided to test the stability, convergence and sensitivity to different meshes. Received November 5, 2001 / Revised version received March 5, 2002 / Published online October 29, 2002 RID="*" ID="*" Current address: Department of Applied Mathematics, University of Petroleum, Dongying 257062, Shandong, P.R.China; e-mail: xianggui_li@sina.com Mathematics Subject Classification (1991): 65M60     

A Gentzen-style axiomatization for basic predicate calculus

 We introduce a Gentzen-style sequent calculus axiomatization for Basic Predicate Calculus. Our new axiomatization is an improvement of the previous axiomatizations, in the sense that it has the subformula property. In this system the cut rule is eliminated. Received: 18 April 2000 / Published online: 2 September 2002 Mathematics Subject Classification (2000): Primary 03F05; Secondary 03F99, 03B60 Key words or phrases: Basic predicate calculus – Cut elimination – Sequent     

A common generalization for MV-algebras and Łukasiewicz–Moisil algebras

We introduce the notion of n-nuanced MV-algebra by performing a Łukasiewicz–Moisil nuancing construction on top of MV-algebras. These structures extend both MV-algebras and Łukasiewicz–Moisil algebras, thus unifying two important types of structures in the algebra of logic. On a logical level, n-nuanced MV-algebras amalgamate two distinct approaches to many valuedness: that of the infinitely valued Łukasiewicz logic, more related in spirit to the fuzzy approach, and that of Moisil n-nuanced logic, which is more concerned with nuances of truth rather than truth degree. We study n-nuanced MV-algebras mainly from the algebraic and categorical points of view, and also consider some basic model-theoretic aspects. The relationship with a suitable notion of n-nuanced ordered group via an extension of the Γ construction is also analyzed.     

A new correctness criterion for multiplicative non-commutative proof nets

 We introduce a new correctness criterion for multiplicative non commutative proof nets which can be considered as the non-commutative counterpart to the Danos-Regnier criterion for proof nets of linear logic. The main intuition relies on the fact that any switching for a proof net (obtained by mutilating one premise of each disjunction link) can be naturally viewed as a series-parallel order variety (a cyclic relation) on the conclusions of the proof net. Received: 8 November 2000 / Revised version: 21 June 2001 / Published online: 2 September 2002 Research supported by the EU TMR Research Programme ``Linear Logic and Theoretical Computer Science'. Mathematics Subject Classification (2000): 03F03, 03F07, 03F52, 03B70 Key words or phrases: Linear and non-commutative logic – Proof nets – Series-parallel orders and order varieties     

Isosceles Triangles Determined by a Planar Point Set

 It is proved that, for any ɛ>0 and n>n ₀(ɛ), every set of n points in the plane has at most triples that induce isosceles triangles. (Here e denotes the base of the natural logarithm, so the exponent is roughly 2.136.) This easily implies the best currently known lower bound, , for the smallest number of distinct distances determined by n points in the plane, due to Solymosi–Cs. Tóth and Tardos. Received: February, 2002 Final version received: September 15, 2002 RID="*" ID="*" Supported by NSF grant CCR-00-86013, PSC-CUNY Research Award 63382-00-32, and OTKA-T-032452 RID="†" ID="†" Supported by OTKA-T-030059 and AKP 2000-78-21     

Cotangent bundles of 4-dimensional hypercomplex Lie groups

 We study geometrical structures on the cotangent bundle T ^* G of a Lie group G which are left-invariant with respect to the Lie group structure on T ^* G determined by a left-invariant affine structure ∇ on G. In particular, we investigate the existence of conformally hyper-K?hler metrics and hyper-K?hler with torsion (HKT) structures on the cotangent bundle of hypercomplex 4-dimensional Lie groups. By applying In?nü-Wigner contractions to compact semisimple Lie algebras we obtain non semisimple Lie algebras endowed with invariant HKT structures. Received: 4 February 2002 / Revised version: 20 August 2002 Research partially supported by MURST and GNSAGA (Indam) of Italy Mathematics Subject Classification (2000): 53C26, 22E25     

Polyhedral <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">2</Emphasis></Subscript>

 Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They coincide with the usual K-theoretic groups in the special case when the polytope is a unit simplex and can be thought of as compact/polytopal substitutes for the tame automorphism groups of polynomial algebras. Relative to the classical case, many new aspects have to be taken into account. We describe these groups explicitly when the underlying polytope is 2-dimensional. Already this low-dimensional case provides interesting classes of groups. Received: 13 December 2001 / Revised version: 24 June 2002 The second author was supported by the Deutsche Forschungsgemeinschaft, INTAS grant 99-00817 and TMR grant ERB FMRX CT-97-0107 Mathematics Subject Classification (2000): 14L27, 14M25, 19C09, 52B20     

Hájek basic fuzzy logic and Łukasiewicz infinite-valued logic

 Using the theory of BL-algebras, it is shown that a propositional formula ϕ is derivable in Łukasiewicz infinite valued Logic if and only if its double negation ˜˜ϕ is derivable in Hájek Basic Fuzzy logic. If SBL is the extension of Basic Logic by the axiom (φ & (φ→˜φ)) → ψ, then ϕ is derivable in in classical logic if and only if ˜˜ ϕ is derivable in SBL. Axiomatic extensions of Basic Logic are in correspondence with subvarieties of the variety of BL-algebras. It is shown that the MV-algebra of regular elements of a free algebra in a subvariety of BL-algebras is free in the corresponding subvariety of MV-algebras, with the same number of free generators. Similar results are obtained for the generalized BL-algebras of dense elements of free BL-algebras. Received: 20 June 2001 / Published online: 2 September 2002 This paper was prepared while the first author was visiting the Universidad de Barcelona supported by INTERCAMPUS Program E.AL 2000. The second author was partially supported by Grants 2000SGR-0007 of D. G. R. of Generalitat de Catalunya and PB 97-0888 of D. G. I. C. Y. T. of Spain. Mathematics Subject classification (2000): 03B50, 03B52, 03G25, 06D35 Keywords or Phrases: Basic fuzzy logic – Łukasiewicz logic – BL-algebras – MV-algebras – Glivenko's theorem     

Intersecting Curves in the Plane

 We prove that for every family of n pairwise intersecting simple closed planar curves in general position, at least (4/5)n ²−O(n) points lie on more than one curve. This improves the previous lower bound of (3/4)n ²−O(n) due to Richter and Thomassen. Received: March 29, 2000 Final version received: August 30, 2001 RID="*" ID="*" Research supported in part by NSF grant DMS-9970325 Acknowledgments. I thank Bruce Richter for informing me about this problem, Gelasio Salazar for reading a preliminary version of the paper, and a Referee for useful comments. Current Address: Microsoft Research, One Microsoft Way, Redmond, WA 98052-6399, USA. e-mail: mubayi@microsoft.com 1991 Mathematics Subject Classification. 05C35, 52C10