A simple proof for a forbidden subposet problem

Abhishek Methuku
2020
Article

Résumé

The poset Y-k,Y-2 consists of k + 2 distinct elements x(1), x(2), ..., x(k), y(1), y(2), such that x(1)

Source officielle

https://infoscience.epfl.ch/record/276018?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

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 simple proof for a forbidden subposet problem

Analysis-aware defeaturing of complex geometries

The Lang-Trotter conjecture for products of non-CM elliptic curves

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

Analysis-aware defeaturing of complex geometries

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

The Lang-Trotter conjecture for products of non-CM elliptic curves