On 𝐿_{𝑝}-Brunn-Minkowski type and 𝐿_{𝑝}-isoperimetric type inequalities for measures
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In 2011 Lutwak, Yang and Zhang extended the definition of the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">L_p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -Minkowski convex combination ( <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p greater-than-or-equal-to 1"> <mml:semantics> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo> ≥ </mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">p \geq 1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ) introduced by Firey in the 1960s from convex bodies containing the origin in their interiors to all measurable subsets in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper R Superscript n"> <mml:semantics> <mml:msup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> <mml:annotation encoding="application/x-tex">\mathbb {R}^n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , and as a consequence, extended the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">L_p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -Brunn-Minkowski inequality ( <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">L_p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -BMI) to the setting of all measurable sets. In this paper, we present a functional extension of their <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">L_p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -Minkowski convex combination—the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p comma s"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>p</mml:mi> <mml:mo>,</mml:mo> <mml:mi>s</mml:mi> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">L_{p,s}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> –supremal convolution and prove the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">L_p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -Borell-Brascamp-Lieb type ( <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">L_p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -BBL) inequalities. Based on the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">L_p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -BBL type inequalities for functions, we extend the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L Subscript p"> <mml:semantics> <mml:msub> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">L_p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -BMI for measurable sets to the class of Borel measures on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper R Superscript n"> <mml:semantics> <mml:msup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> <mml:annotation encoding="application/x-tex">\mathbb {R}^n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> having <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="left-parenthesis StartFraction 1 Over s EndFraction right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mo>(</mml:mo> <mml:mfrac> <mml:mn>1</mml:mn> <mml:mi>s</mml:mi> </mml:mfrac> <mml:mo>)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\left (\frac {1}{s}\right )</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -concave densities, with <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="s greater-than-or-equal-to 0"> <mml:semantics> <mml:mrow> <mml:mi>s</mml:mi> <mml:mo> ≥ </mml:mo>
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.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| 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.000 | 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 it