arXivDaily arXiv每日学术速递 周一至周五更新
重置
全部学科分类 共 2081 篇
2605.07623 2026-05-11 eess.SP

AI-Empowered Low-Altitude Economy: Cooperative Sensing With Fixed Wireless Access

Jinya Zhang, Jiajia Guo, Xiangyi Li, Chao-Kai Wen, Shi Jin

AI总结 随着低空经济的快速发展，未经授权的无人机带来的安全问题日益突出，亟需有效的监测手段。本文提出一种基于固定无线接入（FWA）用户终端设备的协作感知方法，利用上行信道状态信息（CSI）进行无人机检测与定位。通过构建人工智能驱动的两阶段协作感知框架，结合神经网络特征提取与注意力机制融合，显著提升了检测精度与定位性能，实验表明其漏检率低至0.63%，定位误差为6.50米，满足3GPP标准要求。

详情
英文摘要

The rapid growth of the low-altitude economy has intensified safety concerns arising from unauthorized unmanned aerial vehicles (UAVs), positioning UAV supervision as a key use case in 3GPP. To precisely sense such UAVs with wide coverage and low cost, we leverage fixed wireless access (FWA) customer premises equipment (CPEs), static, densely deployed devices that serve as wireless cameras for the radio environment. We develop an artificial intelligence-empowered two-stage cooperative sensing pipeline that exploits uplink channel state information (CSI) from multiple base station-CPE pairs for UAV detection and localization. In cooperative detection, lightweight CSI features are first individually extracted by neural network, and then adaptively integrated through an attention-based scheme to declare UAV presence. The learned attention scores effectively identify the critical pairs during detection, while facilitating UAV-affected pair selection for subsequent localization. For cooperative localization, neural network initially generates individual estimates and extract CSI features from selected pairs. These estimates, together with features and pair indexes, are fused using a Transformer to produce a precise cooperative estimate. Simulations show that cooperative schemes significantly reduce the missed detection probability to 0.63% and realize a 95%-confidence positioning error of 6.50 m, satisfying 3GPP requirements and showing the potential of FWA-assisted cooperative sensing. Dataset and codes are available on GitHub.

URL PDF HTML ☆
赞 0 踩 0
2605.07621 2026-05-11 quant-ph cond-mat.str-el physics.comp-ph

Entanglement-informed distributed wavefunction approach to scalable quantum many-body systems

Adriano Amaricci

AI总结 本文提出了一种基于量子多体态纠缠结构的分布式波函数方法，用于高效模拟可扩展的量子多体系统。通过将波函数分解为纠缠谱对应的双部分结构，该方法将哈密顿量作用转化为局部收缩和通信最优操作，显著提升了计算效率。研究表明，纠缠谱的碎片化是控制计算成本的关键因素，确立了纠缠作为统一的、方法无关的量子多体模拟扩展原则。

Comments 4+1 pages, 5 figures

详情
英文摘要

We show that the entanglement structure of quantum many-body states defines a natural and optimal distributed representation for their simulation. An arbitrary entanglement cut induces a bipartite decomposition of the wavefunction, mapping its distribution onto that of the entanglement spectrum. In this representation the Hamiltonian application, the core of Krylov-subspace methods, reduces to local contractions and communication-optimal operations. Using benchmarks from different methods and models, we demonstrate near-linear scaling for sufficiently large systems and identify entanglement spectrum fragmentation as a key factor controlling computational cost. This establishes entanglement as an organizing principle and unified, method-independent, route for scaling up quantum many-body simulations.

URL PDF HTML ☆
赞 0 踩 0
2605.07620 2026-05-11 stat.ME

Operationalizing Allocation Probability Tests: Practical Guidance on Optimized Implementation for Power and Robustness

Stina Zetterstrom, David S. Robertson, Thomas Jaki, Sofía S. Villar

AI总结 本文针对响应自适应临床试验中基于分配概率（AP）的检验方法，探讨了其在实际应用中的优化实现问题。研究通过优化分配概率在检验统计量中的使用方式，提升了检验的统计功效，并扩展了该方法至生存终点（指数分布）的应用。同时，提出了一种严格的虚无假设选择策略以确保I型错误率的精确控制，仿真结果表明优化后的AP检验在保持患者目标的前提下显著优于传统频率学派检验。

详情
英文摘要

Recently, a new testing approach for response-adaptive clinical trials was proposed based on the allocation probabilities (AP) rather than the outcome data. While original work on the AP test focused on binary and normal endpoints and demonstrated that significant efficiency gains are possible, many critical questions remain open regarding its practical implementation and upper limits. In this work, rather than simply proposing novel statistics, we seek to understand the maximum gain that can be obtained with the AP test by optimizing how these probabilities are used to define the test statistic. We expand the method's practical utility by applying it to survival endpoints (exponential distributions) and introducing a rigorous strategy for selecting the null hypothesis to properly calibrate type I error. Our simulation studies reveal that by optimizing the functional form of the AP test, investigators can achieve a substantial increase in power, approaching the theoretical maximum, without sacrificing the patient outcome goals of the design. Furthermore, we explicitly compare the method to a standard Bayesian decision rule, finding that the optimized AP test significantly outperforms traditional frequentist tests while maintaining strict error control. This work provides a missing practical framework for implementing robust and optimized AP tests in complex response-adaptive settings.

URL PDF HTML ☆
赞 0 踩 0
2605.07619 2026-05-11 quant-ph cond-mat.stat-mech

Typical Mixing and Rare-State Bottlenecks in Open Quantum Systems

Caisheng Cheng, Ruicheng Bao

AI总结 本文研究开放量子系统中混合过程的典型行为与稀有态瓶颈问题，指出尽管最坏情况下的混合时间常被用来作为基准，但这一基准可能由指数罕见的初始态决定。通过分析非线性迹距离松弛曲线的集中性，作者揭示了在广泛无结构的初始态集合中，混合时间在典型情况下表现出显著的集中现象，并建立了典型混合时间与最坏情况之间的分层关系，为理解量子系统中混合动力学提供了新的理论框架。

详情
英文摘要

Mixing in open quantum systems is often summarized by a single worst-case time, even though that benchmark can be set by exponentially rare initial states. We show that for broad unstructured ensembles the nonlinear trace-distance relaxation curve itself concentrates around a deterministic mean. For Haar-random pure states this yields fixed-time concentration of the instantaneous trace distance to the steady state, which we term vertical concentration since typical relaxation curves bundle along the distance axis. Whenever the mean curve crosses the distance threshold with a finite slope, it converts this vertical concentration into a horizontal concentration of the mixing time, extending typicality from standard physical observables to a fundamentally non-observable dynamical quantity. This sharp concentration naturally raises the question of how the typical mixing timescale compares to the worst-case benchmark. We show that in a one-mode tail regime, this separation is controlled by the logarithmic ratio of extremal to typical initial-state overlaps for the slow left eigenoperator. This rare-state bottleneck law yields a hierarchy that is logarithmic in skin-effect settings, linear for boundary-supported many-body slow modes, and exponential in a protected-sector family where generic states mix rapidly while rare states stagnate. The framework also extends beyond Haar to exact and approximate unitary 2-designs and Hilbert-Schmidt/induced ensembles.

URL PDF HTML ☆
赞 0 踩 0
2605.07618 2026-05-11 hep-ph

New Determinations of the Charm and Bottom Quark Masses Using QCD Quarkonium Sum Rules

Qing Yu, Hua Zhou, Xing-Gang Wu

AI总结 本文通过QCD夸克偶素求和规则重新分析了重夸克质量的确定方法，采用特征算符（CO）方法结合最大共形原理（PMC），消除了微扰修正中的重整化方案和标度依赖性，显著提高了理论精度。研究给出了charm和bottom夸克在$\overline{\mathrm{MS}}$方案下的质量新结果，分别为$\overline{m}_c(\overline{m}_c)=1275.8\pm 0.4~\text{MeV}$和$\overline{m}_b(\overline{m}_b)=4177.0 \pm 7.2~\text{MeV}$，与PDG世界平均值偏差均小于$1σ$。

Comments 21 pages, 15 figures

详情
英文摘要

We reanalyze the perturbative QCD (pQCD) corrections to quarkonium QCD sum rules and extract the heavy quark masses $\overline{m}_{q}(\overline{m}_{q})$ ($q=c,b$). At present, the pQCD corrections to the correlation functions of two heavy-quark pseudoscalar and vector currents at zero momentum transfer, denoted as $M_{n,q}^{X,\rm th}$ ($X = P, V$), are calculated up to the $\mathcal{O}(α_s^3)$ order. These corrections exhibit significant renormalization scheme and scale dependence, which introduces large theoretical uncertainties and deteriorates the precision of heavy quark mass determinations. In this work, we eliminate the renormalization scheme and scale ambiguities in the perturbative part of $M_{n,q}^{X,\rm th}$ by adopting the Principle of Maximum Conformality (PMC) within the characteristic operator (CO) approach. The CO approach, a novel extension of the standard PMC procedure, simultaneously determines the effective coupling $α_s(Q_*)$ and the effective quark mass $\overline{m}_q(Q_*)$. It systematically absorbs the nonconformal $\{β_i\}$-terms and $\{γ_i\}$-terms via the renormalization group equations, yielding a strictly scheme- and scale-independent conformal perturbative series. Based on the improved PMC conformal series, we further provide reliable estimates for the unknown $\mathrm{N^4LO}$ contributions using the Padé approximation method. The final predicted heavy quark masses in the $\overline{\mathrm{MS}}$ scheme read: $\overline{m}_c(\overline{m}_c)=1275.8\pm 0.4~\text{MeV}$, extracted from the second moment of the charmed pseudoscalar correlator $M_{2,c}^{P}$; and $\overline{m}_b(\overline{m}_b) = 4177.0 \pm 7.2~\text{MeV}$, extracted from the first moment of the bottom vector correlator $M_{1,b}^{V}$. Both results agree well with the PDG world averages with deviations smaller than $1σ$.

URL PDF HTML ☆
赞 0 踩 0
2605.07617 2026-05-11 math.AG math.AC

The Isomorphism Classes of the Surfaces $x_1^{a_1} + x_2^{a_2} + x_3^{a_3} + 1 = 0$

Michael Chitayat, Buddhadev Hajra

AI总结 该论文研究了形如 $x_1^{a_1} + x_2^{a_2} + x_3^{a_3} + 1 = 0$ 的三维复空间中的代数曲面之间的同构性问题。通过分析这类曲面的结构，作者证明了两个此类曲面同构当且仅当它们的指数元组在排列后完全相同。这一结果明确了此类曲面的同构类由指数元组唯一确定，为代数几何中的分类问题提供了重要依据。

Comments Comments welcome. 15 pages

详情
英文摘要

Let $f = x_1^{a_1} + x_2^{a_2} + x_3^{a_3} + 1 \in \mathbb{C}[x_1,x_2,x_3]$ and let $g = y_1^{b_1} + y_2^{b_2} + y_3^{b_3} + 1 \in \mathbb{C}[y_1,y_2,y_3]$ where $a_1,a_2,a_3,b_1,b_2,b_3 \geq 2$. We prove that the surfaces $V(f) \subset \mathbb{A}^3$ and $V(g) \subset \mathbb{A}^3$ are isomorphic if and only if $(a_1,a_2,a_3) = (b_1,b_2,b_3)$ up to a permutation of the entries.

URL PDF HTML ☆
赞 0 踩 0
2605.07616 2026-05-11 hep-ph astro-ph.HE

Probing the Inert Doublet Dark Matter with Stellar-Mass Black Hole Mini-Spikes

Rameswar Sahu

AI总结 本文研究了惰性双态暗物质模型（IDM）在恒星级质量黑洞周围小尖峰环境中的探测可能性。通过分析费米卫星（FermiLAT）观测数据，作者利用黑洞强引力场对暗物质的压缩效应，显著增强暗物质湮灭信号，从而对IDM参数空间施加严格限制，尤其在高质量区域约束可达多TeV量级。该研究突显了间接探测方法在探索超出当前对撞机和直接探测实验能力范围的暗物质模型中的重要作用。

Comments 15 Pages, 2 Figures, 1 Table

详情
英文摘要

