Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Saturday 12 September

Information Theory

Weight spectra of some families of GRM codes

Let $\mathrm{RM}_q(r,m)$ denote the generalized Reed–Muller code of order $r$ and length $q^m$ over the finite field $\mathbb{F}_q$. We completely determine the weight spectra of $\mathrm{RM}_3(2m-i,m)$ for $i=3,4$, $\mathrm{RM}_4(3m-i,m)$ for $i=2,3$, $\mathrm{RM}_5(4m-4,m)$, and $\mathrm{RM}_7(6m-4,m)$, in the ranges of $m$ specified in the corresponding results. The proofs proceed by induction on $m$, using a sumset inclusion for GRM weight spectra together with results on low-weight codewords. The required base cases are established by computations in Magma and, for certain ternary cases, exact constraint solving with Z3.
Read the full abstract

Differential Geometry

Boundary regularity of harmonic map heat flows from RCD spaces into $CAT(0)$ spaces

In this paper, we study the boundary regularity of harmonic map heat flows from a bounded domain in a metric measure space with generalized Ricci curvature bounded from below into a non-positively curved metric space.

Robotics

Compositional Shift Algebra: Extrapolating Mixed Robot Shifts Without Mixed Finetuning

Robot deployments rarely change one mechanism at a time: cameras, action interfaces, and physical dynamics often shift together. Prior adaptation recipes either finetune a new model for every mix or attempt to select which module to update. We instead learn shift operators on a modular stack z{=}E(o), a{=}g(z,u), z'{=}f(z,a) and compose them. Compositional Shift Algebra (CSA) fits single-factor observation, policy, and dynamics operators from exact-reset probes, then extrapolates held-out mixed shifts by operator composition—without mixed-shift finetuning. On ManiSkill StackCube, residual CSA matches an oracle mixed inverse on held-out mixes (success 1.0 over 10 seeds) while beating best-single / zero-shot / parameter-average baselines by { approx}67 pp. RGB-D vision-in-the-loop composition remains near oracle and far above non-compositional arms; a delay commutator stress shows ordered necessity for policy timesdelay. On a second task (PickCube), residual CSA again reaches compose 1.0 vs. 0.33 non-compositional (n{=}10), and an L1 vision controller without privileged cube/goal poses or grasp flags in the control loop retains compose 0.95 vs. 0.00. Main-track upgrades freeze PushCube (+33 pp), PegInsertion joint8 / pose7 EE (+67 pp each), and thin BC under frozen CSA (+67 pp); deeper BC and fair adapt baselines still need compose (+67 pp each), vision-localized BC needs compose (+56 pp), and delay favors ordered/few-shot deploy. We report Intervention-Gated Adaptation as a negative control.
Read the full abstract

Game Theory

Online Fair Division: Pushing the Frontier of Approximate Proportionality

Online fair division captures allocation problems in which indivisible resources arrive over time and must be assigned before future resources are known. Understanding what fairness remains achievable when allocation decisions are immediate and irrevocable is a fundamental question in this setting. We study deterministic online allocation among $n$ agents with nonnegative additive valuations, where the number of goods is unknown and the adversary can adapt to previous allocation decisions. We focus on proportionality up to one good (PROP1) and examine how advance information affects the achievable guarantees. Without additional future information, we give a deterministic algorithm that guarantees $\Omega(\frac{1}{\log(nm)})$-PROP1 after every round, where $m$ is the number of goods at termination. We complement this result by showing that, for every $n$ and sufficiently large $m$, every deterministic algorithm has an adaptive instance with $m$ goods on which its allocation has PROP1 approximation guarantee $O(\frac{\log \log m}{\log m})$. Thus, when the number of agents is fixed, our upper and lower bounds on the competitive ratio differ by at most an $O(\log\log m)$ factor. These results answer an open question proposed by Choo et al. on whether a nontrivial deterministic approximation for PROP1 can be obtained. We also study the setting where the algorithm knows the predictions of the maximum item value for every agent. When the predictions are accurate, we give a deterministic $\frac{1}{2}$-PROP1 algorithm, improving the $\frac{1}{n}$ guarantee of Choo et al. to a constant. We further establish an explicit upper bound below one on the competitive ratio, even for two agents with accurate predictions. Finally, we give a single deterministic algorithm that guarantees $\frac{1}{2}$-PROP1 when predictions are accurate and $\Omega(\frac{1}{\log (nm)})$-PROP1 for arbitrary predictions.
Read the full abstract

High Energy Physics (Theory)

Dimensional reduction and thermodynamics of a non-local scalar field theory

