arXivDaily arXiv每日学术速递 周一至周五更新
重置
全部学科分类 2071
2606.11481 2026-06-11 cond-mat.other 新提交

Synthetic Altermagnetism Beyond the Crystal Limit

超越晶体极限的合成交变磁性

Rodolfo A. Gallardo, Andrea M. León, Jürgen Lindner, Jhon W. González

AI总结 本文在连续介质平台上首次实验实现合成交变磁振子学,通过反铁磁耦合铁磁膜交替面内交换各向异性,再现了动量依赖分裂、节线方向和各向异性等频轮廓,并揭示了偶极相互作用和奇偶性依赖的重构效应。

Comments 12 pages, 4 figures, including Supplemental Material

详情
AI中文摘要

晶体材料中的交变磁振子表现出动量依赖的分裂,其节线结构和手性特征由磁子晶格旋转的点群对称性控制。在这里,我们展示了在由反铁磁耦合铁磁膜(具有交替面内交换各向异性)组成的连续介质平台上首次合成实现交变磁振子学,表明交变磁振子学的关键特征出现在晶体环境之外。通过求解偶极-交换框架下的线性化Landau-Lifshitz方程,我们证明该架构再现了A型交变磁体的特征动量依赖分裂、节线方向和各向异性等频轮廓。长程偶极相互作用通过提升名义节线简并性、混合相反手性模式,并在交换极限下为节线的方向上产生有限且厚度依赖的波矢分裂,从而定性重构了这一交换驱动的能谱。将双层膜扩展到有限多层膜表明,合成交变磁性经历奇偶性依赖的重构,将表面和体交变磁激发分离。这些结果确立了交变磁振子现象学作为超越微观晶体对称性的偶极-交换多层膜的可工程化集体响应。

英文摘要

Altermagnetic magnons in crystalline materials exhibit momentum-dependent splitting whose nodal structure and chiral character are governed by the point-group symmetry of the magnetic sublattice rotation. Here, we demonstrate the first synthetic realization of altermagnetic magnonics in a continuum platform composed of antiferromagnetically coupled ferromagnetic films with alternating in-plane exchange anisotropies, showing that the key signatures of altermagnetic magnonics emerge beyond the crystalline setting. Solving the linearized Landau-Lifshitz equation within a dipole-exchange framework, we show that this architecture reproduces the characteristic momentum-dependent splitting, nodal directions, and anisotropic isofrequency contours of A-type altermagnets. Long-range dipolar interactions qualitatively reconstruct this exchange-driven spectrum by lifting the nominal nodal degeneracy, hybridizing opposite-chirality modes, and producing a finite, thickness-dependent wave-vector splitting along directions that are nodal in the exchange-only limit. Extending the bilayer to finite multilayers reveals that synthetic altermagnetism undergoes a parity-dependent reconstruction that separates surface and bulk altermagnetic excitations. These results establish altermagnetic magnon phenomenology as an engineerable collective response of dipole-exchange multilayers beyond microscopic crystal symmetries.

2606.11479 2026-06-11 physics.med-ph 新提交

A Two-Stage Framework for Fast Proton Spot Map Generation in Pencil Beam Scanning Prostate SBRT Planning

一种用于笔束扫描前列腺SBRT计划中快速质子点图生成的两阶段框架

Xueyan Tang, Hok Wan Chan Tseung, Mark Pepin, Jiasen Ma, David M. Routman, Doug J. Moseley, Brandon Reber, Jed E. Johnson, Jing Qian

AI总结 提出GenSpot两阶段框架,利用物理信息投影质子点图表示,结合3D SwinUNETR预测和列非负Lasso回归重建,从CT和剂量生成可交付的质子点图,在单机构前列腺SBRT队列中实现与临床计划高度一致的蒙特卡洛剂量。

详情
AI中文摘要

背景:在笔束扫描(PBS)质子治疗中,治疗计划以质子点图(PSM)形式交付。尽管深度学习可以快速预测3D剂量,但将剂量直接转换为可交付的点模式仍然有限。目的:我们开发了GenSpot,一个两阶段框架,从CT和剂量推断可交付的PSM,并通过比较GenSpot和临床PSM的蒙特卡洛(MC)剂量在前列腺SBRT中进行评估。方法:GenSpot使用物理信息投影质子点图(PrPSM)表示,通过CT投影点,利用水等效厚度和PDD信息将点与CT/剂量网格对齐,同时保持与点权重的线性关系。数据集包括来自259个前列腺SBRT计划的1036个射野,按80%/10%/10%分为训练、验证和测试集。3D SwinUNETR从CT和剂量预测PrPSM。使用列非负Lasso回归和预计算的PDD曲线重建射野特定PSM。使用MAE、3D伽马分析和复合计划DVH指标比较GenSpot和临床MC剂量。结果:在测试集上,SwinUNETR的PrPSM MAE为0.06±0.02,与临床PrPSM高度相似。GenSpot MC剂量在非零剂量区域的MAE为0.07±0.03 Gy,射野级和计划级伽马通过率分别为0.90和0.97。靶区和危及器官的复合DVH差异在1 Gy以内,但CTV显示适度的高剂量增加。点复杂度与临床计划相似,点数量略多。预测和重建平均每射野耗时0.02秒和2.1秒。结论:GenSpot从CT和剂量生成机器可交付的PSM,其MC剂量在单机构前列腺SBRT队列中与临床PSM剂量紧密匹配。这种物理信息驱动的剂量到点框架可能支持自动化PBS计划和自适应再计划,有待更广泛的验证。

英文摘要

Background: In pencil beam scanning (PBS) proton therapy, plans are delivered as proton spot maps (PSMs). Although deep learning can rapidly predict 3D dose, direct conversion of dose into deliverable spot patterns remains limited. Purpose: We developed GenSpot, a two stage framework that infers deliverable PSMs from CT and dose, and evaluated it in prostate SBRT by comparing Monte Carlo (MC) doses from GenSpot and clinical PSMs. Methods: GenSpot uses a physics informed projected proton spot map (PrPSM) representation, projecting spots through CT with water equivalent thickness and PDD information to align spots with the CT/dose grid while preserving linearity with spot weights. The dataset included 1,036 fields from 259 prostate SBRT plans, split 80%/10%/10% for training, validation, and testing. A 3D SwinUNETR predicted PrPSMs from CT and dose. Field specific PSMs were reconstructed using column wise nonnegative Lasso regression with precomputed PDD curves. GenSpot and clinical MC doses were compared using MAE, 3D gamma analysis, and composite plan DVH metrics. Results: On the test set, SwinUNETR achieved PrPSM MAE of 0.06 +/- 0.02 with high similarity to clinical PrPSMs. GenSpot MC doses showed low MAE of 0.07 +/- 0.03 Gy in the nonzero dose region and gamma passing rates of 0.90 at the field level and 0.97 at plan level. Composite DVH differences were within 1 Gy for targets and organs at risk, though the CTV showed a modest high dose increase. Spot complexity was similar to clinical plans, with slightly more spots. Prediction and reconstruction averaged 0.02 s and 2.1 s/field. Conclusions: GenSpot generated machine deliverable PSMs from CT and dose whose MC doses closely matched clinical PSM doses in a single institution prostate SBRT cohort. This physics informed dose to spots framework may support automated PBS planning and adaptive replanning, pending broader validation.

2606.11478 2026-06-11 quant-ph cs.NA math.NA 新提交

PHASE: Pauli Hierarchical Assembly on Subdivided Elements for Quantum-Compatible Operator Synthesis

PHASE: 基于细分元素的泡利层次化组装实现量子兼容算子合成

Tillman Philo, Caglar Oskay

AI总结 提出PHASE算法,利用递归网格划分和混合策略,将有限元刚度矩阵的泡利分解复杂度从指数级降低到维度依赖的更低指数级,实现大规模量子兼容算子合成。

详情
AI中文摘要

将有限元刚度矩阵高效分解为泡利基是一项挑战,因为泡利字符串随问题规模呈指数增长。朴素的泡利展开需要$\Theta(8^{\lceil \log_2 N \rceil})$次操作,其中$N$表示自由度数量,使得直接分解对于大规模系统不可行。现有方法利用代数稀疏性或算子结构,但未纳入有限元离散化固有的几何组织,因此对于刚度矩阵的扩展性较差。为解决此问题,我们引入PHASE,一种层次化、几何感知的泡利分解算法,利用递归网格划分在多个空间尺度上组织单元贡献。PHASE采用混合策略,结合全空间和约化空间的张量化泡利分解与基于快速沃尔什-哈达玛变换的聚合,高效组装全局泡利系数。我们表明,与现有方法相比,该方法在泡利组装的渐近复杂度指数上实现了维度相关的降低,在标准网格正则性和平衡划分假设下,将成本从$2^{2{\lceil \log_2 N \rceil}}$降至$2^{\gamma_d{\lceil \log_2 N \rceil}}$,其中$\gamma_d < 2$。这些结果显著提高了大规模有限元模型的量子兼容算子合成的可行性。