The nature of dark matter remains a central unresolved problem in contemporary physics, motivating the exploration of well-defined extensions of the Standard Model. Among these, the Inert Doublet Model provides a minimal and theoretically consistent framework accommodating a viable weakly interacting massive particle dark matter candidate. In this work, we investigate the IDM parameter space through an analysis of FermiLAT observations of dark matter mini-spikes surrounding stellar-mass black holes. Owing to the strong gravitational compression of dark matter in the vicinity of these systems, the resulting annihilation signal can be significantly enhanced, rendering such environments exceptionally sensitive probes of dark matter interactions. We find that substantial regions of the IDM parameter space, particularly in the high-mass regime, are subject to stringent constraints extending into the multi-TeV range. These results underscore the increasingly important role of indirect detection in probing particle dark matter scenarios beyond the reach of current collider and direct detection experiments.

URL PDF HTML ☆
赞 0 踩 0
2605.07615 2026-05-11 cond-mat.stat-mech math-ph math.MP

Hydrodynamics and boundary-induced phase transitions in the $n$-species particle-exchange process

Gunter M. Schutz, Ali Zahra

AI总结 本文研究了$n$种粒子交换过程（PEP($n$)）的流体力学行为及其边界诱导的相变现象。该过程在离散环上具有积测度作为不变测度，其宏观行为由$n$个耦合的无粘性Burgers方程描述，并可通过黎曼不变量求得显式解。作者还引入了具有边界储库的开放系统，证明在特定边界速率下其不变测度仍为积测度，并通过黎曼不变量推导出稳态相图，显示在一般情况下系统表现出$2n+1$种相，存在由边界引起的类似单种粒子不对称简单排除过程的相变。

详情
英文摘要

The $n$-species particle-exchange process (PEP($n$)) is an exclusion process in which particles of $n$ different species exchange positions on neighbouring sites with rates chosen such that the invariant measure on the discrete torus is a product measure. We address the large-scale hydrodynamic behaviour of this process which yields a system of $n$ coupled inviscid Burgers equations. This system of conservation laws is shown to admit Riemann invariants for arbitrary $n$ from which explicit solutions of the Riemann problem in terms of shock waves and rarefaction fans are obtained. We also introduce the open PEP($n$), in which particles are exchanged with boundary reservoirs. For a distinguished manifold of boundary rates, we prove that the invariant measure is the same product measure as in the periodic system. The hydrodynamic description in terms of Riemann invariants is used to derive the stationary phase diagram explicitly in terms of microscopic boundary rates. In the generic case, the steady state exhibits $2n+1$ phases, with boundary-induced phase transitions analogous to those of the single-species asymmetric simple exclusion process.

URL PDF HTML ☆
赞 0 踩 0
2605.07614 2026-05-11 math.DS q-bio.MN

Predictive-Switching Control of Stochastic Gene Regulatory Networks: A Contractive PIDE Framework

Christian Fernández, Manuel Pájaro, Gábor Szederkényi, Irene Otero-Muras

AI总结 本文提出了一种基于部分积分微分方程（PIDE）模型的预测切换控制算法，用于调控随机基因调控网络的概率密度函数形状。通过从有限候选集选择控制输入以最小化给定代价函数，并引入神经网络近似控制策略，构建了一个适用于高维系统的混合控制框架。核心理论贡献在于基于收缩性分析的闭环PIDE动力学稳定性证明，确保了概率密度演化对初始条件的渐进独立性，并在存在严格正泄漏项时实现了指数收敛。数值仿真验证了该方法的有效性与灵活性。

详情
英文摘要

This paper develops a predictive switching control algorithm for stochastic gene regulatory networks described by a Partial Integro-Differential Equation (PIDE) model, which enables direct shape control of the probability density function. Control inputs are selected from a finite candidate set to minimize a prescribed cost functional. A hybrid framework is proposed for scalability in higher-dimensional systems, using neural networks to approximate the control policy. A central theoretical contribution is a contraction-based analysis of the closed-loop PIDE dynamics. The paper establishes $L^ 1$-contractivity under the proposed control scheme, yielding formal stability guarantees and showing that the evolution of the probability density becomes progressively independent of the initial condition. Moreover, under strictly positive leakage terms, exponential convergence is obtained. The effectiveness and flexibility of the approach, together with the theoretical contractivity results, are illustrated through numerical simulations on three representative examples of increasing dimensionality.

URL PDF HTML ☆
赞 0 踩 0
2605.07612 2026-05-11 physics.comp-ph

foap4: Adaptive mesh refinement with OpenACC, MPI, and p4est

Jannis Teunissen, Héctor R. Olivares Sánchez, Jesse Vos, Leon Oostrum, Johan Hidding, Victor Azizi, Yuhao Zhou, Hao Wu, Adrian Kelly, Olaf Willocx, Chun Xia, Rony Keppens, Oliver Porth

AI总结 本文介绍了一个基于 Fortran 的自适应网格 refinement（AMR）框架 foap4，该框架结合了 OpenACC、MPI 和 p4est 库，旨在为未来在 GPU 上运行 Fortran 编写的并行 AMR 代码提供支持。研究通过多个二维和三维的气体动力学基准测试，验证了该框架在不同硬件上使用静态和自适应网格进行高效模拟的能力，表明即使使用较小的网格块，也能在 GPU 上实现良好的性能。

详情
英文摘要

GPUs and other accelerators are increasingly used for scientific computing. In the future, we want to add GPU support to parallel adaptive mesh refinement (AMR) codes written in Fortran. To understand which changes are necessary to obtain good performance we have developed foap4, an AMR framework implemented in Fortran that uses OpenACC, MPI, and the p4est library. We discuss the design and implementation of the framework. Several benchmark problems are considered, in which Euler's equations of gas dynamics are solved using explicit time integration. These benchmarks are performed in both 2D and 3D, using static and adaptive meshes, for varying problem sizes on different hardware. Our results show that AMR simulations can be carried out efficiently on GPUs with OpenACC and MPI, even when using relatively small grid blocks of $8^3$ or $16^3$ cells.

URL PDF HTML ☆
赞 0 踩 0
2605.07611 2026-05-11 quant-ph

Compositional Quantum Heuristics for Max-Clique Detection

Tiffany Duneau, Colin Krawchuk, Anna Pearson

AI总结 该研究探讨了如何通过组合量子子模块来缓解量子机器学习中的“ barren plateaus”问题，提出了一种基于群不变损失函数的框架，以增强模型的可训练性和泛化能力。研究设计了具有置换等变性的量子图神经网络，用于检测图中的最大团，并通过递归混合量子-经典启发式算法提升了推理精度和可扩展性。实验表明，该方法在复杂问题实例上表现出优越的性能，为构建可扩展的量子学习模型提供了新思路。

详情
英文摘要

Quantum machine learning holds the promise of combining the success of classical machine learning methods with the power of quantum computing, however one of the largest obstacles facing the field is the problem of barren plateaus. Parameterised quantum circuits offer a flexible framework for developing quantum machine learning models, but their practicality is constrained by a trade-off between trainability and classical simulability. In general, circuits that are sufficiently expressive to model complex behaviour often exhibit barren plateaus, where gradients vanish and optimisation fails. In this work we investigate a compositional approach to mitigate this trade-off by assembling larger quantum models from smaller subcomponents. To ensure trainability of these subcomponents, we describe a framework for constructing group-invariant loss functions, which introduce symmetry-induced inductive bias and lead to improved gradient behaviour and generalisation. In particular, we use this framework to design permutation-equivariant quantum graph neural networks for identifying maximal cliques in graphs. The models we construct exhibit superior training gradients through symmetry-induced bias, and our experiments demonstrate that the trained models generalise to larger, more complex problem instances. Finally, inspired by Quantum-Informed Recursive Optimisation Algorithms (arXiv:2308.13607), we implement a recursive hybrid quantum-classical heuristic using the learned quantum models to guide a classical search procedure, demonstrating improved inference accuracy and scalability. Together, these results suggest that compositional circuits could be a viable pathway towards scalable quantum learning models that remain challenging to reproduce classically.

URL PDF HTML ☆
赞 0 踩 0
2605.07610 2026-05-11 math.AP

Stationary solutions to the spherically symmetric compressible fluid with capillarity effect

Jeongho Kim

AI总结 本文研究了具有毛细效应的球对称可压缩流体在外部区域上的平稳解问题，考虑了不可渗透壁、流入和流出等边界条件。通过分析边界和远场数据，作者证明了当边界数据足够小时，存在唯一的光滑平稳解，并给出了平稳解的衰减速率：不可渗透壁问题的解指数衰减，而流入/流出问题的解代数衰减。此外，研究了毛细系数趋于零时平稳解的渐近收敛性，并通过数值实验验证了理论收敛速率的最优性。

详情
英文摘要

We consider the spherically symmetric Navier--Stokes--Korteweg (NSK) system on the exterior domain $Ω=\{x\in\mathbb{R}^n~|~|x|>1\}$ with $n\ge2$ when the boundary and far-field data are given. We show that, if the boundary data are sufficiently small, then there exists a unique smooth stationary solution to the spherically symmetric NSK system with impermeable wall, inflow, and outflow boundary conditions. We also establish the decay rate of the stationary solutions. Precisely, the stationary solution for the impermeable wall problem exponentially decays to the far-field states, while that of the inflow/outflow problem algebraically decays. Finally, we investigate the asymptotic convergences of the stationary solution for the impermeable wall problem as the capillarity coefficient vanishes. Numerical results validate that our theoretical convergence rate of the stationary solution is optimal.

URL PDF HTML ☆
赞 0 踩 0
2605.07608 2026-05-11 q-bio.QM q-bio.BM

GoForth: Language Models for RNA Design under Structure, Sequence, and Coding Constraints

Michael Lindsey

AI总结 本文提出了一种名为GoForth的语言模型，用于在结构、序列和编码约束下进行RNA设计。该模型通过条件生成的方式处理复杂的逆向设计问题，将序列先验、前向折叠采样器和奖励或似然评估器三个通常耦合的要素进行解耦。实验表明，GoForth能够高效生成高质量的RNA序列候选，并提供了对设计任务的语义嵌入和设计可行性的学习表征。

详情
英文摘要

RNA inverse sequence design has broad biological and engineering applications, but computational methods for practical design queries remain limited. Such queries may impose several constraints at once, including target folds or motifs, fixed bases, and coding restrictions, while leaving arbitrary sequence and structure in unspecified regions. Because these constraints may permit many acceptable sequences, we study RNA design as a conditional generative modeling problem. The basic object is a conditional law over RNA sequences given a user-specified condition, with full inverse folding as a special case. We introduce GoForth, a forward-trained RNA language model that conditions on structure, sequence, and coding targets. The formulation separates three ingredients that are often entangled in RNA design: a sequence prior, a forward folding sampler, and a reward or likelihood oracle. We train encoder-decoder models on witnessed folds rather than on outputs from an inverse-design teacher and validate our methodology on full inverse-folding benchmarks, as well as tasks involving constraints on structure, sequence, and coding. The resulting models achieve fast and high-quality candidate generation for mixed RNA design specifications. Moreover they furnish useful semantic embeddings of design tasks and a robust learned notion of designability.

URL PDF HTML ☆
赞 0 踩 0
2605.07603 2026-05-11 math.AP

Uniqueness for an inverse coefficient problem of a weakly coupled parabolic system

Caixuan Ren, Kai Yu, Zhiyuan Li

AI总结 本文研究了一个弱耦合抛物系统的反系数问题，旨在通过边界观测数据唯一确定系统中的系数矩阵。该系统具有齐次Neumann边界条件，其核心方法基于解的特征函数展开以及对Gel'fand-Levitan理论在抛物系统中的推广。研究证明，在初始值满足生成元条件的情况下，系数矩阵可由边界观测唯一确定，为反问题的理论分析提供了重要依据。

详情
英文摘要

This paper considers the weakly coupled parabolic system $\partial_t u-\partial^2_xu +P(x)u=0$ with the homogeneous Neumann boundary condition, where \(P(x)\) is a \(2\times2\) symmetric real-valued function matrix. Under the assumption that the initial value \(a(x)\) is a generating element (i.e., it has a nonzero inner product with every eigenfunction), we prove that the coefficient matrix $ P(x)$ is uniquely determined by the boundary observation $u(0, t)$, $u(1, t)$, $0 < t < T$. The proof relies on the eigenfunction expansion of the solution to the initial-boundary value problem and an extension of the Gel'fand-Levitan theory to the parabolic system.

URL PDF HTML ☆
赞 0 踩 0
2605.07602 2026-05-11 cond-mat.str-el cond-mat.mtrl-sci

