Peer Revenue Publish or profit

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Monday 7 September

Computation and Language

MeRoTune: RoPE-Safe Merging with a Tunable Dial

When you merge two fine-tuned models from the same base checkpoint by simply averaging their weights, you implicitly assume their attention subspaces are still aligned. Recent work attempts to fix misalignments by learning an invertible correction matrix, $M$, for each model's query and key projections. This correction cancels out—using $M$ on the query side and $M^{-T}$ on the key side—right before the dot product. However, this cancellation is only exact if nothing sits between the projection and the dot product. In reality, almost all modern open-weight language models put a rotary position embedding (RoPE) exactly there. In this paper, we show that this cancellation is exact under RoPE if and only if $M$ commutes with RoPE's per-position rotation. We derive the specific class of matrices where this holds: a scaled rotation acting independently within each RoPE frequency pair. This forms a strict, low-dimensional subset of the unconstrained matrices that current methods normally train. Building on this, we turn this constrained matrix class into a new merging method. While keeping the base weights entirely frozen, two fine-tunes each learn their own RoPE-compliant correction matrices. We optimize these corrections against a chosen blend ratio so the final result can be adjusted post-hoc like a dial, rather than locked into a single fixed merge. Our default approach trains at one fixed blend ratio, similar to how LoRA sets its scaling hyperparameter in advance. We also experiment with resampling the blend ratio randomly at every training step, and we report the results of both approaches.
Read the full abstract

Operator Algebras

A Non-commutative Individual Ergodic Theorem Along Sparse Random Subsequences

Let $(M,\tau)$ be a semifinite von Neumann algebra, let $J$ be a trace-preserving Jordan isomorphism, and let $(n_k)_{k\geq 1}$ be a random increasing sequence of integers obtained by selecting each integer $n\geq 1$ independently with probability $n^{-\alpha}$, where $0<\alpha<\frac12$. We show that, almost surely, for every $x\in L^1(M)$, $ \frac1m\sum_{k=1}^m J^{n_k}(x)$ converges bilaterally almost uniformly. This extends LaVictoire's classical random $L^1$ ergodic theorem to the non-commutative setting.
Read the full abstract

Mathematical Software

Geometric Function Atlas: certified computing for geometric function theory in Python

We describe geometric-function-atlas, our open-source Python package for the sharp extremal problems of geometric function theory. We organise it around a catalogue of thirty-nine Ma–Minda starlike generators. From this catalogue we compute exact Taylor coefficients, closed-form Fekete–Szegő constants, exact coefficients of the Ma–Minda extremal function, and admissibility screens. Our verifier answers membership questions for normalised polynomials at three levels of evidence: a floating-point grid screen, an exact sufficient condition decided in rational arithmetic, and a certified interval enclosure at the worst screened point. Every answer names the level at which we obtained it. We ship a checksummed artifact snapshot with three hundred and six coefficient certificates and seven hundred and two directed inclusion radii. Eight reviewed radius lanes carry certificates whose proof chains we replay symbolically, and we re-execute every coefficient certificate through our exact Schur-parameter machinery on request. We emit all results through one versioned envelope that records the method, the evidence status, the assumptions, and the artifact identifiers. Two optional laboratories apply the same discipline to cryptographic S-box metrics and to image-quality metrics. We present our design, state as propositions what each tier establishes, follow one radius lane from screen to replayed certificate, report measured timings, and place our package among symbolic-algebra, rigorous-numerics, and mathematical-database software. We release geometric-function-atlas under the MIT licence on the Python Package Index and at https://github.com/Prasanna28Devadiga/geometric-function-atlas.
Read the full abstract

All authors Kishan Gurumurthy, Pushparaj Devadiga, Prasanna Devadiga, Arya Suneesh, Asha Sebastian

Computation and Language

Reasoning Beyond Transcription: Audio Language Models on Child Stuttering Speech

Child speech differs from adult speech in acoustics, prosody, and linguistic structures. Speech disfluencies (such as repetitions) further challenge automatic understanding. While Audio Language Models (ALMs) show strong semantic reasoning from speech audio, their ability to reason about disfluent child speech in mixed-speaker settings remains unexplored. We investigate this through two tasks: child-focused semantic summarization and speech entailment. Experiments use recordings of children who stutter in mixed speaker interviews without explicit speaker separation. Models are instruction-guided to focus on the child, preserve clinically relevant disfluencies, and avoid adult-speech leakage. Evaluation combines LLM-based judges and reference-based metrics, anchored by transcript-oracle baselines to isolate errors. Results show that while ALMs extract high-level meaning from stuttered speech, reasoning degrades significantly with increased
Read the full abstract

