Maximal Energy Bipartite Graphs

 Given a graph G, its energy E(G) is defined to be the sum of the absolute values of the eigenvalues of G. This quantity is used in chemistry to approximate the total π-electron energy of molecules and in particular, in case G is bipartite, alternant hydrocarbons. Here we show that if G is a bipartite graph with n vertices, then

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.     

Fusion Relation in Products of Association Schemes

 Fusion relations between the association schemes obtained by direct product and wreath product are established via a study of their matrix representations. The character table of the scheme obtained by the wreath product is described and some algebraic properties of the products are derived. Received: May 7, 1999 Final version received: September 24, 1999 RID="*" ID="*" 1991 Mathematics Subject Classification. Primary 05E30; Secondary 05B99 RID="*" ID="*" Supported in part by Com ²MaC-KOSEF, POSTECH, Korea Acknowledgments. The author is indebted to an anonymous referee who provided the complete proof of Theorem 4.2.     

The stable forking conjecture and generic structures

 We prove that for any simple theory which is constructed via Fr?issé-Hrushovski method, if the forking independence is the same as the d-independence then the stable forking property holds. Received: 22 January 2001 / Published online: 19 December 2002 This article is part of the author's D-Phil thesis, written at the University of Oxford and supported by the Ministry of Higher Education of Iran. The author would like to thank the Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran, for its financial support whilst working on this article. Mathematics Subject Classification (2000): 03C45 Key words or phrases: Generic structures – Fr?issé-Hrushovski method – Predimension – Simple theories – Stable theories – Stable forking conjecture     

Uniform Group Divisible Designs with Block Sizes Three and <Emphasis Type="Italic">n</Emphasis>

 The existence of group divisible designs of type g ^t with block sizes three and n, 4≤ n≤10, is completely settled for all values of g and t. Received: July 21, 1999 Final version received: September 10, 2001 RID="*" ID="*" This work was done in 1995 while the authors were graduate students at the University of Waterloo, Waterloo, Ontario N2L 3G1, Canada Acknowledgments. The authors would like to thank the referee for his careful reading and for pointing out some errors in an earlier draft of the paper.     

Aspects of strong compactness, measurability, and indestructibility

 We prove three theorems concerning Laver indestructibility, strong compactness, and measurability. We then state some related open questions. Received: 11 December 1999 / Revised version: 17 September 2000 / Published online: 2 September 2002 Mathematics Subject classification (2000): 03E35, 03E55 Keywords or phrases: Measurable cardinal – Strongly compact cardinal – Supercompact cardinal – Indestructibility     

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.     

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     

A notion of rank in set theory without choice

 Starting from the definition of `amorphous set' in set theory without the axiom of choice, we propose a notion of rank (which will only make sense for, at most, the class of Dedekind finite sets), which is intended to be an analogue in this situation of Morley rank in model theory. Received: 22 September 2000 / Revised version: 14 May 2002 Published online: 19 December 2002 The research of the first author was supported by the SERC. Mathematics Subject Classification (2000): 03E25 Key words or phrases: Rank – Degree – Amorphous     

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

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     

CM-triviality and generic structures

 We show that any relational generic structure whose theory has finite closure and amalgamation over closed sets is stable CM-trivial with weak elimination of imaginaries. Received: 21 December 2001 / Published online: 5 November 2002 Mathematics Subject Classification (2000): 03C45 Key words or phrases: CM-triviality – Generic structures – Stability     

On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices

 For given two graphs G dan H, the Ramsey number R(G,H) is the smallest positive integer n such that every graph F of order n must contain G or the complement of F must contain H. In [12], the Ramsey numbers for the combination between a star S _n and a wheel W _m for m=4,5 were shown, namely, R(S _n ,W ₄)=2n−1 for odd n and n≥3, otherwise R(S _n ,W ₄)=2n+1, and R(S _n ,W ₅)=3n−2 for n≥3. In this paper, we shall study the Ramsey number R(G,W _m ) for G any tree T _n . We show that if T _n is not a star then the Ramsey number R(T _n ,W ₄)=2n−1 for n≥4 and R(T _n ,W ₅)=3n−2 for n≥3. We also list some open problems. Received: October, 2001 Final version received: July 11, 2002 RID="*" ID="*" This work was supported by the QUE Project, Department of Mathematics ITB Indonesia Acknowledgments. We would like to thank the referees for several helpful comments.     

The modal logic of the countable random frame

 We study the modal logic M L ^r of the countable random frame, which is contained in and `approximates' the modal logic of almost sure frame validity, i.e. the logic of those modal principles which are valid with asymptotic probability 1 in a randomly chosen finite frame. We give a sound and complete axiomatization of M L ^r and show that it is not finitely axiomatizable. Then we describe the finite frames of that logic and show that it has the finite frame property and its satisfiability problem is in EXPTIME. All these results easily extend to temporal and other multi-modal logics. Finally, we show that there are modal formulas which are almost surely valid in the finite, yet fail in the countable random frame, and hence do not follow from the extension axioms. Therefore the analog of Fagin's transfer theorem for almost sure validity in first-order logic fails for modal logic. Received: 1 May 2000 / Revised version: 29 July 2001 / Published online: 2 September 2002 Mathematics Subject Classification (2000): 03B45, 03B70, 03C99 Key words or phrases: Modal logic – Random frames – Almost sure frame validity – Countable random frame – Axiomatization – Completeness     

