Optimal polynomial blow up range for critical wave maps
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.
We present an outline of the field of Multilevel Design Understanding by first defining and motivating the related problems, and then describing the key issues which must be addressed in future research. ...
We prove that the critical Wave Maps equation with target S2 and origin R2+1 admits energy class blow up solutions of the form \[ u(t, r) = Q(\lambda(t)r) + \eps(t, r) \] where Q:R2→S2 is the ground state harmonic map and $\lambd ...
We construct blow-up solutions of the energy critical wave map equation on R2+1→N with polynomial blow-up rate (t−1−ν for blow-up at t=0) in the case when N is a surface of revolution. Here we extend the blow-u ...
Among anonymity systems, DC-nets have long held attraction for their resistance to traffic analysis attacks, but practical implementations remain vulnerable to internal disruption or “jamming” attacks, which require time-consuming detection procedures to r ...
This paper sheds light on some of the graphical methods used by Robert Maillart to design the Salginatobel Bridge, a three-hinged concrete structure spanning 90 meters. Built in 1929, this masterpiece has since received extensive recognition both for its s ...
Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain a ...
Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...
The Cu-catalyzed synthesis of skipped 1,4-dienes from allylic acetates and vinyl-Grignard reagents is key to bidirectional modifications of acyclic terpene acetates. As a result, trisubstituted double bond containing subunits can be readily transferred int ...
Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address ...
Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address ...