Quantum Gases

Limit Cycles in a Photonic Dimer with Tuneable Non-Hermitian Interactions

Interactions govern the emergence of collective behaviour in classical and quantum many-body systems. While conservative interactions are well known to generate nonlinear phenomena ranging from self-trapping to pattern formation, it remains largely unexplored whether purely dissipative – i.e., non-Hermitian – interactions can give rise to similarly rich dynamics and nontrivial system states. Here, we experimentally realise tuneable non-Hermitian interactions in two coupled condensates of light confined within a dye-filled double-well microcavity. Local coupling to molecular reservoirs generates the effective dissipative photon interactions. We show that the interplay between coherent tunnelling and interactions stabilises limit-cycle oscillations, a hallmark of nonlinear dynamics traditionally associated with Hermitian nonlinearities. By tuning the reservoir coupling, we map out the dynamical phase diagram comprising stable fixed points and limit cycles, thereby demonstrating direct control over the interaction strength. Our experimentally validated model reveals both supercritical and subcritical Hopf bifurcations, giving rise to hysteresis, bistability and excitability. These results validate dissipative interactions as a mechanism for organising collective nonlinear dynamics in driven-dissipative systems and pave the way towards exploring nonequilibrium many-body physics through controlled dissipation.
Read the full abstract

All authors Kevin J. H. Peters, Peter Schnorrenberg, Daniel Ehrmanntraut, Nikolas Longen, Julian Schmitt

Machine Learning

MetaKV: Adaptive KV Cache Compression for Constrained LLM Inference

Key–value (KV) cache compression is an effective way to reduce the memory overhead of large language model (LLM) inference, particularly for long-context workloads. However, existing compression methods make different trade-offs among accuracy, inference latency, and peak KV cache memory utilization, making a single fixed configuration unsuitable across different prompts and resource constraints. We introduce MetaKV, an adaptive framework that selects a KV cache compression configuration for each input prompt based on user-specified latency and peak memory budgets. MetaKV uses lightweight prediction models to estimate the end-to-end latency, peak memory, and probability of a correct response for each candidate configuration, and selects the configuration that best satisfies the latency-memory constraints while preserving accuracy. We evaluate MetaKV across ten configurations from three representative KV cache compression methods, KVQuant, H$_2$O, and RocketKV, together with an uncompressed FP16 configuration, on four datasets covering mathematics, science, commonsense reasoning, and reading comprehension. Across a wide range of latency and peak memory constraints, MetaKV consistently outperforms the best static configuration, improving constrained success rate (CSR), the fraction of prompts answered correctly while satisfying both constraints, by approximately 0.07 on average and up to 0.135. These results demonstrate the benefit of adapting KV cache compression to individual prompts and latency-memory constraints. Code is available at https://github.com/MichaelWang0505/MetaKV.git
Read the full abstract

Computation and Language

Rethinking Sign Language Translation: The Impact of Signer Dependence on Model Evaluation

Sign Language Translation has advanced with deep learning, yet evaluations remain largely signer-dependent, with overlapping signers across train/dev/test. This raises concerns about whether models truly generalise or instead rely on signer-specific regularities. We conduct signer-fold cross-validation on GFSLT-VLP, GASLT, and SignCL, three leading, publicly available, gloss-free SLT models, on CSL-Daily and PHOENIX14T. Under signer-independent evaluation, performance drops sharply: on PHOENIX14T, GFSLT-VLP falls from BLEU-4 21.44 to 3.59 and ROUGE-L 42.49 to 11.89; GASLT from 15.74 to 8.26; and SignCL from 22.74 to 3.66. We also observe that in CSL-Daily many target sentences are performed by multiple signers, so common splits can place identical sentences in both training and test, inflating absolute scores by rewarding recall of recurring sentences rather than genuine generalisation. These findings indicate that signer-dependent evaluation can substantially overestimate SLT capability. We recommend: (1) adopting signer-independent protocols to ensure generalisation to unseen signers; (2) restructuring datasets to include explicit signer-independent, sentence-disjoint splits for consistent benchmarking; and (3) reporting both signer-dependent and signer-independent results together with train-test sentence overlap to improve transparency and comparability.
Read the full abstract

