General Relativity and Quantum Cosmology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
We obtain the singular ”mother” black hole solution by solving the coupling between Einstein gravity with a cosmological constant and a nonlinear electromagnetic field. The thermodynamic quantities of the ”mother” black hole are first derived in the unconstrained phase space $(S, q, \alpha, P)$, after which the regularity condition $M = q^3/\alpha$ is imposed to obtain the thermodynamic quantities of a class of spherically symmetric AdS regular black holes self-consistently. We distinguish two categories of thermodynamic quantities: fundamental conjugate variables defined by the first law, and thermodynamic response functions constructed from them. For response functions involving second-order derivatives – in particular the heat capacity – we show that the order of constraint imposition and derivative calculation cannot be interchanged, and the correct procedure is to first impose the constraint and then construct the response function. Within this framework, we find that when $P<P_c$, the $G$–$T$ diagram exhibits a behavior qualitatively different from the swallowtail behavior of the standard RN-AdS black hole. Instead, it exhibits an 8-shaped structure for $P<P_z$ and a C-shaped structure for $P_z<P<P_c$, corresponding to first-order and zeroth-order phase transitions between small and large black hole phases, respectively. Imposing the regularity condition thus leads to a richer phase structure for this class of black holes than the standard RN-AdS case.
Number Theory
$\vec M$ Versions of Andrews-Gordon Identities Revisited
In this paper, we revisit the work of Berkovich and Paule on variants of the Andrews-Gordon identities. We find a generalization of their principal polynomial identity and, as a consequence, obtain new $\vec M$ versions of the Andrews-Gordon identities. More precisely, for non-negative integers $M_1\ge M_2\ge M_3\ge\ldots\ge M_\nu$, we show that a broad class of multi-sums of the form $$ \sum\limits_{\mathbf n} \frac{ q^{ N_1^2+\cdots+N_\nu^2 - M_1N_1 - M_2N_2 - \cdots - M_\nu N_\nu } }{ (q)_{n_1}(q)_{n_2}\cdots(q)_{n_\nu} } $$ can be expressed as a sum of products. Above, we use standard notations for $q$-Pochhammer symbols and $N_i = \sum\limits_{k=i}^{\nu}n_k$ for $1\le i\le \nu$.
Read the full abstract
Complex Variables
Big and nef cohomology classes on compact Kähler spaces
We first prove a version of the Demailly-Paun theorem for compact weakly Kaehler spaces. Secondly, for a big and nef Bott-Chern class on a compact normal Kaehler space, we prove that the restricted non-Kaehler locus, defined using Kaehler currents with weak analytic singularities, is equal to the usual non-Kaehler locus.
Read the full abstract
Optics
Nonlinear dynamics of intra-cavity-field for periodically pump-modulated dual-coupled Kerr micro-ring cavities
We numerically investigate the long-time intra-cavity-field dynamics of a periodically pump- modulated pair of coherently coupled Kerr micro-ring resonators. Along a detuning scanning, fixed-phase stroboscopic trajectories change from recurrent regular state to states with positive maximum-Lyapunov growth. Long observation windows near the transition, where finite-time estimates converge slowly. The low- and high-detuning states both retain multi-mode Kerr-comb spectra, while their cycle-to-cycle field organization changes much more strongly. Spatiotemporal intensities, adjacent-cycle profiles, and full-field recurrence measures show a loss of one-period recurrence together with changes in the inter-resonator phase relation, coherent exchange, and dispersive intensity flow. We linearize the coupled equations around the long-time field and examine the growth of an infinitesimal perturbation. The resulting tangent-energy balance shows that the loss contribution changes little along the scanning, whereas the Kerr contribution increases and exceeds the loss magnitude in the high-detuning states with positive Lyapunov growth. A separate dimensional correspondence relates the normalized working range to Si3N4 micro-ring. These results provide a field-resolved description of the long-time dynamical change and its associated perturbation growth.
Read the full abstract
Number Theory
Simultaneous Residue-Class Selection in Prescribed-Difference Packings
A family $\mathcal F$ of finite subsets of $\mathbb Z$ is packed into $[N]$ if suitable integer translates of its members are pairwise disjoint subsets of $[N]$. We study two prescribed-difference packing problems of Alon, Dębski, Grytczuk and Przybyło for the arithmetic progressions $A_d=\{d,2d,\ldots,\lfloor n/d\rfloor d\}$ and $B_d=\{d,2d,\ldots,nd\}$. Let $m(n)$ and $M(n)$ denote the corresponding minimum packing lengths, with subscripts indicating restrictions on the admissible differences, and let $\mathcal P(x)$ denote the set of primes at most $x$. The key ingredient is a residue-class selection scheme that encodes pairwise intersection constraints by cyclic intervals. A lattice-covering argument yields a simultaneous admissible choice, permitting substantial overlap of the containing intervals and providing the sharp upper bounds needed for the bounded-diameter family and the prime-difference equal-cardinality family. For the bounded-diameter family, we prove $m(n)\sim m_{\mathcal P(\sqrt n)}(n)\sim 4n^{3/2}/(3\log n)$. For the equal-cardinality family with prime differences, we prove $M_{\mathcal P(n)}(n)\sim n^3/(6\log n)$. For the full equal-cardinality family, we show $M(n)\ge \left(\frac{19}{108}-o(1)\right)n^3/\log n$. Together with corresponding estimates for restricted ranges of differences, these results prove several conjectures of Alon–Dębski–Grytczuk–Przybyło and disprove others.
Read the full abstract
Risk Management
Simplifying Cyber Cat(astrophe)s with Cyber Kittens: Power Law Plausibility for Cyber Insurance Risks
Cyber insurance requires accurate modeling of worst-case catastrophic (cat) events, but the field lacks robust quantitative approaches for estimating upper-bound losses. Building on a recent dataset of 24 cyber cat events over 30 years, this work tests whether cyber economic losses follow a power law distribution. We analyze "cyber kittens" - sub-1B USD events distinguished from cat events (1B+ USD) only by magnitude - extracted via LLM from cyber insurance claims data (2020-2024). Using victim count (weighted by claim year) as a proxy for economic loss, we link kitten-sized events to known cat events to estimate losses. The kitten distribution proved consistent with the cat dataset, and power laws were statistically plausible: each order-of-magnitude increase in event size corresponds to a 5-7x drop in probability. Extrapolating, an event 100x the largest 2020-2024 cat event is expected roughly every 206 years, translating to 100-250B USD in losses - catastrophic, but not extraordinary relative to other insurance lines.
Read the full abstract
Mathematical Physics
Möbius Invariant Dimers and Miquel Dynamics
As is already known, there is a correspondence between circle patterns and the dimer model, which is invariant under Euclidean transformations. We establish a new correspondence that is invariant under the group of Möbius transformations PO(3,1), which is the natural symmetry group of circle patterns. We show that Miquel dynamics preserve the partition function, and that convexity of the t-embedding guarantees positivity of the face weights. We also show that the correspondence has a somewhat hidden symmetry group PO(3,3), which relates to the Lorentz lift of the t-embedding. Finally, we consider isoradial graphs, Doyle spirals, the once-punctured torus and isothermic circle patterns.
Read the full abstract
Signal Processing
Robust Multi-Source DoA Estimation under Weather-Induced Distortion: Structured Covariance Methods and Performance Bounds
Direction-of-arrival (DoA) estimation in adverse weather is degraded by propagation-induced phase and amplitude distortions that violate the covariance structure assumed by classical subspace methods. Motivated by a physics-based model of rain propagation, we develop a structured covariance formulation for rain-distorted arrays in both single- and multi-source scenarios. A key ingredient is to relax the physically parameterized distortion model and instead model the distortion covariance as an unknown real-valued Hermitian Toeplitz matrix. For the single-source case, we derive a closed-form covariance-matching calibration algorithm and provide structured-covariance and physics-informed Cramer-Rao lower bounds (CRLBs). For the multi-source case, we prove that the original per-source distortion model is non-identifiable and introduce a collinear approximation across angles. Under this approximation, we propose three multi-source calibration methods: alternating LASSO, joint LASSO, and a joint nuclear-norm formulation. Simulations under heavy rain demonstrate improved DoA accuracy and source resolvability compared with conventional baselines, highlighting the benefit of structured covariance modeling and calibration for safety-critical sensing.
Read the full abstract
Artificial Intelligence
Modus Tollens and Counterfactuals and Counterfactual Reasoning Based on Three Types of Negation
Modus Tollens (MT) is a classical logical inference rule, while counterfactuals are hypothetical statements that are contrary to facts, and counterfactual reasoning is a process of reasoning based on counterfactuals. Negation is an indispensable core concept in them. In this paper, based on the logical systems LCOI&PLCOI with contradictory negation, opposite negation and intermediary negation, we propose three variants of Modus Tollens corresponding to distinct negation types, namely MTC: Modus Tollens based on contradictory negation, MTO: Modus Tollens based on opposite negation, and MTI: Modus Tollens based on intermediary negation. We define the implications within MTC, MTO and MTI, provide the truth value algorithms of MTC, MTO and MTI, and discuss the reducibility of these algorithms. To incorporate these three types of negation into counterfactuals and counterfactual reasoning, we differentiate counterfactuals into two types based on whether they possess logical negation, thereby proposing three counterfactuals and counterfactuals reasoning based on different logical negations. In this paper, we further argue that the three counterfactuals reasoning based on different logical negations have the same inference form as MTC, MTO and MTI, respectively. In other words, they share the same inference structure. As a result, the truth value algorithms for MTC, MTO and MTI can be as the truth value algorithms for the three counterfactuals reasoning based on different logical negations. The algorithms indicates that if the first premise of the reasoning is true, the truth values of the reasoning conclusions are identical to the truth values of the three negative premises in the reasoning premises, respectively. This reflects the consistency and accuracy of the truth value algorithms.
Read the full abstract
Software Engineering
An Empirical Study on the Impact of Change Granularity in Refactoring Detection
Detecting refactorings in commit history is essential to improve comprehension to code changes on code reviews, and to provide valuable information for empirical studies on software evolution. Techniques have been proposed to accurately detect refactorings on the granularity of a single commit. However, refactorings can be made over multiple commits because of their complexity or other practical development problems, which cause detecting on only the granularity of a single commit not enough. We observe that some refactorings can only be detected in coarser granularity, i.e., changes conducted over multiple commits, or in the granularity of a single commit but not in coarse-grained. We call these types of refactorings as coarse-grained refactorings (CGRs) and ephemeral refactorings (EPRs). We investigated the features and causes of CGRs and EPRs through an empirical study of 32 open-source Java projects and found that both commonly occur during development. In addition, we found that refactoring types related to splitting or merging classes and packages, as well as those involving modifications to the inheritance structure, tend to be CGRs, and types targeting small objects such as variables and attributes, and refactorings with context-sensitive detection criteria tend to be EPRs. The causes of CGRs and EPRs are analyzed and categorized, and the relationships between the commit messages of CGRs and themselves are also assessed. We found that about 20% of commit messages explicitly suggest the existence of CGRs. We suggest that CGRs and EPRs be valued in refactoring research and that detectors be extended to identify CGRs.
Read the full abstract
Combinatorics
Clique Number of Tournaments II
The directed clique number $\vec{\omega}(T)$ of a tournament $T$ is the minimum, over all orderings of the vertices of $T$, of the clique number of the graph whose edges are the arcs that point backward with respect to the ordering. In this paper, we prove that, for every integer $k \geq 3$, deciding whether $\vec{\omega}(T) \leq k$ is NP-complete. This answers a question of Nguyen, Scott, and Seymour, and contrasts with the classical undirected setting, where deciding whether $\omega(G) \leq k$ is polynomial-time solvable for every fixed integer $k$. On the other hand, we give a polynomial-time algorithm distinguishing tournaments with $\vec{\omega}(T) \leq 2$ from those with $\vec{\omega}(T) > 100$. We also study the tournament analogue of the Gyárfás–Sumner conjecture. We construct new $\vec{\chi}$-bounding tournaments and thereby prove a conjecture of Aboulker, Aubian, Charbit, and Lopes stating that every class of tournaments with bounded twin-width is $\vec{\chi}$-bounded. We then exhibit new tournaments that are not $\vec{\chi}$-bounding, disproving another conjecture of Aboulker, Aubian, Charbit, and Lopes, as well as two conjectures of Kim. Finally, we present infinite families of 3-$\vec{\omega}$-critical and 4-$\vec{\omega}$-critical tournaments.
Read the full abstract
Signal Processing
Resolving the Discontinuity of Continuous-Time AFDM Waveforms
Continuous-time affine frequency division multiplexing (AFDM) waveforms, constructed via frequency wrapping and phase correction, are known to be sample-wise equivalent to the widely adopted discrete AFDM framework. In this paper, we uncover a fundamental and previously overlooked flaw in this construction: its complex envelope is inherently discontinuous for generic chirp parameters. We show that these discontinuities are the direct cause of the high out-of-band emission (OOBE). To resolve this issue, we propose a fundamentally different continuous-time waveform, termed stepped frequency division multiplexing (SFDM). Unlike conventional approaches that allow continuous frequency variation, SFDM freezes the instantaneous frequency at the midpoint of the underlying chirp trajectory within each Nyquist sampling interval. This design yields a complex envelope that is strictly continuous over the entire symbol duration while preserving exact sample-wise equivalence with discrete AFDM. A unified spectral analysis reveals that the superior OOBE performance of SFDM stems from the absence of internal jump discontinuities, which otherwise dominate the far-out spectral roll-off. Numerical results confirm that SFDM consistently achieves significantly lower OOBE across a wide range of chirp rates.
Read the full abstract
Information Theory
A Fundamental Limit in Decentralized Decision-Making
In decentralized decision-making, several agents connected according to a network graph aim at solving a classification problem by collecting streaming observations. Due to decentralization, they run an iterative algorithm where, at each iteration, they can only exchange information locally with their neighbors. While decentralized estimation solutions have been shown to match the performance of optimal centralized systems, we show here that surprisingly this conclusion does not hold for decentralized decision-making. Specifically, we prove that the error probability for the best decentralized decision strategy exhibits an irreducible loss with respect to the optimal centralized classifier. This result establishes a fundamental limit for the performance of any decentralized decision strategy. We obtain an analytical relation showing that this limit is related to the interplay between decentralization and classification. The first aspect appears through the distances between the nodes in the graph, while the second aspect plays through the moment generating functions of the likelihood ratios that describe the decision problem. By applying the derived closed-form relation to different network topologies and inference problems, we observe some interesting and perhaps unexpected behavior emerging. In particular, we characterize the scaling law (with the network size) for the loss over popular network topologies, showing that the error probabilities might differ by orders of magnitude; and we examine how performance is affected by the relative distance between informative and uninformative agents over the graph.
Read the full abstract
Artificial Intelligence
The Internal Anatomy of Strategic Choice in Large Language Models
Large language models act as strategic agents and models of human choice, yet choosing like a strategic agent does not mean computing like one. We recorded activations from four open-weight models — dense and mixture-of-experts, including a matched base–instruct pair — in one-shot play of 144 strict ordinal $2\times2$ games. We followed a prespecified incentive from prompt, through activations, to choice. Dense models mirrored the unadjusted human decline with game complexity. Incentive and choice were detectable in every model, but models differed in whether incentive reached the choice, aligned with it and, where tested, whether strengthening it shifted preference. The base and instruction-tuned Qwen2.5 models chose almost identically at baseline yet differed in whether incentive reached choice. Fixed decision cues were distinguishable internally but changed choices selectively. Similar behaviour can rest on different computation; post-training can reshape the path from represented incentive to decision while leaving behaviour and decodable information largely intact.
Read the full abstract
Materials Science
Benchmarking Universal Machine Learning Force Fields for Crystal Structure Prediction of High-Energy Molecular Systems
Recent developments of universal machine learning interatomic potentials (UMLIPs) offer a fast route for screening molecular crystals based on geometry relaxation and energy ranking, but their reliability across chemically diverse energetic materials remains elusive. In particular, it is unclear whether or not these UMLIPs are over-sensitive to break the desired molecular connectivity for relaxing the periodic crystals. Herein we tested the hypothesis that classical force-field pre-relaxation can provide a more suitable starting geometry for subsequent UMLIP relaxation on a large database of high energy molecular crystals. Three models (MACE, MACE-OFF and UMA) in conjunction with the General Amber Force Field (GAFF) were applied to test this hypothesis. Among them, direct MACE-OFF and UMA showed very high relaxation success and preserved the reference geometries most closely, but they still exhibit failures for some rare cases. Using GAFF pre-relaxation can systematically reduce the number of failed relaxations with lower computational costs. Our comparative failure and robustness analyses revealed distinct trade-offs among the evaluated models. Among them, MACE-OFF achieves a better compromise between potential energy surface smoothness, structural fidelity, and stress convergence, serving as a good choice to provide a reliable foundation for automated structural optimization.
Read the full abstract
Systems and Control
Noninvasive Anisotropic Identification of Magnetic Properties in Toroidal Shaped Magnetic Steel
This research proposes a model-free inverse approach for identifying the nonlinear anisotropic single-valued magnetic constitutive characteristics of soft magnetic materials from boundary measurements. Using the harmonic approximation, the internal magnetic flux density B and magnetic field strength H are independently reconstructed from the measured boundary data, thus avoiding the limitation of using a predefined parametric B–H mapping function. Subsequently, the reconstructed fields are spatially averaged along selected collection lines to recover the B–H characteristics of the principal directions. Numerical results demonstrate high reconstruction accuracy for unperturbed data and good robustness against Gaussian perturbations of the boundary measurements, with the overall mean error remaining below 5% for a 10% noise level. These results indicate that under the harmonic-field assumptions, the field-based reconstruction provides a simple and computationally efficient framework for non-invasive identification of nonlinear anisotropic magnetic constitutive characteristics.
Read the full abstract
Logic
Combinatorics in 1-semi-equational theories
We give direct combinatorial proofs that 1-semi-equational theories satisfy two combinatorial properties that imply the non-interpretability of certain fields. Our main result is that Boolean combinations of 1-semi-equations have almost linear Zarankiewicz bounds, and hence no infinite field is interpretable in a 1-semi-equational theory; this answers a question of Chernikov–Mennen and Chernikov–Starchenko, who had respectively established almost linear Zarankiewicz bounds for Boolean combinations of $(2,1)$-semi-equations and Boolean combinations of weakly normal relations. (This was recently and independently established by Gou, Mirabi, Mittal, Tran, and Yang, using different techniques and producing different bounds.) We also show that $(k,1)$-semi-equations satisfy the $\delta$-strong Erdős–Hajnal property with $\delta=1/6^{k-1}$; this had previously been established by Chernikov–Starchenko for an ineffective constant $\delta>0$.
Read the full abstract
Computation and Language
Where Should Language Sit in a Multimodal Model? Lessons from What Language Does to Human Perception and Cognition
Language models compute over tokens: language is their input, their output, and increasingly their internal representation. Whether language should keep all of these positions depends on what language does to the system that uses it. The one system with a century of data on that question is the human. We review what language does to human perception, the brain, and thought, and read the same evidence against multimodal models and language models. Throughout, we treat language as a compressor that runs on a shared codebook: a word is an index, the content is in the receiver, and a community maintains the codebook. In humans the compression is measurable, learning the codebook reorganizes the senses, and thought survives the loss of language. We then measure the rule that models apply when two cues disagree, with cue-conflict experiments on six vision-language models and two robot policies. Surviving cues are weighted in the order their reliabilities prescribe, at 11 to 82% of the ideal observer's slope, and many answers copy the text. One policy family drops a cue that adds no information beyond the others rather than down-weighting it, another keeps it at a weight that fails when the cues conflict, and a visual cue that identifies the task in every training frame is never learned, because the language pathway already fits the data. Language models are the best current models of the human language network, and they have entered the human speech community, shifting word frequencies while alignment narrows their conceptual diversity. We close with seven implications for token-based systems. Language belongs at a model's boundary and in the shared codebook, as in the brain, not as its internal representation; the price of leaving the codebook inside is auditability.
Read the full abstract
Networking
Blockchain-based Proportional Fair Scheduling for Multi-Operator O-RAN
The openness and disaggregation of Open radio access network (O-RAN) facilitate resource sharing and coordination across networks, creating new demands for efficient and trustworthy cross-operator scheduling. However, such scheduling is beyond the scope and capability of conventional proportional fair scheduling (PFS), which lacks mechanisms for establishing trust among independent operators. To fulfill this gap, we propose the blockchain-based proportional fair scheduling (BC-PFS) that enables trustworthy inter-network coordination and resource pooling across operators in O-RAN. Specifically, we design four core smart contracts including registration, status reporting, scheduling, and settlement contracts with corresponding Solidity implementations to ensure trustworthy on-chain execution. Theoretically, to evaluate the BC-PFS performance, we develop an analytical framework to derive the user average throughput via both probabilistic and ordinary differential equation (ODE) approaches, and provide a simplified closed-form solution. Based on the above performance assessment, we quantify the pooling effect in O-RAN achieved through trustworthy cross-operator collaboration via BC-PFS, and point out that this effect grows monotonically in both the numbers of operator networks and users. Simulations validate the theoretical analysis and show the performance of the BC-PFS in O-RAN.
Read the full abstract
Fluid Dynamics
A Comparative Study of Finite-Volume-based Coupled and Segregated Reduced-Order Models for Incompressible Flows in Parametrized Domains
This work presents a comparative analysis of Reduced-Order Models (ROMs) applied to incompressible fluid dynamics within geometrically parametrized domains. Two distinct reduced-order solution strategies are investigated and compared: a monolithic coupled solver and a segregated SIMPLE-based algorithm. Their performance is assessed on two steady, two-dimensional benchmark cases: a lid-driven cavity flow and a flow past a cylindrical obstacle. The two algorithms are compared in terms of fields evaluation and aerodynamic coefficients prediction. The computational results highlight a fundamental trade-off between accuracy and numerical efficiency. On the one hand, after an opportune supremizers enrichment, the coupled approach guarantees a faster convergence, despite the need of a larger number of degrees of freedom. On the other hand, the segregated SIMPLE algorithm yields superior reconstruction accuracy, particularly for lower-dimensional reduced spaces, at the cost of a slower convergence rate.
Read the full abstract
Computation and Language
MEMO: Multimodal Evidence Memory Organization for Long-Horizon LLM Agents
Long-running LLM agents rely on external memory to store and reuse information beyond a single context window, yet there is a fundamental tension between the continuous accumulation of interaction trajectories and the limited context capacity. The key challenge in agent memory is therefore not only to retrieve relevant records, but also to select necessary evidence under a given budget and organize it in an appropriate modality. Existing memory readout methods mainly use textual or visual forms. Text preserves high fidelity, but its linear token representation makes contents with different importance compete for the limited context at nearly uniform unit cost. Visual readout renders text into document-like images, which can use two-dimensional layouts to expose structure and emphasize key information, but it may lose fine-grained details during rendering and compression. To address this issue, we propose MEMO, a multimodal evidence memory organization method for LLM agents. MEMO first uses a trained evidence extractor to select relevant memory blocks and form evidence units with source information and presentation requirements. A trained query-conditioned memory manager assigns each unit to a textual, visual, or dual-channel carrier and selects a layout that matches the evidence structure. A deterministic memory construction module then generates the textual package and visual pages. The memory manager is trained with feedback from an offline reader that measures the utility of the guided memory plan, so that retention and presentation decisions align with downstream usage. We evaluate MEMO on four benchmarks, HotpotQA, 2WikiMultiHopQA, LoCoMo, and ALFWorld, with multiple reader backends. The results show that MEMO presents memory more efficiently with fewer memory tokens, improves downstream task performance, and builds more effective working memory under constrained budgets.
Read the full abstract
Robotics
Measuring Language Transfer in Robot Policies: Adding Greek to a Cosmos3 Vision-Language-Action Policy
Robot foundation models are trained and evaluated predominantly in English, and robot demonstration corpora do not exist for most languages. We study the addition of Greek to an open vision-language-action stack using only machine-rephrased instructions and no architecture changes. The main challenge is measurement rather than translation. Several plausible instruments produce false conclusions: a color-histogram metric rewards noise, a single-goal benchmark scores 84.6% under correct Greek and 82.6% under deliberately wrong instructions, training loss fails to predict Greek success, and single-run comparisons are dominated by seed variation. On a discriminative ninety-task suite with three seeds per arm, a multilingual text tower without Greek demonstrations remains at its wrong-instruction floor, while Greek-only training exceeds its control by at most 2.7 points. Bilingual training yields a consistent 6.7-7.1 point margin over its control and reaches about two fifths of English performance. The policy also overfits the translator's phrasing; training on seven phrasings per task approximately halves this penalty. Warm-starting from a language-adapted world model and unfreezing the text tower both degrade performance. The results support two practical requirements for low-resource robot-policy localization: build a guaranteed null before trusting a metric, and replicate low-resource-language results across seeds.
Read the full abstract
Astrophysics of Galaxies
ALMA Reveals an Explosive Outflow Candidate in IRAS 16119–5048
We present a multiwavelength study of the massive star formation region IRAS 16119-5048 (I16119) using ALMA ATOMS Band 3 and QUARKS Band 6 observations, complemented by archival ATCA radio continuum and Spitzer mid-infrared data. The CO (2-1) emission reveals a system of high-velocity streamer-like structures around the central region. Using dendrogram analysis of velocity-channel maps followed by linking in position-position-velocity space, we identify 16 approximately radially distributed streamers whose projected trajectories converge toward a common central region. The kinetic energy of the outflows is at least an order of magnitude lower than those of most known explosive outflows, while their mass entrainment and momentum rates are high compared with typical protostellar outflows, suggesting that I16119 may represent a low-energy explosive outflow candidate. Dense-gas and photodissociation-region tracers reveal shell-like structures associated with the 8 $\mu$m emission, indicating that feedback from the H II region may influence the streamer morphology. The 1.3 mm continuum resolves 27 dense cores along a fragmented filamentary structure. Their separations are consistent with thermal Jeans or cylindrical fragmentation, while the collect-and-collapse scenario is unsupported. The dense cores also show evidence of mass segregation, with the most massive cores concentrated near the inferred explosive centre. We suggest that I16119 is a plausible low-energy explosive outflow candidate, possibly triggered by dynamical interactions among centrally concentrated massive cores. However, the complex velocity structure and possible contamination from individual core-driven outflows prevent a definitive classification. More sensitive, higher angular-resolution observations are required to confirm the nature of the outflow.
Read the full abstract
Functional Analysis
Spectral structure and eigenmatrices of self-affine measures with $p$-digits in $ \bf{\mathbb{R}^{n}} $
For a prime number $p > 2$, let $\bm{0} \in D \subset \mathbb{Z}^n$ be a $p$-element digit set satisfying $ \mathcal{Z}(\widehat{\delta}_D) =\cup_{j=1}^{p-1}(\frac{j}{p}\bm{a}+\mathbb{Z}^{n}) $ for some \( \bm{a} \in \{ (i_1, \dots, i_n)^t : i_k \in [1, p-1] \cap \mathbb{Z}, 1\leq k\leq n \} \), where $\mathcal{Z}(\widehat{\delta}_D)$ is the zero set of the Fourier transform of $\delta_D$. Let $Q$ be an integer expansive diagonal matrix in $\mathbb{R}^{n}$, the self-affine measure $\mu_{Q,D}$ is defined by \[ \mu_{Q,D}(\cdot) = \frac{1}{\#D} \sum_{d \in D} \mu_{Q,D}(Q(\cdot) - d). \] In this paper, we first provide sufficient condition for a maximal orthogonal family $E_{\Lambda}=\{ e^{-2\pi i \langle \lambda, x \rangle} : \lambda\in \Lambda \subset\mathbb{R}^{n}\}$ to be an orthogonal basis of $L^2(\mu_{Q,D})$ when $Q = p\operatorname{diag}[q, \dots, q]$ with $q\geq 1$. Then we obtain necessary and sufficient conditions for the integer matrix $R$ such that $E_{\Lambda}$ and $E_{R\Lambda}$ are both orthogonal basis of $L^{2}(\mu_{Q,D})$. Furthermore, for $Q = p\operatorname{diag}[l_1, \dots, l_n]$ with $|l_1 \dots l_n| > 1$, we give a necessary and sufficient condition under which the real diagonal matrix is the second type spectral eigenmatrices of $\mu_{Q,D}$.
Read the full abstract
High Energy Physics (Phenomenology)
Baryon number freeze-out in the Standard Model, precisely
Weak sphaleron transitions turn a lepton asymmetry of the Standard Model plasma in the early Universe into a baryon asymmetry, conserving baryon-minus-lepton number $B-L$ and its individual flavored charges. A baryon asymmetry can thus also arise from flavored lepton asymmetries with vanishing $B-L$. Standard equilibrium calculations in the symmetric and broken phases are performed at constant temperature and hence neglect the fact that both the Higgs expectation value and the sphaleron rate vary as functions of temperature across the electroweak crossover. We derive a Boltzmann equation for the baryon number evolution across the crossover and calculate the freeze-out abundance including higher-order corrections to both the grand canonical partition function and the perturbative Higgs expectation value. This yields two sphaleron conversion factors: $C_\text{sph} = 0.3328(5)$ for $B-L$ and $\mathcal{F}_\text{sph} = 0.0279(19)$ for the flavored charges weighted by the charged-lepton Yukawa couplings.
Read the full abstract
Analysis of PDEs
Gradient flow approach to Landau equation: A cross-product structure
We introduce a cross-product Landau gradient that commutes with Gaussian mollification. For the hard-potential interaction kernels of the form $A(|v-v_*|)\sim \langle v-v_*\rangle^\gamma|v-v_*|^2$ with $\gamma\in(-\infty,1]$, this construction yields a variational characterisation of the gradient-flow structure of the spatially homogeneous Landau equation. The cross-product gradient induces the same gradient-flow geometry as that introduced by Carrillo, Delgadino, Desvillettes and Wu (2024), while providing a different representation of the Landau gradient. The main advantage of this formulation is that it requires only weighted $L^1$-control. We also discuss a similar variational characterisation for the GENERIC structure of the fuzzy Landau equations.
Read the full abstract
Optics
Reduction of hydroxyl groups in optical nanofibers via in-fiber laser heating
Optical nanofibers fabricated using a standard oxyhydrogen flame exhibit optical losses at wavelengths around 1385~nm due to absorption by embedded hydroxyl groups, posing a challenge for the realization of quantum electrodynamics systems using ytterbium atoms. Here, we establish a method for the reduction of hydroxyl groups by heating them with a laser guided within the optical nanofiber under vacuum conditions. The temperature of the optical nanofiber during heating is estimated by monitoring the phase shift of the transmitted light using an interferometer. As a result, evidence suggesting that hydroxyl groups were desorbed by laser heating was obtained.
Read the full abstract
Spectral Theory
$L^p$ bounds for wave operators with critical electromagnetic potentials
We study the Møller wave operators for scaling critical electromagnetic Hamiltonians in the plane. For smooth transverse magnetic and angular electric potentials, with nonnegative angular operator and magnetic flux outside $\frac12\Z$, we prove that the wave operators relative to $-\Delta$ exist, are unitary on $L^2$, and, together with their adjoints, are bounded on every $L^p$, $1<p<\infty$. We then specialize to the the Aharonov–Bohm model and we determine the exact ranges for the boundedness of their wave operators on weighted $L^p(\R^2,|x|^\beta\,dx)$ spaces, for both the Friedrichs and the Krein realizations. In the Friedrichs case, this gives in particular the already known boundedness on all $L^{p}$ spaces $1<p<\infty$, while boundedness fails at $p=1,\infty$. In the Krein case, both wave operators and adjoints are bounded precisely when $2/(2-\eta_\alpha)<p<2/\eta_\alpha$, where $\eta_\alpha=\max\{\alpha,1-\alpha\}$ (here $\alpha\in(0,1)$). Thus the boundary condition changes the admissible exponents.
Read the full abstract
Metric Geometry
On a Brunn-Minkowski principle for first-order information functionals
In this work we present the following general principle: every positive homogeneous functional on an abstract convex cone satisfying a suitable Brunn-Minkowski inequality gives rise to an information functional -defined as the quotient of the functional by its relative surface area- that satisfies a linear Brunn-Minkowski inequality. We also establish the dual counterpart of this principle for functionals satisfying an analogous convexity property, yielding reverse linear Brunn-Minkowski inequalities for the associated information functionals. Furthermore, we show that homogeneity is necessary within this principle by providing a counterexample to the expected result for the information functional associated to the standard Gaussian measure. As applications, we recover, via an alternative first-order argument, a classical result by Giannopoulos, Hartzoulaki and Paouris (2002) for the ratio of two consecutive quermassintegrals, together with a characterization of the equality case. The same argument extends to the setting of mixed discriminants of symmetric positive definite matrices. Finally, our approach yields new extensions of the Brunn-Minkowski inequality of Dembo, Cover and Thomas, for the classical information functional, both to the $L_p$ setting ($p \geq 1$), where the relative surface area is expressed in terms of Lutwak's first $L_p$ quermassintegral, and to the measure-theoretic framework, for measures with homogeneous densities satisfying some concavity. Moreover, we prove that our principle applies also in the context of the Blaschke addition, both in the volume and in the (mixed) affine surface area cases, obtaining new inequalities as an application of it.
Read the full abstract
Computer Vision
When Superpixels Fail on Documents: A Study of Segmentation for LIME Explanations
Post-hoc explanation methods are widely used to inspect image classifiers, but their reliability depends on design choices that are often treated as implementation details. We study this issue for LIME on document image classification, focusing on the segmentation step that defines the interpretable units being perturbed. Standard image-based LIME typically relies on natural-image superpixels, which are poorly aligned with document structure such as text regions, layout blocks, and identification codes. Using RVL-CDIP, we compare Quickshift and SLIC with document-aware segmentations based on OCR bounding boxes and regular grids. Our results show that segmentation strongly affects explanation consistency, correctness, and local fidelity. Document-aware segmentations produce more stable and faithful explanations, require fewer perturbations to converge, and expose shortcut behaviour based on document identification codes, a known RVL-CDIP bias that superpixel-based LIME often obscures. These findings show that reliable post-hoc explanation requires domain-aware interpretable representations, and that segmentation should be treated as part of the explanation method rather than as neutral preprocessing.