Convex Solutions to the Power-of-mean Curvature Flow, Conformally Invariant Inequalities and Regularity Results in Some
Bibliographic record
Abstract
In this thesis we study three different problems: convex ancient solutions to the power-of-mean curvature flow; Sharp inequalities; regularity results in some applications of optimal transportation. \n \nThe second chapter is devoted to the power-of-mean curvature flow; We prove some estimates for convex ancient solutions (the existence time for the solution starts from -\\infty) to the power-of-mean curvature flow, when the power is strictly greater than \\frac{1}{2}. As an application, we prove that in two dimension, the blow-down of an entire convex translating solution, namely u_{h}=\\frac{1}{h}u(h^{\\frac{1}{1+\\alpha}}x), locally uniformly converges to \\frac{1}{1+\\alpha}|x|^{1+\\alpha} as \nh\\rightarrow\\infty. The second application is that for generalized curve shortening flow (convex curve evolving in its normal direction with speed equal to a power of its curvature), if the convex compact ancient solution sweeps the whole space \\mathbb{R}^{2}, it must be a shrinking circle. Otherwise the solution must be defined in a strip region. \nIn the first section of the third chapter, we prove a one-parameter family of sharp conformally invariant integral inequalities for functions on the $n$-dimensional unit ball. As a limiting case, we obtain an inequality that generalizes Carleman's inequality for harmonic functions in the plane to poly-harmonic functions in higher dimensions. The second section represents joint work with Tobias Weth and Rupert Frank; the main result is that, one can always put a sharp remainder term on the righthand side of the sharp fractional sobolev inequality. \nIn the first section of the final chapter, under some suitable condition, we prove that the solution to the principal-agent problem must be C^{1}. The proof is based on a perturbation argument. The second section represents joint work with Emanuel Indrei; the main result is that, under (A3S) condition on the cost and c-convexity condition on the domains, the free boundary in the optimal partial transport problem is C^{1,\\alpha}.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".