All authors Keren Artiaga, Sabyasachi Kamila, Haithem Afli, Conor Lynch, Mohammed Hasanuzzaman

Algebraic Geometry

Nakano-positive determinants outside the Hodge-Riemann cone

Dinh and Nguyên asked whether the determinant of a Griffiths positive matrix of $(1,1)$-forms belongs to the Hodge–Riemann cone. For every $n\geqslant4$ and $2\leqslant k\leqslant n-2$, we present counterexamples constructed by AI: Nakano positive $k\times k$ matrices of constant $(1,1)$-forms on $\mathbb{C}^n$ whose determinants have singular Lefschetz maps in bidegree $(1,n-k-1)$. Under the simultaneous diagonalizability (SD) condition, we prove the Hodge–Riemann property in every bidegree $(p,q)$ with $p+q=n-k$ and $\min(p,q)\leqslant1$. The proof uses the generalized Alexandrov–Fenchel inequality of Ross, Süß, and Wannerer. For every $n\geqslant6$ and $2\leqslant k\leqslant n-4$, we also present SD examples whose determinants have singular Lefschetz maps in bidegree $(2,n-k-2)$. Their underlying idea comes from Ross–Toma's construction. The remaining cases $n=k\geqslant4$ and $n=k+1\geqslant5$ are open for general Griffiths positive matrices. They reduce to the top-Chern case of Griffiths' positivity question, equivalently to Finski's double mixed discriminant problem. We also ask whether a $2\times2$ counterexample on $\mathbb{C}^4$ can be both Nakano positive and dual Nakano positive.
Read the full abstract

Cryptography and Security

Guppy: Efficient Light Clients via Recursive Zero-Knowledge Proofs

Traditional light clients rely on validators committing to the entire blockchain state at every block via a state commitment such as a Merkle tree, allowing clients to verify facts using short proofs. However, maintaining large and ever-growing state trees imposes a significant burden on validators and lies on the critical path of block production. As a result, many modern high-throughput chains avoid this approach altogether. This work asks whether efficient inclusion proofs can be supported without requiring validators to maintain full state commitments. We present Guppy, a protocol that achieves this by having validators commit to just the state updates. An off-chain, untrusted service, secured by recursive Zero-Knowledge Proofs (ZKPs), then maintains a verifiable Merkle tree over the full state. This design keeps validator overhead negligible and does not increase the asymptotic complexity of block construction. Our design rests on two key technical ideas. First, a hash-chain commitment moves validator signature verification out of the ZK circuit, keeping the proving circuit efficient. Second, we design a parallel recursive proving pipeline that leverages cheap recursion in modern ZKPs to ensure latency grows only logarithmically with throughput. Our Plonky2-based implementation demonstrates that Guppy can maintain a Merkle tree of size 2^30 while processing thousands of updates per second, adding only 2-4 s of latency.
Read the full abstract

All authors George Danezis, Deepak Maram, Arnab Roy, Alberto Sonnino, Karl Wüst

Mesoscale and Nanoscale Physics

Steady reservoir-mediated self-trapping of polariton condensates

Nonequilibrium bosonic condensates of exciton-polaritons generated by tightly focused incoherent optical beams are typically expected to form a stationary ballistically expanding state with the notable exception of experimentally observed compact self-trapped states [Phys. Rev. Lett. 123, 047401 (2019)]. We show that the back-action of the condensate on the optically pumped excitonic reservoir via bosonic stimulated scattering can cause local reservoir depletion, producing a steady condensate confined in a self-induced potential trap. Notably, this self-trapped state is formed by persistent converging rather than radially expanding polariton currents and exists even below the conventionally defined condensation threshold. This state remains steady over nanosecond-scale times and is eventually ejected from the self-induced trap due to a bullet-type instability, enabling spiking neuromorphic dynamics in networks of polariton condensates.
Read the full abstract

All authors Pavel N. Kozhevin, Oleg I. Utesov, Igor S. Aranson, Sergey V. Koniakhin, Anton V. Nalitov

Machine Learning

$\alpha$-Graph: Attention-Infused Normalizing Flow Approach to Tractable Graph Modeling

