Some remarks on the uniformizing function in genus 2
Publications associées (60)
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.
Discontinuous Galerkin methods have desirable properties, which make them suitable for the com- putation of wave problems. Being parallelizable and hp-adaptive makes them attractive for the simulation of large-scale tsunami propagation. In order to retriev ...
We explore the use of radial basis functions (RBF) in the weighted essentially non-oscillatory (WENO) reconstruction process used to solve hyperbolic conservation laws, resulting in a numerical method of arbitrarily high order to solve problems with discon ...
Solar energy has seen tremendous advances in the past years. For thin film photovoltaics, which use less of the expensive semiconductor materials, insufficient light absorption can be a limiting factor. It is hoped that by using diffractive optics to impro ...
In this paper we develop and analyze a multilevel weighted reduced basis method for solving stochastic optimal control problems constrained by Stokes equations. We prove the analytic regularity of the optimal solution in the probability space under certain ...
A new finite element heterogeneous multiscale method (FE-HMM) is proposed for the numerical solution of the wave equation over long times in a rapidly varying medium. Our new FE-HMM-L method captures not only the short-time behavior of the wave field, well ...
A long-standing conjecture of Richter and Thomassen states that the total number of intersection points between any n simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same point, is at least ...
A fully discrete analysis of the finite element heterogeneous multiscale method (FE-HMM) for elliptic problems with N+1 well-separated scales is discussed. The FE-HMM is a numerical homogenization method that relies on a macroscopic scheme (macro FEM) for ...
Let S be a set of n points in R-2 contained in an algebraic curve C of degree d. We prove that the number of distinct distances determined by S is at least c(d)n(4/3), unless C contains a line or a circle. We also prove the lower bound c(d)' min{m(2/3)n(2/ ...
We consider a class of large scale robust optimization problems. While the robust optimization literature often relies on structural assumptions to reformulate the problem in a tractable form using duality, this method is not always applicable and can resu ...
We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set of n points determines o(n) distinct distances, then no line contains Omega(n (7/8)) points of and no circle contains Omega ...