Emergent Dynamic Magnetic Ground State in a Mixed 3d/5d Heavy Fermion System CaCu3Ir4O12

J. Ming, Abhisek Bandyopadhyay, G. B. G. Stenning, M. T. F. Telling, N. N. Wang, G. Wang, J. -G. Cheng, D. T. Adroja

AI总结 该研究探讨了三维氧化物中罕见的量子无序磁基态，研究对象是具有混合3d/5d电子结构的重费米子材料CaCu₃Ir₄O₁₂。通过多种实验手段，包括磁化率、比热和缪子自旋弛豫等，发现该材料在极低温下既无长程磁序也无自旋冻结，表现出强烈的量子自旋涨落和动态局域磁矩。这一结果表明CaCu₃Ir₄O₁₂是研究三维量子无序磁性及关联电子体系中涨落主导态的理想平台。

Comments 38 paages, 9 figures

详情
英文摘要

Quantum-disordered magnetic ground states are challenging to identify in three-dimensional (3D) oxides, where strong exchange pathways typically favour long-range magnetic order or spin freezing. The quadruple perovskite $\mathrm{CaCu_3Ir_4O_{12}}$, crystallizing in the cubic $Im\bar{3}$ structure, provides a 3D lattice where $\mathrm{Cu^{2+}}$ $3d$ moments are coupled to an extended Ir $5d$ network, offering a rare platform for probing quantum-disordered magnetism in a mixed $3d/5d$ electron system. Here, we combine bulk probes, including DC and AC magnetic susceptibility, and heat capacity measurements (down to $50~\mathrm{mK}$), along with the local microscopic probe muon spin relaxation ($μ$SR) (down to $40~\mathrm{mK}$), to investigate the true magnetic ground state of $\mathrm{CaCu_3Ir_4O_{12}}$. Despite strong antiferromagnetic interactions ($θ_{\mathrm{W}} \sim -200~\mathrm{K}$, with an applied-field dependence), no signature of long-range magnetic ordering or spin freezing is detected down to the lowest measured temperatures. Furthermore, our in-depth zero-field (ZF) and longitudinal-field (LF) $μ$SR characterizations confirm strong quantum spin fluctuations and the truly dynamic nature of the local moments down to $40~\mathrm{mK}$. These results establish $\mathrm{CaCu_3Ir_4O_{12}}$ as a promising 3D quantum-disordered magnet and a well-characterized platform for exploring fluctuation-dominated states in correlated $3d/5d$ oxides.

URL PDF HTML ☆
赞 0 踩 0
2605.07601 2026-05-11 math.CV math.AP

The Pseudo-Analytic Mass of a Beltrami-Vekua Equation

Daniel Alayón-Solarz

AI总结 本文研究了贝尔特拉米-维库方程的伪解析质量，提出了一种基于复形式的椭圆系统统一表达式，并分析了其在乘法规范变换和保向微分同胚下的不变性。核心结果表明，由方程参数构造的二形式Θ在规范变换下保持不变，并在微分同胚下协变变换，其总质量可用来区分不同伪解析方程，并在解析类中精确为零。该研究为解析方程的分类和约化提供了新的几何视角。

Comments 20 pages

详情
英文摘要

Every smooth first-order real planar elliptic system admits a universal complex form $w_{\bar z} - μw_z + \mathcal{A} w + \mathcal{B} \bar w = \mathcal{F}$, which we call the Beltrami-Vekua equation: the data $(μ, \mathcal{A}, \mathcal{B}, \mathcal{F})$ are produced from the original system by algebraic operations and differentiations, with no auxiliary PDE. On this space we study the joint action of multiplicative gauges $w \mapsto ϕw$ and orientation-preserving diffeomorphisms. Our main result is that the 2-form $Θ= |\mathcal{B}|^2 / (1 - |μ|^2) \, dx \, dy$ is gauge-invariant and pulls back covariantly under diffeomorphisms; its form is forced, with $|\mathcal{B}|^2$ the unique $\mathcal{B}$-quadratic combination invariant under $\mathcal{B} \mapsto \mathcal{B}ϕ/\barϕ$ and $1 - |μ|^2$ the conformal distortion factor from the diffeomorphism law for $μ$. The total mass $\mathcal{M}(D) = \int_ΩΘ$, the \emph{pseudo-analytic mass}, vanishes precisely on the analytic class $\mathcal{B} \equiv 0$ and separates a continuous family of pairwise inequivalent pseudo-analytic equations on the disk. As a by-product, Vekua's two-stage reduction - uniformization then gauge elimination - requires only one variable-coefficient PDE solve: the Beltrami diffeomorphism supplies the integrating factor for a flat $\bar\partial$-equation.

URL PDF HTML ☆
赞 0 踩 0
2605.07599 2026-05-11 cs.DC cs.ET

Stencil Computations on Tenstorrent Wormhole

Lorenzo Piarulli, Daniele De Sensi

AI总结 本文研究了如何在Tenstorrent Wormhole AI加速器上高效执行二维五点模板计算这一传统科学计算内核。作者提出了两种异构实现方法：Axpy和MatMul，分别将模板计算分解为子矩阵操作和重构为矩阵乘法。研究发现，尽管CPU整体性能仍优于Wormhole，但在特定条件下Wormhole的能效比更高，并指出了当前平台在架构和软件层面的限制，为未来AI加速器在高性能计算中的应用提供了改进方向。

详情
英文摘要

As investment in AI-focused accelerators grows and their deployment in supercomputing facilities expands, understanding whether these architectures can efficiently support traditional scientific kernels is critical for the future of High-Performance Computing. We investigate the mapping of 2D 5-point stencil computations onto the Tenstorrent Wormhole, a RISC-V AI dataflow accelerator. We develop two heterogeneous implementations: Axpy, which decomposes the stencil into element-wise submatrix operations, and MatMul, which reformulates it as a matrix multiplication. While the CPU baseline remains 3x faster end-to-end, profiling reveals that the isolated Wormhole kernel is competitive with CPU execution, with the gap driven by PCIe transfers, device initialization, and host-side preprocessing. Despite slower runtime, Axpy achieves lower energy consumption than the CPU baseline for large inputs. Through detailed profiling and theoretical analysis, we identify key architectural and software limitations of the current platform and outline concrete hardware and software directions that could make AI accelerators competitive for HPC workloads.

URL PDF HTML ☆
赞 0 踩 0
2605.07597 2026-05-11 cond-mat.stat-mech

Nonreciprocal McKean-Vlasov Equations: From Stationary Instabilities to Travelling Waves

Arjun R, Pratyush Prakash Patra, A. V. Anil Kumar

AI总结 本文研究了非对称相互作用下麦凯-弗拉索夫方程的集体动力学行为，揭示了非对称性如何调控从稳态不稳定性到行波态的相变过程。通过线性稳定性分析、弱非线性方法、伪谱模拟和朗之万粒子动力学，作者展示了空间均匀和空间调制的非对称性分别导致不同类型的集体有序态，并发现了亚临界和超临界霍普夫分岔现象。研究还表明，即使在弱非对称条件下，无需显式的追逐机制，行波态也能出现，为理解非平衡集体运动提供了新的理论框架。

Comments 27 pages, 8 figures

详情
英文摘要

Nonreciprocal interactions, in which action-reaction symmetry is broken, provide a powerful route to collective dynamics that cannot be captured by equilibrium free-energy minimisation. Here, we introduce and analyse a two-species nonreciprocal McKean-Vlasov equation derived from an underlying system of interacting stochastic particles. Combining linear stability analysis, weakly nonlinear arguments, pseudo-spectral simulations, and Langevin particle dynamics, we show that the structure of nonreciprocity controls the onset and nature of collective order. For spatially uniform weak nonreciprocity, asymmetry shifts the critical diffusion threshold but produces only stationary instabilities, indicating that uniform imbalance alone is insufficient to generate sustained time-dependent motion. In contrast, spatially modulated nonreciprocity fundamentally enriches the dynamics: depending on its symmetry and coupling to the interaction potential, the homogeneous state can lose stability through Hopf bifurcations, giving rise to standing and travelling wave states. We identify both subcritical and supercritical Hopf transitions, relate the selected patterns to Landau saturation coefficients, and show that travelling waves can emerge even in the weak-nonreciprocity regime without explicit microscopic run-and-chase rules. Direct Langevin simulations confirm that these oscillatory and travelling states persist at the particle level and are not artefacts of the continuum mean-field description. Our results establish nonreciprocal McKean-Vlasov equations as a minimal framework for understanding how spatially structured asymmetric interactions generate self-organized motion, dynamical phase transitions, and nonequilibrium collective order.

URL PDF HTML ☆
赞 0 踩 0
2605.07595 2026-05-11 cs.IT math.IT

A Syndrome-Space Approach to Proximity Gaps and Correlated Agreement for Random Linear Codes

Chen Yuan, Ruiqi Zhu

AI总结 本文研究了随机线性码在接近性间隙和相关一致性的分析中所面临的问题，提出了一个基于综合征空间的直接方法，避免了依赖列表译码的传统途径。该方法通过引入证人归约机制，能够在仿射直线、仿射空间和多项式曲线等结构上获得强健的结果，并在参数上取得了改进，特别是在大字母表情况下达到了接近理论极限的半径界。这一成果为随机线性码在零知识证明等应用中的高效验证提供了新的理论支持。

Comments 35 pages

详情
英文摘要

Proximity gaps and correlated agreement have become central tools in the analysis of interactive oracle proofs of proximity (IOPPs) and code-based SNARKs. Informally, a proximity-gap statement says that for a structured set of words -- such as a line, an affine space, or a curve -- either all points are close to the code, or most are far from it. Such statements are essential in sampling-based proof systems, where a verifier queries only a few random locations on a structured object but must still obtain a global soundness guarantee. In Reed--Solomon-based proof systems, one would ideally like the proximity parameter to approach the information-theoretic limit $1-R$, since this is the largest possible radius for a rate-$R$ code and directly affects protocol efficiency. While recent work has substantially strengthened the picture for algebraic codes and linked proximity gaps to decoding-related structural properties, it remains unclear whether analogous results for random linear codes can be proved directly, rather than through decoding-theoretic surrogates. In this work, we establish a direct approach to proximity gaps and correlated agreement for random linear codes in the random parity-check-matrix model, without relying on list decoding as the main engine of the proof. Our approach is based on a syndrome-space reformulation together with a witness-based reduction mechanism, and it yields strong results for affine lines, affine spaces, and polynomial curves. It is conceptually different from the existing decoding-driven route for random linear codes, and it also leads to sharper parameters, including the optimal-up-to-$\varepsilon$ large-alphabet radius bound $ρ<1-R-\varepsilon$ for $q=Θ(n)$, as well as near-capacity bounds over constant alphabets with improved alphabet-size requirements.

URL PDF HTML ☆
赞 0 踩 0
2605.07592 2026-05-11 physics.ins-det cond-mat.supr-con hep-ex

Optimisation of TES design for the CRESST experiment

G. Angloher, S. Banik, A. Bento, A. Bertolini, R. Breier, C. Bucci, J. Burkhart, L. Burmeister, L. Canonica, E. Cipelli, S. Di Lorenzo, J. Dohm, F. Dominsky, A. Erb, E. Fascione, F. v. Feilitzsch, S. Fichtinger, D. Fuchs, V. M. Ghete, P. Gorla, P. V. Guillaumon, S. Gupta, D. Hauff, M. Ješkovský, J. Jochum, M. Kaznacheeva, H. Kluck, H. Kraus, B. von Krosigk, A. Langenkämper, M. Mancuso, B. Mauri, V. Mokina, C. Moore, P. Murali, M. Olmi, T. Ortmann, C. Pagliarone, L. Pattavina, F. Petricca, W. Potzel, P. Povinec, F. Pröbst, F. Pucci, F. Reindl, J. Rothe, K. Schäffner, J. Schieck, S. Schönert, C. Schwertner, M. Stahlberg, L. Stodolsky, C. Strandhagen, R. Strauss, I. Usherov, M. Zanirato, V. Zema

AI总结 CRESST实验旨在通过低温晶体中的核弹性散射直接探测亚GeV量级的暗物质粒子。本文针对用于该实验的钨超导转变传感器（W-TES）进行了优化研究，重点分析了声子收集器的厚度、尺寸和材料组成对探测器性能的影响。研究结果显著提升了信号与噪声比，为CRESST实验的探测能力设立了新的基准。