英文摘要

Efficiently decomposing finite element stiffness matrices into the Pauli basis is challenging due to the exponential growth of Pauli strings with problem size. A naive Pauli expansion requires $Θ(8^{\lceil \log_2 N \rceil})$ operations, where $N$ denotes the number of degrees of freedom, rendering direct decomposition infeasible for large systems. Existing approaches exploit algebraic sparsity or operator structure but do not incorporate the geometric organization intrinsic to finite element discretizations, and consequently exhibit poor scaling for stiffness matrices. To address this problem, we introduce PHASE, a hierarchical, geometry-aware Pauli decomposition algorithm that leverages recursive mesh partitioning to organize element contributions across multiple spatial scales. PHASE employs a hybrid strategy that combines full- and reduced-space Tensorized Pauli Decomposition with Fast Walsh-Hadamard Transform-based aggregation to assemble global Pauli coefficients efficiently. We show that this approach yields a dimension-dependent reduction in the exponential scaling exponent of Pauli assembly asymptotic complexity relative to existing methods, reducing the cost from $2^{2{\lceil \log_2 N \rceil}}$ to $2^{γ_d{\lceil \log_2 N \rceil}}$ with $γ_d < 2$ under standard mesh regularity and balanced partition assumptions. These results substantially improve the feasibility of quantum-compatible operator synthesis for large-scale finite element models.

2606.11476 2026-06-11 cs.SE 新提交

SentTrack: Sentiment-Driven Bottleneck Detection in GitHub Issue Repositories

SentTrack: GitHub问题仓库中情感驱动的瓶颈检测

Xinyu Hu, Ali Behbahani, Daniel Moon, Yaren Dogan, Nasir U. Eisty

AI总结 提出SentTrack双管道框架,结合大语言模型摘要与ABCDE交互分类,从约9000个GitHub问题线程中检测社会技术瓶颈,发现49%线程停滞,仅13%解决,并通过加权评分引擎优先处理高摩擦讨论。

详情
AI中文摘要

软件工程团队越来越依赖GitHub问题线程来协调工作、报告错误和协商技术决策,然而大多数仓库健康工具专注于代码指标,忽略了推动或阻碍开发的对话动态。本文提出SentTrack,一个双镜头框架,用于从GitHub问题讨论中检测社会技术瓶颈。应用于AvaloniaUI开源仓库的大约9000个问题线程,该框架解决了三个问题:如何从实时对话数据中自动化工作流低效检测,情感信号是否能比传统的基于标签的方法更早地暴露风险,以及如何在混合媒体问题文本中隔离人类叙述与机器生成的噪声。SentTrack结合了两个互补的管道。水平管道使用大语言模型将原始问题报告翻译成干净的摘要,提取中层关注短语,并通过UMAP和HDBSCAN进行聚类,从处理的前3608个问题中产生613个语义簇。垂直管道应用ABCDE协作交互框架对每条评论进行分类并推断线程级结果。在整个语料库中,49%的线程以停滞结束,只有13%达到解决,其中解决差距被确定为主要的瓶颈信号。一个结合消极性、停滞、解决差距和线程长度的加权评分引擎,为维护者提供了一个可解释的优先级工具,用于在开发停滞之前处理高摩擦讨论。

英文摘要

Software engineering teams increasingly depend on GitHub issue threads to coordinate work, report bugs, and negotiate technical decisions, yet most repository health tools focus on code metrics and ignore the conversational dynamics that drive or stall development. This paper presents SentTrack, a dual-lens framework for detecting socio-technical bottlenecks from GitHub issue discussions. Applied to the AvaloniaUI open-source repository across approximately 9,000 issue threads, the framework addresses three questions: how to automate workflow-inefficiency detection from real-time conversational data, whether sentiment signals can surface risk earlier than traditional label-based methods, and how to isolate human narrative from machine-generated noise in mixed-media issue text. SentTrack combines two complementary pipelines. A horizontal pipeline translates raw issue reports into clean summaries using a large language model, extracts mid-level concern phrases, and clusters them through UMAP and HDBSCAN, producing 613 semantic clusters from the first 3,608 issues processed. A vertical pipeline applies the ABCDE collaborative interaction framework to classify each comment and infer thread-level outcomes. Across the full corpus, 49\% of threads ended in stagnation and only 13\% reached resolution, with the resolution gap identified as the dominant bottleneck signal. A weighted scoring engine that combines negativity, stagnation, resolution gap, and thread length gives maintainers an interpretable prioritization tool for high-friction discussions before they stall development.

2606.11475 2026-06-11 quant-ph cs.NA math.NA 新提交

Linear Combination of Hamiltonian Simulation with Commutator Scaling

哈密顿模拟的线性组合与交换子缩放

Junaid Aftab, Dong An, Konstantina Trivisa

AI总结 本文提出基于交换子敏感的哈密顿模拟线性组合框架,通过多乘积公式实现耗散线性动力学模拟,分析求积规则对误差和查询复杂度的影响,并应用于分数扩散、对流扩散和开放量子系统。

Comments 45+15 pages. Comments are welcome

详情
AI中文摘要

哈密顿模拟的线性组合(LCHS)框架通过将时间演化表示为酉算子上的积分来模拟耗散线性动力学,该积分通过求积离散化并通过哈密顿模拟实现。虽然现有分析使用耗散生成器的范数量实现了时间和精度上的近最优缩放,但我们表明,使用多乘积公式(MPF)实现哈密顿模拟步骤会产生交换子敏感的误差和复杂度界限。我们证明了求积规则不仅影响离散化误差,还影响交换子结构和查询复杂度。这种依赖性通过后求积分析对抽象MPF误差轮廓以及使用已知交换子敏感MPF误差估计的一般时间无关和局部哈密顿量进行了量化。我们比较了均匀梯形和自由尺度sinh-sinh求积,表明后者在求积基数缩放上有所改进,并通过分数扩散、对流扩散和开放量子系统的应用说明了该框架。

英文摘要

The Linear Combination of Hamiltonian Simulation (LCHS) framework simulates dissipative linear dynamics by representing time evolution as an integral over unitary operators, which is discretized by quadrature and implemented via Hamiltonian simulation. While existing analyses achieve near-optimal scaling in time and precision using norm-based quantities of the dissipative generator, we show that implementing the Hamiltonian simulation steps with Multi-Product Formulas (MPFs) yields commutator-sensitive error and complexity bounds. We demonstrate that the quadrature rule affects not only discretization error but also commutator structure and query complexity. This dependence is quantified through post-quadrature analysis for abstract MPF error profiles and for general time-independent and local Hamiltonians using known commutator-sensitive MPF error estimates. We compare uniform trapezoidal and free-scale sinh--sinh quadrature, showing improved quadrature-cardinality scaling for the latter, and illustrate the framework with applications to fractional diffusion, advection--diffusion, and open quantum systems.

2606.11472 2026-06-11 hep-th 新提交

Supersymmetry bicomplex of pure spinor AdS background

纯旋量AdS背景的超对称双复形

Thiago Oliveira Ferreira, Andrei Mikhailov

AI总结 本文通过BRST算子与李上同调微分构成的双复形及其谱序列,研究AdS超对称代数在AdS₅×S⁵无穷小形变表示上的结构,特别澄清了鬼数三零模的结构。

Comments 32 pages

详情
AI中文摘要

AdS₅×S⁵的无穷小形变构成AdS超对称代数的一个表示。该表示的结构尚未在文献中完全描述。仅从形变空间是幂零BRST算子的上同调这一事实,即可获得一些信息。我们可以考虑由BRST算子和李上同调微分构成的双复形及其两个谱序列。它们的匹配对表示的结构施加了一些约束,本文开始探索这些约束。特别地,我们澄清了鬼数三零模的结构。

英文摘要

Infinitesimal deformations of $\text{AdS}_5 \times \mathbb{S}^5$ form a representation of the AdS supersymmetry algebra. The structure of this representation has not yet been completely described in the literature. Some information can be obtained just from the fact that the space of deformations is the cohomology of a nilpotent BRST operator. We can consider the bicomplex formed by the BRST operator and the Lie cohomology differential, and its two spectral sequences. Their matching imposes some constraints on the structure of representations, which we start exploring in this paper. In particular, we clarify the structure of ghost number three zero modes.

2606.11468 2026-06-11 quant-ph cs.IT math.IT 新提交

Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search

基于束搜索的纠缠辅助量子LDPC码编码器电路优化

Aditya Sodhani, Pavan Kumar, Shayan Srinivasa Garani, Keshab K. Parhi

