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

推荐订阅源

P
Proofpoint News Feed
T
The Blog of Author Tim Ferriss
aimingoo的专栏
aimingoo的专栏
M
MIT News - Artificial intelligence
N
Netflix TechBlog - Medium
Y
Y Combinator Blog
B
Blog RSS Feed
H
Help Net Security
Blog — PlanetScale
Blog — PlanetScale
Vercel News
Vercel News
Google DeepMind News
Google DeepMind News
Microsoft Security Blog
Microsoft Security Blog
G
Google Developers Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 司徒正美
L
LangChain Blog
IT之家
IT之家
F
Fortinet All Blogs
V
V2EX
C
Check Point Blog
The Cloudflare Blog
博客园_首页
阮一峰的网络日志
阮一峰的网络日志
A
About on SuperTechFans

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
Symmetrization and the Planar Skorokhod Embedding Problem
[Submitted on 14 Dec 2025 (v1), last revised 14 Aug 2026 (this v · 2025-12-15 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:This paper continues our earlier work \cite{becher2025skorokhod} on variational questions arising from the planar Skorokhod embedding problem (PSEP). Given a centered probability measure $\mu$ on $\mathbb R$ with finite second moment, PSEP asks for a simply connected domain $U\subset\mathbb C$ containing $0$ such that planar Brownian motion $(Z_t)$ started at $0$ exits $U$ at time $\tau_U$ with real part $\Re(Z_{\tau_U})\sim\mu$. Among all such $\mu$-domains, we study optimal design problems and focus in particular on area minimization and its fractional boundary-energy extensions.
We formalize and define the Brownian symmetrization of planar domains, and we clarify the relation between Brownian (Gross) symmetrization and the Baernstein-Pruss symmetrization theory, and how Brownian symmetrization applies to a wider category of domains. Within the simply connected class, Gross' $\mu$-domain $U_\mu^G$ minimizes a whole fractional scale of boundary energies $\mathcal E_s$, $0<s<1$. The proof is formulated in a nonlocal Hardy--Sobolev language: it relies only on the exit law $\mu$ and on fractional Sobolev (Gagliardo) seminorms, rather than on an explicit uniformizer or star-function techniques. We introduce deficiency ratios $\rho_s$ that quantify how far a given $\mu$-domain is from the Gross optimizer; we state several related open problems.

Submission history

From: Maher Boudabra [view email]
[v1] Sun, 14 Dec 2025 18:25:51 UTC (279 KB)
[v2] Fri, 14 Aug 2026 13:43:01 UTC (282 KB)