Publication

A proof of a sumset conjecture of Erdős

Related publications (92)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Chat with 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

Chirok: a post-refinement tool to analyse absolute structure

On the Power and Limitations of Branch and Cut

A simple proof for a forbidden subposet problem

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

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

EPFL Library Research Data Management Fastguides

Packing the Boolean lattice with copies of a poset

A lower bound on opaque sets

On the Number of Containments in P-free Families

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