In this paper, we study the dimensional reduction of a non-local scalar field theory from $1+3$ to $1+2$ dimensions. The bulk theory is governed by an entire-function non-local form factor $e^{-\Box_E/\Lambda^2}$, where $\Lambda$ sets a fundamental high-energy scale. By constraining external classical sources to a bidimensional plane, we perform the exact dimensional reduction, derive the effective planar Green's function in terms of the complementary error function, and propose the corresponding effective non-local pseudo-differential planar Lagrangian. Using the static propagator, we determine the interaction energy between two point-like planar charges, proving that the non-local scale regularizes the short-distance singularity at the origin while smoothly recovering the standard Yukawa potential at long distances. Furthermore, we obtain the retarded, advanced, and Feynman Green's functions in coordinate space, demonstrating that macroscopic causality and tree-level unitarity are preserved. Finally, implementing the Matsubara formalism, we investigate the finite-temperature regime and evaluate the exact thermal free energy, pressure, entropy, and heat capacity. We show that the effective planar theory exhibits a fractional effective number of degrees of freedom ($g_{\rm eff}=1/2$ for $m \ll T \ll \Lambda$, crossing over to $g_{\rm eff}=1$ for $T \gg \Lambda$) originating from kinematic bulk leakage and that pressure, entropy, and heat capacity remain positive at all temperatures.
Read the full abstract

Artificial Intelligence

Solar Intelligence

Solar energy decision support is fragmented across dashboards that provide data without explanation, research papers are slow to parse, and general-purpose language models are not solar domain specific and answer without evidence. This paper introduces Solar Intelligence, a hybrid retrieval-augmented framework that unifies structured solar analytics, evidence-grounded scientific question answering, and machine learning forecasting in one system. The platform integrates daily NASA POWER solar and meteorological data, Biosphere 2 ground-sensor readings, and a curated corpus of research papers and institutional reports. Structured queries use DuckDB SQL; scientific questions are answered by a hybrid retriever that fuses BM25 and ChromaDB dense embeddings via Reciprocal Rank Fusion, with responses grounded through a language model (llama3.2:3b). An Extreme Gradient Boosting (XGBoost) model produces daily forecasts of irradiance, temperature, and wind speed. The system is exposed via FastAPI, Streamlit, and an MCP server, so it can be used as an application, an API service, or an agent tool - by students, researchers, and energy analysts.
Read the full abstract

Computer Vision

YOLO12-MambaScan: An Efficient Object Detector with High-Frequency Enhancement and State-Space Modeling

The rapid development of unmanned aerial vehicle (UAV) technology has made aerial-image object detection increasingly important for natural-resource monitoring, traffic management, and disaster response. Detecting small objects in aerial images remains difficult because objects occupy very few pixels, high-frequency cues are easily lost, and global context is hard to model in cluttered scenes. Existing detectors often retain insufficient edge, corner, and texture information. We propose \ours, an aerial-image detector built on the YOLO12 architecture. The model combines a triple-path high-frequency enhancement convolution module (TriPathHFConv), receptive-field coordinate-attention convolution (RFCAConv), and a Mamba-based global-context module. On VisDrone, at an input resolution of 960*960, ours achieves 60.0% mAP@50 and 38.6%mAP@50:95, demonstrating a favorable accuracy–efficiency trade-off for small-object detection. The benchmark and dataset protocol follow the VisDrone challenge setup.
Read the full abstract

Machine Learning

Curvature-Independent Regret Bounds for Distributed Online Optimization on Hadamard Manifolds

This work addresses decentralized online Riemannian optimization on Hadamard manifolds. Prior work under geodesic convexity (g-convexity) may require curvature information in the optimization analysis, typically through a finite lower bound on the sectional curvature. Curvature may also enter the step size or contraction factor of tangent-space Riemannian consensus schemes. In this work, we relax the curvature dependence for a narrower class of horospherical convex (h-convex) functions. We study Distributed Riemannian Online Gradient Descent (D-ROGD), which combines local Riemannian h-subgradient updates with an implicit Fréchet-mean consensus. For h-convex and strongly h-convex local objectives, we establish $O(\sqrt{T})$ and $O(\log T)$ static regret, respectively, matching the corresponding Euclidean rates with respect to $T$, with network dependence governed solely by the spectral gap. To our knowledge, these are the first curvature-independent regret guarantees for decentralized online optimization on Hadamard manifolds. Experiments on hyperbolic embeddings corroborate the predicted rates, with no observable degradation due to curvature.
Read the full abstract

Software Engineering

ForgeTrain: Forging Production-Grade Training Frameworks via Harness-Driven AI Development

