Concept

Eugenio Calabi

Publications associées (6)

Birational boundedness of low-dimensional elliptic Calabi-Yau varieties with a section

We prove that there are finitely many families, up to isomorphism in codimension one, of elliptic Calabi-Yau manifolds Y -> X with a rational section, provided that dim(Y)

2021

Steady Three-Dimensional Rotational Flows: An Approach Via Two Stream Functions And Nash-Moser Iteration

Boris Buffoni

We consider the stationary flow of an inviscid and incompressible fluid of constant density in the region D = (0, L) x R-2. We are concerned with flows that are periodic in the second and third variables and that have prescribed flux through each point of ...

MATHEMATICAL SCIENCE PUBL2019

Convergence Results For Projected Line-Search Methods On Varieties Of Low-Rank Matrices Via Lojasiewicz Inequality

André Uschmajew

The aim of this paper is to derive convergence results for projected line-search methods on the real-algebraic variety M-

Siam Publications2015

Sequestering by global symmetries in Calabi–Yau string models

Claudio Scrucca, Christopher John Andrey

We study the possibility of realizing an effective sequestering between visible and hidden sectors in generic heterotic string models, generalizing previous work on orbifold constructions to smooth Calabi-Yau compactifications. In these theories, genuine s ...

Elsevier2011

Constructing de Sitter vacua in no-scale string models without uplifting

Claudio Scrucca

We develop a method for constructing metastable de Sitter vacua in N = 1 supergravity models describing the no-scale volume moduli sector of Calabi-Yau string compactifications. We consider both heterotic and orientifold models. Our main guideline is the n ...

2009

The Schwarz lemma for nonpositively curved Riemannian surfaces

Marc Troyanov

In this paper, we prove that if f is a conformal map between two Riemannian surfaces, and if the curvature of the target is nonpositive and less than or equal to the curvature of the source, then the map is contracting. ...

1991

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search