A simple proof for a forbidden subposet problem

Abhishek Methuku
2020
Journal paper

Abstract

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)

Official source

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

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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