Graph modeling, a crucial task for representing complex relationships in graph-structured data, has achieved significant success in recent years. However, current graph modeling methods rely on traditional Graph Neural Networks and pre-training approaches to implicitly learn the underlying relational structure of graph data. Thus, these prior methods cannot capture the complex graph structure and correlations among inputs. In this paper, we introduce a novel Attention-based Normalizing Flow-based Approach\footnote{Our implementation and models will be released publicly for research reproducibility.} (ANFA or $\alpha$) that provides an explicit, interpretable, and tractable Graph Modeling ($\alpha$-Graph). In particular, we propose a new Unconditional Graph Normalizing Flow with an Invertible Attention Mechanism to capture the complex relational structure of graph data. To further enhance the expressiveness of the model, we introduce Conditional Graph Normalizing Flow with Learnable Queries that enables efficient modeling of correlations in graph-structured data. We show that our Conditional Graph Normalizing Flows behave similarly to Unconditional Graph Normalizing Flows, enhancing expressiveness while maintaining training stability and efficiency. Our experimental results on three benchmarks will illustrate the effectiveness and the state-of-the-art (SoTA) performance of the proposed $\alpha$-Graph method.
Read the full abstract

All authors Thanh-Dat Truong, Sarah Alharbi, Susan Gauch, Xinghui Zhao, Marios Savvides, Khoa Luu

Computational Complexity

Accelerating Fourier–Motzkin elimination: redundancy removal and the choice of variable elimination order

Fourier-Motzkin elimination computes an inequality description of the projection of a polyhedron onto a subset of its coordinates by eliminating one variable at a time. It is used in several areas of optimisation and computer science, and it is a standard way of obtaining the entropic constraints of a causal structure, where the marginalisation over the latent variables produces such a projection. Its limitation is the growth of the intermediate systems of inequalities, which can be doubly exponential in the number of eliminated variables even though the projection itself grows only as a single exponential. In practice the computational overload of the method therefore depends on two choices: how the redundant inequalities are removed after each step, and the order in which the variables are eliminated. We consider both. We first show, by an explicit example, that Imbert's redundancy test cannot be interleaved with redundancy removal by linear programming. We show that the two methods, however, can be combined soundly if the derivation records used by Imbert's test are re-initialised after every step at which linear programming is used. We then propose a rule for choosing the elimination order of the variables that gives a significant computational advantage, however, at the cost of increased resource usage. We demonstrate this advantage on some random polytopes, where the rule reduces the running time by factors of between 6 and 25 compared with the same elimination under a fixed order. For entropic descriptions of causal structures, with more than 250 inequalities and more than 100 variables to eliminate, our rule keeps the number of inequalities handled at each step one to two orders of magnitude lower than a fixed order.
Read the full abstract

Machine Learning (Statistics)

The Role of Uncertainty in Assessing the Fairness of Machine Learning Models

Machine learning models are widely used in clinical applications, social media, law enforcement and critical infrastructure. Verifying whether their outputs are biased against disadvantaged groups or individuals is crucial to ensuring they are fair and allowing their use in such settings. A rigorous risk assessment of possible fairness violations requires quantifying the uncertainty associated with selecting and estimating such models. Yet, this is rarely done in the literature, which focuses on identifying a single model with a suitable trade-off between predictive accuracy and fairness. In this paper, we move beyond point estimation and discuss frequentist and Bayesian approaches to uncertainty quantification for fair machine learning, with practical examples and implications for simulated and real data.
Read the full abstract

General Finance

Historical Reflections on Interest Rates and the Emergence of the Yield Curve

This text grew out of a historical introduction initially written for a study of interest rates in cryptocurrency markets. The difficulty of defining a term structure for a currency without a conventional bond market led naturally to a more fundamental question: under what historical conditions does a yield curve become observable at all? Credit existed long before modern money, and interest-bearing loans are documented as early as ancient Mesopotamia. For much of history, the surviving evidence lacks the institutional features that facilitate reliable comparisons of interest rates by maturity: standardised debt instruments, sufficiently homogeneous borrowers, regular issuance over a range of maturities, observable market prices, and liquid secondary markets. We trace the gradual emergence of these conditions from ancient Mesopotamia, Greece, and Rome, through medieval and early modern Europe, to the development of modern sovereign debt markets in the nineteenth and twentieth centuries.
Read the full abstract

Probability

Malliavin smoothness and density estimates for the third-order Hermite process

