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     

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.     

A new Lichnerowicz–Obata estimate in the presence of a parallel p-form

 Let (M ⁿ ,g) be a compact Riemannian manifold with a smooth boundary. In this paper, we give a Lichnerowicz-Obata type lower bound for the first eigenvalue of the Laplacian of (M ⁿ ,g) when M has a parallel p-form (2 ≤p≤n/2). This result follows from a new Bochner-Reilly's formula. Moreover, we give a characterization of the equality case when (M ⁿ ,g) is simply connected. Received: 1 June 2001     

Littlewood–Paley theorem on spaces <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis>(<Emphasis Type="Italic">t</Emphasis>)</Superscript>(ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

We point out that if the Hardy–Littlewood maximal operator is bounded on the space L ^p(t)(ℝ), 1 < a ≤ p(t) ≤ b < ∞, t ∈ ℝ, then the well-known characterization of the spaces L ^p (ℝ), 1 < p < ∞, by the Littlewood–Paley theory extends to the space L ^p(t)(ℝ). We show that, for n > 1 , the Littlewood–Paley operator is bounded on L ^p(t) (ℝ ⁿ ), 1 < a ≤ p(t) ≤ b < ∞, t ∈ ℝ ⁿ , if and only if p(t) = const. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 12, pp. 1709–1715, December, 2008.     

Asymptotic separation for independent trajectories of Markov processes

We say that n independent trajectories ξ₁(t),…,ξ _n (t) of a stochastic process ξ(t)on a metric space are asymptotically separated if, for some ɛ > 0, the distance between ξ _i (t _i ) and ξ _j (t _j ) is at least ɛ, for some indices i, j and for all large enough t ₁,…,t _n , with probability 1. We prove sufficient conitions for asymptotic separationin terms of the Green function and the transition function, for a wide class of Markov processes. In particular,if ξ is the diffusion on a Riemannian manifold generated by the Laplace operator Δ, and the heat kernel p(t, x, y) satisfies the inequality p(t, x, x) ≤ Ct ^−ν/2 then n trajectories of ξ are asymptotically separated provided . Moreover, if for some α∈(0, 2)then n trajectories of ξ^(α) are asymptotically separated, where ξ^(α) is the α-process generated by −(−Δ)^α/2. Received: 10 June 1999 / Revised version: 20 April 2000 / Published online: 14 December 2000 RID="*" ID="*" Supported by the EPSRC Research Fellowship B/94/AF/1782 RID="**" ID="**" Partially supported by the EPSRC Visiting Fellowship GR/M61573     

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     

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.     

The <Emphasis Type="Italic">k</Emphasis>-Centrum Straight-line Location Problem

A line is sought in the plane which minimizes the sum of the k largest (Euclidean) weighted distances from n given points. This problem generalizes the known straight-line center and median problems and, as far as the authors are aware, has not been tackled up to now. By way of geometric duality it is shown that such a line may always be found which either passes through two of the given points or lying at equal weighted distance from three of these. This allows construction of an algorithm to find all t-centrum lines for 1 ≤ t ≤ k in O((k + logn)n ³). Finally it is shown that both, the characterization of an optimal line and the algorithm, can be extended to any smooth norm.     

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

The Linear 2-Arboricity of Planar Graphs

 Let G be a planar graph with maximum degree Δ and girth g. The linear 2-arboricity la ₂(G) of G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2. We prove that (1) la ₂(G)≤⌈(Δ+1)/2⌉+12; (2) la ₂(G)≤⌈(Δ+1)/2⌉+6 if g≥4; (3) la ₂(G)≤⌈(Δ+1)/2⌉+2 if g≥5; (4) la ₂(G)≤⌈(Δ+1)/2⌉+1 if g≥7. Received: June 28, 2001 Final version received: May 17, 2002 Acknowledgments. This work was done while the second and third authors were visiting the Institute of Mathematics, Academia Sinica, Taipei. The financial support provided by the Institute is greatly appreciated.     

On the Erlang Loss Model with Time Dependent Input

We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting p_n(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for p_n(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability p_m(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n₀ servers are occupied, 0≤ n₀≤ m). Numerical studies back up the asymptotic analysis. AMS subject classification: 60K25,34E10 Supported in part by NSF grants DMS-99-71656 and DMS-02-02815     

Spaces with fibered approximation property in dimension <Emphasis Type="Italic">n</Emphasis>

A metric space M is said to have the fibered approximation property in dimension n (briefly, M ∈ FAP(n)) if for any ɛ > 0, m ≥ 0 and any map g: $ \mathbb{I} $ \mathbb{I} ^m × $ \mathbb{I} $ \mathbb{I} ⁿ → M there exists a map g′: $ \mathbb{I} $ \mathbb{I} ^m × $ \mathbb{I} $ \mathbb{I} ⁿ → M such that g′ is ɛ-homotopic to g and dim g′ ({z} × $ \mathbb{I} $ \mathbb{I} ⁿ ) ≤ n for all z ∈ $ \mathbb{I} $ \mathbb{I} ^m . The class of spaces having the FAP(n)-property is investigated in this paper. The main theorems are applied to obtain generalizations of some results due to Uspenskij [11] and Tuncali-Valov [10].     

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.     

Sudakov-type minoration for gaussian chaos processes

Consider a setA of symmetricn×n matricesa=(a _i,j) _i,j≤n . Consider an independent sequence (g _i) _i≤n of standard normal random variables, and letM=Esup_a∈A|Σ_i,j⪯na_i,jg_ig_j|. Denote byN ₂(A, α) (resp.N _t(A, α)) the smallest number of balls of radiusα for thel ₂ norm ofR ^{n 2} (resp. the operator norm) needed to coverA. Then for a universal constantK we haveα(logN ₂(A, α))^1/4≤KM. This inequality is best possible. We also show that forδ≥0, there exists a constantK(δ) such thatα(logN _t≤K(δ)M. Work partially supported by an N.S.F. grant.     

Evasion and prediction

 Say that a function π:n ^<ω →n (henceforth called a predictor) k-constantly predicts a real xn ^ω if for almost all intervals I of length k, there is iI such that x(i)=π(x↾i). We study the k-constant prediction number v _n ^const (k), that is, the size of the least family of predictors needed to k-constantly predict all reals, for different values of n and k, and investigate their relationship. Received: 27 June 2001 / Revised version: 10 September 2001 / Published online: 10 October 2002 RID="*" ID="*" Supported by Grant–in–Aid for Scientific Research (C)(2)12640124, Japan Society for the Promotion of Science RID="†" ID="†" Supported by The Israel Science Foundation founded by the Israel Academy of Sciences and Humanities. Publication 762     

Global existence and uniform decay for the coupled Klein-Gordon-Schr?dinger equations

This paper is concerned to the existence, uniqueness and uniform decay for the solutions of the coupled Klein-Gordon-Schr?dinger damped equations where ω is a bounded domain of R ⁿ , n≤ 3, F : R ²→R is a C ¹-function; γ, β; θ are constants such that γ, β > 0 and 1 ≤ 2θ≤ 2. Received January 1999 – Accepted October 1999     

The Clique Numbers of Regular Graphs

 Let ω(G) be the clique number of a graph G. We prove that if G runs over the set of graphs with a fixed degree sequence d, then the values ω(G) completely cover a line segment [a,b] of positive integers. For an arbitrary graphic degree sequence d, we define min(ω,d) and max(ω,d) as follows:

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.     

Submanifolds with constant Möbius scalar curvature in <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

 Let M ^m be a m-dimensional submanifold in the n-dimensional unit sphere S ⁿ without umbilic point. Two basic invariants of M ^m under the M?bius transformation group of S ⁿ are a 1-form Φ called M?bius form and a symmetric (0,2) tensor A called Blaschke tensor. In this paper, we prove the following rigidity theorem: Let M ^m be a m-dimensional (m≥3) submanifold with vanishing M?bius form and with constant M?bius scalar curvature R in S ⁿ , denote the trace-free Blaschke tensor by . If , then either ||?||≡0 and M ^m is M?bius equivalent to a minimal submanifold with constant scalar curvature in S ⁿ ; or and M ^m is M?bius equivalent to in for some c≥0 and . Received: 15 May 2002 / Revised version: 3 February 2003 Published online: 19 May 2003 RID="*" ID="*" Partially supported by grants of CSC, NSFC and Outstanding Youth Foundation of Henan, China. RID="†" ID="†" Partially supported by the Alexander Humboldt von Stiftung and Zhongdian grant of NSFC. Mathematics Subject Classification (2000): Primary 53A30; Secondary 53B25