Training large models still relies on general-purpose frameworks such as Megatron-LM, whose generality tax constrains scenario-specific optimization and adds runtime overhead through accumulated abstraction. AI code generation reduces the cost of building a framework, and makes it affordable to forge one per scenario. We propose Forge Engineering: building a dedicated implementation from scratch for each scenario and iteratively optimizing it toward peak performance under correctness and usability constraints. Dedicated implementations inherit no abstraction boundaries, so they can integrate optimizations across the stack and reach a higher performance ceiling. We instantiate this paradigm for training frameworks as ForgeTrain, which holds a trusted framework as a golden reference and relaxes equivalence monotonically from Bit-for-Bit to Surpass. Experiments across multiple model–hardware configurations show that ForgeTrain consistently produces correct training engines and improves MFU over established training frameworks by 4.7–33.2%. To our knowledge this is the first production-grade training framework forged end-to-end by AI to match or surpass its human reference.
Read the full abstract

All authors Qingfeng He, Zhui Zhu, Shangzhan Li, Yaojian Chen, Haojun Sun, Xu Chen, Leshan Li, Yifei Shen, Changjingxing Zhao, Mengyuan Fan, Wenyu Guan, Yiyun Zheng, Yuxuan Zuo, Zhen Li, Zhenghang Luo, Yuxuan Li, Xu Han, Zhiyuan Liu

Cryptography and Security

Basis Rigidity of the AES S-box and Generic Rigidity of Inversion under Affine Transformations

The AES S-box is constructed from finite field inversion followed by a fixed affine transformation. Since inversion possesses intrinsic Frobenius symmetries among its coordinate realizations, we study how these basis symmetries are altered by outer affine transformations. We first develop a deterministic rigidity criterion for transformed inversion and apply it to the AES S-box. This shows that the linear part of the AES S-box affine transformation alone makes the transformed inversion map basis rigid. We then investigate the corresponding generic problem when the outer invertible linear transformation varies. The existence of a nontrivial linear stabilizer is reduced to a conjugacy problem for semilinear candidates arising from two sided linear equivalences of inversion, which we characterize in terms of relative norms and Frobenius orbits. We also determine the dimensions of the associated centralizer algebras exactly. These structural results imply that, for a uniformly chosen outer linear transformation, the probability that the linear stabilizer is nontrivial is bounded by $2^{-\Omega(n^2)}$, with sharper finite dimensional bounds obtained from the exact conjugacy condition. Computational experiments independently verify the AES rigidity result, the conjugacy and centralizer formulas, and the finite dimensional estimates in small dimensions.
Read the full abstract

Symbolic Computation

Parallel Integration over Simple Radical Extensions II: Mixed Towers

In Part I we extended the structure theorems underlying the Risch–Norman (parallel Risch) method to a simple radical extension $L=K(y)$, $y^m=q$, of a differential field $K=F(t_1,\dots,t_n)$ closed under the derivation. Here we remove the closure hypothesis: the radical may occupy any position in the tower, so that the derivatives of the generators above it involve $y$ — the setting of Bronstein's algorithm for mixed elementary functions. The working ring is $\cA=\cO[t_{j+1},\dots,t_n]$, the integral closure of $F[t_1,\dots,t_n]$ in $L$: a Krull domain, free over the polynomial ring on Trager's basis, so that all factorisation remains in a unique factorisation domain. The denominator of the derivation is no longer an element but a divisor $\fd_D$ on $\cA$, and the valuation lemma takes the unified form $v_P(Dg)=v_P(g)-(1+v_P(\fd_D))$ at normal height-one primes, subsuming the shifts $\{1,e_P\}$ of Part I; the proof localises and requires no cancellation analysis. Stability of the class group and the unit group, $\Cl(\cA)\cong\Cl(\cO)$ and $\cA^*=\cO^*$, splits the admissible logands into $S$-units of $\cO$ — computed by the machinery of Part I — and irreducible polynomials moving in the upper variables, whose residues must be constants. We prove degree bounds in the top variable and describe the resulting algorithm, which — unlike the classical parallel method, whose failure proves nothing — returns certificates of non-elementarity in two situations: a residue outside the constant field, and, when every bound in force is proved, a residue-free remainder that the linear system shows to be non-exact.
Read the full abstract

Machine Learning

When Compliance Data Masquerades as Evaluation: Measurement Validity for Deployed AI Systems

We argue that a recurring failure in the evaluation of deployed AI systems occurs when data collected for operational monitoring or regulatory compliance are interpreted as if they were designed for comparative evaluation. Automated driving provides a concrete example of this problem. U.S. disengagement and crash-reporting regimes produce valuable operational evidence, but differences in reporting scope, exposure, deployment domain, event capture, and comparator construction limit the safety claims that can be supported from these measurements alone. We frame this issue as a measurement-validity problem in AI evaluation rather than as a transportation-specific data limitation. We argue that comparative claims about deployed AI systems require alignment between the intended capability, measured outcome, exposure opportunity, deployment domain, data-generation process, and evaluation comparator. Using automated-driving safety evaluation as a case study, we propose an evaluation contract that makes these assumptions explicit before operational data are interpreted as evidence of comparative performance. The broader implication is that data useful for monitoring deployed AI systems are not automatically valid benchmarks for evaluating them.
Read the full abstract

