Publication

A proof of a sumset conjecture of Erdős

Publications associées (92)

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.

Connectez-vous pour utiliser Chat avec Graph Search

A dependence of the cost of fast controls for the heat equation on the support of initial datum

Hoài-Minh Nguyên

The controllability cost for the heat equation as the control time

T

goes to 0 is well-known of the order

e^{C/T}

for some positive constant

C

, depending on the controlled domain and for all initial datum. In this paper, we prove that the constant $C ...

2021

A proof of a sumset conjecture of Erdős

Graph Chatbot

Chattez avec Graph Search

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

A dependence of the cost of fast controls for the heat equation on the support of initial datum

On the Power and Limitations of Branch and Cut

Chirok: a post-refinement tool to analyse absolute structure

Extending the Spectrum of Dysgraphia: A Data Driven Strategy to Estimate Handwriting Quality

A simple proof for a forbidden subposet problem

Packing the Boolean lattice with copies of a poset

A lower bound on opaque sets

EPFL Library Research Data Management Fastguides

On the Number of Containments in P-free Families

On the Number of Containments in P-free Families

Packing the Boolean lattice with copies of a poset

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

EPFL Library Research Data Management Fastguides

On the Power and Limitations of Branch and Cut

A dependence of the cost of fast controls for the heat equation on the support of initial datum

A simple proof for a forbidden subposet problem

Chirok: a post-refinement tool to analyse absolute structure

A lower bound on opaque sets

Extending the Spectrum of Dysgraphia: A Data Driven Strategy to Estimate Handwriting Quality