Publications associées (19)

Unramified F-divided objects and the etale fundamental pro-groupoid in positive characteristic

Giulio Orecchia

Let X /S be a flat algebraic stack of finite presentation. We define a new & eacute;tale fundamental pro-groupoid pi(1)(X /S), generalizing Grothendieck's enlarged & eacute;tale fundamental group from SGA 3 to the relative situation. When S is of equal pos ...
GEOMETRY & TOPOLOGY PUBLICATIONS2022

Serre-Tate theory for Calabi-Yau varieties

Maciej Emilian Zdanowicz

Classical Serre-Tate theory describes deformations of ordinary abelian varieties. It implies that every such variety has a canonical lift to characteristic zero and equips the base of its universal deformation with a Frobenius lifting and canonical multipl ...
WALTER DE GRUYTER GMBH2021

Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes

Aditya Vardhan Varre

We present polynomial families complete for the well-studied algebraic complexity classes VF, VBP, VP, and VNP. The polynomial families are based on the homomorphism polynomials studied in the recent works of Durand et al. (2014) and Mahajan et al. (2018). ...
ASSOC COMPUTING MACHINERY2021

Irreducible representations of simple algebraic groups in which a unipotent element is represented by a matrix with a single non-trivial Jordan block

Donna Testerman

Let G be a simply connected simple linear algebraic group of exceptional Lie type over an algebraically closed field F of characteristic p >= 0, and let u is an element of G be a non-identity unipotent element. Let phi be a non-trivial irreducible represen ...
2018

Large Sieve Inequalities for Algebraic Trace Functions

Philippe Michel, Ping Xi

The large sieve inequalities for algebraic trace functions are considered in this article. A fundamental iterative relation is established by classical Fourier analysis, and l-adic Fourier analysis and multiplicative convolutions of sheaves are also requir ...
Oxford Univ Press2017

Reduced basis method and domain decomposition for elliptic problems in networks and complex parametrized geometries

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

The aim of this work is to solve parametrized partial differential equations in computational domains represented by networks of repetitive geometries by combining reduced basis and domain decomposition techniques. The main idea behind this approach is to ...
Elsevier2016

Real-Time Optimization Based on Adaptation of Surrogate Models

Dominique Bonvin, Timm Faulwasser, Alejandro Gabriel Marchetti, Martand Singhal

Recently, different real-time optimization (RTO) schemes that guarantee feasibility of all RTO iterates and monotonic convergence to the optimal plant operating point have been proposed. However, simulations reveal that these schemes converge very slowly t ...
Elsevier Science Bv2016

MATHICSE Technical Report: Reduced basis method and domain decomposition for elliptic problems in networks and complex parametrized geometries

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

The aim of this work is to solve parametrized partial differential equations in computational domains represented by networks of repetitive geometries by combining reduced basis and domain decomposition techniques. The main idea behind this approach is to ...
MATHICSE2015

Shimura Curves and Special Values of p-adic L-functions

Ernest Hunter Brooks

We construct "generalized Heegner cycles" on a variety fibered over a Shimura curve, defined over a number field. We show that their images under the p-adic Abel-Jacobi map coincide with the values (outside the range of interpolation) of a p-adic L-functio ...
Oxford University Press2015

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.