All authors Hung-Yu Lin, Xingran Huang, Qiming Guo, Jinwen Tang

Combinatorics

Four-arm polyominoes in Golomb's hierarchy: A complete classification with Lean verification

We classify the polyominoes obtained by adjoining four straight arms to a single square, allowing zero arm lengths, according to their ability to tile rectangles, half-strips, bent strips, quadrants, strips, half-planes, and the plane. We also classify their ability to tile an integer enlargement of themselves. Tiles occupy whole square-grid cells; translations, rotations, and reflections are permitted. Exactly five capability profiles occur. For the family $P(n,1,1,0)$, the rectangle profile holds for $n\le3$ and the bent-strip profile, with no half-strip or rep-tiling, for every $n\ge4$. A cross with four positive arms tiles the plane precisely when two opposite arms have length one; it never tiles a half-plane. Explicit periodic constructions and geometric obstructions are combined with finite symbolic case certificates. A Lean 4 development verifies the full classification for every natural four-tuple, including the interpretation of the certificates as statements about arbitrary infinite tilings. The account incorporates the author's 2020–2021 L- and T-polyomino work, reconstructs Dahlke's gun argument, and documents the subsequent AI-assisted proof development and formalization.
Read the full abstract

Machine Learning

FlowTSFM: Turning Encoder Depth into Quantile Transport

Encoder-based time series foundation models (TSFMs) typically rely on deep stacks of independently parameterized Transformer layers, where only the final forecast is supervised and intermediate representations have no explicit predictive role. We introduce FlowTSFM, an encoder architecture that interprets depth as a recurrent transport process: a single Transformer block is iteratively applied with shared parameters, while a quantile-flow objective supervises intermediate states along a prescribed trajectory from a prior distribution toward the final forecast. The objective combines pinball forecasting loss with path-level position matching. With only 38.8M parameters, FlowTSFM achieves competitive performance on GIFT-Eval and TIME, remaining within 1.8-4.6% MASE of stronger baselines while using approximately $3\times$ fewer parameters than a 12-layer Chronos-2 model (119.5M). Beyond accuracy, we introduce CosMean, a scale-free diagnostic measuring whether recurrent updates consistently align toward the final prediction. Under a matched intermediate-state probing protocol, FlowTSFM achieves a CosMean score of 0.919 compared with 0.350 for Chronos-2, suggesting that recurrent parameter sharing combined with path supervision is associated with substantially more structured predictive trajectories at a favorable accuracy-efficiency trade-off.
Read the full abstract

All authors Bahaeddine Abdessalem, Shifeng Xie, Zehao Xiao, Youssef Attia El Hili, Ambroise Odonnat, Jianfeng Zhang, Lujia Pan, Keli Zhang, Malik Tiomoko

Analysis of PDEs

Sharp Dispersive Estimates for the Schrödinger Equation with an Attractive Coulomb Potential

We prove sharp dispersive $L^1 \to L^\infty$ estimates for the three-dimensional attractive Coulomb operator $H_Z=-\Delta-Z|x|^{-1}$, where $Z>0$. The absolutely continuous part of the Schrödinger evolution decays at the free rate for short times, whereas its leading contribution decays like $|t|^{-1}$ for long times, with amplitude proportional to $Z$. This slower decay is driven by the threshold and is sharp when $Z^2|t|\gg1$.
Read the full abstract

High Energy Physics (Phenomenology)

A Unified Numerical Study of Axion Stars: From the Nonrelativistic Regime to General Relativity

Axion-star mass-radius relations are commonly computed using different orders of relativistic approximation, making it important to determine where these descriptions remain reliable. We perform a unified numerical comparison of axion-star ground-state configurations in the Newtonian Schrödinger-Poisson description, first- and second-order relativistic effective field theories, and the full Einstein-Klein-Gordon system for a real scalar field. Using the same attractive quartic self-interaction in all four descriptions, we scan $|\widetilde{\lambda}|=(M_{\rm Pl}/f_a)^2$ and determine the maximum masses and corresponding enclosed-mass radii. All descriptions recover the common large-$|\widetilde{\lambda}|$ dilute-star scaling, while substantial differences appear at weak and moderate coupling. The relativistic EFTs interpolate systematically between the Newtonian and full-GR results. For part of the maximum-mass sequence where $\max|\phi|/f_a=O(1)$, we test the temporal-harmonic and potential truncations explicitly in full GR. The higher-harmonic expansion shows rapid convergence, while restoring the complete single-cosine potential changes the maximum mass only at the percent level and $R_{95}$ at the several-percent level. Together with the systematic convergence of the relativistic EFT descriptions toward full GR, these results show that the large weak-coupling departure from the Schrödinger-Poisson prediction reflects the breakdown of the nonrelativistic structural description. Our results provide a systematic benchmark for determining when Newtonian, relativistically corrected, or fully general-relativistic descriptions are required for axion-star structure. The numerical implementation used in this work is available in the Axion Star Solvers repository at https://github.com/Parisa-Arabameri/AxionStar.
Read the full abstract