We prove Malliavin nondegeneracy for the third-order Hermite process. The key step is to show that, for every nonzero test direction $h\in C_c^\infty(0,1)$, the directional Malliavin derivative of a third-order Hermite random variable is an infinite-rank Gaussian quadratic form. Using arbitrarily large orthonormal families of such directions, we derive a self-contained Fourier bound for their joint characteristic function and obtain polynomial small-ball estimates of arbitrary order for the Malliavin norm. This yields negative moments of every order. Combining the one-time estimate with determinant factorization and Malliavin strong local nondeterminism, we obtain negative moments of all orders for finite-dimensional Malliavin determinants. Consequently, all finite-dimensional distributions, as well as arbitrary vectors of non-overlapping increments, admit Schwartz densities. We further establish grid-uniform Sobolev bounds for inverse Malliavin determinants of normalized increment vectors and derive stretched-exponential estimates for all partial derivatives of their densities. The decay exponent is $2/3$, reflecting the third Wiener chaos. This settles the next non-Gaussian Hermite order after the Rosenblatt case and provides a quantitative counterpart to the order-two smoothness theory.
Read the full abstract

Machine Learning

Streaming Hierarchical Inference with Tabular Foundation Models

Tabular Foundation Models (TFMs) have recently demonstrated strong predictive performance through in-context learning, but their deployment in high-throughput data streams remains challenging due to communication overhead and latency. We propose HINT, a hierarchical inference framework that combines edge-based retrieval with cloud-based TFM inference. A graph-based approximate nearest neighbor memory maintained over a sliding window provides local predictions and uncertainty estimates, allowing confident samples to be processed locally while uncertain instances are selectively offloaded, together with their retrieved context, to a cloud-hosted TFM. The framework exposes an offloading threshold and a neighborhood retrieval policy that can be varied to balance predictive performance and communication cost. Experiments show HINT consistently identifies favorable trade-offs.
Read the full abstract

All authors Vitor Crista, Afonso Lourenço, Diogo Martinho, Goreti Marreiros

Signal Processing

Second-Order Fade Statistics in Underwater Optical Wireless Communications in Air-Bubble and Turbidity-Impaired Environments

The propagation of underwater optical signals through air-bubble-impaired channels induces irradiance fluctuations and partial line-of-sight blockages that degrade the performance of underwater optical wireless communication (UOWC) systems. Although the first-order fading statistics of such channels have been extensively investigated, their second-order statistics, namely the level crossing rate (LCR) and average fade duration (AFD), remain rather unexplored. This paper presents a theoretical and experimental characterization of the LCR and AFD in bubble-impaired UOWC channels under different bubble sizes and water turbidity conditions. Two analytical approaches are developed based on Rice's formula and on the cumulative distribution function (CDF) together with the bivariate CDF of the sampled irradiance, and are validated experimentally. The results show that water turbidity has a negligible effect on fade statistics under small-bubble conditions. In contrast, for large bubbles, turbid water leads to shorter but more frequent fades than tap water, as particle-induced beam spreading reduces the likelihood of deep fades and prolonged blockage events. Finally, the derived second-order statistics are applied to evaluate the packet outage probability (POP) performance using a two-state Markov channel model, demonstrating that the higher fade rate in the turbid water case results in a larger POP despite the shorter fade durations.
Read the full abstract

All authors Pedro Salcedo-Serrano, Mohammad-Ali Khalighi, Rubén Boluda-Ruiz, José María Garrido-Balsells, Antonio García-Zambrana

Artificial Intelligence

Support Topology and Gradient Mixing in Sinkhorn Layers

Sparse Sinkhorn layers use a fixed support graph to restrict transport between tokens. How does this graph control gradient propagation through the scaling iterations. We develop a fixed-support calculus showing that each row-column cycle induces a row-stochastic operator on column-potential perturbations modulo constants. Its transpose propagates zero-mass reverse-mode cotangents. The finite-cycle operator uses two distinct half-step transport plans; at a balanced fixed point it reduces to a two-step walk determined by a single plan. We derive the accompanying score and marginal source terms and use Dobrushin contraction and minorization to bound homogeneous and source-driven tail cotangents. Our main result characterizes when support and marginals guarantee one-step contraction uniformly over finite scores: every feasible face of the transportation polytope must have pairwise two-hop column overlap. Otherwise, suitable score directions make the contraction coefficient arbitrarily close to one. We extend this analysis to ordered support schedules and derive certificates for partition heat-bath layers, coordinate sweeps, forced shared mass, and register-augmented supports. These results provide mathematical criteria for support design in differentiable transport layers, with guarantees restricted to the fixed-support quotient-gradient component.
Read the full abstract

