𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear bound on the Euler number of threefolds of Calabi–Yau and of general type

✍ Scribed by Mei-Chu Chang; Angelo Felice Lopez

Publisher
Springer
Year
2001
Tongue
English
Weight
144 KB
Volume
105
Category
Article
ISSN
0025-2611

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On (orientifold of) type IIA on a compac
On (orientifold of) type IIA on a compact Calabi-Yau
✍ A. Misra 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract We study the gauged sigma model and its mirror Landau‐Ginsburg model corresponding to type IIA on the Fermat degree‐24 hypersurface in **WCP**^4^[1,1,2,8,12] (whose blow‐up gives the smooth __CY__~3~(3,243)) away from the orbifold singularities, and its orientifold by a freely‐acting an

Type IIA on a compact Calabi-Yau and D =
Type IIA on a compact Calabi-Yau and D = 11 supergravity uplift of its orientifold
✍ A. Misra 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB

## Abstract Using the prescription of [1] for defining period integrals in the Landau‐Ginsburg theory for compact Calabi‐Yau's, we obtain the Picard‐Fuchs equation and the Meijer basis of solutions for the compact Calabi‐Yau __CY__~3~(3,243) expressed as a degree‐24 Fermat hypersurface __after__ re

A note on the Chow groups of projective
A note on the Chow groups of projective determinantal varieties; an appendix to the paper by Grzegorz Kapustka and Michal Kapustka on “A cascade of determinantal Calabi-Yau threefolds”
✍ Piotr Pragacz 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

## Abstract We investigate the Chow groups of projective determinantal varieties and those of their strata of matrices of fixed rank, using Chern class computations (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

A better bound for the cop number of gen
A better bound for the cop number of general graphs
✍ Ehsan Chiniforooshan 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB

## Abstract In this note, we prove that the cop number of any __n__‐vertex graph __G__, denoted by ${{c}}({{G}})$, is at most ${{O}}\big({{{n}}\over {{\rm lg}} {{n}}}\big)$. Meyniel conjectured ${{c}}({{G}})={{O}}(\sqrt{{{n}}})$. It appears that the best previously known sublinear upper‐bound is du