Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 14 May
Long-term outcomes are often unavailable in randomized clinical trials, although short-term surrogate outcomes are commonly observed. External observational data may contain the long-term outcome, but causal comparisons based on such data alone are vulnerable to confounding. Existing surrogate-based data integration methods for long-term outcomes have focused primarily on average treatment effects. We study estimation of quantile treatment effects for long-term outcomes in the trial population by combining randomized trial data with external observational data. Under treatment randomization, positivity, and a surrogate-based transportability assumption, we establish identification and develop a doubly robust estimator for inference. The estimator accommodates flexible machine learning methods for nuisance estimation, remains consistent if either the score-related or outcome regression-related nuisance functions are consistently estimated, and is asymptotically normal under regularity conditions. Simulation and real-data results demonstrate that the proposed method performs well in finite samples and can reveal heterogeneous long-term treatment effects across quantiles.
Optimization and Control
Generalized Dual Decomposition
We study two-stage stochastic optimization models with mixed-integer decision variables appearing in both stages. For these models, dual decomposition enables parallel computing implementation and can quickly provide a lower bound for the optimal value. However, the lower bound thus obtained is not exact in general due to the lack of strong duality. In this paper, we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality. By encoding the nonlinear regularizers through parameterization and cutting planes, we establish the convergence of a GDD algorithm to achieve global optimum. In addition, we discuss strategies for solving the GDD scenario subproblems more efficiently, including pruning and valid inequalities. Furthermore, we extend GDD to a more general, constrained form that subsumes, as special cases, robust optimization, chance-constrained programs, and bilevel optimization with multiple followers. Finally, numerical experiments demonstrate the strong duality of GDD, its computational efficacy versus primal (Benders-type) decomposition algorithms, and the speedup through parallel computing.
Read the full abstract
Information Theory
Joint Transmit and Receive Antenna Orientation Design for Secure MIMO Communications
Physical layer security (PLS) is a promising paradigm for safeguarding 6G wireless networks by exploiting the inherent characteristics of wireless channels. However, the efficiency of conventional PLS is often limited by fixed orientation antennas. This paper investigates a rotatable antenna (RA)-aided secure multiple-input multiple-output (MIMO) communication system, where both the transmitter and the receiver are equipped with RAs in the presence of an eavesdropper. By dynamically optimizing the orientations of RAs, we can proactively reshape the effective MIMO channels to enhance legitimate transmission while simultaneously suppressing information leakage to the eavesdropper. We formulate a secrecy rate maximization problem by jointly optimizing the transmit beamforming, artificial noise (AN) covariance matrix, and the transmit/receive RA orientations, subject to the transmit power budget and antenna orientation constraints. To tackle the resulting highly coupled and non-convex problem, we first study a simplified single-input single-output (SISO) case to reveal the structure of the optimal RA orientation. For the general MIMO case, we develop an alternating optimization algorithm by reformulating the original problem through the minimum mean-square error framework. In particular, the transmit beamforming and AN covariance matrix are derived in semi-closed forms, while the RA orientations are updated via the Riemannian Frank-Wolfe method. The proposed design is further extended to the multi-receiver secure transmission scenario. Simulation results show that the proposed scheme converges rapidly and achieves significant secrecy rate gains over the conventional fixed-orientation scheme.
Read the full abstract
Probability
Stopping Times in the Filtration of a Brownian Motion Stopped at its Last Passage Time
We investigate the structural properties of the last passage time $\sigma_z^{\lambda}$ at level $z > 0$ of a Brownian motion with positive drift $\lambda > 0$, denoted $B^{\lambda} = (B_t + \lambda t)_{t \geq 0}$, in the filtration generated by the process $\xi^{\lambda,z} = (B^{\lambda}_{t \wedge \sigma_z^{\lambda}})_{t \geq 0}$. We compute the compensator of $\sigma_z^{\lambda}$ and establish that it is the unique totally inaccessible stopping time in the filtration of $\xi^{\lambda,z}$. Moreover, we provide a canonical decomposition of arbitrary stopping times: for any stopping time $T$, the restriction of $T$ to the set $\{T = \sigma_z^\lambda\}$ is totally inaccessible, while its restriction to $\{T \neq \sigma_z^\lambda\}$ is predictable. Although the paths of $\xi^{\lambda,z}$ are continuous, the process fails to satisfy the Feller property and is not strong Markov. Nevertheless, we show that its natural filtration is quasi-left-continuous. To overcome these limitations, we consider the extended process $\zeta^{\lambda,z} = (\mathbb{I}_{\{t < \sigma_z^\lambda\}}, \xi_t^{\lambda,z})_{t \geq 0}$, and prove that it is a Feller process. We compute its infinitesimal generator, which allows us to characterize the associated class of martingales and identify the solutions to certain partial differential equations.
Read the full abstract
Quantum Algebra
Monomial bases and canonical bases for quantum affine algebras
We construct a monomial basis of a quantum affine algebra of simply-laced type, associated to the PBW basis of Beck-Nakajima. We show that there exists a simple algorithm of computing canonical basis in terms of the monomial basis. We dsicuss the relations of the canonical basis obtained from this PBW basis with Lusztig's canonical basis constructed by using the geometry of quivers.
Read the full abstract
Group Theory
Group Theory of the Kolakoski Sequence
Run-length decoding is an operation on sequences in which a positive integer $a$ is replaced by a run(sequence of repeated elements) of length $a$. Iterated run-length decodings applied to sequences with alphabets consisting of pairs of positive integers $\{p, q\}$ have attracted attention from mathematicians, most notably in their role defining the well-known Kolakoski sequence. $n$-th-iterated run-length decodings are controlled by naturally associated permutation automata $A^{p,q}_n$. Here we study the transformation groups $\mathcal{K}^{p,q}_n$ of these automata. They are subgroups of the automorphism group of binary trees of depth $n+1$. They are naturally subgroups of(and likely equal to) a certain group $\mathcal{J}_n^{p,q}$ with an intricate recursive structure; their limit group is plausibly weakly regular branch. As an application we determine the number of maximal-length orbits of the automata given an arbitrary input sequence for odd $n$.
Read the full abstract
Combinatorics
Optimal Diameters of High Multiplicity g-Golomb Rulers
A set $\cG$ of $n$ integers is called a $g$-Golomb ruler if the difference between any two distinct elements of $\cG$ is repeated at most $g$ times. If $g=1$, these are also called $B_2$-sets, Sidon sets, and Babcock sets. We define $G(g,n)$ to be the minimum diameter of a $g$-Golomb ruler with $n$ marks. In this paper, we prove that for every $\epsilon>0$ and all sufficiently large positive integers $b$, if $g\ge(\pi/3+\epsilon)b^{3/2}$, then $G(g,g+b)=g+2b-2$. Explicit thresholds are given for $b\le251$. The main technique is through an arithmetic property of the integers that are not in a $g$-Golomb ruler, leading us to introduce LM rulers, a class of rulers where every positive integer distance $d$ occurs as a difference at most $d-1$ times. Writing $L(n)$ for the minimum diameter of an $n$-element LM ruler, we prove $L(n)\ge\sqrt{8/9}\,(n-1)^{3/2}$ for every positive integer $n$ and, using a Farey construction, $L(n)\le(\pi/3+o(1))n^{3/2}$ as $n\to\infty$. We also provide computationally verified optimal LM rulers for every $1\le n\le250$.
Read the full abstract
Number Theory
Kodaira-Neron statistics for rational elliptic curves with $j$-invariant 0 and 1728
Elliptic curves over $\Q$ with $j$-invariant 0 or 1728 have additive reduction at all primes of bad reduction. In addition, all elliptic curves with $j$-invariant 0 have bad reduction at $p=3$ and all elliptic curves with $j$-invariant 1728 have bad reduction at $p=2$. In this paper we count elliptic curves with $j$-invariant 0 and 1728 by height and determine asymptotics for the various Kodaira-Néron types at 3 and 2, respectively. We also give related statistics by holding the torsion subgoup and isogeny-torsion graph constant.
Read the full abstract
Numerical Analysis
Wavelet-Based Observables for Koopman Analysis: An Extended Dynamic Mode Decomposition Framework
We present an in-depth analysis of the Koopman semigroup via wavelet transform. Towards this goal, we start by introducing the wavelet-based observables and show that they are eigenfunctions of the Koopman semigroup when this semigroup is considered over the Banach space of continuous functions on a compact forward-invariant set endowed with the supremum norm. We then construct closed-form expressions of the action of the Koopman semigroup and its resolvent in terms of these observables. To approximate the action of Koopman semigroup numerically, we combine Extended Dynamic Mode Decomposition (EDMD) with the proposed wavelet-based observables leading to the Wavelet Dynamic Mode Decomposition via Continuous Wavelet Transform (cWDMD) algorithm. We validate our theoretical results on two numerical examples.
Read the full abstract
Combinatorics
A short proof of Mathar's 2013 recurrence conjecture for the reversible-binary-string sequence A032123
For the OEIS sequence A032123, the number of length-$2n$ black-and-white strings with $n$ black beads, considered up to reversal, R. J. Mathar contributed in November 2013 the conjectured order-5 P-recursive recurrence \[ \begin{aligned} &n(n-1)\,a(n) - 2(n-1)(3n-4)\,a(n-1) + 4(2n^{2}-14n+19)\,a(n-2) &\qquad + 8(n^{2}+5n-19)\,a(n-3) - 16(n-3)(3n-10)\,a(n-4) &\qquad + 32(n-4)(2n-9)\,a(n-5) \;=\; 0, \qquad n \ge 6. \end{aligned} \] We give a short proof. Burnside's lemma applied to the reversal action gives the closed form $a(n) = \tfrac{1}{2}\bigl(\binom{2n}{n} + [n \text{ even}]\binom{n}{n/2}\bigr)$; the two summands satisfy elementary recurrences of order $1$ and $2$ respectively; and Mathar's order-5 operator, applied to each summand separately, reduces to a polynomial identity that simplifies to zero after a brief calculation. The supplementary archive includes a SymPy script which verifies the polynomial identities symbolically and checks Mathar's recurrence numerically for $n = 6, \ldots, 5000$.
Read the full abstract
Probability
The clumsy coupon collector's problem
We consider a generalisation of the classical coupon collector's problem, in which at each time step a collector either receives a new copy of a randomly chosen coupon, or loses all their previously collected copies of that coupon. We consider the amount of time it takes this clumsy coupon collector to obtain the full set of $m$ coupons. We establish limit theorems as $m\to\infty$ for the clumsy coupon collection time, and describe the large $m$ asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, $p$, scales with $m$. If $p=o(1/m)$, we obtain a Gumbel limit theorem, as is the case for the classical coupon collector. If $p=\omega(1/m)$, we instead show weak convergence to an exponential random variable. In the critical case, $p=c/m$, we give a full characterisation of the limiting distribution in terms of a birth-death process.
Read the full abstract
Wednesday 13 May
Optimization and Control
Learning to Optimize at Scale: A Benders Decomposition-TransfORmers Framework for Stochastic Combinatorial Optimization
We propose a learning-augmented Benders decomposition framework to solve large-scale two-stage stochastic mixed-integer programs. We focus on the two-stage stochastic capacitated lot-sizing problem (TSSCLSP) under demand uncertainty. Our method accelerates the convergence of the decomposition by using a pre-trained TransfORmer model to rapidly generate high-quality approximate solutions for the scenario subproblems. This hybrid strategy uses the TransfORmer predictions to generate strong optimality and feasibility cuts, effectively guiding the Benders master problem. Our framework includes a novel expandable generation mechanism, allowing a model trained on a fixed horizon to solve instances of arbitrary length. For the test set considered, our method solves instances up to T = 270, a scale previously intractable for this approach, while maintaining zero infeasibility in the generated subproblem solutions. This demonstrates the potential of TransfORmers as powerful surrogate solvers embedded within classical decomposition algorithms.
Read the full abstract
Differential Geometry
Lifting of linear connections and geodesic simulation
This article describes and classifies the liftings of a connection on a differential manifold M. Such lifting gives a connection on the frame bundle L(M) which is compatible with the original connection via the canonical projection. A specific connection, called induced lifting, will be used as reference to classify the others. Another kind of liftings, called adjust liftings, will be used for geodesic modeling of second order differential equations involving the connection on the base M. To conclude, an application of this modeling to boundary value problems will be given to conclude.
Read the full abstract
Numerical Analysis · Cross-listed from physics.med-ph
A digital twin for microwave liver treatment replanning
Purpose: MicroWave Ablation (MWA) modeling and simulation bear great potential for loco-regional treatment of liver tumors. However, accurately positioning the antenna according to a planned orientation/location is technically challenging. In cases of misplacement, maintaining the original plan may cause incomplete ablation, while repositioning the antenna may induce tumor seeding. In this work, we propose (i) a digital twin of MWA that simulates ablation outcomes, and (ii) an optimizer that suggests corrections to MWA parameters without antenna reinsertion, while ensuring complete tumor ablations. Methods: A finite element scheme was used to solve the coupled microwave propagation and heat transfer equations governing MWA, with personalized dielectric and thermal properties determined from preoperative CT and MRI images. We then proposed an optimization algorithm able to adjust power input, ablation duration, and antenna position to correct for antenna misplacement. Results: The simulator and optimizer were evaluated against in vivo swine experimental data. Three ablations were performed in liver regions with varying vascularization. The simulations accurately predicted the ablation zones despite the presence of large vessels near the antenna, achieving Dice scores of 0.82, 0.81, and 0.79. In the case of replanning scenarios, our optimizer predicted new parameter sets that led to Dice scores of 0.83, 0.83, 0.80, a corresponding improvement of 20.3%, 40.7% and 48.1% in average over the initial ablation result. Conclusion: This paper is the first to address intra-operative replanning of thermal ablation therapy. It demonstrates that optimal ablation results can be achieved without requiring antenna reinsertion by optimizing specific ablation parameters.
Read the full abstract
Differential Geometry
From dual connections to gravitational field equations – the curvature and Einstein tensors of the $\alpha$ - connection of a quasi-statistical manifold
We present a detailed review of the mathematical foundations of the theory of the statistical and quasi-statistical manifolds, which recently have found many applications in general relativity, quantum mechanics, and mathematical statistics. In particular, we fully develop, in a rigorous and coherent way, the formulas and concepts necessary for the understanding of the mathematical basis of the statistical and quasi-statistical manifolds, including the properties of the dual connections and of the equiaffine connections. For each geometrical structure the explicit expressions of the curvatures and the Einstein tensors are explicitly obtained. As possible applications to the field of gravitational theories we explicitly compute the curvatures of a family of $\alpha$-connections {$\nabla^{(\alpha)}:=\frac{1+\alpha}{2}\nabla +\frac{1-\alpha}{2}\nabla ^{*}$, where $\nabla :=\nabla ^{(1)}$ and $\nabla ^{*}:=\nabla ^{(-1)}$ } are the dual connections of a quasi-statistical manifold $M$. The Einstein vacuum field equations are also written down, and the physical relevance of the obtained results for gravity and cosmology is briefly discussed.
Read the full abstract
Combinatorics
Every Minimal Counterexample to the Erdős-Gyárfás Conjecture is Predominantly Cubic
A minimal counterexample to the Erdős-Gyárfás conjecture is a graph of minimum possible order and size with minimum degree at least 3 that contains no cycle whose length is a power of 2. Markström observed that any such graph must contain an independent set of vertices of degree at least 4 together with a nonempty set of vertices of degree exactly 3. As an immediate consequence, every regular minimal counterexample must be cubic. Building on this structure, two additional consequences are derived. First, every vertex of a minimal counterexample is adjacent to a vertex of degree exactly 3. Second, at least 4/7 of the vertices of any minimal counterexample must have degree exactly 3.
Read the full abstract
Number Theory
High-Precision Approximation of Riemann Zeros via the Truncated Weil Form
The Connes-van Suijlekom truncated Weil quadratic form, indexed by a cutoff $c$ (controlling the primes $p\leq c$ in the operator), has a ground state whose Fourier-Mellin zeros provably lie on the critical line; whether they converge to the Riemann zeros as $c\to\infty$ is open (Connes 2026; Connes-Consani-Moscovici 2025). We present, to our knowledge, the first public implementation of the CvS Galerkin matrix at sixteen cutoffs ($c=13$ through $67$, plus $c=100$). Across $c=13$–$67$ at $N=100$, the first-zero error $|\gamma_1-\gamma_1^{\mathrm{Riemann}}|$ shrinks monotonically from $\sim 2\times 10^{-55}$ to $\sim 1.5\times 10^{-168}$ (113-OOM across fifteen cutoffs). The smallest-positive even-sector eigenvalue reaches $\sim 10^{-334}$ at $c=100$, $N=250$ (275-OOM span), whose eigenvector recovers $\gamma_1,\ldots,\gamma_{10}$ to 307-329 matching digits. Under the unitary equivalence with CCM 2025 Lemma 5.1, each $\gamma_k$ is (modulo a hypothesis-status caveat at $c=100$) an eigenvalue of the CCM rank-one operator $D_{\log}^{(\lambda,N)}$. Aitken-$\Delta^2$ on the $c=100$ $N$-sweep gives $\log_{10}|\lambda_\infty^{\mathrm{even}}|\approx -536.76$ and $-533.70$, approaching the Connes 2026 Section 6.4 heuristic continuum prediction ($\approx -530.38$) monotonically in $N$. The empirical fit $|\log_{10}\lambda_{\min}|\approx 13.24\,c^{0.634}$ on $c\leq 67$, $N=100$ is a finite-$N$ rate, falsified at $c=100, N=200$ by 49 OOM. At $c=100$ the raw spectrum carries a small block of negative-sign eigenvalues at the finite archimedean cutoff $T=800$; these are an artifact of that cutoff and absent once $T$ is increased, so the smallest-positive even-sector eigenvalue is the genuine smallest one (continuum positivity of $QW_\lambda$ is RH-equivalent and is not assumed at $\lambda=\sqrt{100}$). We make no claim of proof.
Read the full abstract
Information Theory · Cross-listed from cs.LG
SPHERICAL KV: Angle-Domain Attention and Rate-Distortion Retention for Efficient Long-Context Inference
Long-context inference is increasingly constrained by the KV cache: resident memory grows with context length, and decoding becomes limited by repeated High Bandwidth Memory (HBM) streaming rather than arithmetic. Existing methods such as eviction, windowing, quantization, and offloading reduce footprint, but often leave the critical-path bottleneck only partially addressed, especially when compressed states must still be reconstructed into dense vectors during decoding. We present Spherical KV, a long-context inference method that treats KV allocation as a rate-distortion problem grounded in attention geometry for efficient decoding. The method is built on two ideas: (i) represent directional information cheaply in the decode hot loop, and (ii) allocate retention and precision according to estimated future utility. Its first component, Angle-Domain Attention (ADA), stores keys in a spherical parameterization consisting of a scalar radius and compact angle codes, and computes attention logits directly from these codes without reconstructing dense keys. This preserves a paged, block-local, fusion-friendly decode path and directly targets HBM traffic in realistic serving settings. Its second component, Rate-Distortion Retention (RDR), jointly chooses keep/drop decisions and precision tiers per token and head under a fixed budget, producing tier-homogeneous pages with lightweight metadata and coalesced reads. Together, ADA and RDR provide a deployment-oriented mechanism for reducing KV residency while preserving decode efficiency.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Lost and Found in Translation: Variational Diagnostics for Neural Codebook Channels
Classical communication systems fail not only through random noise but also when transmitter and receiver use incompatible operational codebooks. Variational autoencoders (VAEs) train an encoder $q_\phi$ and decoder $p_\theta$ jointly, and practitioners treat the resulting latent space as a discrete code – for clustering, conditional generation, and mechanistic interpretability. Yet standard VAE diagnostics – ELBO, active units, mutual information, and code histograms – certify only whether this code is used, never whether the decoder reads each latent under the encoder's code. We close this gap with the neural codebook channel $K_{e\to d}(j\mid i)$, a coupled encoder-decoder diagnostic whose off-diagonal mass is bounded by an architecture-free Bernoulli-KL certificate $d_{\mathrm{bin}}(1-\mathcal{A} \,\|\, \bar\eta_p) \le \bar\Delta$ controlled by the variational gap. The certificate is the operational specialization of the classical KL chain rule under disintegration to the encoder-decoder disagreement event, complemented by a constructive marginal-impossibility result: no combination of marginal histograms, entropies, active-code counts, or mutual information determines $K_{e\to d}$. We audit the certificate on four sklearn datasets (finite-grid exact, 5/5 seeds, 20/20 pairs satisfy the bound), a 2D model where the bound is non-vacuous at $2.71\times$ the observed disagreement and the four-term identity closes within $10^{-4}$, MNIST under importance-sampling control, and a VQ-VAE attaining the predicted limit $\hat{\mathcal{A}}=1.000$. The package $(K_{e\to d}, \mathcal{A}, R_{\mathrm{eff}}, R, \mathrm{AU})$ is an audit-ready reporting unit. More broadly, the framework makes mismatched decoding – a failure mode classical communication theory named decades ago – visible inside a single deep generative model.
Read the full abstract
Information Theory
Learning Selective Merge Policies for Deadline-Constrained Coded Caching via Deep Reinforcement Learning
In the coded caching, the server uses the cached information at the users to serve multiple users in parallel with a single coded multi-casting message or packet, that is, a merged packet, and thus mitigates the peak network congestion. In order to deliver the timely messages to the users in the deadline-driven applications like the video streaming, we must determine online the messages to be merged for the delivery, as there is a time limit for each request. It is important to note that while the merging aids the current coded multi-casting packet, it could harm the future deliveries. Our solution employs the deep reinforcement learning to view the coded multi-casting delivery as a masked action-discrete state control problem, and our policy network, trained via the proximal policy optimization, performs better than SACM++. On the uniform-demand benchmark, our policy network reduces the broadcast-packet expiration ratio $\rho$ by $40.9\%$ ($0.208$ vs.\ $0.352$) with respect to the best coded multi-casting baseline (SACM++), while also attaining the best broadcast-efficiency score $\sigma$ across the Track~A battery among the coded multi-casting methods. One noteworthy phenomenon here is that, for the applications with stricter deadlines, the merging becomes selective instead of aggressive, since the policy network selectively merges at approximately $31.8\%$ of the chances, even though the same observation holds across the variations within the same simulator family. The focus of our design is on the efficient pairwise XOR merging, where the higher-order ($K{\ge}3$) coding can be considered as a natural generalization left for future work.
Read the full abstract
Numerical Analysis
Sampling pseudospectrum for data-driven matrices
Many complex systems can be reduced to their key components through spectrally decomposing matrices that capture their dynamics. These matrices can in turn be constructed from data, often by least-squares fitting: examples of algorithms to do this include Dynamical Mode Decomposition and variants, subspace identification and eigenvalue realisation algorithms. Typical outputs of these algorithms include a range of isolated, peripheral eigenvalues capturing persistent emergent patterns in the system. However, there is no objective way to assess which of these discrete eigenvalues are artefacts of finite data error, and which are reflections of a fully sampled operator. n this paper, we present a sampling pseudospectrum $P(\lambda)$, that provides probabilistic information on the behaviour of finite-data eigenvalues in the complex plane, and an estimator $\hat P(\lambda)$, which can be obtained by reprocessing our finite data sample. The estimator, which is computationally efficient to implement, allows us to test statistically for the location of the true eigenvalues. This gives us a rigorous and very general way to assess whether the patterns we extract from finite data are likely to be signal or noise.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Day-to-Day Traffic Network Modeling under Route-Guidance Misinformation: Endogenous Trust and Resilience in CAV Environments
Connected and autonomous vehicles and smart mobility services increasingly use digital route guidance as an operational input to traffic network management. When this information becomes unreliable or adversarial, day-to-day traffic models must represent not only flow adaptation but also the evolution of user trust in the information source. This paper develops a coupled day-to-day traffic assignment and trust-evolution framework for route-guidance misinformation. Within-day congestion is represented by Lighthill-Whitham-Richards network loading, while day-to-day route choice follows bounded-rationality logit learning with trust-dependent reliance on external guidance. Trust is modeled as an aggregate class-level behavioral reliance state encoded by a Beta evidence model and updated from repeated guidance errors. Theoretical analysis establishes stationary equilibria, a conservative stability guide, a weighted compliance index for population-level vulnerability, and an asymmetric recovery law that explains post-attack trust hysteresis. Numerical experiments on Sioux Falls, with an Anaheim robustness check, show that endogenous trust creates a threshold-based resilience mechanism. Below the trust-activation threshold, the attack remains behaviorally stealthy and dynamic trust provides almost no attenuation. Above the threshold, trust erosion reduces the impact of the fixed-trust attack by about 91 percent in Sioux Falls and 85 percent in Anaheim. The experiments also show that CAV penetration increases fixed-trust vulnerability while preserving dynamic attenuation, and that traffic performance can recover before trust, resulting in a 77-day hidden vulnerability window. The results provide a trust-aware modeling basis for resilience analysis in CAV-enabled traffic networks.
Read the full abstract
Commutative Algebra
Numerical characterizations for integral dependence of graded modules
In this paper we construct adic, saturated and $\varepsilon$-density functions for a torsion-free module in a graded setup. Then we give some simple criteria for checking the integral dependence of two graded modules $N\subseteq M$ in terms of various well-studied invariants.
Read the full abstract
Logic
Modal group theory
I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is more expressive than the first-order language of groups. I interpret the theory of true arithmetic in modal group theory, and show that, as sets of Goedel numbers, it is computably isomorphic to the modal theory of finitely presented groups. I answer an open question of Berger, Block, and Loewe by showing that the formulaic propositional modal validities of groups under embeddings are precisely S4.2. I also analyze sentential validities and worlds validating S5.
Read the full abstract
Statistics Theory
Equilibrium and Pricing in Consumer Networks with Nonlinear Utilities: An Online Shape-Constrained Learning Approach
We study optimal monopoly pricing over consumer networks governed by general nonlinear utilities. In our framework, a consumer's utility is jointly determined by an individualized price and the consumption choices of their peers, propagated through a directed and signed social graph. This formulation encapsulates a broad class of utility functions; it strictly generalizes the traditional linear-quadratic framework to include logit-type discrete choice, isoelastic, and Stone-Geary utilities under a single theoretical umbrella. We first establish the existence and uniqueness of the consumer-side equilibrium under general contraction and variational conditions, explicitly accommodating asymmetric and signed network externalities. Leveraging this equilibrium characterization, we analyze targeted price discrimination within community-structured and influencer-driven markets. To this end, we introduce a generalized measure of network influence that extends classical Katz-Bonacich centrality beyond the Euclidean domain. Finally, addressing the challenge of unknown consumer utility functions, we develop a shape-constrained, tuning-parameter-free learning approach utilizing isotonic regression, for which we establish strict no-regret convergence guarantees. Supported by extensive simulations, our results seamlessly integrate equilibrium analysis and nonparametric learning into a cohesive monopoly pricing framework.
Read the full abstract
Combinatorics
Relation Algebra Representations from Distance-Regular Graphs
We describe a general method for constructing representations of finite integral symmetric relation algebras from distance-regular graphs. Given a distance-regular graph of diameter $d$, the distances between vertices induces a coloring of the complete graph with $d$ colors, and we show that this coloring yields a representation of finite integral symmetric relation algebra on $d+1$ atoms. We then introduce a necessary and sufficient condition for when such a representation is algebraic, proving that this occurs if and only if the distance-regular graph is also distance-transitive. We study the diameter-3 case of this method in detail, and we express a condition for the representation's mandatory cycles in terms of the distance-regular graph's intersection array. We apply this result to give a positive answer to an open question of Roger Maddux; namely, whether the relation algebra $30_{65}$ has a representation on a finite set. The representation is given on 42 points, and arises from the second subconstituent of the Hoffman-Singleton graph. We further use this method to describe an infinite class of finite representations of $26_{65}$ and the smallest possible representation of $31_{65}$.
Read the full abstract
Geometric Topology
The KnotMosaics Package for SageMath
We introduce KnotMosaics, a SageMath package for constructing, visualizing, and analyzing knot mosaic diagrams. The package represents an n-mosaic as a matrix of standard tile labels and implements the local connectivity rules needed to validate mosaics, trace strands and components, compute planar diagram codes, generate random examples, and construct rational tangle mosaics. The planar diagram interface connects the mosaic representation to existing knot and link software, enabling computations such as Jones polynomials and knot Floer homology checks. We describe the package design, its main algorithms, and representative examples that illustrate how KnotMosaics can support computational exploration in knot mosaic theory.
Read the full abstract
Geometric Topology
Taming Wild Knots with Mosaics
Wild knots–knots with infinite knotting behavior–have resisted traditional methods of knot classification, making them more of a curiosity in topology than a subject of sustained investigation. In this paper, we present a new way to investigate these objects. We extend Lomonaco and Kauffman's knot mosaic theory to represent a substantial subclass of wild knots that have isolated wild points. Our mosaics consist of infinite rooted trees with mosaics assigned to vertices and embedding functions governing connections. In developing this framework, we also introduce a notion of mosaic tangles as well as mosaic rigid vertex spatial graphs of which mosaic singular knots are a special case.
Read the full abstract
Probability
Generalization and Probabilistic Proofs of Some Combinatorial Identities
Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special functions. In particular, by studying moments of the difference of two gamma and beta random variables, both in the dependent and independent cases, we obtain new combinatorial identities. This approach provides a systematic method to derive further combinatorial identities from probabilistic transformations.
Read the full abstract
Mathematical Physics · Cross-listed from physics.optics
Integral representation of time-harmonic solutions to Maxwell's equations with fast numerical convergence
The robustness of XRD methods for the determination of the lattice parameters of crystals is well established. These methods have been extended to helical atomic structures using twisted x-rays \cite{friesecke_twisted_2016}. Building on an integral form used in \cite{friesecke_twisted_2016}, we construct integral representations of a broad class of time-harmonic solutions to Maxwell's equations in a vacuum or, more generally, in a homogeneous medium without source terms. The representation includes assignable generalized functions (distributions) that can be tailored to specific boundary or far-field conditions. When the assignable functions satisfy mild periodicity and smoothness conditions, the solutions can be approximated using multi-dimensional trapezoidal rules with exponentially fast convergence. This approximation can be physically interpreted as utilizing finite sources of plane waves to approximate the broad class of time-harmonic solutions to Maxwell's equations. Using these solutions, we show that radiation from suitably placed and oriented sources can serve as incoming radiation for structures with icosahedral symmetry to achieve constructive interference after interacting with the icosahedral structure. The finite source approximations are sufficiently general to satisfy the general Dirichlet conditions at an arbitrarily large number of assigned locations in a source-free domain. The integral representation also extends to a broad class of physical phenomena governed by Helmholtz-type equations. Examples include the scalar wave equation for acoustic waves and elastic wave propagation in linear isotropic solids, which involve both scalar and vector wave equations.