Representation Theory

Splitting torsion classes in higher homological algebra

Let $d \geqslant 1$ be an integer, $\mathscr{M}$ a suitable $d$-abelian category. There is a notion of higher torsion classes in $\mathscr{M}$, also known as $d$-torsion classes. We generalise a classic theorem of Hoshino by providing criteria for a $d$-torsion class $\mathscr{U}$ to be splitting, notably that $\mathscr{U}$ is stable under $\tau_d^-$, the inverse $d$-Auslander–Reiten translation. We apply the criteria to show that under additional assumptions, which are satisfied in Dynkin type $A$, the elements of the spine of the lattice of $d$-torsion classes are precisely the splitting $d$-torsion classes. The spine consists of the elements which belong to a chain of maximal length.
Read the full abstract

Machine Learning

Structured Extrema Errors in Classical Surrogates for Viscous Burgers: A Physics-Consistent Interpretation

We study the local errors of classical machine-learning surrogate models, which approximate the time evolution of the one-dimensional viscous Burgers equation. Four models are compared on the same prediction task, using the spatial grid values directly: radial basis function (RBF) kernel ridge regression (KRR), linear Ridge, ExtraTrees, and Random Forests. Across all four models, the one-step residual, defined here as the true value minus the predicted value at each grid point, forms clear curved branches near predicted maxima and minima. A more detailed analysis of KRR shows that these errors are much more strongly related to the second spatial derivative, which measures local curvature, than to the first spatial derivative. Near a smooth extremum, predicted value and curvature form a local two-branch fold. Under our local curvature-based model of the residual, this fold predicts a leading-order near-parabolic relation between predicted value and residual. This geometric result motivates a direct test of the Burgers advection (transport) and diffusion (smoothing) terms. For KRR and Ridge, regression tests on held-out trajectories, a control that breaks the spatial alignment of the diffusion term, and a spectral test of high-frequency content are consistent with insufficient viscous smoothing at moderate and high viscosity. In this case, the surrogate retains more small-scale structure than the true future state. The same physical explanation is much weaker for the tree models. Finally, a correction that uses only predicted quantities reduces both one-step error and error during recursive rollout, where each prediction is used as the next input.
Read the full abstract

History and Overview of Mathematics

Updating Tom Lehrer's "The Elements"

We analyze the poetico-comedic criteria by which Tom Lehrer arranged the chemical elements in his 1959 hit "The Elements," a parody to the tune of Gilbert and Sullivan's "The Modern Major-General" (1879). We compose a new version to the same tune incorporating all 118 currently known elements and fulfilling, so far as possible, the same artistic aims.
Read the full abstract

Strongly Correlated Electrons

Vertical quantum confinement in bulk MoS$_2$

We experimentally observe quantum confinement states in bulk MoS$_2$ using Angle-Resolved Photoemission Spectroscopy (ARPES). The band structure at the $\overline{\Gamma}$ point reveals quantum well states (QWSs) linked to vertical quantum confinement of the electrons, confirmed by the absence of dispersion in k$_z$ and a strong intensity modulation with photon energy. Notably, the binding energy dependence of the QWSs vs $n$ does not follow the quadratic dependence of a two-dimensional electron gas. Instead, a linear behaviour is observed that is consistent with a parabolic-like quantum well. This confinement arises from the mechanical exfoliation preparation method, which leads to the detachment of a multilayer stack from the underlying bulk. This is confirmed by Density Functional Theory (DFT) calculations. The quantum confinement in bulk-like MoS$_2$ not only offers the opportunity to explore intersubband transitions to exploit optical properties but also provides a means to study fundamental quantum phenomena in multilayer stacks of different thicknesses.
Read the full abstract

All authors Jairo Obando-Guevara, Álvaro González-García, Marcin Rosmus, Natalia Olszowska, César González, Miguel Ángel González-Barrio, Antonio Tejeda, Arantzazu Mascaraque

Data Structures and Algorithms

Improved Integrality Gap for Multicommodity Flow on Trees

We improve the best known lower bound on the integrality gap for weighted unit-demand multicommodity flow on trees from $1/4$ to $2/5$, improving on the long-standing bound of Chekuri, Mydlarz, and Shepherd~\cite{CMS}. We give the proof in two stages. First, a surprisingly simple packing lemma and an inductive coloring argument give an intermediate bound of $4/11$. We then refine the argument to obtain $2/5$.
Read the full abstract