All authors Parisa Arabameri, Paola Arias, Francisco Colipí-Marchant, Enrico D. Schiappacasse

Artificial Intelligence

Identity Is More Than Recall: A Benchmark for Persistent Identity in Deployed AI Agents

Persistent agents need evaluations that distinguish identity facts they can recall from those they express and enact. We introduce PAI-Bench, a provider-neutral benchmark for fidelity to a versioned, update-governed identity contract. It separates recall, composition, behavioral enactment, resistance, persistence, lineage, and role-conditioned updates while keeping scoring oracles outside the target process. Two frozen campaigns cover sixteen synthetic profiles, thirty-two probes, and three independently initialized target configurations, yielding 1,536 retained responses. A judge-independent literal audit finds direct-parent identifiers in 48/48 atomic responses but only 1/48 implicit self-portraits. On eight profiles, explicit field cues increase joint presence of three identity identifiers from 0/8 to 7/8 under the same four-sentence instruction. A separate startup body-label substitution increases full-designation presence from 1/8 to 7/8 while parents remain absent. These contrasts reveal prompt-dependent component selection and component-specific sensitivity to startup cues in the tested deployments. Replaying identical factorial responses also yields a Claude headline mean 12.5 percentage points below Astra's, demonstrating evaluator sensitivity separately from target behavior. The studies use single target samples per condition, with post-hoc audits and follow-ups. PAI-Bench provides a reproducible evaluation protocol for measuring factual availability, identity expression, and behavioral enactment as distinct aspects of identity-contract fidelity.
Read the full abstract

Cryptography and Security

EI-DDLGN: Efficient Encrypted Inference with Deep Differentiable Logic Gate Networks under TFHE

Privacy-preserving inference via Torus Fully Homomorphic Encryption (TFHE) provides strong protection for sensitive data in outsourced deep learning applications. However, most TFHE-compatible neural network frameworks remain based on arithmetic neural architectures, resulting in high inference latency due to programmable bootstrapping (PBS), accumulator growth, and circuit bit-width sensitivity. In this work, we investigate Deep Differentiable Logic Gate Networks (DDLGNs) as a Boolean-native alternative for encrypted inference under TFHE. Because DDLGNs learn Boolean computations directly and discretize into fixed logic gate networks, their inference procedure is naturally aligned with TFHE's Boolean execution model and avoids arithmetic accumulation in hidden layers. We present EI-DDLGN, the first in-depth study of TFHE-based DDLGN inference, and characterize how encrypted execution cost depends on model size, learned Boolean-function distribution, and propagated wire status. We also introduce Model-Fixed-Wire PBS Bypass (MFW-PBS Bypass), a semantics-preserving execution strategy that eliminates unnecessary PBS operations without modifying the learned network topology. Evaluations across 72 depth-width configurations on MNIST, FashionMNIST, and UCI Phishing show that DDLGNs constitute an efficient alternative to arithmetic TFHE inference, achieving substantially improved accuracy-latency trade-offs. Notably, on MNIST, EI-DDLGN-Small matches the accuracy of QAT-FCNN-4 while reducing encrypted inference latency by 13.4x. Our implementation is available at https://github.com/Carleton-SCI/EI-DDLGN
Read the full abstract

Number Theory

Spherical statistics and phase transitions in high-dimensional lattices

We study the spherical statistics of all the points in a thin shell of a high-dimensional random lattice. The exact relations between lattice points make it unclear when predictions based only on spherical geometry should hold. We answer this question for several statistics, including the number of shell points, the balance of their directions, and the occurrence, repetition, and distribution of differences between them. We identify sharp thresholds as the shell radius grows and show that these statistics undergo several distinct phase transitions. A shell can already agree with one geometric prediction while still differing strongly from another. Our results hold for a single sampled lattice, with probability tending to one as the dimension grows. They include estimates that hold across a complete shell, bounds close to the transition thresholds, and extensions to randomly shifted lattices. A Lean formalization verifies the main results, assuming the classical formulas and probability model stated in the code.
Read the full abstract

Human-Computer Interaction

FaithfulBench: Does AI Counsel Uphold or Undermine the User's Professed Faith?