AI总结 提出用束搜索算法优化纠缠辅助量子QC-LDPC码的SKG编码器,通过GF(2)行操作减少CNOT门数量,在测试码族上实现7.3-34.0%的CNOT计数降低。

详情
AI中文摘要

纠缠辅助(EA)量子QC-LDPC码具有结构化的奇偶校验矩阵和强大的纠错能力,但其实际应用依赖于高效的编码器电路和预共享贝尔对(ebits)的可用性。在所有基于稳定子形式体系的编码器实现中,这种复杂性的主要贡献来自受控门的使用。在本文中,我们采用Sharma-Kumar-Garani(SKG)编码器构造。我们将编码器优化表述为在GF(2)行操作上的搜索,该操作分解从其CNOT子序列导出的二进制矩阵。我们使用由汉明距离启发式引导的束搜索算法来解决这个问题。对于测试的EA量子QC-LDPC码族,所提出的方法相对于SKG基线编码器实现了7.3-34.0%的CNOT计数减少。优化后的电路在所有测试实例上也比Patel-Markov-Hayes综合产生更低的CNOT计数,并通过稳定子表格模拟进行了验证。这些结果表明,对于结构化的EA QC-LDPC码,可以实现显著的编码器简化。

英文摘要

Entanglement-assisted (EA) quantum QC-LDPC codes offer strong error-correction capabilities with structured parity-check matrices, but their practical use depends on efficient encoder circuits and the availability of pre-shared Bell pairs (ebits). In all encoder implementations based on the stabilizer formalism, the dominant contribution to this complexity comes from the use of controlled gates. In this paper, we adopt the Sharma-Kumar-Garani (SKG) encoder construction. We formulate the encoder optimization as a search over GF(2) row operations that decompose the binary matrix derived from its CNOT sub-sequence. We solve this problem using a beam search algorithm guided by a Hamming-distance heuristic. For the tested EA quantum QC-LDPC code families, the proposed method achieves CNOT-count reductions of 7.3-34.0% relative to the SKG baseline encoder. The optimized circuits also yield lower CNOT counts than Patel-Markov-Hayes synthesis on all tested instances and are verified by stabilizer-tableau simulation. These results show that substantial encoder simplification is possible for structured EA QC-LDPC codes.

2606.11467 2026-06-11 math.AC 新提交

On the number of generators of licci ideals

关于licci理想的生成元数量

Craig Huneke, Claudia Polini, Bernd Ulrich

AI总结 本文证明了关于licci零维理想(单项式或Loewy余长度较小)的最小生成元数量的一个猜想。

详情
AI中文摘要

我们证明了关于licci零维理想(要么是单项式,要么具有较小的Loewy余长度)的最小生成元数量的一个猜想。

英文摘要

We prove a conjecture on the minimal number of generators of licci zero-dimensional ideals that are either monomial or have small Loewy colength.

2606.11465 2026-06-11 physics.med-ph 新提交

Planned, delivered and variable RBE dose difference analysis for a patient cohort with base-of-tongue cancer treated with IMPT

基于IMPT治疗的舌根癌患者队列的计划、递送和可变RBE剂量差异分析

Qianxia Wang, Edgar Gelover Reyes, Alex Stanforth, William Andrew LePain, Haijian Chen, Mingyao Zhu, Katja M. Langen, William Stokes, Soumon Rudra, Mark McDonald, James Edward Bates, Stella Flampouri

AI总结 针对舌根癌患者,分析质子治疗中计划剂量与递送剂量的差异,并探讨可变RBE剂量与恒定RBE 1.1的差异及其对计划评估的影响。

Comments 6 figures and tables

详情
AI中文摘要

背景:据我们所知,目前临床上尚无用于评估递送剂量与计划剂量差异的工具。对于头颈部患者而言,由于治疗周期长且进食困难,其解剖结构变化比其他部位更显著,因此这种差异可能较大。同时,可变RBE剂量是质子治疗中日益受到关注的问题。临床上广泛采用恒定RBE 1.1,但实际RBE在射程末端大于1.1。研究这些差异及其对计划评估的影响是一个有趣的课题。

英文摘要

Background: To our knowledge, no tools have been installed in clinic for delivered and planned dose differences evaluation. This difference could be large for head and neck patients who suffer the most anatomy changes compared with other treatment sites due to long treatment courses and difficulty in eating. At the same time, variable RBE dose is an increasing concern for proton therapy. The constant RBE 1.1 is widely applied in clinics, however, the real RBE is larger than 1.1 especially at the end of beam range. How they are different and what the influence on plan evaluation are an interesting topic to investigate.

2606.11462 2026-06-11 cs.SE 新提交

Defeater Cards: Characterizing and Managing Safety Assurance Case Defeaters

Defeater Cards: 表征和管理安全保证案例的击败者

Usman Gohar, Michael C. Hunter, Salil Purandare, Jordan J. Rios, Myra B. Cohen, Robyn R. Lutz

AI总结 提出Defeater Cards结构化文档,基于5W1H框架系统表征、推理和管理安全案例中的击败者,通过跨领域案例研究验证其暴露隐藏假设、发现推理缺口和支持持续演化的能力。

详情
AI中文摘要

安全保证案例提供结构化的论证,证明安全关键系统满足其安全要求。最近,击败者的概念作为挑战安全论证有效性的严格手段出现。击败者的例子可能包括过于严格的主张、不可靠的证据或推理缺口。然而,击败者仍然是临时的,缺乏对批判性反思的结构化支持,描述不一致,难以审查,并且缺乏文档标准。为了解决这个问题,我们提出了Defeater Cards,一种新的结构化文档工件,用于系统地表征、推理和管理安全案例中的击败者。通过文献调查和主题分析,我们基于5W1H框架确定了为卡片结构提供信息的文档标准。Defeater Cards旨在支持有根据的分析和演化,提高可追溯性和可审计性,并实现跨系统和产品变体的击败者知识重用。我们通过两个跨领域案例研究展示了它们的适用性,展示了它们如何暴露隐藏的假设、揭示推理缺口并支持持续的安全保证案例演化。为了支持采用和社区重用,我们还发布了一个开源击败者卡片库,作为研究人员和从业者可以构建和描述经验教训的基线。

英文摘要

Safety assurance cases provide structured justifications that safety-critical systems meet their safety requirements. Recently, the notion of defeaters has emerged as a rigorous means of challenging the validity of safety arguments. Examples of defeaters might include overly strict claims, unreliable evidence, or reasoning gaps. However, defeaters remain ad hoc, lack structured support for critical reflection, are inconsistently described, are difficult to review, and lack documentation standards. To address this, we propose Defeater Cards, a new structured documentation artifact for systematically characterizing, reasoning about, and managing defeaters in safety cases. Drawing on a literature survey and thematic analysis, we identify documentation criteria that inform the card's structure, based on the 5W1H framework. Defeater Cards are designed to support informed analysis and evolution, improve traceability and auditability, and enable the reuse of defeater knowledge across systems and product variants. We demonstrate their applicability through two cross-domain case studies, showing how they expose hidden assumptions, surface reasoning gaps, and support ongoing safety assurance case evolution. To support adoption and community reuse, we also release an open-source repository of defeater cards as a baseline upon which researchers and practitioners can build and describe lessons learned.

2606.11461 2026-06-11 math.GR 新提交

Substitution groups of formal power series

形式幂级数的代换群

Agustín D'Alessandro, Fernando Szechtman

AI总结 研究特征为p的交换环上形式幂级数在代换下构成的群G,计算了其子群K_r在截断多项式群G_n中像的指数,并给出了实现该指数的元素族。

详情
AI中文摘要

设$G$是形式幂级数$x+a_2x^2+a_3x^3+\cdots\in R[[x]]$在代换下构成的群,其中$R$是特征为素数$p$的交换环且$1\neq 0$。对任意$n\geq 1$,子群$K_n=\{x+a_{n+1}x^{n+1}+a_{n+2}x^{n+2}+\cdots\\,|\\, a_i\in R\}$是$G$的正规子群,商群$G_n=G/K_n$是$R$上次数$\leq n$的截断多项式在代换下构成的群。本文计算了所有$r,n\geq 1$时$K_r$在$G_n$中像的指数,并在每种情况下给出了实现该指数的一个元素族。

英文摘要

Let $G$ be the group of power series $x+a_2x^2+a_3x^3+\cdots\in R[[x]]$ under substitution, where $R$ is a commutative ring with $1\neq 0$ of prime characteristic $p$. Given any $n\geq 1$, the subgroup $K_n=\{x+a_{n+1}x^{n+1}+a_{n+2}x^{n+2}+\cdots\,|\, a_i\in R\}$ is normal in $G$, and the quotient $G_n=G/K_n$ is the group of truncated polynomials over $R$ of degree $\leq n$ under substitution. In this paper, we compute the exponent of the image of $K_r$ in $G_n$, for all $r,n\geq 1$, indicating in every case a family of elements realizing this exponent.