Comments 7 pages, 9 figures. This article has been accepted for publication in IEEE Transactions on Applied Superconductivity

详情
DOI
10.1109/TASC.2026.3680071
英文摘要

The CRESST experiment aims at the direct detection of sub-GeV dark matter particles via elastic scattering off nuclei in different target crystals at cryogenic temperatures. The advancement in W-TES sensors allowed the CRESST detectors to reach energy thresholds of 10 eV and lower, opening the way to the exploration of dark matter masses as low as 70 MeV/c2. This work presents optimisation studies of W-TESs aimed at further improving the signal-to-noise ratio and overall detector performance. In particular, we investigate the thickness, dimensions and material composition of phonon collectors and assess their impact on detector response. The results demonstrate a significant performance enhancement and establish new benchmarks for the sensors used within CRESST.

URL PDF HTML ☆
赞 0 踩 0
2605.07591 2026-05-11 math.PR

Nonnegativity of the second largest eigenvalue of $4 \times 4$ tridiagonal stochastic matrices

Brando Vagenende, Brecht Verbeken, Marie-Anne Guerry

AI总结 本文研究了4×4三对角随机矩阵的第二大特征值的非负性问题。作者证明了Ran和Teng提出的猜想，即不可约4×4三对角随机矩阵的第二大特征值是非负的，并将该结论推广到所有4×4三对角随机矩阵，包括可约的情形。这一结果深化了对随机矩阵谱性质的理解。

详情
英文摘要

The spectral study of nonnegative and more specifically stochastic matrices is an important topic in matrix theory. In this paper, we prove a conjecture, formulated by Ran and Teng, which states that the second largest eigenvalue of an irreducible $4\times4$ tridiagonal stochastic matrix is nonnegative. We establish this conjecture and extend the result to arbitrary $4\times4$ tridiagonal stochastic matrices, including both irreducible and reducible cases.

URL PDF HTML ☆
赞 0 踩 0
2605.07589 2026-05-11 eess.SY cs.SY

Distributionally Robust Data-Driven Predictive Control for Stochastic LTI Systems

Mirhan Urkmez, Shahab Heshmati-Alamdari

AI总结 本文提出了一种针对具有未知动态和扰动分布的随机线性时不变系统的分布鲁棒数据驱动预测控制框架。该方法通过最小二乘法利用离线轨迹拟合子空间预测控制预测器，并以预测残差的经验分布作为未知扰动分布的代理，构建Wasserstein模糊集，进而最小化最坏情况下的期望成本并保证输出约束的概率满足。该方法可转化为等效的数据驱动形式，无需显式识别预测模型，并通过有限样本集中性结果提供了数据驱动的Wasserstein半径，确保在真实扰动分布下期望成本和输出约束得到有效保障。数值仿真验证了该框架在不同扰动条件和成本函数下的有效性。

详情
英文摘要

We propose a distributionally robust data-driven predictive control framework for stochastic linear time-invariant systems with unknown dynamics and disturbance distributions. We use an offline trajectory to fit the subspace predictive control (SPC) predictor via least squares and construct an empirical distribution of the prediction residuals as a proxy for the unknown disturbance distribution. We then center a Wasserstein ambiguity set around this estimate and minimize the worst-case expected cost while enforcing probabilistic output constraint satisfaction over all distributions in the set. The resulting problem admits a tractable reformulation with an equivalent direct data-driven form, eliminating the need for explicit predictor identification. Using finite-sample concentration results, we provide a data-driven Wasserstein radius such that, with high probability, the true expected cost is bounded above by the tractable objective and output constraints are satisfied with respect to the true disturbance distribution. Numerical simulations validate the framework against existing methods under various disturbance conditions and cost functions.

URL PDF HTML ☆
赞 0 踩 0
2605.07587 2026-05-11 math.CO cs.DM

A Combinatorial Framework for the Pons-Batle Identity: Young Tableaux, Lattice Paths, and Limit Laws

Hexuan Liu, Michael Wallner, Guan-Ru Yu

AI总结 本文研究了树-子网络中一个重要的组合恒等式——Pons-Batle 恒等式，确认了当网路中的重组节点数有限时，具有 $n$ 个叶节点和 $k$ 个重组节点的双结合树-子网络数目等于特定受限字的数目。作者引入带墙和孔的杨表，并构造了与 Pons-Batle 字之间的显式双射，从而给出了组合解释，并通过投影到装饰 Dyck 路径得到了生成函数和递推公式。此外，研究还揭示了在 $k=1$ 时某些结构参数的极限分布服从 Beta 分布和均匀分布，为树-子网络的渐进行为提供了组合与分析统一的视角。

Comments To appear in the Proceedings of the 37th International Conference / Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026), Munich, Germany

详情
英文摘要

Tree-child networks are an important class of phylogenetic network used to model reticulate evolutionary processes. These networks have attracted increasing attention from researchers with interests in both combinatorics and algorithms. A fundamental open problem posed by Pons and Batle asks whether the number $TC_{n,k}$ of bicombining tree-child networks with $n$ leaves and $k$ reticulation nodes equals the number of certain constrained words, now called Pons-Batle words. In this paper, we confirm the conjecture for tree-child networks with a bounded number of reticulation nodes. Our approach is combinatorial and analytic. We introduce families of Young tableaux with walls and holes and construct explicit bijections with Pons-Batle words, yielding a direct combinatorial explanation of the identities. These tableaux encode structural features of the underlying networks, including the placement of reticulation nodes. By projecting them to decorated Dyck paths, we obtain algebraic generating functions with differential operators encoding step weights, leading to explicit recurrence relations and closed-form formulas for $TC_{n,k}$. Beyond finite verification for moderate $k$, the framework reveals an underlying probabilistic structure. For $k=1$, natural structural parameters, such as the position and value of distinguished cells, converge, after rescaling, to $\mathrm{Beta}(2,1)$, $\mathrm{Beta}(1,2)$, and Uniform (i.e., $\mathrm{Beta}(1,1)$) distributions. These limit laws arise from a coalescence of singularities at the dominant square-root singularity, producing a non-analytic transition in the local expansion. Overall, our results provide both combinatorial insight and a unified analytic perspective on the asymptotic behavior of tree-child networks, showing how algebraic generating functions with interacting singularities systematically produce Beta limit laws.

URL PDF HTML ☆
赞 0 踩 0
2605.07586 2026-05-11 hep-ex

Evidence for the decay $B^0_s\toϕη'$

