Publications associées (5)

Unlikely intersections on the p-adic formal ball

Vlad Serban

We investigate generalizations along the lines of the Mordell-Lang conjecture of the author's p-adic formal Manin-Mumford results for n-dimensional p-divisible formal groups F. In particular, given a finitely generated subgroup (sic) of F(Q(p)) and a close ...
SPRINGER INT PUBL AG2023

MATHICSE Technical Report : Analytical and numerical study of a modified cell problem for the numerical homogenization of multiscale random fields

Assyr Abdulle, Doghonay Arjmand, Edoardo Paganoni

A central question in numerical homogenization of partial differential equations with multiscale coefficients is the accurate computation of effective quantities, such as the homogenized coefficients. Computing homogenized coefficients requires solving loc ...
EPFL2020

On the fundamental domain of affine Springer fibers

Zongbin Chen

Let G be a connected reductive algebraic group over an algebraically closed field k,gamma is an element of g( k(( epsilon ))) a semisimple regular element, we introduce a fundamental domain F gamma for the affine Springer fibers X gamma. We show that the p ...
Springer Heidelberg2017

Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification

Divesh Aggarwal

The study of seeded randomness extractors is a major line of research in theoretical computer science. The goal is to construct deterministic algorithms which can take a weak random source x with min-entropy k and a uniformly random seed Y of length d, and ...
Ieee2016

Prime Power Terms In Elliptic Divisibility Sequences

Valéry Aurélien Mahé

We study a problem on specializations of multiples of rational points on elliptic curves analogous to the Mersenne problem. We solve this problem when descent via isogeny is possible by giving explicit bounds on the indices of prime power terms in elliptic ...
American Mathematical Society2014

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.