Do AI assistants help believers reason about moral dilemmas consistently with their faith? We present FaithfulBench, the first benchmark to score AI counsel across traditions by how well it adheres to the user's professed faith. Scenarios are drawn from each tradition's most respected texts, with the faithful answer known and applied by the judges as the standard. We test five frontier models under three conditions: the AI does not know the user's tradition; it receives a one-line prompt identifying the user as a practicing adherent; or it receives a companion-counselor guide rooted in the tradition's sources. Two judges score the initial response and whether the model caves or holds when pressured toward the answer the user wants. When the tradition is unstated, models counsel from a secular therapeutic default and every model fails some believers. Naming the faith wins a faithful first answer but not steadfastness; the guide improves both.
Read the full abstract

All authors M Waleed Kadous, Benjamin Olsen, Walter Scheirer, Daniel D. Slate, Alexander Arnold, DZ Kalman

High Energy Astrophysical Phenomena

Examining Temporal Characteristics of GCRs in the AMS-02 era

The energy spectra of Galactic cosmic rays (GCRs) serve as critical probes of their astrophysical origins and propagation mechanisms through the interstellar medium. Among the key physical processes shaping the observed spectra, solar modulation, driven by turbulent heliospheric magnetic fields and the variability of the solar wind, plays a dominant role in modifying GCR fluxes within the inner heliosphere. The recent release of time-dependent flux measurements for He, Li, Be, B, C, N, and O by AMS-02 provides unprecedented precision to investigate solar modulation phenomena. In this study, we demonstrate that Li, Be, B, C, N, and O nuclei exhibit solar modulation parameters consistent with those of protons (p) and He within a modified force-field approximation (FFA) framework incorporating rigidity-dependent modulation potentials. By positing that GCRs with the same charge-sign sharing the solar modulation parameters, we further forecast daily fluxes of Ne, Mg and Si from 2011 to 2020.
Read the full abstract

All authors Cheng-Rui Zhu, Yu-Lu Liu, Mei-Juan Wang, Tian-Hao Li, Yi-Hua Zhu, Kai-Kai Duan

Discrete Mathematics

Oblivious Self-Distance Symmetric Rendezvous on the Integer Line

Symmetric rendezvous on the line is a search problem in which two agents, initially placed at distance $2d$, must follow the same randomized strategy to meet as quickly as possible. In the standard model, agents may condition their actions on the entire execution history, and both the known- and unknown-distance variants admit expected rendezvous time $\Theta(d)$. We study the role of memory by introducing oblivious self-distance strategies, in which an agent's decision depends only on her position relative to her own starting location. For an initial separation of $2d$, let $R_d$ denote the optimal oblivious expected rendezvous time in the known-distance setting. We develop two finite-state frameworks based on absorbing Markov chains. Truncated chains give computable upper bounds through finite-support strategies, while weak-peek chains give lower bounds through a revealed-information relaxation. Together, they provide a mechanism for certifying optimality. Using that mechanism, we determine $R_1$ exactly and prove that it is attained by a finite-support strategy. For $d=2,\ldots,6$, numerical optimization gives the same truncation structure and objective values, yielding rigorous upper bounds below $7.83d^2$. We do not prove that the computed weak-peek minimizers are global, but the stability of the computations leads us to conjecture that they are, in which case the corresponding truncated strategies are optimal. We also prove that $R_d=\Theta(d^2)$. In the unknown-distance setting, we construct a universal strategy, independent of $d$, with expected rendezvous time $O(d^{2+\eta})$ for every fixed $\eta>0$. Thus, under the memory restriction, the known-distance rendezvous time becomes quadratic, while near-quadratic performance remains possible even without knowing $d$. The asymptotic analysis uses birth-death Markov chains and their electrical-network interpretation.
Read the full abstract

All authors Konstantinos Georgiou, Claude Gravel, Joey Kapusin, Lazar Mandic

Instrumentation and Methods for Astrophysics

A Two-Stage Physically Grounded Optical Design Framework with Application to a Multi-Channel Focal Reducer

We present a two-stage optimization framework that formalizes classical optical design strategies within a reproducible computational workflow. Starting point designs are constructed from paraxial and third-order models, providing optically consistent initial configurations. These configurations are refined through a physically grounded residual merit function evaluated by exact ray tracing, followed by RMS-based image refinement. Applied to a multi-channel astronomical focal reducer, the methodology provides a structured transition from aberration-based modeling to numerical optimization while preserving physically interpretable intermediate stages. By embedding classical optical design principles into an open computational pipeline, the approach reduces reliance on heuristic initial conditions and improves the reproducibility and interpretability of the design process.
Read the full abstract

All authors M. R. Najera, J. Herrera, Esteban Luna, Erika Sohn

Metric Geometry

