惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

大猫的无限游戏
大猫的无限游戏
阮一峰的网络日志
阮一峰的网络日志
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
WordPress大学
WordPress大学
博客园 - 叶小钗
Hugging Face - Blog
Hugging Face - Blog
博客园 - 司徒正美
Last Week in AI
Last Week in AI
罗磊的独立博客
量子位
Jina AI
Jina AI
T
Tailwind CSS Blog
Apple Machine Learning Research
Apple Machine Learning Research
IT之家
IT之家
美团技术团队
雷峰网
雷峰网
爱范儿
爱范儿
S
SegmentFault 最新的问题
小众软件
小众软件
月光博客
月光博客
酷 壳 – CoolShell
酷 壳 – CoolShell
人人都是产品经理
人人都是产品经理
The Cloudflare Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
The Bojanov--Naidenov inequality for quartics and second ...
[Submitted on 22 Jun 2026] · 2026-06-23 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We settle the case $n=4$, $k=2$ of the Bojanov--Naidenov problem for algebraic polynomials. Let $P$ be a real polynomial of degree at most four with $\left\lVert{P}\right\rVert_{C[-1,1]}\leq 1$, and let $T_4(x)=8x^4-8x^2+1$. We prove that, for every $t\geq0$, \[
\int_{-1}^{1} \bigl(|P''(x)|-t\bigr)_+\,dx
\leq
\int_{-1}^{1} \bigl(|T_4''(x)|-t\bigr)_+\,dx . \] This tail estimate implies \[
\int_{-1}^{1}\varphi(|P''(x)|)\,dx
\leq
\int_{-1}^{1}\varphi(|T_4''(x)|)\,dx \] for every nondecreasing convex function $\varphi:[0,\infty)\to\mathbb{R}$. If $\varphi$ is strictly increasing and convex, equality can occur only for $P=\pm T_4$. The proof is elementary and finite. We interpolate at the five extremal points of $T_4$; convexity then reduces the problem to the $32$ sign choices at these nodes. At each vertex the second derivative is a quadratic polynomial, so the remaining work is an explicit comparison of level sets.

Submission history

From: Gentian Zavalani [view email]
[v1] Mon, 22 Jun 2026 08:34:37 UTC (9 KB)