2606.11460 2026-06-11 math.AG math.NT 新提交

Answer to a decomposition question on tori raised by Colliot-Thélène and Sansuc

回答Colliot-Thélène和Sansuc提出的关于环面的分解问题

Anis Zidani

AI总结 本文通过简单策略否定回答了Colliot-Thélène和Sansuc在1987年提出的环面分解问题,并构造了一个Q上的环面T和素数p,使得T(Z_p)T(Q) ≠ T(Q_p)。

Comments Both English and French version are included

详情
AI中文摘要

本文的目的是提出一个简单策略,否定回答Colliot-Thélène和Sansuc在1987年文章《Flasque环面上的主齐性空间:应用》中提出的关于环面的分解问题。然后我们推导出一个Q上的环面T和一个素数p,使得T(Z_p)T(Q) ≠ T(Q_p),其中T(Z_p)表示T(Q_p)的最大紧子群。

英文摘要

The aim of this note is to present a simple strategy to answer negatively a decomposition question on tori posed by Colliot-Thélène and Sansuc in the article \textit{Principal Homogeneous Spaces under Flasque Tori: Applications} of 1987. We then deduce a torus $T$ over $\mathbb{Q}$ and a prime number $p$ such that $T(\mathbb{Z}_p)\,T(\mathbb{Q})\not=T(\mathbb{Q}_p)$, where $T(\mathbb{Z}_p)$ denotes the maximal compact subgroup of $T(\mathbb{Q}_p)$.

2606.11458 2026-06-11 nucl-th 新提交

New Developments in Light-Front Nuclear Structure

光前核结构的新进展

Dmitriy N. Kim

AI总结 针对高能实验需求,发展光前量子化框架下的相对论核结构理论,结合密度泛函与相似重整化群方法,成功再现核结合能、壳结构和短程关联,但指出纯核子描述无法完全解释包容性电子-核数据,表明非弹性末态相互作用的关键作用。

详情
AI中文摘要

受即将在杰斐逊实验室和电子-离子对撞机上开展的高能实验的推动,本论文发展了一种新颖的相对论核结构表述。虽然之前的散射模型已更新以包含核子-核子短程关联(SRCs)来解释截面平台,但现代高运动学实验需要相对论方法。我们将传统工具重新表述为光前量子化框架,利用密度泛函理论和相似重整化群技术。我们的计算成功再现了核结合能、壳结构和SRC物理。然而,我们表明纯核子描述无法完全捕捉包容性电子-核数据或高Bjorken-$x_B$处的平台。这证明了当前标准SRC现象学中省略的非弹性末态相互作用的关键重要性。

英文摘要

Motivated by forthcoming high-energy experiments at Jefferson Lab and the Electron-Ion Collider, this dissertation develops a novel relativistic formulation of nuclear structure. While previous scattering models were updated to include nucleon-nucleon short-range correlations (SRCs) to explain cross-section plateaus, modern high-kinematics experiments require a relativistic approach. We reformulate conventional tools into a light-front-quantized framework, utilizing density functional theory and similarity renormalization group techniques. Our calculations successfully reproduce nuclear binding energies, shell structure, and SRC physics. However, we show that a purely nucleonic description fails to fully capture inclusive electron-nucleus data or the plateaus at high Bjorken-$x_B$. This demonstrates the critical importance of inelastic final-state interactions currently omitted by standard SRC phenomenology.

2606.11457 2026-06-11 cs.CY 新提交

Investigating Gender Bias in Touch Biometrics

探究触摸生物识别中的性别偏见

Joshua Lee, Ben Khant, Rajesh Kumar

AI总结 本研究使用BBMAS和ANTAL数据集,通过XGBoost和DenseNet分类器评估滑动认证中的性别偏见,发现认证错误率无显著性别差异,表明滑动认证可公平可靠。

Comments 4 pages, 1 figure, 2 tables. Accepted for presentation at the Richard Tapia Conference (Tapia 2026)

详情
Journal ref
Proceedings of the Richard Tapia Conference (Tapia 2026)
AI中文摘要

行为生物识别为持续认证提供了一种有前景的方法,但其在不同人口群体中的公平性尚未得到充分探索。本文使用BBMAS(117名用户)和ANTAL(71名用户)数据集研究基于滑动的认证中的性别偏见,并通过错误接受率(FAR)和错误拒绝率(FRR)评估XGBoost和DenseNet分类器。XGBoost在BBMAS和ANTAL数据集上的认证准确率分别达到92%和94%,而统计检验(Kolmogorov-Smirnov、Mann-Whitney和Wasserstein置换检验)发现,在几乎所有实验设置中,认证错误率均无显著性别差异。这些发现表明,基于滑动的认证可以在保持高性能的同时,对男性和女性用户表现相当,支持其作为公平可靠的行为生物识别模态的潜力。

英文摘要

Behavioral biometrics offer a promising approach for continuous authentication, but their fairness across demographic groups remains largely unexplored. This paper investigates gender bias in swipe-based authentication using the BBMAS (117 users) and ANTAL (71 users) datasets and evaluates XGBoost and DenseNet classifiers through False Acceptance Rate (FAR) and False Rejection Rate (FRR). XGBoost achieved authentication accuracies of 92% and 94% on the BBMAS and ANTAL datasets, respectively, while statistical tests (Kolmogorov-Smirnov, Mann-Whitney, and Wasserstein permutation) found no significant gender differences in authentication error rates across almost all experimental settings. These findings suggest that swipe-based authentication can achieve high accuracy while maintaining comparable performance for male and female users, supporting its potential as a fair and reliable behavioral biometric modality.

2606.11455 2026-06-11 quant-ph 新提交

Planted-Solution Pauli Hamiltonians as a Quantum Benchmarking Primitive

植根解Pauli哈密顿量作为量子基准测试原语

Amir Kalev, Itay Hen

AI总结 提出一种具有精确已知基态能量的Pauli哈密顿量构造方法,用于基态能量估计算法的基准测试,通过嵌入块积态作为无挫局部子句的公共基态,并支持保持谱的Clifford共轭。

Comments 10 pages, 4 figures

详情
AI中文摘要

我们引入了一种具有精确已知基态能量的Pauli哈密顿量构造方法,旨在作为基态能量估计算法的参考实例。该构造嵌入一个块积态作为重叠支撑上无挫局部子句之和的同时基态,仅将所得模型暴露为Pauli算子的多项式大小线性组合,并允许保持谱的可选Clifford共轭。该框架将经典植根约束满足问题作为对角特例包含在内,提供了一个直接嵌入通道,通过该通道可以继承经典硬度性质。开源软件、认证密钥和示例实例已公开提供。

英文摘要

We introduce a construction of Pauli Hamiltonians with exactly known ground-state energies, intended as reference instances for ground-state energy estimation algorithms. The construction embeds a planted block-product state as the simultaneous ground state of a sum of frustration-free local clauses on overlapping supports, exposes the resulting model only as a polynomial-size linear combination of Pauli operators, and admits optional Clifford conjugation that preserves the spectrum. The framework subsumes classical planted constraint-satisfaction problems as a diagonal special case, providing a direct embedding channel through which classical hardness properties can be inherited. Open-source software, certification keys, and example instances are made publicly available.

2606.11454 2026-06-11 cs.IT math.IT 新提交

Lifted Gabidulin Construction for LDPC Representations of Finite Geometry Codes

有限几何码的LDPC表示的提升Gabidulin构造

Yifei Shen, Andreas Burg

AI总结 针对有限几何码的LDPC表示中稠密矩阵和短环问题,提出基于铅笔选择的稀疏化方法,利用提升Gabidulin码显式构造稀疏校验矩阵,仿真显示无错误平层且优于5G LDPC码。

详情
AI中文摘要

有限几何(FG)码结合了经典分组码的代数性质与低密度奇偶校验(LDPC)码的迭代置信传播(BP)解码能力。然而,由于$(\mu+1)$-平面与点之间的标准关联矩阵是稠密的,并且对于任何平面维度$\mu\geq 1$包含许多短环,这阻碍了在实践中同时利用这两种优势。在这项工作中,我们提出基于铅笔选择对解码矩阵进行稀疏化,将其表述为常维子空间堆积问题,并使用提升Gabidulin码显式求解。对于仿射几何和射影几何,我们构造了稀疏奇偶校验矩阵,并在长度达1024的FG码上进行了验证。对四个FG码的仿真显示,在块错误率为$10^{-7}$时,没有明显的错误平层,并且相比相应的5G LDPC码有约0.5 dB的增益。