Group Theory

Co-intersection graphs of nonabelian finite simple groups have diameter two

Let $G$ be a finite group. The co-intersection graph $\Delta_G ^c$ of $G$ has as its vertices the nontrivial proper subgroups of $G$, with edges joining those pairs of subgroups which intersect trivially. It is clear that every connected component of $\Delta_G ^c$ has diameter at most three. In this Note, we show that when $T$ is a nonabelian finite simple group, $\Delta_T$ is connected of diameter exactly two. We also make several observations about the extent to which a finite group is determined by its co-intersection graph, and about the class of finite graphs arising as co-intersection graphs.
Read the full abstract

Analysis of PDEs

A counterexample to Kenig's conjecture for the Laplace double-layer operator

We disprove Kenig's 1994 spectral-radius conjecture for the double-layer operator in every dimension $d\ge2$. For every $t>1/2$ sufficiently close to $1/2$, we construct a bounded simply connected Lipschitz domain with connected boundary such that the double-layer operator on $L^2$ with respect to the surface measure has $\pm \mathrm{i} t$ in its Fredholm essential spectrum. In particular, the essential spectral radius is greater than $1/2$. In the plane, the boundary may be chosen differentiable everywhere and smooth away from a single point. Our planar construction develops a refinement mechanism that produces unbounded growth of adjoint resolvent solutions with fixed forcing while keeping the graph slopes uniformly bounded. A closed recursion for the density and its image under an auxiliary singular integral reduces the growth estimate to a certified inequality for Hermitian $2\times2$ matrices. The certificate uses continuous estimates, exact rational arithmetic and rigorous interval enclosures. Localisation and rescaled graph insertions then produce a weakly null sequence of normalised approximate eigenvectors for the adjoint double-layer operator on one bounded boundary. A compact intertwining relation on Cartesian products of the planar domain with cubes gives the higher-dimensional examples without changing the spectral parameter.
Read the full abstract

Portfolio Management

Simple Dynamic Stock/Bond/Gold Portfolios

For more than four decades, the 60/40 stock/bond portfolio has served as a benchmark for delivering reasonable returns without excessive risk. More recently, a 50/30/20 stock/bond/alternative portfolio has been suggested. We use gold as the alternative and as an inflation hedge. In this paper we ask: how much improvement over these benchmark fixed-weight portfolios can be obtained using widely available public data and standard methods from quantitative finance? We restrict ourselves to long-only dynamic portfolios of stocks, bonds, and gold, plus cash, rebalancing monthly, using only publicly available data. We evaluate portfolios on the conventional metrics: return, volatility, Sharpe ratio (computed in excess of the federal funds rate), drawdown, and turnover, in addition to consistency of performance over time, judged by the consistency of the realized annual volatility. Over the 20–year period 2006–2026, using a conservative estimate of trading costs, we show that all risk-adjusted and drawdown metrics are improved using simple volatility control, where we dynamically mix the fixed-weight portfolios with cash so as to target a fixed volatility. This method relies on a simple estimate of portfolio volatility derived from past returns. We also demonstrate that more sophisticated portfolios based on convex optimization—similar to those used in quantitative hedge funds—yield further substantial improvement in return and risk-adjusted return. We consider two such portfolios, one that uses a simple estimate of future returns based on past returns, and one that forecasts future returns based on past returns and just a handful of widely available public economic data. These portfolios also outperform a suite of standard risk-based allocation methods, such as risk parity and minimum variance, evaluated on the same assets and data.
Read the full abstract

Computational Complexity

Promises should be taken seriously: On relativization with promise problems