Minimum central circles: an effective characterization of the global asymptotic constant

Let $R^\ast(n)$ be the minimum radius of a central circle externally tangent to nonoverlapping circles of radii $1,\ldots,n$. We prove that $R^\ast(n)=C_\ast n^2+o(n^2)$ and give finite linear programs that enclose $C_\ast$ with prescribed error. An exact angular comparison reduces the problem to marked points on a line with separation at least the geometric mean of each pair of marks. Concatenation with bounded joining cost and reassignment to the prescribed normalized radii prove existence of the limit. Balanced finite-word programs give a bracket of width $(1/k+1/r)/\pi$, before directed arithmetic error, using $k$ types and words of length $r$. We also obtain explicit geometric bounds. For the upper bound, we recover finite and countable reflected-block constructions by actual permutations, retaining all pair constraints. A coupled terminal-subset argument gives an explicit lower bound strictly above $1/8$. Together these give $C_{\rm term}+\eta_{\rm width}\le C_\ast\le U_4$. The lower endpoint comes from the terminal-subset argument, and the upper endpoint from the four-block construction; neither is asserted sharp. The finite-word scheme establishes computability; efficient high-precision evaluation and the structure of global optimizers remain open.
Read the full abstract

2609.13630 · 12 Sep · 9 pages. Updated the reference to Paper I and added a direct link and verification commands for the frozen companion archive in section 7. Mathematical results unchanged. Standalone proof supplements S1 (14 pages) and S2 (13 pages) are supplied as ancillary PDFs, with their TeX sources included

Computational Physics

Data-Driven Cohesive Zone Modeling within the Generalized Standard Materials Framework

Cohesive zone models are widely used to describe fracture and interfacial failure, yet most formulations prescribe problem-specific analytical traction-separation laws together with phenomenological rules for unloading and reloading, leading to specialized models for different cohesive behaviors. This work develops a unified learnable cohesive formulation within the generalized standard materials framework, in which the response is generated from learned constitutive functions while the underlying thermodynamic structure remains fixed. The surface free energy is decomposed into active and contact contributions, and irreversible damage evolution is governed by a learned mode-dependent damage resistance. The active energy is represented by an input-convex neural network, while the inverse damage resistance is represented by a monotone neural network. Convexity, monotonicity, normalization, and damage irreversibility are incorporated directly into the constitutive representation. Direct parameterization of the inverse resistance yields an explicit damage update and avoids local nonlinear inversion during constitutive evaluation. Material-point studies show that the formulation can represent qualitatively distinct cohesive responses, including plateaus, extended softening tails, irregular softening, nonlinear unloading, distinct Mode I and Mode II behaviors, and several classical mixed-mode cohesive laws. The framework therefore replaces law-specific model construction with a single thermodynamically structured representation capable of learning cohesive responses of broad functional complexity from data.
Read the full abstract

General Relativity and Quantum Cosmology

Static Spherically Symmetric Solutions in Nonconservative Unimodular Gravity

We study static and spherically symmetric black holes in nonconservative unimodular gravity, where the traceless field equations determine the source of a given geometry only up to a pure-trace term. We consider the Reissner-Nordström metric with an additional $1/r^{3}$ term and show that its coefficient fixes the Ricci scalar and, when the freedom in the source is restricted to the Rastall form, controls the nonconservation of energy and momentum. We find that only the null projections of the source are independent of how the geometry is divided between matter and vacuum. Therefore, no-go results based on the null energy condition hold in unimodular gravity, while those based on the strong or dominant conditions are generally split dependent. We identify the traceless source as the optimal split with respect to the energy conditions and determine the region in which all standard energy conditions can be satisfied. We also identify a combination of the shifts of the photon sphere and of the innermost stable circular orbit that measures the $1/r^{3}$ coefficient independently of the charge, although its detection requires a precision far beyond current observations.
Read the full abstract

Robotics

How Well Do Pseudo-Rigid Body Models Capture Real Plants? In-Field Validation of Simulated Blueberry Canes

Many labor-intensive tasks in fruit production such as pruning require physically interacting with the plant (e.g., pushing, pulling, bending limbs, etc.). Due to increasing labor shortages, there is widespread interest in the adoption of robotics in this area. When the robot must physically interact with the system, a deformable model of the plant is beneficial. Coupled, spring-loaded beams have been used in prior work to build deformable plant models in simulation for learning, planning, and control, but this approach has rarely been validated against the mechanical properties of real-world plants. In this paper, we use this rigid-body model, grounded in real material properties and beam bending theory, to simulate the deformation of blueberry canes under loading. To validate the model, we simulate the canes in MuJoCo and compare their behavior with real-world data collected from probing canes at a commercial farm with a custom testbed. We perform sensitivity analysis on several key modeling variables and show that this approach is highly sensitive to the plant diameter calculations and a priori flexural modulus estimation, which is dependent on season and blueberry variety. We also share our dataset of live blueberry cane deformation, including RGB-D images and measured forces and displacements.
Read the full abstract

