Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 30 August
For graphs $H$ and $F$, let $\operatorname{ex}(n,H,F)$ denote the maximum number of copies of $H$ in an $F$-free graph of order $n$. Motivated by the Erdős-Sós theorem, Gerbner and Palmer and, independently, Zhao and Peng conjectured that for every tree $T$ of order $k$ and every $3\le r\le k-1,$ $$\operatorname{ex}(n,K_r,T)=a\binom{k-1}{r}+\binom{b}{r},$$ where $n=a(k-1)+b$ with $0\le b<k-1$. In this paper, we confirm the conjecture for $r\ge \left\lceil (2k-1)/3\right\rceil$ and characterize all extremal graphs.
Functional Analysis
A counterexample to Scottish Book Problem 155
We construct real Banach spaces $X$ and $Y$ and a bijection $U\colon X\to Y$ which preserves all pairwise distances on every closed ball of radius $1/4$ but is not a global isometry. The proof starts from an explicit injective map that preserves every distance at most $1/2$ and shortens one longer distance. We then enlarge the source and target through a transfinite recursion that inserts every missing target point while preserving both injectivity and this distance threshold.
Read the full abstract
Artificial Intelligence
To Think or Not to Think: Allocating Reasoning Where It Helps
Reinforcement learning (RL) has proven effective in enhancing the reasoning performance of large language models (LLMs), particularly in complex mathematical and programming tasks. However, this capability comes with systematic length misallocation, in which models devote excessive reasoning to simple questions while terminating prematurely on harder ones, degrading inference efficiency with negligible accuracy improvement. Many length-adaptive methods mitigate this issue by allocating token budgets according to question difficulty, under the implicit assumption that harder questions benefit monotonically from extended reasoning. In contrast, we find that the effect of reasoning length on accuracy is concentrated on partially solvable questions. Our further analysis reveals that explicit length rewards can produce unintended training dynamics. Motivated by these findings, we propose CARE—Contrastive Accuracy Reward Estimation—which compares the beneficial length adjustment per question from online sampled responses and applies adaptive length rewards within Group Relative Policy Optimization, with no extra hyperparameters or additional inference cost. Experiments across multiple reasoning benchmarks demonstrate that our method improves Pass@1 by up to \(4\%\) while simultaneously reducing reasoning length by \(37\%\), achieving higher token efficiency. Code will be available upon the acceptance of this paper.
Read the full abstract
Computer Vision
Investigating White Blood Cells as a Source of False-Positive Malaria Parasite Detection in African Blood-Smear Images
White blood cells (WBCs) present on every Giemsa-stained thick blood smear share visual properties with early-stage Plasmodium falciparum ring-form trophozoites: small size, round morphology, and intense purple staining. They are a plausible but untested source of false positives in parasite-only detectors. We trained two YOLOv12s models on the Lacuna Malaria Detection dataset (8,000 images from Uganda and Ghana): Model A with parasite labels only, and Model B with both parasite and WBC labels. Seven independent spatial and statistical analyses tested whether false positive (FP) predictions cluster near WBC locations. All seven refute the hypothesis. In both models, 95% of FPs are pure background detections (IoU below 0.10 against any ground-truth box); zero are WBC class confusions. Ripley's Cross-K analysis shows spatial repulsion between FP centroids and WBC positions at every radius tested. Model B outperforms Model A overall (mAP50 0.859 vs. 0.755), and the advantage is uniform across all WBC-proximity bands, pointing to multi-task representation learning rather than WBC suppression as the cause. False positives arise from Giemsa stain debris and preparation artifacts. Effective mitigation requires staining artifact augmentation and annotation of unannotated early-stage ring forms rather than WBC labeling alone.
Read the full abstract
Number Theory
On the density of $A+B$ when $B$ has few elements
Let $\mathsf{d}$ be the asymptotic density on the positive integers $\mathbb{N}^+$. We provide sufficient conditions on an infinite set $B\subseteq \mathbb{N}^+$ so that for each $\alpha \in [0,1]$ there exists a set $A\subseteq \mathbb{N}^+$ such that $\mathsf{d}(A)=0$ and $\mathsf{d}(A+B)=\alpha$. For instance, if $(b_n: n \in \mathbb{N}^+)$ is the increasing enumeration of $B$, it is sufficient that $\liminf_n b_{n+1}/b_n>1$. Moreover, we show that, if $|B\cap [1,n]|\ll \log(n)^{1-\varepsilon}$ for some $\varepsilon>0$, then for each $\alpha \in [0,1]$ there exists a set $A\subseteq \mathbb{N}^+$ such that $\mathsf{d}(A)=\mathsf{d}(A+B)=\alpha$. Conversely, we show that, for each $\varepsilon>0$, there exists an infinite set $B\subseteq \mathbb{N}^+$ such that $|B\cap [1,n]| \ll n^{2/3+\varepsilon}$ and $\mathsf{d}(A+B) \in \{0,1\}$ for every $A\subseteq \mathbb{N}^+$ such that $A+B$ admits asymptotic density.
Read the full abstract
Statistics Theory
Copula Geometry and Second-Order Calibration of Heavily Right Aggregation
Heavy-tailed $p$-value combination tests are attractive under unknown dependence because their null tails can be first-order robust even when the exact dependent null distribution is unavailable. That robustness does not resolve calibration: $\Pr\{T>q(\alpha)\}=\alpha+o(\alpha)$ neither quantifies the remaining size error nor determines its sign. We develop a second-order calibration theory for positive Half-Cauchy and reciprocal, or harmonic-mean, aggregation. After exact marginal standardization, extremal dependence is represented by an index-one exponent measure on the coordinate-face lattice. Its support separates axial, full-interior, proper-face, and mixed geometries. A Möbius decomposition shows how the noncompact weighted half-space probes every face, while quantitative face limits determine whether the correction is integrable, critically amplified, or nonintegrable. With common-factor inversion and a tail-to-calibration map, this yields machinery applicable beyond individual parametric copula families. The results include an integrable hidden-face transfer theorem, a sharp fixed-dimensional local-corner theorem with explicit higher-face control, a common-heavy-factor theorem, and size and critical-value expansions relative to independence. Gaussian, standard multivariate-$t$, positive Clayton, and max-linear pair-shock models exhibit distinct power, logarithmic, radial–angular, and proper-face mechanisms; the Gaussian weighted-half-space transfer is conditional on explicit face-boundary hypotheses. Thus dependence geometry determines the rate, coefficient, and direction of the calibration error left unresolved by first-order validity. Asymptotics use $t\to\infty$, equivalently vanishing significance levels.
Read the full abstract
Mathematical Physics
Interactions between rarefaction waves and dispersive shock waves in the Gerdjikov–Ivanov equation with non-convex hydrodynamics
This paper systematically investigates admissible configurations of the interaction between a rarefaction wave (RW) and a dispersive shock wave (DSW) by constructing a two-step piecewise constant initial condition in the Gerdjikov–Ivanov (GI) equation with non-convex hydrodynamics. Owing to the two-valued mapping associated with the Riemann invariants, the GI equation also supports contact DSWs (CDSWs), which are included in the interaction analysis. Using Whitham modulation theory, we elucidate the self-similar descriptions of the incoming waves, derive the boundary matching conditions, and obtain analytical expressions of the full evolution before, during, and after the interaction through generalized hodograph transformation. The results show that the interaction of a RW with either a DSW or a CDSW can exhibit two distinct scenarios: in one case, the two waves exchange spectral parameters after the interaction and fully separate, propagating independently with modified phases; in the other case, the wave structures merge upon interaction and subsequently evolve into either a soliton train or a small-amplitude harmonic wave for a classical DSW, and into an algebraic soliton train for a CDSW. The theoretical results are in good agreement with numerical simulations. This work can provide theoretical support for wave interaction phenomena in non-convex dispersive systems.
Read the full abstract
Social and Information Networks
IMEX-FND: A Traceable Interaction-Aware Mixture-of-Experts Framework for Multimodal Fake News Detection
Multimodal fake news detection (FND) increasingly demands verdicts that are not only accurate but traceable, revealing how cross-modal evidence is combined, yet two coupled difficulties remain. First, text-image relations are heterogeneous: uniqueness, redundancy, and synergy coexist and vary from post to post, so a single global fusion rule is brittle and opaque. Second, the dominant modality shifts across instances, which static encoders and a fixed fusion pathway handle poorly. We present IMEX-FND, an interaction-aware mixture-of-experts framework that couples adaptive routing with explicit interaction decomposition. A Multi-Modal Expert Gateway (MMEG) performs instance-wise, within-modality routing over specialized and shared experts and builds a CLIP-grounded cross-modal stream, yielding three refined, interaction-ready representations that adapt to the dominant modality of each post. An Interaction-aware Multi-Modal Expert Fusion (IMEF) module then decomposes the interactions among these streams into uniqueness, redundancy, and synergy, producing transparent, sample-wise weights via a modality-replacement training signal. The two stages form a single route-then-decompose pipeline whose routing and interaction weights are both inspectable, offering instance- and dataset-level traceability for misinformation diagnosis. Extensive experiments on the Weibo, Weibo-21, and Gossip benchmarks show that IMEX-FND achieves state-of-the-art performance, surpassing competitive baselines by 0.4-1.2% while offering superior traceability with fewer parameters.
Read the full abstract
Information Retrieval
Anatomy of a Decision: Uncertainty-aware Hierarchical Intent Learning via Flow Matching for Multimodal Recommendation
Modeling the underlying user intent is crucial for recommendation, but existing methods struggle with the inherent uncertainty and the dynamic, hierarchical nature of user interests. Current approaches often rely on clustering or prototype learning to discover a static set of intents. However, they face two critical challenges: (1) they overlook the uncertainty inherent in multimodal features; and (2) they assume a static and flat intent structure, failing to adapt to a user's varying decision certainty. To address these limitations, we propose UHIFlow, an Uncertainty-aware Hierarchical Intent learning framework via Flow matching. First, our Cross-modal Uncertainty Synergistic Modeling (CUSM) module leverages conditional flow matching to quantify uncertainty from visual and textual modalities and synergistically align them. Subsequently, the Uncertainty-guided Hierarchical Intent Generation (UHIG) module uses this quantified uncertainty to dynamically construct a personalized intent hierarchy, generating coarse-grained intents for uncertain users and fine-grained ones for users with clear preferences. Extensive experiments on three real-world datasets demonstrate that UHIFlow significantly outperforms state-of-the-art baselines.
Read the full abstract
Cryptography and Security
MoSign: Challenge-Response Motion-Watermark Authentication for Anonymous Virtual-Reality Users
Social virtual reality (VR) creates a paradox. A user's body motion is a high-entropy biometric: head and hand trajectories alone re-identify users among tens of thousands with over $94\%$ accuracy, so anonymizing the rendered avatar is a practical necessity. Yet a user often still wants to prove their identity to a chosen party from inside that anonymity. We present MoSign, which recasts digital watermarking as a challenge-response authentication protocol on the motion channel. MoSign embeds a time-varying keyed message into the style latent of a motion variational autoencoder via keystream-whitened Gaussian-Shading: watermarked motion is provably indistinguishable from watermark-free motion, since any detector's advantage reduces to breaking a pseudorandom function, so the mark composes with anonymization. The message is a keyed MAC over an epoch counter, a session nonce, and a deployment context, making MoSign replay-resistant and bounding forgery by the verifier's measured false-accept rate times the adversary's online query budget. A key-holding verifier decides with a sequential test. We identify render$\rightarrow$record$\rightarrow$re-estimate ("recapture") as the realistic VR attack surface: a generic pose estimator strips the necessarily subtle watermark, but a recapture-robust keyed reader recovers it (up to $0.96$ codeword accuracy on a projected-2D channel, $0.81$ through a full render-to-video loop), while without the key recovery stays at chance. On HumanML3D, MoSign authenticates every legitimate user at a false-accept rate of $10^{-4}$ on clean and most channels and stays undetectable (detection AUC $0.51$, chance $0.5$); on the BOXRR-23 VR dataset it carries the mark through a real anonymizer at $0.99$ codeword accuracy and adds no de-anonymization side channel.
Read the full abstract
Systems and Control
DynaTrust-VVC: Directional Physics-Informed Trust-Based Detection and Mitigation for Cyber-Resilient Multi-Agent Volt–VAR Control
Distributed Volt–VAR control relies on voltage measurements and is therefore vulnerable to false-data injection. Neighbor corroboration can distinguish an isolated corrupted measurement from a physical disturbance, but coordinated agents can falsely corroborate one another. This paper proposes DynaTrust-VVC, a cyber-resilient multi-agent Volt–VAR framework that assigns each incoming neighbor message a directional trust value based on the consistency between its reported voltage increment and a sensitivity-based prediction from active- and reactive-power changes. Trust falls immediately after a physics mismatch and recovers gradually after sustained consistency. DynaTrust-VVC further uses a physics-adaptive evidence threshold and counterfactual safe-voltage recovery-based mitigation. The proposed method was validated using a nonlinear IEEE 123-bus feeder with minute-resolution residential profiles and 27 matched replicates. DynaTrust-VVC identifies a coordinated three-bus attack one minute after onset in all 27 matched replicates, whereas an otherwise identical configuration with fixed neighbor trust identifies none. The composite resilience index also increases from 0.227 to 0.315, with no statistically significant increase in the benign false-alarm rate.
Read the full abstract
Cryptography and Security
From Spectrum Regulation to Computational Enforcement: An Auditable Governance Architecture for Adaptive Spectrum Sharing
Spectrum governance requires rules to be translated into machine-executable decisions while preserving incumbent protection, regulatory authority, and an auditable record of why a decision was made. We present SPECTRA-GOV, a Tri-Layer Adaptive Governance Architecture (TLAGA) connecting international treaty coordination, national adaptive licensing, and real-time enforcement. The work builds on the original reference implementation preserved at v0.1.0-paper and adds a post-audit evaluation layer rather than replacing it. V2 introduces controlled spectral-contention scenarios, corrected geodesic-distance calculation, per-operator selective authorization, paired baseline counterfactuals, policy perturbation, regulatory-change analysis, and causal provenance. Across 10,000 scenarios in each of seven contention classes, incumbent protection was 100.00% in the no-contention control, 99.92-99.87% in weak-to-dynamic classes, 99.47% under strong overlap, and 90.00% in the adversarial close-proximity class. In a paired S3 baseline experiment, selective authorization achieved 100% incumbent protection and 89.43% access opportunity, while the population-wide dynamic baseline achieved 99.91% protection and 99.53% access. Identical results for the dynamic-SAS and SPECTRA-GOV selective variants mean selective admission alone is not claimed as an exclusive algorithmic novelty. The contribution is the integration of policy representation, computational enforcement, auditability, provenance. Enforcement timing was measured in-process, with mean latency increasing from 0.028 ms for one operator to 1.682 ms for 500 operators; these are software benchmarks, not field measurements. The results establish a reproducible computational governance prototype and identify remaining questions before operational or regulatory claims can be made.
Read the full abstract
Quantum Physics
Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment
Hybrid quantum-classical neural networks have emerged as a promising approach for leveraging quantum computing in machine learning while mitigating current hardware limitations. This paper presents Sim-HVQC, a hybrid Deep Quantum Neural Network that couples an adaptive, parameter-free SimAM weighting module with classical feature extraction to preserve class-discriminative information prior to encoding into a Variational Quantum Circuit (VQC). Previous studies are restricted to binary classification [1] [2] [3] [4] [5]. In contrast, the proposed framework is trained and evaluated on various multi-class datasets(MNIST, KMNIST, Fashion-MNIST, and EMNIST). The framework further demonstrates reproducibility, parameter efficiency, and interpretability through multi-seed evaluation, parameter analysis, and latent/quantum feature inspection. The source code is publicly available at https://github.com/Dilli822/ SimAM-HVQC
Read the full abstract
Quantum Physics
Structured Variational Key Concentration for a Reduced AES Cipher
Grover search provides the generic quantum baseline for symmetric-key recovery by amplifying a reversible public-verification oracle. We investigate whether public round structure can instead shape a variational key register before exact verification. For simplified AES (S-AES), we construct phase separators from S-box differential-distribution constraints, candidate-key-dependent inverse diagnostics, and a global residual Hamming-shell term. Each component has a reversible compute-phase-uncompute realization. We prove a one-sided completeness statement for these diagnostics and derive a conditional lower-tail bound for false keys under a weakly correlated diagnostic model. On ten random three-pair 16-bit S-AES instances, an 18-layer schedule optimized with Adam achieves a mean public-consistent-key probability of 46.78 percent, ranks the correct key first in every run, and limits the largest observed false-key probability to 1.11 percent. The 16-bit study evaluates the induced key-register dynamics without shot sampling, while a separate gate-level S-DES experiment validates the reversible oracle pattern without a key-space phase table. The results establish a controlled reduced-cipher benchmark; they do not claim an attack on full AES or an asymptotic advantage over Grover. Within these limits, the construction provides a useful framework for analyzing how AES structure can be incorporated into quantum algorithms.
Read the full abstract
Quantum Physics
End-to-End Quantum Semantic Communication with Variational Quantum Neural Networks
Quantum-enabled learning is increasingly being explored for future communication and networking applications, including distributed sensing, Internet of Things (IoT), and distributed quantum computing. However, existing approaches often face challenges in scalable inference and efficient information processing. To address these limitations, this paper integrates quantum machine learning (QML) with quantum semantic communication (QSemCom) in an end-to-end learning framework. A classical dataset is first mapped to a low-dimensional feature representation and encoded by a variational quantum transmitter that learns task-relevant semantic features. The resulting features are transmitted through a quantum channel and processed by a receiver to perform a downstream classification task. The proposed framework is evaluated using the MNIST dataset and variational quantum neural networks (QNNs) under ideal and noisy quantum-channel conditions. First, a baseline model is trained over an ideal channel and evaluated under increasing depolarizing noise without retraining. A second set of experiments introduces a trainable receiver QNN and jointly optimizes the transmitter and receiver through end-to-end (E2E) training. The results demonstrate that jointly trained quantum semantic transceivers can adapt the transmitted representation to channel impairments and preserve task-relevant information, highlighting the potential of receiver-aware QML for robust inference in quantum semantic communication.
Read the full abstract
Computation and Language
The Role of AI in Online Reviews
The rapid adoption of large language models (LLMs) creates new opportunities for strategic content generation on online platforms, including potentially harmful forms of manipulation that may undermine platform effectiveness and reshape platform dynamics. However, measuring such activity is difficult because AI-generated content is rarely directly observable. We introduce an empirical approach that leverages discrete LLM supply shocks - abrupt changes in model prices and capabilities, and contrasts verified with non-verified reviews to identify changes in platform activity associated with generative AI supply improvements. We apply this approach to more than 13 million reviews from Trustpilot, one of the leading online platforms for business reviews. A robust finding is that following LLM supply shocks, unverified reviews shift toward greater negativity: more 1-stars, fewer 5-stars, and lower ratings, with effects driven primarily by new model releases and concentrated among firms with the lowest and highest review volumes, suggesting that strategic AI use may reshape platform competition dynamics. We further find that LLM supply shocks trigger short, concentrated bursts of review activity. Together, these findings suggest that generative AI is already reshaping how reputation and competition operate on online platforms.
Read the full abstract
Machine Learning
Dissecting Hierarchical Reasoning Models: A Mechanistic Study
We study Hierarchical Reasoning Model (HRM), a representative hierarchical Transformer-based latent reasoning model with many variants, on Sudoku, Maze, and ARC-AGI-2. We mechanistically understand how HRM reasons and what information it encodes. Our analyses compare HRM against Transformer baselines with and without recurrent modules, apply causal interventions on recurrent states, and utilize linear probes against random-direction ablations, as well as sparse autoencoders with feature ablations. Our results reveal several key findings: recurrent models outperform one-pass baselines, while single-state recurrent Transformers are comparable to HRM. State interventions further show that the causal contributions of the high- and low-level states vary across task-specific checkpoints and inference stages. Selected task variables are linearly decodable from the recurrent states in HRM, yet ablating probe directions produce effects comparable to random controls. SAE ablations yield larger behavioral changes than probe-direction ablations. However, top-ranked SAE features show no stable advantage over size-matched random subsets at larger ablation sizes or across tasks; the same pattern persists in a Sudoku control with within-step BPTT. Together, we characterize that HRM is essentially implementing constraint-aware iterative refinement on a puzzle-specific solution state, in which the functional contributions of components at different levels vary without relying on a compact, causally important feature set. These results highlight the necessity of studying the different working mechanisms and the importance of developing mechanistic interpretability techniques better suited for latent-space, recursive reasoning models.
Read the full abstract
Machine Learning
EvoRank: LLM-Guided Evolution of Multi-Objective Learning-to-Rank Pipelines
We present EvoRank, an open autonomous ranking engineer: an LLM-guided evolutionary loop that discovers complete Learning-to-Rank pipelines (features, models, losses, ensembles) for multi-objective e-commerce search. On the Expedia ICDM 2013 dataset, with relevance, conversion, and revenue as competing objectives, three independent runs each converge within 50 iterations (about ten dollars) on interpretable pipelines that beat an Optuna-tuned LambdaMART on 60k held-out queries, an advantage that persists at full data scale and places in the top 6 percent of the original competition. A first campaign, evolving only training objectives, builds the central design rule: it appeared to work on its selection fold (the small dataset it uses to pick winners) while a transfer audit, re-scoring winners on held-out data, showed the gains were almost entirely fitness noise (the randomness of its own scoring), and neither seeded domain knowledge nor richer diagnostic feedback changed what transferred. The deciding quantity is measurable in advance: search-space headroom relative to fitness noise. We package this as a headroom gate that predicts, before any LLM spend, whether the loop will pay off, and we release the system, the auditing tools, and a catalog of failure modes with their guardrails, so teams can apply the procedure to their own ranking stacks.
Read the full abstract
Computation and Language
The Situated Identity Test: Distinguishing Persistent Cognitive Identity from Persona Imitation
Large language models can convincingly adopt personas, recall past dialogues, and weave rich autobiographies. Yet this conversational eloquence conceals a fundamental attribution problem: looking the part does not mean having lived the life. Two individuals can share identical public profiles–the same age, hometown, occupation, and personality traits–while possessing entirely distinct private histories, relationships, and acquired skills. When conditioned solely on that shared profile, an agent lacks the information required to determine which lineage is correct. We introduce the Situated Identity Test (SIT), an architecture-independent framework that evaluates whether an agent's behavior is functionally attributable to a specific developmental lineage. Grounded identity requires both appropriate knowledge of recorded experiences and appropriate ignorance of ungrounded ones, bounded by what the identity has actually acquired rather than what its underlying foundation model knows. We prove that any policy conditioned solely on a compressed profile is bounded by an average situated validity of at most 1/m across m colliding life histories on lineage-discriminative queries (at most 50% for paired lineages). We instantiate this framework in SITBench, an evaluation suite designed for 25 profile-collision pairs (50 distinct lineages) across 10,000 planned probes and nine architectural configurations. Supported by an open-source reference implementation, deterministic test fixtures, and empirical pilot evaluations on frontier foundation models (GPT-5.6 Sol and Claude Opus 5), we formalize the failure modes of persona prompting under profile collision and provide an assurance harness for evaluating episodic continuity, structured state, and epistemic boundaries.
Read the full abstract
Analysis of PDEs
Edmunds-Evans essential spectra of the generalized Constantin-Lax-Majda linearization
For $0<a<1$, we study the linearization $L_a$ about a smooth odd self-similar collapse profile $(\Omega,c_l)$ of the generalized Constantin-Lax-Majda equation, where $c_l$ is the focusing exponent. On the origin-$H^2$ realization $X=\{\varphi\in L^2(0,\infty):\varphi(0)=0,\varphi''\in L^2(0,\infty)\}$, under explicit transport, regularity, weighted-derivative, and far-field hypotheses, the first three Edmunds-Evans essential spectra are exactly the union of two possibly coincident vertical lines: $\operatorname{Re}\lambda=F=-1+c_l/2$ at infinity and $\operatorname{Re}\lambda=O=-\tilde c/2$ at the origin, where $\tilde c=c_l+a(H\Omega)(0)$ and $H$ is the Hilbert transform. Off these lines, $L_a-\lambda$ is Fredholm, with index zero on the exterior components, $+1$ in the open strip when $F<O$, and $-1$ when $O<F$. The fourth and fifth Edmunds-Evans spectra and the Browder essential spectrum equal the closed strip. Every point of the open strip with index $+1$ is an eigenvalue. Every fixed point of the Huang-Qin-Wang-Wei positive-advection construction with $0<a<400/(848-9\pi^2)$, after normalization, satisfies the full hypothesis package. For all sufficiently small positive $a$, every such fixed point has $F<O$. Thus actual collapse profiles realize a nonempty Browder band. An additional kernel-nondegeneracy condition (ND) yields exact individual kernel and cokernel dimensions. We prove it outside an explicit vertical energy slab and, at sufficiently high frequency, on every closed vertical substrip of the open band separated from the far-field line. Failures in the open band are locally finite and can accumulate at high frequency only toward that line.
Read the full abstract
Neurons and Cognition
Planning as Dynamics Relaxation: Hippocampal Recurrent Network Realizes Optimal Goal-Directed Navigation
Neural correlates of the cognitive map are well documented, yet how a neural circuit turns a stored map into an obstacle-avoiding route remains unclear. Here we show that a hippocampal network with appropriate recurrent connections achieves optimal goal-directed navigation through its own relaxation dynamics. The recurrent weights represent the transition probabilities between the locations the neurons encode, walls are reflected by vanishing weights, and behavioral-timescale synaptic plasticity (BTSP) writes this connectivity during goal-free exploration. When a goal is recalled, a top-down current clamps the goal neuron and the population relaxes into a goal-locked activity field. We prove that this field is the desirability field of a linearly-solvable Markov decision process: the relaxed state is the exact optimum of a stated control problem, the KL-regularized objective of Todorov, and the optimal next-step distribution is carried by the branch synaptic currents. The identity extends to directed transitions, and a weak-cost limit returns the Green's function of the recurrent Laplacian. A place-tuned readout converts the field's log-gradient into a direction of travel, and the same synapses answer a predictive query when the source is placed at the current location. Simulations on mazes with complex obstacles show near-shortest routes, an identity that survives a thousand-fold range of recall amplitude, the loss of 80% of place cells, and tens of thousands of states, low-rank updates of every plan after a local change, and a transient that is anytime: the local action is ready long before the field converges. We hope this offers a general circuit principle for planning in abstract cognitive maps beyond spatial navigation.
Read the full abstract
Analysis of PDEs
A characterization of submanifolds of $\mathbb{R}^{m \times n}$ satisfying optimal rigidity estimates
Let $K \subset \mathbb{R}^{m \times n}$ be a compact $C^1$-submanifold with boundary, $p \in (1,\infty)$ and $Q := (0,1)^n$. We prove that $K$ satisfies a rigidity estimate of the form $\|Du - (Du)_{Q}\|_{L^p} \leq C \|\mathrm{dist}_K(Du)\|_{L^p}$, $u \in W^{1,p}(Q,\mathbb{R}^m)$, if and only if $K$ satisfies sequential rigidity and for each $A \in K$, the tangent space to $K$ at $A$ satisfies exact rigidity. We further prove that this rigidity estimate is stable under small graphical perturbations of $K$. The key technical ingredient is proving that outside some small bad set where the maximal function of $\mathrm{dist}_K^p(Du)$ is large, the size of the superlevel sets of $\lvert Du - (Du)_Q\rvert$ decays exponentially. This is achieved by an adaptation of the John-Nirenberg inequality for $BMO$-functions.
Read the full abstract
Atmospheric and Oceanic Physics
Liutex Core Lines as a New Framework for Tropical Cyclone Vortex Analysis
Liutex core lines are systematically applied to Hurricane Dorian to investigate the three-dimensional vortical organization of an intense tropical cyclone. Unlike conventional analysis based on wind speed or vorticity, Liutex core lines identify the local vortex axes and provide a compact geometrical representation of rotational structures. The results show that Dorian is not characterized by a single vortex core, but by a large population of vortices embedded within a coherent hurricane-scale circulation. Stronger and more vertically organized vortices are concentrated in the inner-core region, whereas numerous weaker, inclined, and curved vortical structures extend outward and collectively retain the spiral organization of the storm. The complete core line field therefore reveals a three-dimensional, multiscale vortical skeleton of the hurricane. These results suggest that a tropical cyclone can be viewed as an organized multiscale vortex system rather than a single monolithic vortex. Beyond visualization, Liutex core lines provide a potential framework for quantifying vortex geometry, spatial organization, and temporal evolution, offering a new approach for studying structural changes and vortex dynamics in tropical cyclones.
Read the full abstract
Optimization and Control
MOE-DGSCND: Multi-Objective Enterprise Green Supply Chain Network Design
This paper introduces and studies the Multi-Objective Enterprise Doubly-Green Supply Chain Network Design (MOE-DGSCND) problem an extension of Green Multi-Objective Supply Chain Network Design (GSCND)[Olfat, L., e. a. (2022), Sreyneath, C. (2021)]. The problem studied here is a three-objective combinatorial optimization problem that simultaneously minimizes total cost f1, carbon dioxide emissions f2 and customer dissatisfaction f3 over binary decisions regarding which distribution centers to open and how to assign customer zones to open facilities. The problem generalizes the capacitated facility location problem CFLP and is known to be NP-hard [Garey, M. R. and Johnson, D. S. (1979)]. This paper formally specifies the decision variables objective functions and constraints and investigates three solution approaches using a single numerical instance (A) an exact weighted-sum integer linear programming ILP formulation solved with Python combinatorially and via PuLP (B) three Fully Polynomial Time Approximation Schemes (FPTAS) providing $1+\epsilon$ approximate solutions for $\epsilon := 0.15$ and (C) two baseline heuristics for comparison. On an instance with eight customers and five candidate distribution centers the exact solver certifies the optimal sampled supported solutions across eight weight combinations while the FPTAS-based approaches complete within milliseconds compared to centiseconds for the exact ILP on this tiny non-stochastic instance.
Read the full abstract
General Mathematics
Schwarz-Type Null Curves in $\mathbb{C}^4$: Symmetry and Period Reduction
We study a genus-three hyperelliptic holomorphic null-curve family in $\mathbb{C}^4$, modelled on the algebraic data of the classical Schwarz P/D family, whose real parts define minimal immersions into $\mathbb{R}^4$. For the order-four automorphism $\omega\mapsto i\omega$ of the underlying Schwarz curve, we compute explicitly its action on the four holomorphic Weierstrass $1$-forms and derive the resulting identities for all real period vectors. Consequently, for every lattice invariant under the induced target rotation, torus-period closure can be checked on one representative from each orbit of a symmetry-stable homology generating set. We also identify precisely when the additional parameter produces a nondegenerate codimension-two deformation. The paper does not claim the construction of a new embedded periodic minimal surface in $\mathbb{R}^4$; rather, it provides an explicit symmetry reduction of the period problem associated with this family.
Read the full abstract
Machine Learning
When Do Options Help? Policy Necrosis and Redundant Coverage in Option-Critic
Option-critic learns options: sub-policies together with a learned rule for when each one hands control back. Its headline result is that performance improves as options are added. We explain that result, with theory and experiment. First, the termination rule option-critic learns by maximising return contributes nothing. When the termination test and the policy that picks options read the same values, the test fires at every step, so the learned rule is identical to always terminating. When that policy explores and the test does not, as in option-critic itself, the rule can block the exploration; there are instances where it suffers $\Omega(T)$ regret while always terminating holds to $O(\log T)$. Forcing termination at every step leaves the option-count curve intact. Second, the policy inside an option barely explores at all, so a state locks onto the first action that looked good and never updates again. We name this policy necrosis, give a state-level test for it, and find three fifths of states necrotic in a typical option. Restoring exploration repairs those states, and one option then solves the task. Third, extra options improve no option; what falls is the chance that all of them fail in the same state, from $59\\%$ to $4\\%$, and performance follows that joint quantity.
Read the full abstract
Chemical Physics
Three-Electrode TiO2 + rGO Cells: Classical Controls and Interpretation within a Quantum-Discord Framework
In three-electrode electrochemical impedance spectroscopy (EIS), the impedance/capacitance response of the working electrode (WE) is measured relative to the reference electrode (RE), whereas the current required by potentiostatic control flows between the WE and the counter electrode (CE). Under classical three-electrode operation, the measured WE-RE response should therefore be independent of the properties of the electrode used as the CE, provided that conventional electrochemical and instrumental artifacts are negligible. Here, we test this expectation in cells containing nanostructured electrodes TiO2 + rGO and examine the results within a framework motivated by quantum discord to describe effective interelectrode correlations. We used dummy-cell measurements, a two-electrode bar-bar control, comparisons between Pt and bar CEs, a dummy circuit introduced into the CE branch, and CE ensemble comparisons to distinguish additive circuit behavior from CE-dependent behavior specific to the three-electrode configuration. In these experiments, the measured three-electrode capacitance response depends on CE, an effect that is not reproduced by the dummy-circuit controls examined. These findings identify a macroscopic CE-dependent capacitance response that departs from the tested classical expectation and is compatible with an effective interelectrode-correlation framework motivated by quantum discord, although the capacitance evidence alone does not constitute a direct measurement of quantum discord.
Read the full abstract
General Relativity and Quantum Cosmology
Late-time dark energy dynamics in $f(Q)$ gravity: A data-driven analysis
The increasing precision and complementarity of late-time cosmological observations provide new opportunities to test modified gravity against the observed expansion history of the universe. The combination of DESI DR2 BAO measurements with cosmic chronometers (CC) and independent Type Ia supernova compilations provides a data-driven test of cosmic acceleration. Motivated by this progress, we investigate late-time dark energy dynamics in symmetric teleparallel $f(Q)$ gravity by adopting the power-law form $f(Q)=\beta Q^{m+1}$ and characterizing cosmic evolution through the effective equation of state (EoS) parameter. The model is constrained using CC, DESI DR2 BAO and three independent Type Ia supernova compilations, namely Pantheon+, DES-Dovekie and Union3. The inferred Hubble constant values are mutually consistent, yielding $H_0=68.0^{+2.7}_{-3.3}$, $68.2^{+2.7}_{-3.3}$ and $67.4^{+2.7}_{-3.3}\,\mathrm{km\,s^{-1}\,Mpc^{-1}}$, respectively. Statistically, the proposed $f(Q)$ model yields lower $\chi^2_{\min}$ values and is favored by the AIC for all dataset combinations, whereas the BIC favors $\Lambda$CDM for the CC + DESI DR2 + Pantheon+ and CC + DESI DR2 + DES-Dovekie combinations and indicates no meaningful preference between the two models for the CC + DESI DR2 + Union3 dataset combinations. The reconstructed effective EoS characterizes the evolution of the cosmic fluid, while the deceleration parameter indicates the current accelerated expansion of the universe. Higher-order cosmographic parameters and the Statefinder and $Om(z)$ diagnostics provide complementary insights into the evolution of the cosmic expansion, while the Statefinder trajectories approach the $\Lambda$CDM fixed point in the far future. Overall, the power-law $f(Q)$ model provides a competitive description of the late-time expansion history and the observed cosmic acceleration.
Read the full abstract
Social and Information Networks
A Data-Driven Multimodal Method for Early Detection of Coordinated Abnormal Behaviors in Live-Streaming Platforms
With the rapid growth of live-streaming e-commerce and digital marketing, abnormal marketing behaviors have become increasingly concealed and coordinated across heterogeneous modalities, challenging platform governance and early risk identification. We propose MM-FGDNet, a data-driven multimodal framework for detecting abnormal behavior in large-scale live-streaming environments from complementary temporal-evolution and group-structure perspectives. A cross-modal temporal alignment module maps video, text, audio, and user behavior into a unified temporal semantic space. A temporal fraud-pattern module captures the progression from weak early signals to abrupt outbreaks, while a cooperative manipulation module identifies coordinated interactions among organized user groups and automated accounts. Experiments on real-world multi-platform live-streaming e-commerce datasets show that MM-FGDNet outperforms representative baselines, achieving an AUC of 0.927, F1 of 0.847, precision of 0.861, recall of 0.834, and an Early Detection Score of 0.689, while reducing false alarms. Ablation studies validate the contribution of each module, and cross-domain experiments demonstrate stable generalization to new streamers, product categories, and platforms. These results indicate that MM-FGDNet provides an effective and scalable solution for proactive detection of coordinated abnormal behavior in live-streaming systems.
Read the full abstract
Statistical Methodology
Matrix-Aware Proper Scoring Rules and Significance Testing for Correlation and Covariance Forecasts in Python
Forecasting a correlation or covariance matrix is common in risk management and portfolio construction, but evaluating such a forecast correctly is not routine: naive matrix-comparison metrics are not proper scoring rules, walk-forward evaluation windows are easy to overlap with the estimation window in ways that silently leak information, and significance testing on serially dependent forecast-error sequences needs machinery few analysts implement from scratch. corrscore is a Python package that provides matrix-aware implementations of two established proper scoring rules for this setting – the energy score and the variogram score – dispatched across a closed-form tractability spectrum (point, discrete-mixture, and isotropic-Gaussian-mixture forecasts are scored exactly; a general Monte Carlo ensemble falls back to sampling), a geometry-aware variant of the variogram score built from the affine-invariant distance on the correlation manifold, a zero-overlap-by-construction walk-forward backtest harness, and a bundled significance-testing suite (circular block bootstrap, the Diebold-Mariano test, and the Model Confidence Set). We describe the package's design, its point of departure from the existing scoringRules and properscoring packages, and walk through a complete worked example.