Algebraic Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
This paper is to construct deformation families of open Calabi-Yau manifolds together with some discussions on Steinness. Firstly, we construct a nontrivial compactifiable deformation of open Calabi-Yau manifolds from rational elliptic surface with global sections. Secondly, we give a condition for the existence of an elliptic fibration with global sections on the complex analytic family of rational elliptic surface with global sections, construct a holomorphic involution on the compactifiable deformation family and claim the non-Steinness for all the compactifiable deformation families constructed. Finally, we give some discussions on the non-Steinness of the quasi-projective variety from $\text{CP}^2 \text{$\#$9} \overline{\text{CP}}^2$ corresponding to a conjecture by Marco Brunella and construct deformation families whose fibers were conjectured to be Stein by Andreas Höring and Thomas Peternel.
High Energy Physics (Phenomenology)
Transition magnetic-dipole dark matter and the LZ230616 high-recoil candidate
A transition magnetic dipole connects an endothermic nuclear recoil to a delayed photon. We study this interpretation of LZ230616, the 248-keV candidate in LZ's extended-energy search. Imposing the thermal abundance in a point hypercharge theory fixes a moment near $2.4 \times 10^{-4} \mathrm{TeV}^{-1}$ at the preferred masses, leaving a mass–splitting fit. The excited state travels about 0.6 m, making its decay relevant to the isolated-recoil selection. A position-dependent TPC-exit response gives conditional maxima at $(1.07 \,\mathrm{TeV} ,346 \,\mathrm{keV} )$ without the high-energy sideband and $(0.44 \,\mathrm{TeV} ,321 \,\mathrm{keV})$ with its zero-count proxy. Their line rates exceed the H.E.S.S. Einasto bound by factors of about 11 and 5.5. We examine halo dependence, other direct and indirect probes, and charged-messenger matching. Allowing a smaller moment and additional annihilation preserves the low-mass maxima while admitting heavier fits over 0.1–100 TeV. Delayed recoil–photon data can measure the splitting and moment, testing both the detector response and the assumed connection to thermal annihilation.
Read the full abstract
Dynamical Systems
Delay Placement Governs Feasibility and Hopf Bifurcation in a Pollution-Based Tourism Model
We compare eight variants of a three-variable pollution-based tourism model obtained by assigning the same discrete delay to different terms. The delay may enter three slots: the visitor factor in the deterrence term, pollution perception, or visitation-driven growth and reinvestment. We call a placement feasible when every nonnegative initial history produces a solution that exists for all future time and remains nonnegative. For every $\tau>0$, feasibility holds exactly when the visitor factor in the deterrence term is current, which occurs in four of the eight placements. In three of these four feasible placements, the positive equilibrium is locally asymptotically stable for every delay. In the fourth – the perception-lag model, with delayed pollution perception but current visitation – a conjugate pair of characteristic roots crosses the imaginary axis at a finite critical delay for every set of positive parameters. The equilibrium then loses stability and does not restabilise as the delay increases. A center-manifold reduction and numerical parameter sweep show that both supercritical and subcritical Hopf bifurcations can occur. The visitor-delayed placement, closest to earlier delayed-tourism models, can undergo a local Hopf bifurcation under additional conditions, but it does not preserve nonnegativity for all initial histories.
Read the full abstract
Artificial Intelligence
JarvisGUI: Towards Cross-Device GUI Agents with Dynamic Task Composition
Real-world GUI usage frequently involves workflows that span multiple devices and platforms, requiring the transfer of intermediate results, maintenance of shared state, and coordination across heterogeneous environments. However, existing GUI benchmarks overwhelmingly evaluate agents on single-device, statically defined tasks, thus leaving such cross-device capabilities largely unexamined, resulting in an overly optimistic assessment of agents' readiness for real-world usage. We introduce JarvisGUI, a dynamic benchmark that evaluates GUI agents on cross-device workflows requiring coordinated interaction across heterogeneous platforms, including Android, Windows, and Ubuntu. Specifically, JarvisGUI formulates GUI tasks as input-output transformations under a lightweight type system, which allows us to automatically compose multi-step, cross-device workflows and dynamically evaluate agent performance within a unified framework. By evaluating agents in virtual environments spanning multiple operating systems, JarvisGUI reveals that state-of-the-art open-source GUI agents struggle with the state-transfer awareness, cross-platform contextual reasoning, and long-horizon dependency management required for real-world workflows, exposing a critical capability gap invisible to existing benchmarks.
Read the full abstract
Probability
Aldous' spectral gap phenomena in stochastic exchange models
We consider a broad class of exchange dynamics with arbitrary weighted graph or hypergraph update structures, which includes the Kipnis–Marchioro–Presutti (KMP) model and the energies of Kac's walk on the sphere. These are conservative continuous-spin systems whose reversible measures are Dirichlet distributions. We prove that their spectral gap is always attained by a polynomial of degree at most two in the energy variables. Equivalently, through an intertwining with the associated discrete particle systems, the dominant mode is always represented by either a one-particle or a two-particle observable. We interpret this as a manifestation of an Aldous-type spectral gap phenomenon. In particular, the resulting two-particle spectral gap identity settles a recent conjecture of Alon and Puder. We also characterize sharply when one particle suffices and when a genuinely two-particle mode dominates. Under a common rescaling of the Dirichlet parameters, segment-like geometries are precisely those for which the gap is always of one-particle type, mean-field geometries are precisely those for which it is always of two-particle type, and all other geometries exhibit a nontrivial transition. The proof relies on the analysis of the so-called hidden model, a dual representation of the original process. The mechanism underlying the degree-two reduction is remarkably robust and extends to a much broader class of stochastic exchange models and their associated particle systems, including the harmonic process, the immediate exchange model, averaging-type processes, and nonreversible variants. Finally, we analyze boundary-driven versions of the KMP model, in which the bulk exchange dynamics interacts with reservoirs, generally resulting in nonreversible processes. In contrast to the conservative setting, we prove that the spectral gap of a boundary-driven model is always of one-particle type.
Read the full abstract
Geometric Topology
On Medial Quandle Coloring Link Invariant and Detecting Causality
We investigate the capability of medial quandles to detect causality in (2+1) dimensional globally hyperbolic spacetime by determining if their coloring link invariants can distinguish between the connected sum of two Hopf links and an infinite series of relevant three-component links constructed by Allen and Swenberg in 2020, who suggested that any link invariant must be able to distinguish those links for them to detect causality in the given setting. We show that these quandles fail to do so as long as $a\sim b\Leftrightarrow a*b=a$ defines an equivalence relation. The Alexander quandles are an example to which this result applies. We also give a sufficient condition for a medial quandle to distinguish between the connected sum of two Hopf links and all links in Allen-Swenberg series, and give an example of such a quandle. Inspired by this result, we also derive a generalized theorem about the coloring of medial quandles on a specific type of tangle, which helps to determine whether these quandles can distinguish between a wider range of knots and links or not.
Read the full abstract
Quantum Physics
Coherent advantage in the computational expressivity of excitonic networks
The rising energy consumption of AI has generated interest in physical systems as alternative substrates for trainable computation. Recent experimental advances have enabled precise control over the couplings between molecular chromophores, which give rise to coherent excitation dynamics. Here, we study driven-dissipative excitonic networks as a computational platform, where the intersite couplings define the input and the steady state defines the output. We show that coherence enables computational expressivity to scale with network size, analogous to artificial neural networks. Both this scaling and the overall expressivity are suppressed by strong dephasing. Our work establishes coherence as a resource for expressive computation in nonequilibrium quantum systems.
Read the full abstract
Logic
Compact totally separated types
Perhaps surprisingly, there are infinite types that can be exhaustively searched mechanically in finite time. We use ideas from topology to build plenty of them, referring to searchable types as compact types, and we use ordinals to measure their logical complexity. We consider two systems of ordinal notations under which a single notation denotes both a discrete ordinal and a compact one, with an embedding of the former into the latter whose image has empty complement. A boolean valued function decides which points in the image of the embedding are isolated and which are topological limit points. The first system consists of the traditional Brouwer codes and the second is an inductive-recursive universe generalizing them. The discrete ordinals so obtained are trichotomous, and the compact ones have the least element property for complemented subsets, but these two desirable properties cannot be fulfilled simultaneously in a constructive setting. The compact ordinals obtained from Brouwer codes further enjoy a boolean Leibniz principle, which has the notion of total separatedness as its topological counterpart. This extends previous work from Gödel's system T to intensional Martin-Löf type theory with univalent universes, and is formalized in Agda in the TypeTopology repository.
Read the full abstract
Number Theory
On the Number of Hecke Eigenvalues of the Same Sign on $\mathrm{GL}_n$
We study the distribution of signs of the (real-valued) Hecke eigenvalues $A(m,1,...,1)$ of self-dual Hecke–Maass cusp forms for the group $\mathrm{SL}_n(\mathbb Z)$, where $n\geq 2$ is an integer. Our main result establishes, under the Generalised Ramanujan–Petersson Conjecture, that for all $X\leq x\leq 2X$ outside a set of measure $o(X)$ the short interval $(x,x+H]$ contains at least $H(\log X)^{1/n^2-1}$ indices with both positive and negative Hecke eigenvalues, provided that $(\log X)^{1-1/n^2+\varepsilon}\leq H\leq X/10$. For $\mathrm{GL}_2$ Hecke–Maass cusp forms we obtain a stronger bound unconditionally, and for self-dual $\mathrm{GL}_3$ forms we obtain the same logarithmic exponent unconditionally. We also establish results under weaker bounds towards the Generalised Ramanujan–Petersson Conjecture together with the Generalised Lindelöf Hypothesis, and obtain lower bounds for the number of sign changes and for the number of Hecke eigenvalues of each sign in long intervals.
Read the full abstract
Computation and Language
Building Multilingual Bridges: Data Mixing as the Pillar of Generalization for In-Language Reasoning
Reasoning language models have made substantial advances on a variety of complex tasks, yet their capabilities remain overwhelmingly English-centric: models primarily reason in English regardless of the language they are prompted in. This is inaccessible for non-English-speaking users, risks losing the intent of the original question, and forgoes knowledge more readily expressed in the target language. In this work, we advance L2 reasoning, the ability of a model to reason consistently in the language of the user's prompt, thus building an in-language bridge between the prompt and the answer. We approach this problem from a data-centric angle, investigating how to optimize data composition and scheduling in SFT for reasoning generalization. Building Tiny Aya L2-Thinker at 3.35B scale, we achieve an L2 reasoning rate above 93% across 60 languages on 6 benchmarks spanning math, commonsense reasoning, instruction following, open-ended generation, and cultural reasoning while keeping performance strong. We show the path to generalizing L2 reasoning to held-out languages goes through broader language coverage, readily available multilingual non-reasoning data, and a sufficient English reasoning backbone. These findings indicate that reasoning is a language-agnostic behavior that can be transferred across typologically diverse languages through careful data mixing and without requiring reasoning supervision in every target language. We release our model weights and multilingual reasoning data to support further research on accessible, in-language reasoning.
Read the full abstract
Functional Analysis
The bounds $\hbar_{p,X}\lesssim(\beta_{p,X})^2$ and $\beta_{p,X}\lesssim(\hbar_{p,X})^2$ are sharp
It was proved in the 1980s by Burkholder and Bourgain that, for any Banach space $X$ and $1<p<\infty$, the UMD$_p$ property for $X$ is equivalent to boundedness of the Hilbert transform on $L^p(\R;X)$, and that the UMD constant $\beta_{p,X}$ and the Hilbert transform constant $\hbar_{p,X}$ are related by the quadratic bounds \begin{equation*} \hbar_{p,X}\lesssim(\beta_{p,X})^2, \qquad \beta_{p,X}\lesssim(\hbar_{p,X})^2. \end{equation*} In this paper we present examples showing that both bounds are sharp. More precisely, we construct explicit $2^n$-dimensional Banach spaces for which the Hilbert transform constant grows like $n$ and the UMD constant like $\sqrt n$, and a second family with the reverse behaviour.
Read the full abstract
Strongly Correlated Electrons
Gauge mean-field theories of the underscreened Kondo lattice
Various mean-field decoupling schemes have been introduced thus far to study the important and challenging problem of the spin-$1$ underscreened Kondo lattice where magnetic order can coexist with Kondo hybridization. We use a single control parameter $N$ and an unbiased variational ansatz to unify and connect the previously proposed decouplings to standard Read-Newns theory, where fluctuations are small in $1/N$. We compute the corrections around the large-$N$ limit. In particular, we make contact with Nozières strong-coupling theory by finding the residual ferromagnetic Hund interaction that decays logarithmically in the case of a heavy-fermion metal. We map out the ground state phase diagram as a function of $N$ and the Kondo coupling. We find crucial differences between the previously proposed mean-field theories in the strength of the hybridization and total magnetization of the coexistent phase. We show that, within our unifying variational theory, the previously proposed decouplings correspond to either taking $N=2$ from the start, or performing a $1/N$ expansion and then extrapolating to $N=2$. Finally, we summarize the generalization of our theory to $S>1$.
Read the full abstract
Differential Geometry
Nonexistence of complete metrics with uniformly positive scalar curvature
Let $X$ be a connected oriented even-dimensional manifold whose universal cover is spin. We prove that $X$ admits no complete metric with uniformly positive scalar curvature when either infinite relative $K$-area or a relative cohomological condition holds along compact sets escaping to infinity in a fixed open subset with compact complement. The proof compares twisted Dirac operators on spin covers of compact manifolds with boundary and combines a heat-kernel argument on fundamental domains with a long-neck estimate.
Read the full abstract
Artificial Intelligence
ConvMem: Convolutional Memory for Long-Context Reasoning
While Large Language Models (LLMs) have demonstrated impressive capabilities, they often struggle with extremely long contexts due to fixed context limits. To address this, sequential approaches like MemAgent extend the effective context by reading text in segments and iteratively updating a fixed-size memory. However, this sequential paradigm suffers from high latency and requires costly reinforcement learning (RL) training, which can lead to overfitting on specific datasets. To overcome these limitations, we propose ConvMem, a training-free, highly parallelizable framework that reformulates long-context reasoning as a hierarchical convolution. Inspired by CNNs, ConvMem treats an LLM prompted with a specific query as a convolutional kernel. This kernel summarizes text segments hierarchically, shortening the reasoning path from a linear chain into a logarithmic tree. Specifically, ConvMem integrates Configurable Strides and Skip Connections to ensure robust evidence capture and propagation, while employing Multi-Kernel Convolution to decompose complex queries into disentangled semantic channels. This design not only mitigates error accumulation but also enables massive parallelization across both text segments and reasoning threads. Experiments on RULER-HotpotQA and RULER-2WikiMultiHopQA demonstrate that ConvMem outperforms training-free baselines and avoids the risk of overfitting to parametric priors often observed in RL-trained models on out-of-distribution tasks.
Read the full abstract
Quantum Algebra
Local Ocneanu rigidity for separable algebra objects
We establish local Ocneanu rigidity for separable algebra objects in Hom-finite monoidal categories C over an algebraically closed field k. A separability morphism contracts the first two Hochschild cohomology groups without requiring an abelian ambient category. Separable algebra structures and homomorphisms from separable sources have open algebraic-group orbits, and affine Bezout estimates give effective finiteness results. For Frobenius subalgebras, exchange relations replace the source and embedding data by a single self-dual idempotent. We prove that their separable inner-conjugacy classes are open in the exchange locus, yielding a bound of 2^(dim_k(End_C(X))) for any ambient Frobenius algebra X; connectedness gives the same bound on the actual number of subalgebras. As an application, we obtain an effective form of the Etingof-Walton finiteness theorem: every finite-dimensional semisimple Hopf algebra H over C has fewer than 2^(dim_C(H)) left coideal subalgebras. In the unitary setting, we bound E-compatible intermediates of C*-algebra and von Neumann algebra inclusions up to unitary conjugacy, under finite-index and finite-center hypotheses. For irreducible finite-index subfactors N < M, we improve the 9^[M:N] bound of Bakshi-Das-Liu-Ren to fewer than 2^[M:N] intermediate subfactors.
Read the full abstract
Machine Learning
Forgetting Only What Matters: Layer-Selective Unlearning toward Robust LLMs
Large Language Models (LLMs) can memorize and reproduce sensitive, copyrighted, or otherwise undesirable training content, creating privacy, safety, and regulatory concerns. Machine unlearning offers a practical alternative to full retraining, but many existing methods apply broad or fixed parameter updates that can degrade utility and remain brittle under deployment changes such as post-training quantization, where forgotten knowledge may partially re-emerge. We propose Forgetting Only What Matters via Unlearning Layers (FOM-UL), a layer-level unlearning framework that selects transformer layers using a forget-to-retain significance score. This score identifies layers with high influence on the forget set and low sensitivity to the retain set, allowing FOM-UL to concentrate updates where they are most effective while leaving most of the model unchanged. This targeted update strategy improves the forgetting-utility trade-off and provides an empirical path toward quantization-resilient unlearning by reducing the chance that small, diffuse updates are erased by low-bit rounding. Across TOFU, KnowUnDo, and MUSE-style evaluations, FOM-UL reduces residual memorization compared with strong GA, NPO, KLD, SURE, ReLearn, and LUNAR-based baselines while preserving retain-set utility close to the vanilla model. Under 8-bit and 4-bit post-training quantization, FOM-UL maintains stronger memorization suppression and utility preservation than competing methods, and adversarial prompt evaluations show lower recovery of forgotten content. Overall, FOM-UL provides an efficient unlearning strategy that improves targeted forgetting, utility preservation, and deployment robustness without claiming formal guarantees of erasure.
Read the full abstract
Materials Science
Overcoming Transport Layer Bottlenecks to Quantify Ionic Parameters from Transient Ion Current Measurements of Perovskite Solar Cells
In perovskite solar cells (PSCs), voltage step-induced transient ion current (TIC) measurements, commonly referred to as bias-assisted charge extraction (BACE), are frequently used to quantify ion density. Drift-diffusion simulations predict that the ion density computed from TIC saturates once mobile ions screen the electric field in the perovskite. However, experimental studies often report ion densities orders of magnitude above this limit, whose physical origin remains incompletely explained in terms of transport layer (TL) properties. In this work, the capacitance of the TLs is identified to be the fundamental bottleneck: the maximum quantifiable ion density is limited to the charge that can accumulate at the perovskite/TL interfaces, so that TIC most often depends more strongly on TL properties than on the ionic properties of the perovskite. Experiments with systematically varied C$_{\rm 60}$ electron-TL thickness (p-i-n) and Spiro-OMeTAD hole-TL doping (n-i-p) confirm this dependence across architectures. To overcome this limitation, the importance of a correction based on the average ionic displacement is discussed, and it is shown how extrapolating the TL-thickness trend towards the TL-free situation yields the actual ionic conductivity of the absorber, alongside density and mobility, depending on the assumed ionic model. Simulations are also examined in which ion penetration into the TLs or initial accumulation under forward bias raise the capacitive limit and extend TIC sensitivity to higher ion densities. The slow release of trapped carriers is also discussed as a potential source of current which can inflate the TIC signal. Overall, the presented analysis provides important practical considerations for interpreting TIC and quantifying ionic properties in PSCs.
Read the full abstract
Dynamical Systems
From Nilspace Theory to Simplicial Homotopy Theory
We construct a faithful functor from the category of cubespaces, arising in structured ergodic theory and nilspace theory, to the category of (condensed) simplicial sets. This functor translates the weak structure theorem of a nilspace to a Postnikov tower of the corresponding simplicial set. In particular, nilspaces are mapped to Kan complexes and the structure groups of the nilspace correspond to the simplicial homotopy groups of the Kan complex. The functor is constructed via pullback along a special cosimplicial cubical set, whose combinatorial properties may be of independent interest.
Read the full abstract
Information Theory
Mobility Information Capacity in the Sky: A Gaussian Channel Perspective
Existing airspace capacity metrics mainly quantify occupancy or flow, although the same number of aerial vehicles may result in different motion alternatives. This letter establishes mobility information capacity as an information-theoretic measure for low-altitude wireless networks. It quantifies the maximum information that trajectory observations reveal about intentional maneuver inputs under a given maneuver-resource budget and environmental uncertainty. For a common fixed feedback architecture, we formulate a lifted linear-Gaussian mobility channel and derive its finite-horizon log-determinant capacity. Cost and uncertainty whitening gives the spatiotemporal mobility eigenmodes, whose optimal maneuver-resource allocation follows water-filling. When the number of nondegenerate modes grows linearly with time and their efficiencies become asymptotically symmetric, we arrive at the Shannon-like law $R_M^{\rm G}=\frac{B_M}{2}\log_2(1+\mathrm{MNR})$, where MNR is the mobility-to-noise ratio. The proposed measure opens a motion-centric capacity perspective for the sky, while remaining a distinguishability baseline rather than a collision- or geometry-constrained airspace capacity.
Read the full abstract
Physics and Society
Assessing extreme flood impacts on urban rail transit: A passenger-oriented, resilience-informed framework
Urban rail transit systems (URTSs) are increasingly exposed to extreme floods following heavy precipitation, yet passenger travel impacts are often assessed through delay-based indicators that overlook infeasible journeys under large-scale disruptions. This study develops a passenger-oriented, resilience-informed framework for assessing flood impacts on URTS journeys from disruption onset to recovery completion. The framework presents a novel six-category classification of journey impacts, explicitly considering rerouting, alternative station use, and a delay threshold. It is demonstrated through hourly dynamic simulations of 15 London URTS lines under 30-year, 100-year, and 1,000-year flood risk scenarios. Results indicate that severe flood disruptions lead to substantial unsatisfied demand, driven primarily by unavailable routes rather than unacceptable delays. Compared with finer behaviour adjustments, rerouting dominates travel impacts. These findings highlight the significance of moving beyond delay-based assessment and provide valuable evidence on essential behavioural mechanisms for strategic-level stress testing intended to inform URTS flood resilience intervention planning.
Read the full abstract
Computation and Language
Do speech foundation models really learn words?
Self-supervised speech foundation models are now used in a wide array of downstream applications, including traditional speech recognition and as the basis for tokens in speech-aware language models. Attempts to understand their usefulness have largely focused on probing their representations' ability to discriminate phonemes and words. However, discriminative ability for words need not imply specialized representation of words per se. Good discrimination of words may be explained by good encoding of word form (phonemes) rather than form-independent word representations encoding identity or syntactic/semantic properties. By partialling out phoneme information using residualization, we show that, in later layers, HuBERT and wav2vec 2.0 do in general learn representations which encode words with reasonable fidelity independently of local phonetic content. We show that this simple approach to disentanglement can enhance higher-order linguistic information in word discovery tasks.
Read the full abstract
Robotics
Multi-Agent Reinforcement Learning for Autonomous UAV Exploration in Wildfire Response
This study develops a deep reinforcement learning framework for training Unmanned Aerial Vehicle (UAV) agents to navigate and monitor simulated wildfire environments. Results show that agents learn increasingly stable and effective behaviors over time, as demonstrated by converging loss trends, improved reward signals, and more consistent navigation patterns such as fire-boundary tracking. Overall, these findings highlight the potential of deep reinforcement learning (DRL) based UAV systems for autonomous wildfire monitoring and suggest that environmental structure and reward design influence policy effectiveness.
Read the full abstract
High Energy Physics (Theory)
Null String Holography, Null Strings Probe Projective Boundary of Their Target Spaces
We prove that the minimal null string theory on a background manifold ${\mathcal M}$ is classically equivalent to the ILST theory on the projective boundary of $\mathcal M$, ${{\cal B}_{_{\text{P}}}}={\partial_{_{\text{P}}}\mathcal{M}}$. We conjecture that this equivalence also holds at quantum level, we dub this correspondence null string holography. In particular, we show the minimal null string theory on the Poincaré patch of a $D$ dimensional Anti de Sitter (AdS$_D$) background is described by the ILST theory on $(D-1)$-dimensional Minkowski background, paralleling the celebrated AdS/CFT. The minimal null string theory on the cosmological patch of dS$_D$ is governed by the ILST theory on $(D-1)$-dimensional flat Euclidean space. For null strings on a $D$-dimensional Minkowski space $\mathbb{M}_D$, depending on the coordinate patches used to span $\mathbb{M}_D$, the projective boundary includes a dS$_{D-1}$, asymptotic null infinities ${\mathcal I}^\pm$ and the hyperboloid $\mathbb{H}^{D-1}$ patches. The ILST theory dual to the minimal null strings on each patch, then resides on the piece of the projective boundary spanned by the coordinates adopted in the patch. We comment on possible applications of null string holography to black hole horizons.
Read the full abstract
Nuclear Theory
Systematic study of E2 matrix elements in the framework of the Triaxial Projected Shell Model
Nuclides for which extended sets of E2 matrix elements have been measured by means of COULEX experiments are studied in the framework of the triaxial projected shell model (TPSM). The studies encompass: 70,72,74,76Ge, 76,78,80,82Se, 100Mo, 104Ru, 110Pd, 168Er, 186,188,190Os, 184Pt. The experimental energies of the ground band, of the quasi gamma band and of some excited 0+ bands as well as their individual intra and inter band matrix E2 matrix elements are systematically accounted for by the microscopic TPSM calculations.
Read the full abstract
Multiagent Systems
Glyph: A Multi-Strategy Agentic System for Column Description and Sensitivity-Ontology Tagging of Enterprise Data Catalogs
Enterprise data lakes accumulate tables faster than human stewards can document or classify them, leaving columns with missing descriptions and unassigned governance labels. This documentation debt undermines data discovery, access control, and regulatory compliance. We present Glyph, a production system that frames two coupled problems, column description generation and column type annotation for data classification, as cooperating LLM agents orchestrated as stateful graphs. The Descriptor grounds generation in the pipeline source code that produces each column, retrieved on demand from an enterprise GitHub via a reasoning–acting tool loop (active Retrieval-Augmented Generation). The Tagger assigns labels from a governed 275-leaf Data Classification Ontology by running three complementary strategies in parallel (a description tagger, a line-of-business regex tagger, and a metadata tagger backed by a fine-tuned contrastive encoder over a vector database), then fuses their ranked outputs with Reciprocal Rank Fusion (RRF). We fine-tune a 6-layer MiniLM metadata encoder with an in-batch contrastive objective, lifting same-tag retrieval on an in-distribution held-out split from NDCG@10 0.55 to 0.92 (MAP@100 $0.19 \rightarrow 0.90$) relative to the stock base encoder. We report end-to-end multi-label tagging quality under a recall-weighted F2 objective across three evaluation groups, an ablation isolating each strategy and the RRF fusion, and the engineering decisions that distinguish Glyph from prior column-type-annotation work and from commercial value/regex sensitivity scanners: value-free and code-grounded design, per-tag provenance, and graceful degradation. Together these make multi-agent LLM cataloging auditable and operable as a production service.
Read the full abstract
Quantum Physics
Faster Computation with the Generalized Laplacian Quantum Walk
Quantum walks are the quantum analogues of classical random walks or Markov chains. They are universal models of quantum computing, and they underpin a variety of quantum algorithms. We prove that a continuous-time quantum walk effected by a generalized Laplacian, which can arise in spin chains, can solve a computational problem more quickly than typical quantum walks governed by the standard Laplacian or adjacency matrix. This generalized Laplacian consists of the standard Laplacian plus a real-valued multiple of the degree matrix, and we prove that as the magnitude of the multiple of the degree matrix is increased, its corresponding quantum walk can search the complete bipartite graph with multiple marked vertices in time that approaches the optimal. This raises the potential for the generalized Laplacian quantum walk to be a useful method for developing additional faster quantum algorithms.
Read the full abstract
Statistics Theory
Algorithmic stability via ensembling
Algorithmic stability refers to the property of an algorithm being insensitive to perturbations of the input data, where the type of perturbation may vary depending on the setting. In this work, we develop a general framework to quantify the extent to which any ensembling strategy defined via averaging can yield stability guarantees for any type of data perturbation. Our main theoretical result is a guarantee on the stability of this ensembled algorithm, given in terms of the norm of a certain covariance operator that describes the ensembling process. We show how our general framework yields interpretable and intuitive insights in several examples of perturbations of practical interest, and provides much sharper guarantees than those obtained from privacy considerations.
Read the full abstract
Analysis of PDEs
$\mathrm{L}^p$-extrapolation via non-local decay estimates: theory and applications to the generalized Stokes operator with rough coefficients
In this article, we establish $\mathrm{L}^p$-mapping properties for the generalized Stokes operator with bounded measurable coefficients on the full range of exponents that is known to be sharp for elliptic systems with rough coefficients. These include $\mathrm{L}^p$-estimates for the corresponding semigroup, its gradient and the $\mathrm{H}^\infty$-calculus, as well as $\mathrm{L}^q$-$\mathrm{L}^p$ smoothing estimates. As a key ingredient, we develop a non-local framework for $\mathrm{L}^p$-extrapolation that captures the relationship between hypercontractivity, non-local decay estimates and uniform $\L^p$-bounds.
Read the full abstract
Applied Physics
Thermal Stability and Carrier Recombination Kinetics in InGaN/GaN Multiple Quantum Wells under High-Temperature Annealing
The thermal stability and carrier recombination kinetics of an as-received InGaN/GaN multiple quantum well (MQW) structure, capped with a protective AlN thin film, are studied following a series of thermal annealings at temperatures between 500 deg C and 1100 deg C. Under 325 nm focused laser excitation at room temperature, the sample's photoluminescence (PL) spectrum exhibits three emission bands: an ultraviolet peak at 363 nm, a blue peak at 455 nm, and a yellow peak at 565 nm. We find that the MQW's 455 nm emission is preserved after annealing at 1100 deg C. Moreover, room-temperature PL excitation (PLE) and time-resolved PL (TRPL) have been investigated to shed light on the sample's energy-transfer mechanisms and emission decay characteristics. Power-dependent PL spectra analysis shows that the carrier recombination mechanism of the MQW's emission has not been affected by thermal treatment. Rate equation modelling and chromaticity coordinate analysis also show limited thermal impact on the calculated equivalent emission lifetime and emissive colour. Time-of-flight secondary ion mass spectrometry (ToF-SIMS) analysis has been performed, further evidencing the preservation of the MQW structure in the annealed sample.
Read the full abstract
Atomic Physics
Deterministic engineering of topological defects in two-dimensional single-species ion Coulomb crystals
We propose and numerically demonstrate a deterministic protocol for preparing and tailoring topological defects in two-dimensional single-species Coulomb crystals confined in radio-frequency traps. In conventional finite-rate quenches through the linear-to-zigzag transition, defects form stochastically from independently chosen broken-symmetry domains, and the quench rate controls the resulting domain structure. We instead use an initial three-dimensional helix structure and planarize it into a deterministic defected state. We demonstrate that the number and approximate axial positions of kinks are encoded by the projected nodes of the initial helix. We find that selected helices can remain on metastable finite-winding branches during planarization and yield reproducible single- or multi-kink states, even in the adiabatic limit. Using the quench rate as an additional control parameter substantially enlarges the set of precursor helices that result in defected states, as a fast planarization can prevent reordering during the quench and freeze in the pre-existing domain pattern. After planarization, the survival and mutual interaction of the defects are governed by their effective Peierls–Nabarro potential landscape. By numerically isolating the interaction energy for the two defect types, we find that the interaction of extended kinks is attractive over the investigated parameter range, while odd kinks exhibit a short-range repulsive barrier tunable by the anisotropy of the trapping potential $\alpha$. Finally, we introduce an experimentally motivated post-selection scheme in which $\alpha$ is used to selectively destabilize, annihilate, or convert targeted defects. Our results provide a route to deterministic single- and multi-kink preparation in single-species Coulomb crystals, enabling controlled studies of defect interactions, transport, and nanofriction.