英文摘要

Finite geometry (FG) codes combine the algebraic properties of classical block codes with the iterative belief propagation (BP) decoding ability of low-density parity-check~(LDPC) codes. However, exploiting both advantages in practice is hindered by the fact that the standard incidence matrix between $(μ+1)$-flats and points is dense and contains many short cycles for any flat dimension $μ\geq 1$. In this work, we propose to sparsify the decoding matrix based on pencil selection, formulated as a constant-dimension subspace packing problem and solved explicitly using lifted Gabidulin codes. For both affine and projective geometries, sparse parity-check matrices are constructed and verified for FG codes of lengths up to $1024$. Simulations on four FG codes show no visible error floor and around $0.5$~dB gain over corresponding 5G LDPC codes at a block error rate of $10^{-7}$.

2606.11453 2026-06-11 gr-qc hep-th 新提交

On phase-space singular surfaces in $f(R)$ gravity

关于 $f(R)$ 引力中相空间奇异曲面

Dražen Glavan, David M. J. Vokrouhlický

AI总结 对 Jordan 框架下的度规 $f(R)$ 引力进行哈密顿约束分析,发现正则约束分类在 $f'(R)=0$ 和 $f''(R)=0$ 的相空间奇异曲面上退化,并研究了这些曲面对微扰的影响。

Comments 27 pages, 3 figures, 7 tables

详情
AI中文摘要

我们对 Jordan 框架下的度规 $f(R)$ 引力进行了哈密顿约束分析,并表明正则约束分类在位于 $f'(R)=0$ 和 $f''(R)=0$ 的相空间奇异曲面上退化。然后我们研究了这些曲面的微扰含义。对于满足 $f(R)=0$ 和 $f'(R)=0$ 的精确背景,线性化谱为空;因此已知的纯 $R^2$ 结果是 $f(R)$ 引力中更一般退化性的特例。我们还表明,Starobinsky 模型中的 FLRW 轨迹可以穿过 $f'(R)=0$ 曲面,但在穿过时非均匀微扰会发展出退化的约束结构。由此产生的穿过条件更适合解释为微扰演化的正则性条件,而不是 Dirac-Bergmann 算法中的普通约束。综合这些结果,区分了完全位于奇异曲面上的背景与动态穿过奇异曲面的背景,并表明这两种情况导致不同的微扰退化性。

英文摘要

We perform a Hamiltonian constraint analysis of metric $f(R)$ gravity in the Jordan frame and show that the regular constraint classification degenerates on singular phase-space surfaces located at $f'(R)\!=\!0$ and $f''(R)\!=\!0$. We then study the perturbative implications of these surfaces. For exact backgrounds satisfying $f(R)\!=\!0$ and $f'(R)\!=\!0$, the linearized spectrum is empty; the known pure $R^2$ result is therefore a special case of a more general degeneracy in $f(R)$ gravity. We also show that FLRW trajectories in the Starobinsky model can cross the surface $f'(R)=0$, but that inhomogeneous perturbations develop a degenerate constraint structure at the crossing. The resulting crossing condition is better interpreted as a regularity condition for perturbative evolution than as an ordinary constraint within the Dirac--Bergmann algorithm. Together, these results distinguish backgrounds that lie entirely on a singular surface from backgrounds that cross one dynamically, and show that the two situations lead to different perturbative degeneracies.

2606.11452 2026-06-11 astro-ph.EP 新提交

Hydrodynamical Simulations of Resonant Breaking in Multi-Planet Systems via Rebound Migration During Disk Dispersal

多行星系统中通过盘消散期间的反弹迁移发生共振破裂的流体动力学模拟

Beibei Liu, Clément Baruteau, Zhaohuan Zhu, Ya-Ping Li, Sijme-Jan Paardekooper, Shigeru Ida

AI总结 通过二维流体动力学模拟,研究恒星X射线光蒸发驱动的内盘空洞扩张下,多行星系统的反弹向外迁移如何重塑行星架构,并导致共振破裂和非共振轨道。

Comments 10 pages, 9 figures, accepted for publication in A&A, animations on this link: https://github.com/bbliu-astro/movies/tree/main/hydrodynamic_rebound

详情
AI中文摘要

本研究将反弹向外迁移的研究扩展到靠近由恒星X射线光蒸发驱动的内膨胀盘空洞的多行星系统。使用二维流体动力学模拟,我们探索了质量从超级地球到木星的两颗和三颗行星系统在盘从内向外消散时的演化。我们的结果表明,在盘清除的最后阶段,反弹迁移可以显著重塑多行星架构。由于在空洞边缘附近的行星上施加的强正共转力矩,相邻行星的差异迁移可以打破共振配置并触发动力学不稳定性,产生具有加宽周期比的非共振轨道。然而,结果关键取决于行星质量和盘消散时标。在空洞扩张过快的低质量盘中,反弹迁移被抑制,系统倾向于保留共振链。这些发现表明,反弹机制可以为解释系外行星种群中普遍存在的宽间隔非共振架构提供一条令人信服的途径。

英文摘要

This study extends the investigation of rebound outward migration to multi-planet systems near an inner expanding disk cavity driven by stellar X-ray photoevaporation. Using 2D hydrodynamical simulations, we explore how systems of two and three planets that span masses from super-Earths to Jupiters evolve as the disk disperses from the inside out. Our results show that rebound migration can substantially reshape multi-planet architectures in the final stages of disk clearing. Owing to the strong, positive corotation torque exerted onto the planet near the cavity edge, divergent migration of the neighbouring planets can break resonant configurations and trigger dynamical instabilities, producing non-resonant orbits with widened period ratios. However, the outcome depends critically on planet mass and the disk dispersal timescale. In lower-mass disks where cavity expansion is too rapid, rebound migration is suppressed, and systems tend to preserve resonant chains. These findings suggest that the rebound mechanism can provide a compelling pathway to explain the prevalence of widely separated, non-resonant architecture observed in the exoplanet population.

2606.11451 2026-06-11 math.NT 新提交

Rankin--Selberg Subconvexity via Spectral Reciprocity

通过谱互反性得到的 Rankin--Selberg 次凸性

Peter Humphries, Liyang Yang

AI总结 本文通过改进 Michel 和 Venkatesh 的谱互反框架,建立了数域上 GL_2 酉尖自守表示对的 Rankin-Selberg L-函数中心值的显式次凸界,改进了所有已知结果,并应用于多个算术问题。

Comments 134 pages

详情
AI中文摘要

我们为与数域上 $\mathrm{GL}_2$ 的酉尖自守表示对 $\pi\times\pi'$ 相关的 Rankin--Selberg $L$-函数 $L(1/2,\pi\times\pi')$ 的中心值建立了显式的次凸界。基于 Michel 和 Venkatesh 的谱互反框架,我们发展了一个精细的、完全显式的谱互反形式,允许对导子和局部测试向量进行精确控制。作为结果,我们得到了一个显式的次凸界,即使在 $F=\mathbb{Q}$ 上,它也改进了所有先前已知的结果。我们进一步将这些界应用于几个算术问题,包括四元数 Shimura 簇上 CM 子轨道的有效等分布、全测地子流形的定量等分布、数域上二面体量子唯一遍历性的统一定量形式,以及区分尖自守表示的一个应用。

英文摘要