All authors Hannah Kolano, Chelse VanAtter, Wei Yang, Cindy Grimm, Joseph R. Davidson

Number Theory

Pointwise ergodic theorems along sequences of intermediate growth

We establish the first pointwise convergence result for ergodic averages with iterates along explicit and deterministic sequences of intermediate growth, that is, growing faster than any polynomial but slower than any exponential. In particular, we show that the sequence $(\lfloor \exp((\log n)^c)\rfloor)_{n\in\mathbb{Z}+}$, with $c\in(1,8/7)$, is universally $L^p$-good for every $p\in(1,\infty]$. This gives an affirmative answer to an open problem dating back to the mid 1980s and contributes to Bellow's program, initiated in the earlier part of the same decade, on the characterization of $L^p$-good sequences in pointwise ergodic theorems. The proof combines the so-called one-frequency circle method with a delicate application of Vinogradov's method for estimating exponential sums whose phases involve $\big(\lfloor \exp((\log n)^c)\rfloor\big)_{n\in\mathbb{Z}_+}$. An interesting feature of our analysis, reminiscent of estimates arising in the study of the zero-free region of the Riemann zeta function, is that the argument relies on the classical Vinogradov method, in the sense that it necessitates estimates on the number of solutions for the Vinogradov system of Diophantine equations with explicit dependence on the system's parameters.
Read the full abstract

Materials Science

Probing (sub)nanoscale ferrons in an electron microscope

Ferrons are collective excitations of polarization fluctuations that can enable terahertz communications and quantum transduction due to long propagation lengths. Although ferrons have been experimentally demonstrated in van der Waals ferroelectrics and relaxor ferroelectrics, there is no direct (sub)nanoscale experimental evidence of ferrons in three-dimensional ferroelectrics. Here, we detect two types of ferrons, Higgs and pseudo-Goldstone, at the (sub)nanoscale in lead titanate by measuring vibrational signals due to polarization fluctuations. By harnessing momentum transfer in electron energy loss spectroscopy (EELS), we directly distinguish between soft-phonons and ferrons. We observe that the Higgs mode originates from the soft optical phonon parallel to the polar axis, whereas the pseudo-Goldstone mode originates from the soft optical phonon perpendicular to the polarization axis. Together with Landau theory, Raman spectroscopy measurements, and EELS, we observe that Higgs group velocities, in the bulk limit, are eight times greater than those of out-of-plane soft phonons and the pseudo-Goldstone ferrons have group velocities six times greater than in-plane soft phonons due to long-range dipole interactions. We further show that the domain size confinement effects lead to doubling of the respective bulk ferron group velocities, reaching up to approximately 15 km per second (almost 15 times higher than the out-of-plane soft phonon modes). Overall, this study opens a pathway to the detection of ferrons in three-dimensional ferroelectrics with domain engineering as a promising avenue for terahertz communication and transduction.
Read the full abstract

All authors Mahir Manna, Fei Yang, Shayantan Chaudhuri, Sourav Shenoy, Guo-Dong Zhao, Mohit Tanwani, Surya Prakash Reddy, Patrick J. Hays, Sriram Sankar, Cauê de Souza Coutinho Nogueira, Srilekshmi Muraleedharan, Xin Xu, Sujit Das, Katherine Inzani, Long-Qing Chen, Sandhya Susarla

Machine Learning

An Efficient and Modular Framework for Targeted Harm Mitigation in LLMS

Large Language Models (LLMs) are powerful zero-shot learners but remain prone to misalignment with human preferences, often producing biased, toxic, or otherwise harmful outputs. Existing alignment methods, while effective, are costly and tightly coupled to the model, limiting flexibility and scalability. We propose a modular correction framework that augments pretrained LLMs with Activated LoRA (aLoRA) adapters and a context-aware routing mechanism to eliminate harms from misaligned model responses. Our approach enables expert adapters to activate mid-sequence without invalidating the KV cache, allowing low-latency, targeted correction during generation. Each expert is trained to detect and mitigate specific harms, such as bias or toxicity. A learned router dynamically selects appropriate experts based on the models intermediate outputs. We demonstrate that our system improves alignment on standard safety benchmarks while preserving task performance, offering a lightweight and efficient path toward safer and more controllable LLM deployments.
Read the full abstract

All authors Roberto Campbell, Momin Abbas, Muneeza Azmat, Michal Ulewicz, Raya Horesh, Kristjan Greenewald, Rogério Abreu de Paula, Nathalie Baracaldo