搜索结果: 1-5 共查到“数理逻辑与数学基础 Gromov”相关记录5条 . 查询时间(0.031 秒)
A SHORT PROOF OF THE CONJECTURE WITHOUT GROMOV-WITTEN THEORY: HURWITZ THEORY AND THE MODULI OF CURVES
HURWITZ THEORY THE MODULI OF CURVES
2015/7/14
I. P. GOULDEN, D. M. JACKSON AND R. VAKILConjecture. The
approach is through the Ekedahl-Lando-Shapiro-Vainshtein theorem, which establishes the \polynomiality" of Hurwitz numbers, from which we pick...
A SHORT PROOF OF THE CONJECTURE WITHOUT GROMOV-WITTEN THEORY: HURWITZ THEORY AND THE MODULI OF CURVES
HURWITZ THEORY THE MODULI OF CURVES
2015/7/14
I. P. GOULDEN, D. M. JACKSON AND R. VAKILConjecture. The
approach is through the Ekedahl-Lando-Shapiro-Vainshtein theorem, which establishes the \polynomiality" of Hurwitz numbers, from which we pick...
Higher index theory for certain expanders and Gromov monster groups II
Higher index theory certain expanders Gromov monster groups II
2011/2/22
In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse B...
Higher index theory for certain expanders and Gromov monster groups I
Higher index theory certain expanders Gromov monster groups I
2011/2/22
In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infin...
A simpler proof of the Boros--Füredi--Bárány--Pach--Gromov theorem
simpler proof Boros--Füredi--Bárány--Pach--Gromov theorem
2011/3/1
A short and almost elementary proof of the Boros–F¨uredi–B´ar´any–Pach–Gromov theorem on the multiplicity of covering by simplices in Rd is given.