In this note we give a proof-by-formula of certain important embedding inequalities on a dyadic tree. We also consider the case of a bi-tree, where a different approach is explained.
Bellman Function Sitting on a Tree
Arcozzi, N;
2021
Abstract
In this note we give a proof-by-formula of certain important embedding inequalities on a dyadic tree. We also consider the case of a bi-tree, where a different approach is explained.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