LHCb collaboration, R. Aaij, M. Abdelfatah, A. S. W. Abdelmotteleb, C. Abellan Beteta, F. Abudinén, T. Ackernley, A. A. Adefisoye, B. Adeva, M. Adinolfi, P. Adlarson, C. Agapopoulou, C. A. Aidala, S. Akar, K. Akiba, P. Albicocco, J. Albrecht, R. Aleksiejunas, F. Alessio, P. Alvarez Cartelle, S. Amato, J. L. Amey, Y. Amhis, L. An, L. Anderlini, M. Andersson, P. Andreola, M. Andreotti, S. Andres Estrada, A. Anelli, D. Ao, C. Arata, F. Archilli, Z. Areg, M. Argenton, S. Arguedas Cuendis, L. Arnone, M. Artuso, E. Aslanides, R. Ataíde Da Silva, M. Atzeni, B. Audurier, J. A. Authier, D. Bacher, I. Bachiller Perea, S. Bachmann, M. Bachmayer, J. J. Back, Z. B. Bai, V. Balagura, A. Balboni, W. Baldini, Z. Baldwin, L. Balzani, H. Bao, J. Baptista de Souza Leite, C. Barbero Pretel, M. Barbetti, I. R. Barbosa, R. J. Barlow, M. Barnyakov, S. Barsuk, W. Barter, J. Bartz, S. Bashir, B. Batsukh, P. B. Battista, A. Bavarchee, A. Bay, A. Beck, M. Becker, F. Bedeschi, I. B. Bediaga, N. A. Behling, S. Belin, A. Bellavista, I. Belov, I. Belyaev, G. Bencivenni, E. Ben-Haim, R. Bernet, A. Bertolin, F. Betti, J. Bex, O. Bezshyyko, S. Bhattacharya, M. S. Bieker, N. V. Biesuz, A. Biolchini, M. Birch, F. C. R. Bishop, A. Bitadze, A. Bizzeti, T. Blake, F. Blanc, J. E. Blank, S. Blusk, J. A. Boelhauve, O. Boente Garcia, T. Boettcher, A. Bohare, C. Bolognani, R. Bolzonella, R. B. Bonacci, A. Bordelius, F. Borgato, S. Borghi, M. Borsato, J. T. Borsuk, E. Bottalico, S. A. Bouchiba, M. Bovill, T. J. V. Bowcock, A. Boyer, C. Bozzi, J. D. Brandenburg, A. Brea Rodriguez, N. Breer, C. Breitfeld, J. Brodzicka, J. Brown, D. Brundu, E. Buchanan, M. Burgos Marcos, C. Burr, C. Buti, J. S. Butter, J. Buytaert, W. Byczynski, S. Cadeddu, H. Cai, Y. Cai, A. Caillet, R. Calabrese, L. Calefice, M. Calvi, M. Calvo Gomez, P. Camargo Magalhaes, J. I. Cambon Bouzas, P. Campana, A. C. Campos, A. F. Campoverde Quezada, Y. Cao, S. Capelli, M. Caporale, L. Capriotti, R. Caravaca-Mora, A. Carbone, L. Carcedo Salgado, R. Cardinale, A. Cardini, P. Carniti, L. Carus, A. Casais Vidal, R. Caspary, G. Casse, M. Cattaneo, G. Cavallero, V. Cavallini, S. Celani, I. Celestino, S. Cesare, A. J. Chadwick, I. Chahrour, M. Charles, Ph. Charpentier, E. Chatzianagnostou, R. Cheaib, M. Chefdeville, C. Chen, J. Chen, S. Chen, Z. Chen, A. Chen Hu, M. Cherif, S. Chernyshenko, X. Chiotopoulos, G. Chizhik, V. Chobanova, M. Chrzaszcz, V. Chulikov, P. Ciambrone, X. Cid Vidal, P. Cifra, P. E. L. Clarke, M. Clemencic, H. V. Cliff, J. Closier, C. Cocha Toapaxi, V. Coco, J. Cogan, E. Cogneras, L. Cojocariu, S. Collaviti, P. Collins, T. Colombo, M. Colonna, A. Comerma-Montells, L. Congedo, J. Connaughton, A. Contu, N. Cooke, G. Cordova, C. Coronel, I. Corredoira, A. Correia, G. Corti, G. C. Costantino, J. Cottee Meldrum, B. Couturier, D. C. Craik, N. Crepet, M. Cruz Torres, M. Cubero Campos, E. Curras Rivera, R. Currie, C. L. Da Silva, X. Dai, J. Dalseno, C. D'Ambrosio, G. Darze, A. Davidson, J. E. Davies, O. De Aguiar Francisco, C. De Angelis, F. De Benedetti, J. de Boer, K. De Bruyn, S. De Capua, M. De Cian, U. De Freitas Carneiro Da Graca, E. De Lucia, J. M. De Miranda, L. De Paula, M. De Serio, P. De Simone, F. De Vellis, J. A. de Vries, F. Debernardis, D. Decamp, S. Dekkers, L. Del Buono, B. Delaney, J. Deng, V. Denysenko, O. Deschamps, F. Dettori, B. Dey, P. Di Nezza, S. Ding, Y. Ding, L. Dittmann, A. D. Docheva, A. Doheny, C. Dong, F. Dordei, A. C. dos Reis, A. D. Dowling, L. Dreyfus, W. Duan, P. Duda, L. Dufour, V. Duk, P. Durante, M. M. Duras, J. M. Durham, O. D. Durmus, K. Duwe, A. Dziurda, S. Easo, E. Eckstein, U. Egede, S. Eisenhardt, E. Ejopu, L. Eklund, M. Elashri, D. Elizondo Blanco, J. Ellbracht, S. Ely, A. Ene, J. Eschle, T. Evans, F. Fabiano, S. Faghih, L. N. Falcao, B. Fang, R. Fantechi, L. Fantini, M. Faria, K. Farmer, F. Fassin, D. Fazzini, L. Felkowski, C. Feng, M. Feng, A. Fernandez Casani, M. Fernandez Gomez, A. D. Fernez, F. Ferrari, F. Ferreira Rodrigues, M. Ferrillo, M. Ferro-Luzzi, R. A. Fini, M. Fiorini, M. Firlej, K. L. Fischer, D. S. Fitzgerald, C. Fitzpatrick, T. Fiutowski, F. Fleuret, A. Fomin, M. Fontana, L. A. Foreman, R. Forty, D. Foulds-Holt, V. Franco Lima, M. Franco Sevilla, M. Frank, E. Franzoso, G. Frau, C. Frei, D. A. Friday, J. Fu, Q. Führing, T. Fulghesu, G. Galati, M. D. Galati, A. Gallas Torreira, D. Galli, S. Gambetta, M. Gandelman, P. Gandini, B. Ganie, H. Gao, R. Gao, T. Q. Gao, Y. Gao, Y. Gao, Y. Gao, L. M. Garcia Martin, P. Garcia Moreno, J. García Pardiñas, P. Gardner, L. Garrido, C. Gaspar, A. Gavrikov, E. Gersabeck, M. Gersabeck, T. Gershon, S. Ghizzo, Z. Ghorbanimoghaddam, F. I. Giasemis, V. Gibson, H. K. Giemza, A. L. Gilman, M. Giovannetti, A. Gioventù, L. Girardey, M. A. Giza, F. C. Glaser, V. V. Gligorov, C. Göbel, L. Golinka-Bezshyyko, E. Golobardes, A. Golutvin, S. Gomez Fernandez, W. Gomulka, F. Goncalves Abrantes, I. Gonçales Vaz, M. Goncerz, G. Gong, J. A. Gooding, C. Gotti, E. Govorkova, J. P. Grabowski, L. A. Granado Cardoso, E. Graugés, E. Graverini, L. Grazette, G. Graziani, A. T. Grecu, N. A. Grieser, L. Grillo, C. Gu, M. Guarise, L. Guerry, A. -K. Guseinov, Y. Guz, T. Gys, K. Habermann, T. Hadavizadeh, C. Hadjivasiliou, G. Haefeli, C. Haen, S. Haken, G. Hallett, P. M. Hamilton, Q. Han, X. Han, S. Hansmann-Menzemer, N. Harnew, T. J. Harris, M. Hartmann, S. Hashmi, J. He, N. Heatley, A. Hedes, F. Hemmer, C. Henderson, R. Henderson, R. D. L. Henderson, A. M. Hennequin, K. Hennessy, J. Herd, P. Herrero Gascon, J. Heuel, A. Heyn, A. Hicheur, G. Hijano Mendizabal, J. Horswill, R. Hou, Y. Hou, D. C. Houston, N. Howarth, W. Hu, X. Hu, W. Hulsbergen, R. J. Hunter, D. Hutchcroft, M. Idzik, P. Ilten, A. Iohner, H. Jage, S. J. Jaimes Elles, S. Jakobsen, T. Jakoubek, E. Jans, A. Jawahery, C. Jayaweera, A. Jelavic, V. Jevtic, Z. Jia, E. Jiang, X. Jiang, Y. Jiang, Y. J. Jiang, E. Jimenez Moya, N. Jindal, M. John, A. John Rubesh Rajan, D. Johnson, C. R. Jones, S. Joshi, B. Jost, J. Juan Castella, N. Jurik, I. Juszczak, K. Kalecinska, D. Kaminaris, S. Kandybei, M. Kane, Y. Kang, C. Kar, M. Karacson, A. Kauniskangas, J. W. Kautz, M. K. Kazanecki, F. Keizer, M. Kenzie, T. Ketel, B. Khanji, S. Kholodenko, G. Khreich, F. Kiraz, T. Kirn, V. S. Kirsebom, N. Kleijne, A. Kleimenova, D. K. Klekots, K. Klimaszewski, M. R. Kmiec, T. Knospe, R. Kolb, S. Koliiev, L. Kolk, A. Konoplyannikov, P. Kopciewicz, P. Koppenburg, A. Korchin, I. Kostiuk, O. Kot, S. Kotriakhova, E. Kowalczyk, O. Kravcov, M. Kreps, W. Krupa, W. Krzemien, O. Kshyvanskyi, S. Kubis, M. Kucharczyk, A. Kupsc, V. Kushnir, B. Kutsenko, J. Kvapil, I. Kyryllin, D. Lacarrere, P. Laguarta Gonzalez, A. Lai, A. Lampis, D. Lancierini, C. Landesa Gomez, J. J. Lane, G. Lanfranchi, C. Langenbruch, T. Latham, F. Lazzari, C. Lazzeroni, R. Le Gac, H. Lee, R. Lefèvre, M. Lehuraux, E. Lemos Cid, O. Leroy, T. Lesiak, E. D. Lesser, B. Leverington, A. Li, C. Li, C. Li, H. Li, J. Li, K. Li, L. Li, P. Li, P. -R. Li, Q. Li, T. Li, T. Li, Y. Li, Y. Li, Y. Li, Z. Lian, Q. Liang, X. Liang, Z. Liang, S. Libralon, A. Lightbody, T. Lin, R. Lindner, H. Linton, R. Litvinov, D. Liu, F. L. Liu, G. Liu, K. Liu, S. Liu, W. Liu, Y. Liu, Y. Liu, Y. L. Liu, G. Loachamin Ordonez, I. Lobo, A. Lobo Salvia, A. Loi, T. Long, F. C. L. Lopes, J. H. Lopes, A. Lopez Huertas, C. Lopez Iribarnegaray, Q. Lu, C. Lucarelli, D. Lucchesi, M. Lucio Martinez, Y. Luo, A. Lupato, M. Lupberger, E. Luppi, K. Lynch, S. Lyu, X. -R. Lyu, H. Ma, S. Maccolini, F. Machefert, F. Maciuc, B. Mack, I. Mackay, L. M. Mackey, L. R. Madhan Mohan, M. J. Madurai, D. Magdalinski, J. J. Malczewski, S. Malde, L. Malentacca, G. Manca, G. Mancinelli, C. Mancuso, R. Manera Escalero, A. Mangalasseri, F. M. Manganella, D. Manuzzi, S. Mao, D. Marangotto, J. F. Marchand, R. Marchevski, U. Marconi, E. Mariani, S. Mariani, C. Marin Benito, J. Marks, A. M. Marshall, L. Martel, G. Martelli, G. Martellotti, L. Martinazzoli, M. Martinelli, C. Martinez, D. Martinez Gomez, D. Martinez Santos, F. Martinez Vidal, A. Martorell i Granollers, A. Massafferri, R. Matev, A. Mathad, C. Matteuzzi, K. R. Mattioli, A. Mauri, E. Maurice, J. Mauricio, P. Mayencourt, J. Mazorra de Cos, M. Mazurek, D. Mazzanti Tarancon, M. McCann, N. T. McHugh, A. McNab, R. McNulty, B. Meadows, D. Melnychuk, D. Mendoza Granada, P. Menendez Valdes Perez, F. M. Meng, M. Merk, A. Merli, L. Meyer Garcia, D. Miao, H. Miao, M. Mikhasenko, D. A. Milanes, A. Minotti, E. Minucci, B. Mitreska, D. S. Mitzel, R. Mocanu, A. Modak, L. Moeser, R. D. Moise, E. F. Molina Cardenas, T. Mombächer, M. Monk, T. Monnard, S. Monteil, A. Morcillo Gomez, G. Morello, M. J. Morello, M. P. Morgenthaler, A. Moro, J. Moron, W. Morren, A. B. Morris, A. G. Morris, R. Mountain, Z. Mu, N. Muangkod, E. Muhammad, F. Muheim, M. Mulder, K. Müller, F. Muñoz-Rojas, V. Mytrochenko, P. Naik, T. Nakada, R. Nandakumar, G. Napoletano, I. Nasteva, M. Needham, N. Neri, S. Neubert, N. Neufeld, J. Nicolini, D. Nicotra, E. M. Niel, L. Nisi, Q. Niu, B. K. Njoki, P. Nogarolli, P. Nogga, C. Normand, J. Novoa Fernandez, G. Nowak, H. N. Nur, A. Oblakowska-Mucha, T. Oeser, O. Okhrimenko, R. Oldeman, F. Oliva, E. Olivart Pino, M. Olocco, R. H. O'Neil, J. S. Ordonez Soto, D. Osthues, J. M. Otalora Goicochea, P. Owen, A. Oyanguren, O. Ozcelik, F. Paciolla, A. Padee, K. O. Padeken, B. Pagare, T. Pajero, A. Palano, L. Palini, M. Palutan, C. Pan, X. Pan, S. Panebianco, S. Paniskaki, L. Paolucci, A. Papanestis, M. Pappagallo, L. L. Pappalardo, C. Pappenheimer, C. Parkes, D. Parmar, G. Passaleva, D. Passaro, A. Pastore, M. Patel, J. Patoc, C. Patrignani, A. Paul, C. J. Pawley, A. Pellegrino, J. Peng, X. Peng, M. Pepe Altarelli, S. Perazzini, H. Pereira Da Costa, M. Pereira Martinez, A. Pereiro Castro, C. Perez, P. Perret, A. Perrevoort, A. Perro, M. J. Peters, K. Petridis, A. Petrolini, S. Pezzulo, J. P. Pfaller, H. Pham, L. Pica, M. Piccini, L. Piccolo, B. Pietrzyk, R. N. Pilato, D. Pinci, F. Pisani, M. Pizzichemi, V. M. Placinta, M. Plo Casasus, T. Poeschl, F. Polci, M. Poli Lener, A. Poluektov, I. Polyakov, E. Polycarpo, S. Ponce, D. Popov, K. Popp, K. Prasanth, C. Prouve, D. Provenzano, V. Pugatch, A. Puicercus Gomez, G. Punzi, J. R. Pybus, Q. Qian, W. Qian, N. Qin, R. Quagliani, R. I. Rabadan Trejo, R. Racz, J. H. Rademacker, M. Rama, M. Ramírez García, V. Ramos De Oliveira, M. Ramos Pernas, M. S. Rangel, G. Raven, M. Rebollo De Miguel, F. Redi, J. Reich, F. Reiss, Z. Ren, P. K. Resmi, M. Ribalda Galvez, R. Ribatti, G. Ricart, D. Riccardi, S. Ricciardi, K. Richardson, M. Richardson-Slipper, F. Riehn, K. Rinnert, P. Robbe, G. Robertson, E. Rodrigues, A. Rodriguez Alvarez, E. Rodriguez Fernandez, J. A. Rodriguez Lopez, E. Rodriguez Rodriguez, J. Roensch, A. Rogovskiy, D. L. Rolf, P. Roloff, V. Romanovskiy, A. Romero Vidal, G. Romolini, F. Ronchetti, T. Rong, M. Rotondo, M. S. Rudolph, M. Ruiz Diaz, J. Ruiz Vidal, J. J. Saavedra-Arias, J. J. Saborido Silva, S. E. R. Sacha Emile R., D. Sahoo, N. Sahoo, B. Saitta, M. Salomoni, I. Sanderswood, R. Santacesaria, C. Santamarina Rios, M. Santimaria, L. Santoro, E. Santovetti, A. Saputi, A. Sarnatskiy, G. Sarpis, M. Sarpis, C. Satriano, A. Satta, M. Saur, H. Sazak, F. Sborzacchi, A. Scarabotto, S. Schael, S. Scherl, M. Schiller, H. Schindler, M. Schmelling, B. Schmidt, N. Schmidt, S. Schmitt, H. Schmitz, O. Schneider, A. Schopper, N. Schulte, M. H. Schune, G. Schwering, B. Sciascia, A. Sciuccati, G. Scriven, I. Segal, S. Sellam, T. Senger, M. Senghi Soares, A. Sergi, N. Serra, L. Sestini, B. Sevilla Sanjuan, Y. Shang, D. M. Shangase, R. S. Sharma, L. Shchutska, T. Shears, J. Shen, Z. Shen, S. Sheng, B. Shi, J. Shi, Q. Shi, W. S. Shi, E. Shmanin, R. Silva Coutinho, G. Simi, S. Simone, M. Singha, I. Siral, N. Skidmore, T. Skwarnicki, M. W. Slater, E. Smith, M. Smith, L. Soares Lavra, M. D. Sokoloff, F. J. P. Soler, A. Solomin, K. Solovieva, N. S. Sommerfeld, R. Song, Y. Song, Y. Song, Y. S. Song, F. L. Souza De Almeida, B. Souza De Paula, K. M. Sowa, E. Spadaro Norella, E. Spedicato, J. G. Speer, P. Spradlin, F. Stagni, M. Stahl, S. Stahl, S. Stanislaus, M. Stefaniak, O. Steinkamp, F. Suljik, J. Sun, J. Sun, L. Sun, D. Sundfeld, W. Sutcliffe, P. Svihra, V. Svintozelskyi, K. Swientek, F. Swystun, A. Szabelski, T. Szumlak, Y. Tan, Y. Tang, Y. T. Tang, M. D. Tat, J. A. Teijeiro Jimenez, F. Terzuoli, F. Teubert, E. Thomas, D. J. D. Thompson, A. R. Thomson-Strong, H. Tilquin, V. Tisserand, S. T'Jampens, M. Tobin, T. T. Todorov, L. Tomassetti, G. Tonani, X. Tong, T. Tork, L. Toscano, D. Y. Tou, C. Trippl, G. Tuci, N. Tuning, L. H. Uecker, A. Ukleja, A. Upadhyay, B. Urbach, A. Usachov, U. Uwer, V. Vagnoni, A. Vaitkevicius, V. Valcarce Cadenas, G. Valenti, N. Valls Canudas, J. van Eldik, H. Van Hecke, E. van Herwijnen, C. B. Van Hulse, R. Van Laak, M. van Veghel, G. Vasquez, R. Vazquez Gomez, P. Vazquez Regueiro, C. Vázquez Sierra, S. Vecchi, J. Velilla Serna, J. J. Velthuis, M. Veltri, A. Venkateswaran, M. Verdoglia, M. Vesterinen, W. Vetens, D. Vico Benet, P. Vidrier Villalba, M. Vieites Diaz, X. Vilasis-Cardona, E. Vilella Figueras, A. Villa, P. Vincent, B. Vivacqua, F. C. Volle, D. vom Bruch, K. Vos, C. Vrahas, J. Wagner, J. Walsh, N. Walter, E. J. Walton, G. Wan, A. Wang, B. Wang, C. Wang, G. Wang, H. Wang, J. Wang, J. Wang, J. Wang, J. Wang, M. Wang, N. W. Wang, R. Wang, X. Wang, X. Wang, X. Wang, X. W. Wang, Y. Wang, Y. Wang, Y. H. Wang, Z. Wang, Z. Wang, J. A. Ward, M. Waterlaat, N. K. Watson, D. Websdale, Y. Wei, Z. Weida, J. Wendel, B. D. C. Westhenry, C. White, M. Whitehead, E. Whiter, A. R. Wiederhold, D. Wiedner, M. A. Wiegertjes, C. Wild, G. Wilkinson, M. K. Wilkinson, M. Williams, M. J. Williams, M. R. J. Williams, R. Williams, S. Williams, Z. Williams, F. F. Wilson, M. Winn, W. Wislicki, M. Witek, L. Witola, T. Wolf, E. Wood, G. Wormser, S. A. Wotton, H. Wu, J. Wu, X. Wu, Y. Wu, Z. Wu, K. Wyllie, S. Xian, Z. Xiang, Y. Xie, T. X. Xing, A. Xu, L. Xu, M. Xu, R. Xu, Z. Xu, Z. Xu, Z. Xu, Z. Xu, S. Yadav, K. Yang, X. Yang, Y. Yang, Y. Yang, Z. Yang, Z. Yang, H. Yeung, H. Yin, X. Yin, C. Y. Yu, J. Yu, X. Yuan, Y Yuan, J. A. Zamora Saa, M. Zavertyaev, M. Zdybal, F. Zenesini, C. Zeng, M. Zeng, S. H Zeng, C. Zhang, D. Zhang, J. Zhang, L. Zhang, R. Zhang, S. Zhang, S. L. Zhang, Y. Zhang, Z. Zhang, Y. Zhao, A. Zhelezov, S. Z. Zheng, X. Z. Zheng, Y. Zheng, T. Zhou, X. Zhou, V. Zhovkovska, L. Z. Zhu, X. Zhu, X. Zhu, Y. Zhu, V. Zhukov, J. Zhuo, D. Zuliani, G. Zunica