We establish explicit subconvex bounds for central values of Rankin--Selberg $L$-functions $L(1/2,π\timesπ')$ associated with pairs of unitary cuspidal automorphic representations of $\mathrm{GL}_2$ over a number field. Building on the spectral reciprocity framework of Michel and Venkatesh, we develop a refined, fully explicit form of spectral reciprocity that allows for precise control of conductors and local test vectors. As a consequence, we obtain an explicit subconvex bound, which, even over $F=\mathbb{Q}$, improves all previously known results. We further apply these bounds to several arithmetic problems. These include effective equidistribution of CM suborbits on quaternionic Shimura varieties, quantitative equidistribution of totally geodesic submanifolds, a uniform quantitative form of dihedral quantum unique ergodicity over number fields, and an application to distinguishing cuspidal automorphic representations.

2606.11449 2026-06-11 eess.SP 新提交

Coherent Multiband OFDM Sensing via Low-Complexity Gap Reconstruction

通过低复杂度间隙重建的相干多频带OFDM感知

Lorenzo Pucci, Leonardo Pucci, Andrea Giorgetti

AI总结 针对集成感知与通信中多频带OFDM感知的频谱间隙问题,提出一种低复杂度迭代重建方法,包含时域均衡和迭代切趾操作,在中等间隙下接近全频带性能,且复杂度与目标数无关。

Comments 6 pages; This paper was accepted for presentation at the IEEE PIMRC 2026

详情
AI中文摘要

本文研究了集成感知与通信(ISAC)框架内的相干多频带正交频分复用(OFDM)感知。我们考虑一种频带内配置,其中两个等宽感知子带在同一OFDM信道内对称分配,而中心部分仍可用于通信。我们解决了由频谱间隙引起的缺失频域样本的重建以及由此产生的延迟剖面中栅瓣的抑制问题。为此,我们提出了一种低复杂度迭代重建方法,包括初始延迟域均衡阶段和基于迭代切趾的算子,并强制执行数据一致性。多目标场景的性能结果表明,所提方法在中等间隙大小下保持接近全频带参考,仅因残余栅瓣在较大间隙下性能下降。与基于压缩感知的正交匹配追踪(OMP)基线相比,随着目标数量增加,尤其是在实际相关的低信噪比(SNR)区域,它表现出更有利的性能趋势,同时其复杂度缩放与估计的目标数量无关。

英文摘要

This paper investigates coherent multiband orthogonal frequency division multiplexing (OFDM) sensing within an integrated sensing and communication (ISAC) framework. We consider an intra-band configuration in which two sensing subbands of equal width are allocated symmetrically within the same OFDM channel, while the central portion remains available for communication. We address the reconstruction of missing frequency-domain samples induced by the spectral gap and the suppression of the resulting grating lobes in the delay profile. To this end, we propose a low-complexity iterative reconstruction method consisting of an initial delay-domain equalization stage and an iterative apodization-based operator with data-consistency enforcement. Performance results for multi-target scenarios show that the proposed approach remains close to the full-band reference for moderate gap sizes and degrades only for larger gaps because of residual grating lobes. Compared with the compressed-sensing-based orthogonal matching pursuit (OMP) baseline, it exhibits a more favorable performance trend as the number of targets increases, especially in the practically relevant low-signal-to-noise ratio (SNR) regime, while offering a complexity scaling that is independent of the estimated number of targets.

2606.11448 2026-06-11 cs.DS cs.CC cs.IT math.IT 新提交

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

布尔函数噪声查询复杂度的统一下界

Yuzhou Gu, Xin Li, Yinzhan Xu

AI总结 针对噪声查询模型,基于布尔超立方体子图的度统计,提出了布尔函数噪声查询复杂度的通用下界,统一并改进了现有结果,并解决了Gu、Li和Xu提出的开放问题。

Comments COLT 2026

详情
AI中文摘要

我们研究了Feige、Raghavan、Peleg和Upfal [SICOMP 1994] 引入的噪声查询模型中布尔函数 $f: \{0, 1\}^n \rightarrow \{0, 1\}$ 的查询复杂度。在该模型中,算法可以自适应地查询输入向量的比特,但每个查询结果以恒定概率 $p \in (0, 1/2)$ 独立翻转;允许重复查询。函数 $f$ 的噪声查询复杂度 $\mathsf{N}_p(f)$ 定义为在最坏情况输入 $x$ 下,以不超过 $1/3$ 的错误概率计算 $f(x)$ 所需的最小期望查询次数。我们基于布尔超立方体某些子图的度统计,证明了 $\mathsf{N}_p(f)$ 的一个通用下界。这是除了由简单观察 $\mathsf{N}_p(f)$ 不低于随机化查询复杂度所蕴含的下界之外的第一个通用下界。我们表明,该下界恢复了(在常数因子内)大多数先前已知的布尔函数噪声查询复杂度下界,为理解这些结果提供了一个统一框架,并在若干情况下简化了证明。此外,这肯定地回答了Gu、Li和Xu [COLT 2025] 的一个开放问题:$\mathsf{N}_p(f) = \Omega(\mathsf{I}(f) \log \mathsf{I}(f))$,其中 $\mathsf{I}(f)$ 表示 $f$ 的总影响。我们还应用我们的通用下界,为若干新函数获得了噪声查询复杂度的紧界。

英文摘要

We study the query complexity of Boolean functions $f: \{0, 1\}^n \rightarrow \{0, 1\}$ in the noisy query model introduced by Feige, Raghavan, Peleg and Upfal [SICOMP 1994]. In this model, an algorithm can adaptively query the bits of an input vector, but each query result is independently flipped with constant probability $p \in (0, 1/2)$; repeated queries are allowed. The noisy query complexity $\mathsf{N}_p(f)$ of a function $f$ is defined as the minimum expected number of queries needed to compute $f(x)$ with error probability at most $1/3$, for the worst case input $x$. We prove a general lower bound on $\mathsf{N}_p(f)$ based on degree statistics of certain subgraphs of the Boolean hypercube. This is the first general lower bound beyond those implied by the simple observation that $\mathsf{N}_p(f)$ is lower bounded by the randomized query complexity. We show that this recovers (up to a constant factor) most previously known lower bounds on the noisy query complexity of Boolean functions, providing a unified framework for understanding these results and simplifying the proofs in several cases. Furthermore, this resolves in the affirmative an open problem of Gu, Li and Xu [COLT 2025] that $\mathsf{N}_p(f) = Ω(\mathsf{I}(f) \log \mathsf{I}(f))$, where $\mathsf{I}(f)$ denotes the total influence of $f$. We also apply our general lower bound to obtain tight bounds on the noisy query complexity for several new functions.

2606.11444 2026-06-11 astro-ph.GA 新提交

Investigating the role of turbulence in the interstellar medium in $z\sim3$ dusty star-forming galaxies using kpc-resolution ALMA dust and gas maps

利用kpc分辨率的ALMA尘埃和气体图研究$z\sim3$尘埃恒星形成星系中星际介质湍流的作用

B. A. Westoby, J. A. Hodge, P. Sharda, P. E. Mancera Piña, M. Rybak, E. da Cunha, J. Li, I. Smail, A. M. Swinbank, A. Battisti, L. A. Boogaard, W. N. Brandt, G. Calistro Rivera, C. -C. Chen, P. Cox, M. Cracraft, H. Dannerbauer, R. Decarli, T. R. Greve, S. Kendrew, K. Knudsen, C. -L. Liao, J. van Marrewijk, O. Nayak, M. Neeleman, L. E. Rowland, E. Schinnerer, F. Walter, J. L. Wardlow, A. Weiss, P. van der Werf

AI总结 通过ALMA高分辨率CO观测和尘埃连续谱成像,发现三个$z\sim3$尘埃星系的气体分布比尘埃更延展,旋转盘模型拟合良好,且湍流在调节恒星形成中起核心作用。

详情
AI中文摘要

我们展示了ALESS巡天中三个$z\sim3$亚毫米选尘埃星系的高分辨率($\sim$0.25$^{\prime\prime}$/2 kpc)CO(5-4)和CO(4-3)观测。这些数据补充了现有的[亚]kpc尺度ALMA 870$\mu$m连续谱成像以及ALESS-JWST项目的JWST NIRCam和MIRI成像,使我们能够在相似空间尺度上追踪分子气体、尘埃遮蔽的恒星形成和恒星种群。我们光谱证认其中两个源处于相同红移且可能正在相互作用。我们发现分子气体分布大致遵循870$\mu$m尘埃连续谱成像中看到的尘埃恒星形成结构,但气体储库比尘埃发射显著更延展,其空间范围与静止框架近红外恒星发射相当。通过对两个最高信噪比源的运动学建模,我们发现这些星系很好地拟合了旋转盘模型,具有较高的有序运动与随机运动之比($V_{\rm{max}}/\overline{\sigma}=5\pm1$和$6\pm1$),尽管在当前灵敏度和空间分辨率下不能排除更小尺度的运动学偏差。最后,利用高分辨率870$\mu$m尘埃连续谱和CO数据,我们研究了这些高红移星系在kpc尺度上的恒星形成标度关系。假设恒定的CO-to-H$_2$转换因子和激发比,我们发现数据偏离了不考虑湍流的理论恒星形成关系预测,但与引力湍流模型一致,从而表明湍流在高红移恒星形成调节中起着核心作用。

英文摘要

We present ALMA high-resolution ($\sim$0.25$^{\prime\prime}$/2 kpc) CO(5-4) and CO(4-3) observations of three $z\sim 3$ submillimetre-selected dusty galaxies from the ALESS survey. These data complement existing [sub]-kpc scale ALMA 870$μ$m continuum imaging and JWST NIRCam and MIRI imaging from the ALESS-JWST program, allowing us to trace the molecular gas, dust-obscured star formation, and stellar populations on similar spatial scales. We spectroscopically confirm that two of the sources lie at the same redshift and are likely interacting. We find that the molecular-gas distribution broadly follows the dusty star-forming structures seen in the 870$μ$m dust continuum imaging, but that the gas reservoirs are significantly more extended than the dust emission with a spatial extent comparable to the rest-frame near-infrared stellar emission. By modeling the kinematics for the two highest signal-to-noise sources, we find that the galaxies are well-fit by rotating disc models with high ratios of ordered to random motion ($V_{\rm{max}}/\overlineσ=5\pm1$ and $6\pm1$), although smaller-scale kinematic deviations cannot be ruled out at the current sensitivity and spatial resolution. Finally, utilizing the high-resolution 870$μ$m dust continuum and CO data, we investigate star-formation scaling relations on kpc-scales in these high-redshift galaxies. Assuming a constant CO-to-H$_{2}$ conversion factor and excitation ratio, we find that the data are offset from theoretical star-formation relation predictions that do not take turbulence into account, but consistent with gravo-turbulent models, thereby suggesting that turbulence plays a central role in regulating star formation at high redshift.

2606.11443 2026-06-11 math.AC math.AG 新提交

Regularity is bounded on a quasi-excellent Noetherian scheme

拟优良诺特概形上的正则性有界

Alessandro De Stefani, Jack Jeffries, Nawaj KC, Luis Núñez-Betancourt

AI总结 本文证明拟优良诺特概形上切锥的梯度Betti表只有有限种可能,从而正则性有界。

详情
AI中文摘要

一个概形的点有一个关联的切锥,即一个标准分次代数的谱,它编码了局部奇点。其同调复杂性可以通过其梯度Betti表来衡量:一个记录多项式环上梯度极小自由分解部分结构的矩阵。一个自然的问题是,切锥的同调复杂性是否在概形上任意变化。在本文中,我们证明对于拟优良诺特概形并非如此;在这样的概形上,只能出现有限多种梯度Betti表。更一般地,我们证明拟优良诺特概形上的凝聚层只有有限多种梯度Betti表,并且梯度Betti表的常数轨迹是可构造的。一个直接推论是,拟优良诺特概形上的正则性有界。

英文摘要

A point of a scheme has an associated tangent cone, the spectrum of a standard graded algebra encoding the local singularity. Its homological complexity can be measured by its graded Betti table: a matrix that records a part of the structure of its graded, minimal free resolution over a polynomial ring. A natural question is whether the homological complexity of the tangent cones varies arbitrarily across a scheme. In this paper, we show that this is not the case for a quasi-excellent Noetherian scheme; over such schemes, only finitely many graded Betti tables can occur. More generally, we show that a coherent sheaf over a quasi-excellent Noetherian scheme admits finitely many graded Betti tables, and that the constancy loci for the graded Betti table are constructible. As an immediate consequence, regularity is bounded on a quasi-excellent Noetherian scheme.

2606.11442 2026-06-11 cs.SE cs.PL 新提交

Web-Native Graphical EMF Model Editors

Web原生图形化EMF模型编辑器

Susanne Göbel, Ralf Lämmel

AI总结 提出纯Web框架EMFular,基于Ecore模型自动生成图形编辑器,支持EMF一致性操作与Angular扩展,实现低代码生成、高可定制与无后端部署。

详情
AI中文摘要

图形化模型编辑正从桌面应用转向基于Web的工具。我们分析了现有框架的特点,并基于此推导出一组设计原则,这些原则意味着低成本的生成、广泛的定制可能性以及所生成编辑器的直接部署。在此基础上,我们引入了EMFular,一个纯基于Web的框架,用于管理EMF模型而无需任何后端。配套的EMFular生成器将给定的Ecore模型(一个EMF元模型)映射为即用型且可定制的图形编辑器。EMFular编辑器提供“EMF一致性”,即它们不仅支持标准建模操作,如创建、检查、导航、编辑和撤销/重做,而且还以与EMF紧密对齐的方式处理包含和反向引用;它们还通过与EMF兼容的序列化/反序列化提供与现有EMF工具的互操作性。生成的编辑器是一个Angular项目,具有指定的扩展点,允许开发人员利用Angular及其生态系统的表达能力,在EMFular扩展点的指导下,定制和扩展编辑器的所有方面。我们从编辑器充分性(可用的编辑能力)、适应性(定制机制和所需工作量)以及生成的鲁棒性三个方面评估了EMFular。

英文摘要

Graphical model editing is shifting from desktop applications to web-based tools. We analyze the characteristics of existing frameworks and, based on this analysis, we derive a set of design principles that imply low-effort generation, extensive customization possibilities, and straightforward deployment of the resulting editors. On these grounds, we introduce EMFular, a purely web-based framework for managing EMF models without any backend. The accompanying EMFular generator maps a given Ecore model (an EMF metamodel) to a ready-to-use and ready-to-customize graphical editor. EMFular editors provide 'EMF consistency', that is, they not only support standard modeling operations such as creation, inspection, navigation, editing, and undo/redo, but they also handle containment and inverse references in close alignment with EMF; they also provide interoperability with existing EMF tooling through compatible de-/serialization. A generated editor is an Angular project with designated extension points, which allows developers to customize and extend all aspects of the editor using the expressive power of Angular and its ecosystem, guided by the extension points of EMFular. We evaluate EMFular in terms of editor adequacy (available editing capabilities), adaptability (customization mechanisms and required effort), and robustness of the generation.

2606.11441 2026-06-11 cond-mat.mtrl-sci 新提交

Screening of the Coulomb interaction in Carbon Nanotubes: A First-Principles cRPA study

碳纳米管中库仑相互作用的屏蔽:第一性原理cRPA研究

Mohadese Rezayi, Hanif Hadipour

AI总结 采用第一性原理cRPA方法研究不同手性碳纳米管中长程库仑相互作用的电子屏蔽,发现屏蔽效率依赖于金属性、手性和能带拓扑,且扶手椅型和锯齿型纳米管屏蔽效率显著不同。

Comments 9 pages and 7 figures

详情
AI中文摘要

我们利用第一性原理计算在随机相位近似下研究了不同手性碳纳米管中长程库仑相互作用的电子屏蔽。根据其卷曲矢量,碳纳米管表现出金属性或半导体行为,为探索降维和电子结构如何控制一维系统中的屏蔽提供了理想平台。这些化合物中在位库仑相互作用的强度在3.5到5 eV范围内,比纳米带化合物中的相应值小约2-3 eV。这种减小随后影响长程相互作用的值,与关于纳米管中激子结合能较小的实验结果一致。尽管它们具有共同的碳骨架,我们发现有效相互作用景观不仅取决于金属性,还敏感地依赖于手性和能带拓扑。特别是,具有相似电子特征的扶手椅型和锯齿型纳米管表现出显著不同的屏蔽效率。我们的结果建立了碳纳米管中电子屏蔽的统一微观图像,并将其与之前低维碳纳米结构的第一性原理研究直接联系起来。

英文摘要

We investigate the electronic screening of long-range Coulomb interactions in carbon nanotubes with different chiralities using first-principles calculations within the random-phase approximation. Depending on their wrapping vector, carbon nanotubes exhibit either metallic or semiconducting behavior, providing an ideal platform to explore how reduced dimensionality and electronic structure govern screening in one-dimensional systems. The strength of on-site Coulomb interactions in these compounds falls within the range of 3.5 to 5 eV, which is approximately 2-3 eV smaller than the corresponding values in nanoribbon compounds. This reduction subsequently affects the value of long-range interactions, consistent with experimental results regarding the smaller binding energy of excitons in nanotubes. Despite their common carbon backbone, we find that the effective interaction landscape depends not only on metallicity but also sensitively on chirality and band topology. In particular, armchair and zigzag nanotubes with similar electronic character exhibit markedly different screening efficiencies. Our results establish a unified microscopic picture of electronic screening in carbon nanotubes and place them in direct context with previous first-principles studies of low-dimensional carbon nanostructures.

2606.11439 2026-06-11 stat.ME 新提交

A Likelihood Ratio Testing Approach for Interval-Censored Data

区间删失数据的似然比检验方法

Yuan Wu, Susan Halabi

AI总结 针对区间删失数据,提出基于样条筛的稳健似然比检验,解决Wald检验在小样本中的不稳定性,理论推导渐近分布,模拟和实例验证其优越性。

详情
AI中文摘要

区间删失数据在临床研究中经常出现,其中事件时间仅已知落在特定的评估窗口内。尽管Cox比例风险模型是处理此类数据的标准方法,但现有的Wald型检验在小样本中常常存在不稳定性或性能较差。在本文中,我们提出了一种基于样条筛的稳健似然比检验,用于区间删失数据。我们开发了一个计算高效的估计框架,确保了数值稳定性。此外,我们严格建立了所提出的似然比统计量的渐近分布,为统计推断提供了坚实的理论基础。广泛的模拟研究表明,与传统方法相比,我们的方法实现了更优的错误控制和更高的功效。通过一个真实临床数据集的分析,进一步说明了该方法的实用性。

英文摘要

Interval-censored data frequently arise in clinical research where event times are only known to fall within specific assessment windows. Although the Cox proportional hazards model is a standard approach for such data, existing Wald-type tests often suffer from instability or poor performance in small samples. In this paper, we propose a robust spline-sieve-based likelihood ratio test for interval-censored data. We develop a computationally efficient estimation framework that ensures numerical stability. Furthermore, we rigorously establish the asymptotic distribution of the proposed likelihood ratio statistic, providing a solid theoretical foundation for statistical inference. Extensive simulation studies demonstrate that our approach achieves superior error control and higher power compared with traditional approaches. The practical utility of the method is further illustrated through the analysis of a real-world clinical dataset.

2606.11438 2026-06-11 quant-ph math-ph math.MP 新提交

Isotropic random walks and Brownian diffusion on complex projective space

复射影空间上的各向同性随机游走与布朗扩散

Gyula I. Tóth

AI总结 通过各向同性随机游走和布朗扩散,为量子态空间探索提供可解析的随机几何框架,导出跃迁核、保真度统计和几何可观测量,并解决首达时间问题。

详情
AI中文摘要

我们证明了复射影空间上的各向同性随机游走为量子态空间的探索提供了一个规范且可解析处理的随机几何框架。该方法将紧秩一对称空间上的调和分析与随机纯态演化相结合,并给出了与Fubini--Study度量相关的跃迁核、保真度统计和几何可观测量的显式解析表达式。特别地,该框架为各向同性退极化和Haar均衡提供了一个可解的参考模型,无需指定微观Lindblad生成器即可重现Haar随机保真度统计和射影Hilbert空间上的不变测度。在短时区域,随机演化收敛于由Fubini--Study Laplace--Beltrami算子生成的布朗扩散,而长时极限则表现出高维随机量子态典型的测度集中行为。我们进一步推导了首达时间问题的解析和渐近结果,包括布朗极限下平均首达时间的闭式表达式以及首达时间分布的长时尾部。对于高保真度目标态,平均首达时间表现出强烈的维度依赖性发散,这源于Fubini--Study几何的集中性质。

英文摘要

We show that isotropic random walks on the complex projective space provide a canonical and analytically tractable stochastic-geometric framework for the exploration of quantum-state space. The approach combines harmonic analysis on compact rank-one symmetric spaces with stochastic pure-state evolution and yields explicit analytical expressions for transition kernels, fidelity statistics, and geometric observables associated with the Fubini--Study metric. In particular, the framework provides a solvable reference model for isotropic depolarization and Haar equilibration, reproducing Haar-random fidelity statistics and the invariant measure on projective Hilbert space without specifying a microscopic Lindblad generator. In the short-time regime, the stochastic evolution converges to Brownian diffusion generated by the Fubini--Study Laplace--Beltrami operator, while the long-time limit exhibits concentration-of-measure behaviour characteristic of high-dimensional random quantum states. We further derive analytical and asymptotic results for the first-passage-time problem, including closed-form expressions in the Brownian limit for the mean first passage time and the long-time tail of the first-passage-time distribution. For high-fidelity target states, the mean first passage time exhibits a strong dimension-dependent divergence originating from the concentration properties of the Fubini--Study geometry.

2606.11436 2026-06-11 math.FA 新提交

Kolmogorov widths of an intersection of Besov classes with dominating mixed smoothness in a Besov space

Besov空间中具有支配混合光滑性的Besov类交集的Kolmogorov宽度

A. A. Vasil'eva

AI总结 本文在参数满足一般位置条件下,获得了Besov空间中具有支配混合光滑性的Besov类交集Kolmogorov宽度的阶估计。

详情
AI中文摘要

本文在参数满足某些一般位置条件的情况下,获得了Besov空间$B_{q,\sigma}^{\overline{l}}(\mathbb{T}^d)$中有限族具有支配混合光滑性的Besov类$SB_{p_j,\theta_j}^{\overline{r}_j}(\mathbb{T}^d)$交集的Kolmogorov宽度的阶估计,其中$2<q, \sigma <\infty$。

英文摘要

In this paper, we obtain order estimates for the Kolmogorov widths of an intersection of a finite family of Besov classes $SB_{p_j,θ_j}^{\overline{r}_j}(\mathbb{T}^d)$ with dominating mixed smoothness in a Besov space $B_{q,σ}^{\overline{l}}(\mathbb{T}^d)$ in the case $2<q, \, σ<\infty$ when the parameters satisfy certain conditions of general position.

2606.11434 2026-06-11 cond-mat.mes-hall 新提交

Extrinsic quantum geometry in the quadrupolar bulk photovoltaic effect

四极体光伏效应中的外禀量子几何

Steven Gassner, Swati Chaudhary, Martin Claassen

AI总结 本文重新推导了光波矢主导阶的光子拖曳效应,发现源于光-物质耦合的电四极修正的贡献,并将其识别为多带度规张量,预测如扭曲MoTe₂双层等系统具有异常大的光子拖曳效应。

详情
AI中文摘要

体光伏效应已成为布洛赫带量子几何的重要探针。虽然在偶极近似下它仅限于反演破缺系统,但光的有限动量被认为即使在中心对称晶体中也能产生这种效应,称为“光子拖曳”。在这项工作中,我们重新推导了光波矢主导阶的光子拖曳效应,突出了先前被忽略的、直观上来自光-物质耦合的电四极修正的贡献。在能带几何的语言中,我们将这种带间四极识别为多带度规张量,它量化了两个共振驱动态在其所张子空间之外的变化。我们预测,在动量空间中三个或更多能带强烈混合的系统,例如扭曲的MoTe$_2$双层,将由于这种四极效应而具有异常大的光子拖曳。我们的工作为非线性光学中的能带几何组织原理与电磁多极修正之间提供了概念桥梁。

英文摘要

The bulk photovoltaic effect has become a valuable probe of the quantum geometry of Bloch bands. While it is restricted to inversion-broken systems within the dipole approximation, the finite momentum of light is appreciated to give rise to this effect even in centrosymmetric crystals, an effect referred to as "photon drag." In this work, we recast the photon drag effect at leading order in the optical wavevector, highlighting a previously neglected contribution arising intuitively from the electric quadrupole correction to light-matter coupling. In the language of band geometry, we identify this interband quadrupole as a multiband metric tensor that quantifies the variation of two resonantly driven states extrinsic to the subspace they span. We predict that systems in which three or more bands strongly admix in momentum space, such as twisted MoTe$_2$ bilayers, will have anomalously large photon drag due to this quadrupolar effect. Our work provides a conceptual bridge between band-geometric organizing principles and electromagnetic multipole corrections in nonlinear optics.

2606.11433 2026-06-11 math.AP math.OC 新提交

Null-controllability for the beam equation with structural damping. Part 2: Integration by parts for fractional Laplacians and boundary control

结构阻尼梁方程的可控性。第二部分:分数阶拉普拉斯算子的分部积分与边界控制

Sergei Avdonin, Julian Edward

AI总结 本文证明了谱分数阶拉普拉斯算子的分部积分公式,并应用于结构阻尼梁方程,在边界控制下证明了零可控性。

详情
AI中文摘要

设 $\Delta$ 为区间 $(0,\pi)$ 上的 Neumann 拉普拉斯算子,$T>0$。对于 $\alpha \in (0,1)$,证明了谱分数阶拉普拉斯算子 $(-\Delta)^\alpha$ 的分部积分公式。作为应用,我们证明了结构阻尼梁方程 $$u_{tt}+\Delta^2 u+\rho (-\Delta)^\alpha u_t=0, x\in (0,\pi),t>0$$ 在各种边界条件下的适定性,包括 $$ u_x(0,t)=u_{xxx}(0,t)=0;\ u_x(\pi,t)=f(t),\ u_{xxx}(\pi,t)=0, $$ 其中 $f\in L^2(0,T)$ 以及适当的初始条件。将 $f$ 视为控制,我们证明了零可控性。对于高阶控制以及 Dirichlet 拉普拉斯算子,也得到了类似的结果。

英文摘要

Let $Δ$ be the Neumann Laplacian on the interval $(0,π)$, and let $T>0$. An integration by parts formula is proven for the spectral fractional Laplacian, $(-Δ)^α$, for $α\in (0,1)$. As an application, we prove well-posedness results for the structurally damped beam equation $$u_{tt}+Δ^2 u+ρ(-Δ)^αu_t=0, x\in (0,π),t>0$$ with various boundary conditions including $$ u_x(0,t)=u_{xxx}(0,t)=0;\ u_x(π,t)=f(t),\ u_{xxx}(π,t)=0, $$ and $f\in L^2(0,T)$ and appropriate initial conditions. Viewing $f$ as a control, we prove null-controllability. Analagous results are proven for higher order controls, and for the Dirichlet Laplacian.