Relativization is concerned with comparing computational models with black-box access to an oracle. For promise problems, black-box access is not canonical due to inputs outside of the promise being unconstrained. We study two semantics for such access. Under robust queries, a machine must correctly answer regardless of the completion of the problem,, while loose access requires that the internal choices of a machine do not change based on off-promise queries. Our first result separates the language and promise settings. Namely, we construct an oracle $O$ such that $\mathsf{P}^O = \mathsf{BQP}^O = \mathsf{AWPP}^O$, but $\mathsf{PromiseBQP}^O\not\subseteq\mathsf{PromiseP}^O_{\mathsf{/poly}}$. In particular, $\mathsf{BPP}^O = \mathsf{BQP}^O$, but $\mathsf{PromiseBQP}^O \neq \mathsf{PromiseBPP}^O$, showing that results for languages need not transfer to promises. Next, we use loose queries to strengthen the upper bound on the Quantum-Classical Polynomial Hierarchy from $\mathsf{P}^{\mathsf{PP}^{\mathsf{PP}}}$ to $\mathsf{QCPH} \subseteq \mathsf{BP\cdot PP} \subseteq \mathsf{PromiseBPP}^{\mathsf{PP}}$. The same proof also shows $\mathsf{PP}^\mathsf{PromiseBQP} = \mathsf{PP}$. Additionally, we show that $\mathsf{PromiseBQP}$, even when given quantum advice, is self-low under robust queries. Finally, we exhibit an obstruction to transferring language-level counting results to promise classes. Although $\mathsf{AWPP}$ and $\mathsf{APP}$ are low for $\mathsf{PP}$, a corresponding promise analogue would collapse the counting hierarchy as $\mathsf{GapP} \subseteq \mathsf{FP}^{\mathsf{PromiseAWPP}}$. This motivates the introduction of $\mathsf{PromisePostBQP^*}$, which restricts $\mathsf{PostBQP}$ to input-indepencent postselection. By showing that it is low for \PP, we obtain $\mathsf{PP}^{\mathsf{PromiseYQP^*}} = \mathsf{PP}$.
Read the full abstract

Artificial Intelligence

CausalVerify: End-to-End Verification of Causal Analyses by Language Models

Language models increasingly perform empirical analyses end to end, yet existing evaluations assess the written explanation or whether generated code executes, not whether the executed workflow recovers the intended causal estimand. We introduce CausalVerify, an execution-grounded benchmark for end-to-end causal analysis that follows a model from research-context interpretation to estimand recovery. It scores this workflow at four distinct layers: method recognition, design specification, executable implementation, and estimand recovery. It combines 259 real-paper contexts, 100 fixed-seed synthetic scenarios with executable reference estimates, and 23 paper-twin pairs in which a model commits to a design before seeing the data and its executed analysis is scored against a canonical estimator on the same realised dataset. Execution is not correctness. Among 426 model-written workflows that run without error, 15.5% fail verification, and a keyword score of the effect direction stated in the text is a poor proxy for recovery. In a 23-pair, nine-model paired study, replacing a model's committed design with the reference design and its execution conventions raises joint recovery of the point estimate and standard error from 15.0% to 51.5%; yet 48.5% of eligible seeds still fail under the reference design. The direction replicates on six pairs built afterwards under a frozen construction protocol, although on the two newest pairs the gain is confined to models from the family that built the references. Design specification is consequential but not sufficient: a plausible method and runnable code do not guarantee recovery, and even supplying the reference design and its conventions leaves substantial downstream failure. CausalVerify evaluates the executed workflow rather than its surface plausibility, and every reported number is recomputed from frozen artifacts by a single script.
Read the full abstract

All authors Yonghong Zhang, Ricardo Correia, Isabel M. Parra, Yong Xie

Artificial Intelligence

Beliefs and Behavior in Language Models

There is significant uncertainty about whether abstractions like beliefs or desires usefully describe the behavior of large language models (LLMs). In addition to the inherent scientific interest of this question, these latent quantities are often invoked to explain the behavior of LLMs to users or to define and evaluate harmful behaviors which are relative to intent. Nevertheless, we currently lack a means to systematically test whether concepts like "belief" are well-applied to LLMs, and hence whether they are likely to be fruitful ingredients of attempts to align models with human interests. We propose an approach for empirically studying such questions, asking whether a single latent variable inferred from the LLMs' outputs – interpreted as a degree of belief – allows an observer to make interpretable predictions of how the LLMs' will respond to new prompts. We find that highly capable models are usefully described as holding beliefs and that, generally, the predictability of model outputs based on an inferred latent belief tracks overall trends in model capability. Building on these findings, we provide empirical strategies to study how beliefs in LLMs can be measured, the extent to which LLMs comply with instructed decision rules or payoffs, and how beliefs evolve within individual instances of an LLM over the course of reasoning.
Read the full abstract

General Topology

Universal approximation of continuous maps between topological vector spaces

We study the problem of universal approximation of continuous maps between topological vector spaces by neural networks. We provide a universal approximation theorem for maps between locally convex topological vector spaces with and without paracompactness assumptions. We extend this result to continuous maps between non-locally convex topological vector spaces on compact sets under the assumption of finite topological dimension.
Read the full abstract