AI总结 本文利用LHCb实验在2011至2018年间采集的9 fb⁻¹积分亮度的质子-质子碰撞数据，首次在3.5个标准差显著性水平上观测到$B^0_s\toϕη'$衰变过程。研究测得该衰变相对于$B^0_s\toϕϕ$的分支比为$R=(3.56 \pm 0.79\pm 0.18\pm 0.06)\times10^{-2}$，对应的分支分数为$B(B^0_s\toϕη')=(0.66 \pm 0.15 \pm 0.03 \pm 0.02) \times 10^{-6}$，为研究B介子衰变提供了新的实验依据。

Comments All figures and tables, along with any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/5170

详情
英文摘要

Using a dataset corresponding to an integrated luminosity of $9 \,\textrm{fb}^{-1}$ collected in proton-proton collisions between 2011 and 2018 by the LHCb experiment, evidence is found for the decay $B^0_s\toϕη'$ with $3.5 σ$ significance. The branching ratio relative to the $B^0_s\toϕϕ$ decay is determined to be $R=(3.56 \pm 0.79\pm 0.18\pm 0.06)\times10^{-2}$. This corresponds to a branching fraction, $B(B^0_s\toϕη')=(0.66 \pm 0.15 \pm 0.03 \pm 0.02) \times 10^{-6}$ where, in both cases, the first uncertainty is statistical, the second systematic, and the third due to external branching fractions.

URL PDF HTML ☆
赞 0 踩 0
2605.07585 2026-05-11 physics.ins-det hep-ex

Track and Vertex Reconstruction with the ATLAS Inner Detector

ATLAS Collaboration

AI总结 本文介绍了ATLAS探测器内层用于电荷粒子和原始顶点重建的算法，重点描述了最新软件配置及其在Run 2和部分Run 3数据处理中的性能表现。研究展示了在多达80次质子-质子相互作用情况下，ATLAS在轨迹和顶点重建中仍能保持高效率、良好的参数分辨率以及较低的误重建率，为高能物理实验提供了可靠的数据重建方法。

Comments 74 pages in total, author list starting page 57, 27 figures, 3 tables, to be submitted to JINST. All figures including auxiliary figures are available at http://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/IDTR-2021-01

详情
英文摘要

Charged-particle reconstruction is a fundamental part of the event reconstruction in modern multi-purpose high-energy physics detectors. This paper describes the algorithms used to reconstruct charged particles and primary vertices with the ATLAS Inner Detector. The most recent software configuration deployed for data-taking is described, and the performance obtained when this software is used to process Run 2 (2015-2018) data, a subset (from 2022) of Run 3 (2022-2026) data, and corresponding simulated data is presented. The ATLAS track and vertex reconstruction performance is shown for up to 80 simultaneous proton-proton interaction. It maintains a high efficiency, good resolution for key parameters, and low rates of mis-reconstructed candidates for Run 2 and Run 3 conditions.

URL PDF HTML ☆
赞 0 踩 0
2605.07583 2026-05-11 math.CV

Avoidance Criteria for Normal Holomorphic Curves on Complex Projective Space

Gopal Datt, Rahul Gogoi, Kushal Lalwan

AI总结 本文研究了从复平面单位圆盘到复射影空间的全纯曲线族在避免足够多处于点态一般位置的移动超曲面时的条件。作者建立了相应的回避准则，并进一步探讨了共享超平面的全纯曲线族的正规性条件，为复几何中的全纯曲线理论提供了新的分析工具。

详情
英文摘要

We establish an avoidance criterion for families of holomorphic curves from the unit disk in complex plane to the complex projective space that omit sufficiently many moving hypersurfaces in pointwise general position. Furthermore, we study families of holomorphic curves that share hyperplanes and derive analogous normality conditions in this context.

URL PDF HTML ☆
赞 0 踩 0
2605.07582 2026-05-11 hep-ex

$C\!P$ violation analysis of local and nonlocal amplitudes in the $\overline{B}^0 \to \overline{K}^{*0}μ^+μ^-$ decay

