Concept

Branched covering

Publications associées (12)

Generalized Norm-compatible Systems on Unitary Shimura Varieties

Mohamed Réda Boumasmoud

We define and study in terms of integral Iwahori–Hecke algebras a new class of geometric operators acting on the Bruhat-Tits building of connected reductive groups over p-adic fields. These operators, which we call U-operators, generalize the geometric n ...
EPFL2019

On subadditivity of Kodaira dimension in positive characteristic over a general type base

Zsolt Patakfalvi

We show that for a surjective, separable morphism f of smooth projective varieties over a field of positive characteristic such that f(*) OX congruent to O-Y subadditivity of Kodaira dimension holds, provided the base is of general type and the Hasse-Witt ...
2018

Mirror symmetry for moduli spaces of Higgs bundles via $p$-adic integration

Dimitri Stelio Wyss, Michael Gröchenig

We prove the Topological Mirror Symmetry Conjecture by Hausel-Thaddeus for smooth moduli spaces of Higgs bundles of type SLnSL_n and PGLnPGL_n. More precisely, we establish an equality of stringy Hodge numbers for certain pairs of algebraic orbifolds generica ...
2017

Mapping large organizations

Dario Rodighiero

Today organizations are more than ever complex systems. They are large, ramified, distributed, and intertwined so that their organic structure seems like a tangle of activities. Day by day individuals contribute to keep these structures alive with their wo ...
2017

Unsplittable Coverings in the Plane

János Pach

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...
Springer-Verlag Berlin2016

Unsplittable coverings in the plane

János Pach

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...
Academic Press Inc Elsevier Science2016

Error estimates for finite element approximations of nonlinear monotone elliptic problems with application to numerical homogenization

Assyr Abdulle, Martin Ernst Huber

We consider a finite element method (FEM) with arbitrary polynomial degree for nonlinear monotone elliptic problems. Using a linear elliptic projection, we first give a new short proof of the optimal convergence rate of the FEM in the L2 norm. We then deri ...
Wiley-Blackwell2016

Closing Large Hyperbolic 2g-gons

Poincaré's uniformisation theorem says that any Riemann surface is conformally equivalent to a unique (up to isometry) surface of constant Gauss curvature 0, 1 or –1. The (topologically) richest of these three worlds is for curvature –1 formed of hyperboli ...
EPFL2012

Convex polygons are cover-decomposable

We show that for any open convex polygon P, there is a constant k(P) such that any k(P)-fold covering of the plane with translates of P can be decomposed into two coverings. ...
2010

Indecomposable Coverings with Concave Polygons

We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold covering of some point set by the translates of this polygon that cannot be decomposed into two coverings. Moreover, we give a complete classification of open ...
Springer-Verlag2010

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.