✦ LIBER ✦

Lower bounds for Seshadri constants

✍ Scribed by Thomas Eckl

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 158 KB
Volume: 281
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.200510664

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

One of Demailly's characterization of Seshadri constants on ample line bundles works with Lelong numbers of certain positive singular hermitian metrics. In this note this is translated into algebraic terms by using sections of multiples of the line bundle. The resulting formula for Seshadri constants is applied to compute Seshadri constants on blown up products of curves, to disprove a conjectured characterization of maximal rationally connected quotients and to introduce a new approach to Nagata's conjecture. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

A bound for Seshadri constants on ℙ2

✍ Halszka Tutaj–Gasińska 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Duality and Lower Bounds for Relative Pr

Duality and Lower Bounds for Relative Projection Constants

✍ K. Petras 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 441 KB

Lower bounds for lower Ramsey numbers

✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

Lower Bounds for Shellsort

✍ C.Greg Plaxton; Torsten Suel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We show lower bounds on the worst-case complexity of Shellsort. In particular, Ž Ž 2 . Ž . 2 . we give a fairly simple proof of an ⍀ n lg n r lg lg n lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time o

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.

Lower bounds for linear interval routing

✍ Eilam, T.; Moran, S.; Zaks, S. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB 👁 2 views

Linear interval routing is a space-efficient routing method for point-to-point communication networks. It is a restricted variant of interval routing where the routing range associated with every link is represented by an interval with no wraparound. A common way to measure the efficiency of such ro