LHCb collaboration, R. Aaij, M. Abdelfatah, A. S. W. Abdelmotteleb, C. Abellan Beteta, F. Abudinén, T. Ackernley, A. A. Adefisoye, B. Adeva, M. Adinolfi, P. Adlarson, C. Agapopoulou, C. A. Aidala, S. Akar, K. Akiba, P. Albicocco, J. Albrecht, R. Aleksiejunas, F. Alessio, P. Alvarez Cartelle, S. Amato, J. L. Amey, Y. Amhis, L. An, L. Anderlini, M. Andersson, P. Andreola, M. Andreotti, S. Andres Estrada, A. Anelli, D. Ao, C. Arata, F. Archilli, Z. Areg, M. Argenton, S. Arguedas Cuendis, L. Arnone, M. Artuso, E. Aslanides, R. Ataíde Da Silva, M. Atzeni, B. Audurier, J. A. Authier, D. Bacher, I. Bachiller Perea, S. Bachmann, M. Bachmayer, J. J. Back, Z. B. Bai, V. Balagura, A. Balboni, W. Baldini, Z. Baldwin, L. Balzani, H. Bao, J. Baptista de Souza Leite, C. Barbero Pretel, M. Barbetti, I. R. Barbosa, R. J. Barlow, M. Barnyakov, S. Baron, S. Barsuk, W. Barter, J. Bartz, S. Bashir, B. Batsukh, P. B. Battista, A. Bavarchee, A. Bay, A. Beck, M. Becker, F. Bedeschi, I. B. Bediaga, N. A. Behling, S. Belin, A. Bellavista, I. Belov, I. Belyaev, G. Bencivenni, E. Ben-Haim, R. Bernet, A. Bertolin, F. Betti, J. Bex, O. Bezshyyko, S. Bhattacharya, M. S. Bieker, N. V. Biesuz, A. Biolchini, M. Birch, F. C. R. Bishop, A. Bitadze, A. Bizzeti, T. Blake, F. Blanc, J. E. Blank, S. Blusk, J. A. Boelhauve, O. Boente Garcia, T. Boettcher, A. Bohare, C. Bolognani, R. Bolzonella, R. B. Bonacci, A. Bordelius, F. Borgato, S. Borghi, M. Borsato, J. T. Borsuk, E. Bottalico, S. A. Bouchiba, M. Bovill, T. J. V. Bowcock, A. Boyer, C. Bozzi, J. D. Brandenburg, A. Brea Rodriguez, N. Breer, C. Breitfeld, J. Brodzicka, J. Brown, D. Brundu, E. Buchanan, M. Burgos Marcos, C. Burr, C. Buti, J. S. Butter, J. Buytaert, W. Byczynski, S. Cadeddu, H. Cai, Y. Cai, A. Caillet, R. Calabrese, L. Calefice, M. Calvi, M. Calvo Gomez, P. Camargo Magalhaes, J. I. Cambon Bouzas, P. Campana, A. C. Campos, A. F. Campoverde Quezada, Y. Cao, S. Capelli, M. Caporale, L. Capriotti, R. Caravaca-Mora, A. Carbone, L. Carcedo Salgado, R. Cardinale, A. Cardini, P. Carniti, L. Carus, A. Casais Vidal, R. Caspary, G. Casse, M. Cattaneo, G. Cavallero, V. Cavallini, S. Celani, I. Celestino, S. Cesare, A. J. Chadwick, I. Chahrour, M. Charles, Ph. Charpentier, E. Chatzianagnostou, R. Cheaib, M. Chefdeville, C. Chen, J. Chen, S. Chen, Z. Chen, A. Chen Hu, M. Cherif, S. Chernyshenko, X. Chiotopoulos, G. Chizhik, V. Chobanova, M. Chrzaszcz, V. Chulikov, P. Ciambrone, X. Cid Vidal, P. Cifra, P. E. L. Clarke, M. Clemencic, H. V. Cliff, J. Closier, C. Cocha Toapaxi, V. Coco, J. Cogan, E. Cogneras, L. Cojocariu, S. Collaviti, P. Collins, T. Colombo, M. Colonna, A. Comerma-Montells, L. Congedo, J. Connaughton, A. Contu, N. Cooke, G. Cordova, C. Coronel, I. Corredoira, A. Correia, G. Corti, G. C. Costantino, J. Cottee Meldrum, B. Couturier, D. C. Craik, N. Crepet, M. Cruz Torres, M. Cubero Campos, E. Curras Rivera, R. Currie, C. L. Da Silva, X. Dai, J. Dalseno, C. D'Ambrosio, G. Darze, A. Davidson, J. E. Davies, O. De Aguiar Francisco, C. De Angelis, F. De Benedetti, J. de Boer, K. De Bruyn, S. De Capua, M. De Cian, U. De Freitas Carneiro Da Graca, E. De Lucia, J. M. De Miranda, L. De Paula, M. De Serio, P. De Simone, F. De Vellis, J. A. de Vries, F. Debernardis, D. Decamp, S. Dekkers, L. Del Buono, B. Delaney, J. Deng, V. Denysenko, O. Deschamps, F. Dettori, B. Dey, P. Di Nezza, S. Ding, Y. Ding, L. Dittmann, A. D. Docheva, A. Doheny, C. Dong, F. Dordei, A. C. dos Reis, A. D. Dowling, L. Dreyfus, W. Duan, P. Duda, L. Dufour, V. Duk, P. Durante, M. M. Duras, J. M. Durham, O. D. Durmus, K. Duwe, A. Dziurda, S. Easo, E. Eckstein, U. Egede, S. Eisenhardt, E. Ejopu, L. Eklund, M. Elashri, D. Elizondo Blanco, J. Ellbracht, S. Ely, A. Ene, J. Eschle, T. Evans, F. Fabiano, S. Faghih, L. N. Falcao, B. Fang, R. Fantechi, L. Fantini, M. Faria, K. Farmer, F. Fassin, D. Fazzini, L. Felkowski, C. Feng, M. Feng, A. Fernandez Casani, M. Fernandez Gomez, A. D. Fernez, F. Ferrari, F. Ferreira Rodrigues, M. Ferrillo, M. Ferro-Luzzi, R. A. Fini, M. Fiorini, M. Firlej, K. L. Fischer, D. S. Fitzgerald, C. Fitzpatrick, T. Fiutowski, F. Fleuret, A. Fomin, M. Fontana, L. A. Foreman, R. Forty, D. Foulds-Holt, V. Franco Lima, M. Franco Sevilla, M. Frank, E. Franzoso, G. Frau, C. Frei, D. A. Friday, J. Fu, Q. Führing, T. Fulghesu, G. Galati, M. D. Galati, A. Gallas Torreira, D. Galli, S. Gambetta, M. Gandelman, P. Gandini, B. Ganie, H. Gao, R. Gao, T. Q. Gao, Y. Gao, Y. Gao, Y. Gao, L. M. Garcia Martin, P. Garcia Moreno, J. García Pardiñas, P. Gardner, L. Garrido, C. Gaspar, A. Gavrikov, E. Gersabeck, M. Gersabeck, T. Gershon, S. Ghizzo, Z. Ghorbanimoghaddam, F. I. Giasemis, V. Gibson, H. K. Giemza, A. L. Gilman, M. Giovannetti, A. Gioventù, L. Girardey, M. A. Giza, F. C. Glaser, V. V. Gligorov, C. Göbel, L. Golinka-Bezshyyko, E. Golobardes, A. Golutvin, S. Gomez Fernandez, W. Gomulka, F. Goncalves Abrantes, I. Gonçales Vaz, M. Goncerz, G. Gong, J. A. Gooding, C. Gotti, E. Govorkova, J. P. Grabowski, L. A. Granado Cardoso, E. Graugés, E. Graverini, L. Grazette, G. Graziani, A. T. Grecu, N. A. Grieser, L. Grillo, C. Gu, M. Guarise, L. Guerry, A. -K. Guseinov, Y. Guz, T. Gys, K. Habermann, T. Hadavizadeh, C. Hadjivasiliou, G. Haefeli, C. Haen, S. Haken, G. Hallett, P. M. Hamilton, Q. Han, X. Han, S. Hansmann-Menzemer, N. Harnew, T. J. Harris, M. Hartmann, S. Hashmi, J. He, N. Heatley, A. Hedes, F. Hemmer, C. Henderson, R. Henderson, R. D. L. Henderson, A. M. Hennequin, K. Hennessy, J. Herd, P. Herrero Gascon, J. Heuel, A. Heyn, A. Hicheur, G. Hijano Mendizabal, J. Horswill, R. Hou, Y. Hou, D. C. Houston, N. Howarth, W. Hu, X. Hu, W. Hulsbergen, R. J. Hunter, D. Hutchcroft, M. Idzik, P. Ilten, A. Iohner, H. Jage, S. J. Jaimes Elles, S. Jakobsen, T. Jakoubek, E. Jans, A. Jawahery, C. Jayaweera, A. Jelavic, V. Jevtic, Z. Jia, E. Jiang, X. Jiang, Y. Jiang, Y. J. Jiang, E. Jimenez Moya, N. Jindal, M. John, A. John Rubesh Rajan, D. Johnson, C. R. Jones, S. Joshi, B. Jost, J. Juan Castella, N. Jurik, I. Juszczak, K. Kalecinska, D. Kaminaris, S. Kandybei, M. Kane, Y. Kang, C. Kar, M. Karacson, A. Kauniskangas, J. W. Kautz, M. K. Kazanecki, F. Keizer, M. Kenzie, T. Ketel, B. Khanji, S. Kholodenko, G. Khreich, F. Kiraz, T. Kirn, V. S. Kirsebom, N. Kleijne, A. Kleimenova, D. K. Klekots, K. Klimaszewski, M. R. Kmiec, T. Knospe, R. Kolb, S. Koliiev, L. Kolk, A. Konoplyannikov, P. Kopciewicz, P. Koppenburg, A. Korchin, I. Kostiuk, O. Kot, S. Kotriakhova, E. Kowalczyk, O. Kravcov, M. Kreps, W. Krupa, W. Krzemien, O. Kshyvanskyi, S. Kubis, M. Kucharczyk, A. Kupsc, V. Kushnir, B. Kutsenko, J. Kvapil, I. Kyryllin, D. Lacarrere, P. Laguarta Gonzalez, A. Lai, A. Lampis, D. Lancierini, C. Landesa Gomez, J. J. Lane, G. Lanfranchi, C. Langenbruch, T. Latham, F. Lazzari, C. Lazzeroni, R. Le Gac, H. Lee, R. Lefèvre, M. Lehuraux, E. Lemos Cid, O. Leroy, T. Lesiak, E. D. Lesser, B. Leverington, A. Li, C. Li, C. Li, H. Li, J. Li, K. Li, L. Li, P. Li, P. -R. Li, Q. Li, T. Li, T. Li, Y. Li, Y. Li, Y. Li, Z. Lian, Q. Liang, X. Liang, Z. Liang, S. Libralon, A. Lightbody, T. Lin, R. Lindner, H. Linton, R. Litvinov, D. Liu, F. L. Liu, G. Liu, K. Liu, S. Liu, W. Liu, Y. Liu, Y. Liu, Y. L. Liu, G. Loachamin Ordonez, I. Lobo, A. Lobo Salvia, A. Loi, T. Long, F. C. L. Lopes, J. H. Lopes, A. Lopez Huertas, C. Lopez Iribarnegaray, Q. Lu, C. Lucarelli, D. Lucchesi, M. Lucio Martinez, Y. Luo, A. Lupato, M. Lupberger, E. Luppi, K. Lynch, S. Lyu, X. -R. Lyu, H. Ma, S. Maccolini, F. Machefert, F. Maciuc, B. Mack, I. Mackay, L. M. Mackey, L. R. Madhan Mohan, M. J. Madurai, D. Magdalinski, J. J. Malczewski, S. Malde, L. Malentacca, G. Manca, G. Mancinelli, C. Mancuso, R. Manera Escalero, A. Mangalasseri, F. M. Manganella, D. Manuzzi, S. Mao, D. Marangotto, J. F. Marchand, R. Marchevski, U. Marconi, E. Mariani, S. Mariani, C. Marin Benito, J. Marks, A. M. Marshall, L. Martel, G. Martelli, G. Martellotti, L. Martinazzoli, M. Martinelli, C. Martinez, D. Martinez Gomez, D. Martinez Santos, F. Martinez Vidal, A. Martorell i Granollers, A. Massafferri, R. Matev, A. Mathad, C. Matteuzzi, K. R. Mattioli, A. Mauri, E. Maurice, J. Mauricio, P. Mayencourt, J. Mazorra de Cos, M. Mazurek, D. Mazzanti Tarancon, M. McCann, N. T. McHugh, A. McNab, R. McNulty, B. Meadows, D. Melnychuk, D. Mendoza Granada, P. Menendez Valdes Perez, F. M. Meng, M. Merk, A. Merli, L. Meyer Garcia, D. Miao, H. Miao, M. Mikhasenko, D. A. Milanes, A. Minotti, E. Minucci, B. Mitreska, D. S. Mitzel, R. Mocanu, A. Modak, L. Moeser, R. D. Moise, E. F. Molina Cardenas, T. Mombächer, M. Monk, T. Monnard, S. Monteil, A. Morcillo Gomez, G. Morello, M. J. Morello, M. P. Morgenthaler, A. Moro, J. Moron, W. Morren, A. B. Morris, A. G. Morris, R. Mountain, Z. Mu, N. Muangkod, E. Muhammad, F. Muheim, M. Mulder, K. Müller, F. Muñoz-Rojas, V. Mytrochenko, P. Naik, T. Nakada, R. Nandakumar, G. Napoletano, I. Nasteva, M. Needham, N. Neri, S. Neubert, N. Neufeld, J. Nicolini, D. Nicotra, E. M. Niel, L. Nisi, Q. Niu, B. K. Njoki, P. Nogarolli, P. Nogga, C. Normand, J. Novoa Fernandez, G. Nowak, H. N. Nur, A. Oblakowska-Mucha, T. Oeser, O. Okhrimenko, R. Oldeman, F. Oliva, E. Olivart Pino, M. Olocco, R. H. O'Neil, J. S. Ordonez Soto, D. Osthues, J. M. Otalora Goicochea, P. Owen, A. Oyanguren, O. Ozcelik, F. Paciolla, A. Padee, K. O. Padeken, B. Pagare, T. Pajero, A. Palano, L. Palini, M. Palutan, C. Pan, X. Pan, S. Panebianco, S. Paniskaki, L. Paolucci, A. Papanestis, M. Pappagallo, L. L. Pappalardo, C. Pappenheimer, C. Parkes, D. Parmar, G. Passaleva, D. Passaro, A. Pastore, M. Patel, J. Patoc, C. Patrignani, A. Paul, C. J. Pawley, A. Pellegrino, J. Peng, X. Peng, M. Pepe Altarelli, S. Perazzini, H. Pereira Da Costa, M. Pereira Martinez, A. Pereiro Castro, C. Perez, P. Perret, A. Perrevoort, A. Perro, M. J. Peters, K. Petridis, A. Petrolini, S. Pezzulo, J. P. Pfaller, H. Pham, L. Pica, M. Piccini, L. Piccolo, B. Pietrzyk, R. N. Pilato, D. Pinci, F. Pisani, M. Pizzichemi, V. M. Placinta, M. Plo Casasus, T. Poeschl, F. Polci, M. Poli Lener, A. Poluektov, I. Polyakov, E. Polycarpo, S. Ponce, D. Popov, K. Popp, K. Prasanth, C. Prouve, D. Provenzano, V. Pugatch, A. Puicercus Gomez, G. Punzi, J. R. Pybus, Q. Qian, W. Qian, N. Qin, R. Quagliani, R. I. Rabadan Trejo, B. Rachwal, R. Racz, J. H. Rademacker, M. Rama, M. Ramírez García, V. Ramos De Oliveira, M. Ramos Pernas, M. S. Rangel, G. Raven, M. Rebollo De Miguel, F. Redi, J. Reich, F. Reiss, Z. Ren, P. K. Resmi, M. Ribalda Galvez, R. Ribatti, G. Ricart, D. Riccardi, S. Ricciardi, K. Richardson, M. Richardson-Slipper, F. Riehn, K. Rinnert, P. Robbe, G. Robertson, E. Rodrigues, A. Rodriguez Alvarez, E. Rodriguez Fernandez, J. A. Rodriguez Lopez, E. Rodriguez Rodriguez, J. Roensch, A. Rogovskiy, D. L. Rolf, P. Roloff, V. Romanovskiy, A. Romero Vidal, G. Romolini, F. Ronchetti, T. Rong, M. Rotondo, M. S. Rudolph, M. Ruiz Diaz, J. Ruiz Vidal, J. J. Saavedra-Arias, J. J. Saborido Silva, S. E. R. Sacha Emile R., D. Sahoo, N. Sahoo, B. Saitta, M. Salomoni, I. Sanderswood, R. Santacesaria, C. Santamarina Rios, M. Santimaria, L. Santoro, E. Santovetti, A. Saputi, A. Sarnatskiy, G. Sarpis, M. Sarpis, C. Satriano, A. Satta, M. Saur, H. Sazak, F. Sborzacchi, A. Scarabotto, S. Schael, S. Scherl, M. Schiller, H. Schindler, M. Schmelling, B. Schmidt, N. Schmidt, S. Schmitt, H. Schmitz, O. Schneider, A. Schopper, N. Schulte, M. H. Schune, G. Schwering, B. Sciascia, A. Sciuccati, G. Scriven, I. Segal, S. Sellam, M. Senghi Soares, A. Sergi, N. Serra, L. Sestini, B. Sevilla Sanjuan, Y. Shang, D. M. Shangase, R. S. Sharma, L. Shchutska, T. Shears, J. Shen, Z. Shen, S. Sheng, B. Shi, J. Shi, Q. Shi, W. S. Shi, E. Shmanin, R. Silva Coutinho, G. Simi, S. Simone, M. Singha, I. Siral, N. Skidmore, T. Skwarnicki, M. W. Slater, E. Smith, M. Smith, L. Soares Lavra, M. D. Sokoloff, F. J. P. Soler, A. Solomin, K. Solovieva, N. S. Sommerfeld, R. Song, Y. Song, Y. Song, Y. S. Song, F. L. Souza De Almeida, B. Souza De Paula, K. M. Sowa, E. Spadaro Norella, E. Spedicato, J. G. Speer, P. Spradlin, F. Stagni, M. Stahl, S. Stahl, S. Stanislaus, M. Stefaniak, O. Steinkamp, F. Suljik, J. Sun, J. Sun, L. Sun, M. Sun, D. Sundfeld, W. Sutcliffe, P. Svihra, V. Svintozelskyi, K. Swientek, F. Swystun, A. Szabelski, T. Szumlak, Y. Tan, Y. Tang, Y. T. Tang, M. D. Tat, J. A. Teijeiro Jimenez, F. Terzuoli, F. Teubert, E. Thomas, D. J. D. Thompson, A. R. Thomson-Strong, H. Tilquin, V. Tisserand, S. T'Jampens, M. Tobin, T. T. Todorov, L. Tomassetti, G. Tonani, X. Tong, T. Tork, L. Toscano, D. Y. Tou, C. Trippl, G. Tuci, N. Tuning, L. H. Uecker, A. Ukleja, A. Upadhyay, B. Urbach, A. Usachov, U. Uwer, V. Vagnoni, A. Vaitkevicius, V. Valcarce Cadenas, G. Valenti, N. Valls Canudas, J. van Eldik, H. Van Hecke, E. van Herwijnen, C. B. Van Hulse, R. Van Laak, M. van Veghel, G. Vasquez, R. Vazquez Gomez, P. Vazquez Regueiro, C. Vázquez Sierra, S. Vecchi, J. Velilla Serna, J. J. Velthuis, M. Veltri, A. Venkateswaran, M. Verdoglia, M. Vesterinen, W. Vetens, D. Vico Benet, P. Vidrier Villalba, M. Vieites Diaz, X. Vilasis-Cardona, E. Vilella Figueras, A. Villa, P. Vincent, B. Vivacqua, F. C. Volle, D. vom Bruch, K. Vos, C. Vrahas, J. Wagner, J. Walsh, N. Walter, E. J. Walton, G. Wan, A. Wang, B. Wang, C. Wang, G. Wang, H. Wang, J. Wang, J. Wang, J. Wang, J. Wang, M. Wang, N. W. Wang, R. Wang, X. Wang, X. Wang, X. Wang, X. W. Wang, Y. Wang, Y. Wang, Y. H. Wang, Z. Wang, Z. Wang, J. A. Ward, M. Waterlaat, N. K. Watson, D. Websdale, Y. Wei, Z. Weida, J. Wendel, B. D. C. Westhenry, C. White, M. Whitehead, E. Whiter, A. R. Wiederhold, D. Wiedner, M. A. Wiegertjes, C. Wild, G. Wilkinson, M. K. Wilkinson, M. Williams, M. J. Williams, M. R. J. Williams, R. Williams, S. Williams, Z. Williams, F. F. Wilson, M. Winn, W. Wislicki, M. Witek, L. Witola, T. Wolf, E. Wood, G. Wormser, S. A. Wotton, H. Wu, J. Wu, X. Wu, Y. Wu, Z. Wu, K. Wyllie, S. Xian, Z. Xiang, Y. Xie, T. X. Xing, A. Xu, L. Xu, M. Xu, R. Xu, Z. Xu, Z. Xu, Z. Xu, Z. Xu, S. Yadav, K. Yang, X. Yang, Y. Yang, Y. Yang, Z. Yang, Z. Yang, H. Yeung, H. Yin, X. Yin, C. Y. Yu, J. Yu, X. Yuan, Y Yuan, J. A. Zamora Saa, M. Zavertyaev, M. Zdybal, F. Zenesini, C. Zeng, M. Zeng, S. H Zeng, C. Zhang, D. Zhang, J. Zhang, L. Zhang, R. Zhang, S. Zhang, S. L. Zhang, Y. Zhang, Z. Zhang, J. Zhao, Y. Zhao, A. Zhelezov, S. Z. Zheng, X. Z. Zheng, Y. Zheng, T. Zhou, X. Zhou, V. Zhovkovska, L. Z. Zhu, X. Zhu, X. Zhu, Y. Zhu, V. Zhukov, J. Zhuo, D. Zuliani, G. Zunica