Multi-self-similar Markov processes on ℝ<Subscript>+</Subscript><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> and their Lamperti representations

 A classical result, due to Lamperti, establishes a one-to-one correspondence between a class of strictly positive Markov processes that are self-similar, and the class of one-dimensional Lévy processes. This correspondence is obtained by suitably time-changing the exponential of the Lévy process. In this paper we generalise Lamperti's result to processes in n dimensions. For the representation we obtain, it is essential that the same time-change be applied to all coordinates of the processes involved. Also for the statement of the main result we need the proper concept of self-similarity in higher dimensions, referred to as multi-self-similarity in the paper. The special case where the Lévy process ξ is standard Brownian motion in n dimensions is studied in detail. There are also specific comments on the case where ξ is an n-dimensional compound Poisson process with drift. Finally, we present some results concerning moment sequences, obtained by studying the multi-self-similar processes that correspond to n-dimensional subordinators. Received: 22 August 2002 / Revised version: 10 February 2003 Published online: 15 April 2003 RID="*" ID="*" MaPhySto – Centre for Mathematical Physics and Stochastics, funded by a grant from the Danish National Research Foundation Mathematics Subject Classification (2000): 60G18, 60G51, 60J25, 60J60, 60J75 Key words or phrases: Lévy process – Self-similarity – Time-change – Exponential functional – Brownian motion – Bessel process – Piecewise deterministic Markov process – Moment sequence     

A Blow-up Theorem for regular hypersurfaces on nilpotent groups

 We obtain an intrinsic Blow-up Theorem for regular hypersurfaces on graded nilpotent groups. This procedure allows us to represent explicitly the Riemannian surface measure in terms of the spherical Hausdorff measure with respect to an intrinsic distance of the group, namely homogeneous distance. We apply this result to get a version of the Riemannian coarea forumula on sub-Riemannian groups, that can be expressed in terms of arbitrary homogeneous distances. We introduce the natural class of horizontal isometries in sub-Riemannian groups, giving examples of rotational invariant homogeneous distances and rotational groups, where the coarea formula takes a simpler form. By means of the same Blow-up Theorem we obtain an optimal estimate for the Hausdorff dimension of the characteristic set relative to C ^1,1 hypersurfaces in 2-step groups and we prove that it has finite Q–2 Hausdorff measure, where Q is the homogeneous dimension of the group. Received: 6 February 2002 Mathematics Subject Classification (2000): 28A75 (22E25)     

Two measures for proving Gentzen's Hauptsatz without mix

 This paper presents a cut-elimination procedure for classical and intuitionistic logic, in which cut is eliminated directly, without introducing the mix rule. The well-known problem of cut eliminations, when in the derivation the contractions of the cut-formulae are above the premisses of the cut, will be solved by new transformations of the derivation. Received: 1 June 2001 / Published online: 5 November 2002 Mathematics Subject Classification (2000): 03F05 Key words or phrases: Systems of sequents – Cut-elimination theorem     

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.