AI总结 本文利用LHCb实验在Run 1和Run 2期间采集的质子-质子对撞数据，对$\overline{B}^0 \to \overline{K}^{*0}μ^+μ^-$衰变中的$C\!P$破坏进行了搜索，总积分亮度为8.4 fb$^{-1}$。研究通过分析衰变的完整角分布，提高了对矢量和轴矢量贡献中$C\!P$破坏效应的灵敏度，并利用未分箱的最大似然拟合方法，在弱有效理论框架下确定了复数威尔逊系数，涵盖了整个双μ子质量谱的非局部强相互作用幅。相比以往测量，该研究将$C\!P$破坏可观测量的精度提升了约一个数量级，且未观测到显著的$C\!P$破坏信号，结果与标准模型一致。

Comments All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/4315/ (LHCb public pages)

详情
英文摘要

A search for $C\!P$ violation in the $\overline{B}^0 \to \overline{K}^{*0}μ^+μ^-$ decay is performed using proton--proton collision data collected by the LHCb experiment during Run 1 and Run 2, corresponding to an integrated luminosity of 8.4 fb$^{-1}$. The analysis exploits the full angular distribution of the decay, providing sensitivity to $C\!P$-violating effects in both vector and axial-vector contributions to this flavour-changing neutral-current process. The complex Wilson coefficients are determined within the Weak Effective Theory through an unbinned maximum-likelihood fit to the angular observables, incorporating nonlocal hadronic amplitudes across the full dimuon mass spectrum. The precision of the $C\!P$-violation observables is improved by an order of magnitude relative to previous measurements, with the imaginary parts of the Wilson coefficients now determined more precisely than the real parts. No significant $C\!P$ violation is observed, and the results are consistent with Standard Model.

URL PDF HTML ☆
赞 0 踩 0
2605.07580 2026-05-11 math.CA math-ph math.AP math.CV math.MP math.NT

On ratios of theta functions

Senping Luo, Juncheng Wei

AI总结 本文研究了theta函数和Epstein zeta函数的比值，旨在分类这些比值的极小值或极大值点，并发现六边形晶格在其中起关键作用。研究结果在共形场论和Liouville场论中具有直接应用，并对晶体结构和相互作用粒子理论中的数学问题提供了新的见解。

Comments All comments are welcome. 29 pages, 2 figures

详情
英文摘要

Motivated by the average partition function of c free bosons $($Afhkami-Jeddi et al. \cite{Afhk2021}$)$ and the average of the genus 1 partition function over the Narain moduli space $($Maloney-Witten \cite{Witten2020}$)$, we investigate ratios of theta functions. In this paper, we completely classify the minimizers (or maximizers) for ratios of theta and Epstein zeta functions. We find that the hexagonal lattice plays a pivotal role there. These results have direct applications in conformal and Liouville field theory via partition functions. Additionally, they yield the minima of differences of theta and Epstein zeta functions, which have implications for the mathematics of crystallization and interacting particle theory (\cite{Bet2016,Bet2019AMP}).

URL PDF HTML ☆
赞 0 踩 0
2605.07578 2026-05-11 hep-ph nucl-ex nucl-th

Light-Ion Collisions: Bridging Small and Large QCD Systems

Aleksas Mazeliauskas

AI总结 在LHC上进行的轻离子碰撞实验填补了质子-质子小系统与重离子大系统之间的空白，为研究QCD集体现象的起始提供了独特平台。2025年7月首次开展的轻离子碰撞实验包括质子-氧、氧-氧和氖-氖碰撞，初步实验结果表明这些小系统中可能存在夸克-胶子等离子体。该研究综述了轻离子碰撞的动机及初步实验结果，连接了微扰QCD、高温QCD和低能核结构物理等多个领域。

Comments 4 pages, 2 figures, contribution to the 2026 QCD session of the 60th Rencontres de Moriond

详情
英文摘要

Light-ion collisions at the LHC bridge the gap between small proton-proton and large heavy-ion collision systems, providing a unique laboratory to study the onset of QCD collective phenomena. The first light-ion run at the LHC took place July~1--9, 2025, with proton-oxygen (pO), oxygen-oxygen (OO), and neon-neon (NeNe) collisions. Early experimental results provide strong evidence of quark-gluon plasma (QGP) formation in these small systems. I review the motivation for the light-ion collisions and the first experimental results, connecting perturbative QCD, hot QCD, and low-energy nuclear structure physics.

URL PDF HTML ☆
赞 0 踩 0
2605.07576 2026-05-11 math.NA cs.NA

On structure-preserving and pointwise conservative continuous DG schemes for hyperbolic systems

Rémi Abgrall, Michael Dumbser, Pierre-Henri Maire, Enrico Zampa

AI总结 本文提出了一类适用于非结构化网格的结构保持且逐点守恒的连续-间断有限元格式，用于求解线性和非线性双曲型偏微分方程组。该方法通过结合两类兼容的近似空间，实现了全局和局部的守恒性、离散层面的向量微分恒等式精确满足以及能量守恒等关键性质。该格式在保持数值稳定性的同时，适用于多种双曲系统，并通过数学证明和数值实验验证了其有效性。

详情
英文摘要

We present a new class of structure-preserving semi-discrete continuous-discontinuous Galerkin (CG-DG) finite element schemes for linear and nonlinear hyperbolic systems of partial differential equations on unstructured simplex meshes that automatically satisfy the following properties: i) the new schemes are not only cellwise conservative, but also locally pointwise conservative everywhere, hence they satisfy the integral form of the conservation law on arbitrary control volumes that do not have to coincide with the mesh at all; ii) the new methods naturally satisfy the two basic vector calculus identities $\nabla \cdot \nabla \times \mathbf{A}$ and $\nabla \times \nabla Z$ exactly pointwise locally and globally everywhere on the discrete level; iii) for linear symmetric hyperbolic systems the schemes are naturally energy conservative for the square energy, i.e. nonlinearly stable in the $L^2$ norm. The key ingredient of the new CG-DG schemes is the use of two different but compatible approximation spaces: the classical DG space $\mathcal{U}_h^N$ of discontinuous piecewise polynomials of degree up to $N$ and a classical finite element space $\mathcal{W}_h^{N+1}$ of globally continuous piecewise polynomials of degree $N+1$. In the new CG-DG schemes, the discrete solution $\mathbf{u}_h$ is sought in $\mathcal{U}_h^N$, while a suitable discrete flux field $\tilde{\mathbf{f}}_h$ is computed in $\mathcal{W}_h^{N+1}$. For $N=0$ our new schemes are directly related to cell-centered finite volume schemes with suitable vertex-based fluxes. All claimed properties of the schemes are first mathematically proven and are then also verified via suitable numerical tests. We show applications of our approach to three linear and nonlinear hyperbolic systems.

URL PDF HTML ☆
赞 0 踩 0
↑