Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 6 September
Let $G$ be a $3$-partite graph with $k$ vertices in each part such that the bipartite graph induced by any two parts contains no cycle of length four. Fischer and Matoušek [J. Combin. Theory Ser. A, 2001] asked for the maximum number of triangles in such a graph. They obtained the lower bound $(1-o(1))k^{3/2}$ and the upper bound $k^{7/4}+O(k^{3/2})$. Coulter, Matthews and Timmons [J. Combin. Theory Ser. B, 2018] later constructed such graphs using planar polynomials over finite fields and improved the lower bound to $(1-o(1))k^{5/3}$. In this note, we use a new triple of planar polynomials and further improve the lower bound to $(1-o(1))k^{17/10}$.
Computation and Language
Discovering Translation-Worthy Languages with E-Values
Choosing when to translate multilingual documents is a central routing problem in text classification: translation can improve predictions for some languages while degrading others or adding unnecessary computation. Uniform translation and heuristic language tiers do not provide statistically controlled route selection. We introduce a language-level router based on paired e-processes that continuously compares direct and translation-assisted classification before freezing a routing policy. A familywise-controlled threshold of 280 bounds the probability of any false route across 14 eligible languages per dataset by 0.05. On SIB-200 and MASSIVE, the router selects translation for 4 of 15 languages and 14 of 15 locales, improving held-out accuracy over direct classification by 8.14 and 16.70 percentage points, respectively. All 28 decisions remain stable across 50 outcome-independent orderings and relative to the per-group threshold. Our results demonstrate that paired e-processes enable statistically controlled, anytime-valid, and auditable multilingual classification routing.
Read the full abstract
Numerical Analysis
Halley's Method for Rectangular Matrix Variables and the Matrix Schwarzian Derivative
Alefeld (1981) recast Halley's cubic convergence as Newton's method on $g=f/\sqrt{f'}$, linked to the Schwarzian derivative. We generalize this to matrix gradient fields $F=\nabla\phi$ ($X\in\R^{m\times n}$) via a matrix Schwarzian derivative interpreted through information geometry ($\alpha$-connections). Simplifying Palmore (1994), we construct this operator square-root-free derivative from the third Fréchet derivative of the Newton map. Our main theorem proves local cubic convergence with an explicit error constant, without self-adjointness, commutativity, or gradient-field assumptions. A matrix-free algorithm (Hessian-vector products only) validates the theory. We contrast this with a power-Newton family (whose naive matrix extension fails) and the matrix Laguerre family (which requires an operator square root). A case study on the Oja-type system $\dot X=AXB-XBX^TAX$ reveals that convergence depends on target eigenvalue gaps, cubic gains grow with ill-conditioning, and 70-digit tests confirm exact theoretical orders alongside a working-precision accuracy budget. Finally, we note coupled formulations excel primarily when sequential deflation is inapplicable.
Read the full abstract
Robotics
Unifying Physics-Based Humanoid Interaction with a Context-Conditioned Interaction Prior
Developing unified physics-based humanoid controllers that can navigate complex 3D scenes and manipulate objects remains a longstanding challenge. Existing approaches are often specialized for either locomotion or object-centric manipulation, or rely on task-specific reward engineering that does not scale well across diverse behaviors. We present CHIP, a unified, physics-grounded framework for learning reusable humanoid interaction skills from heterogeneous motion data. Central to our approach is a conditional interaction prior that models a context-dependent distribution over these skills within a shared discrete space. Our method is trained in three stages. We first learn physics-based motion-imitation policies that acquire grounded teacher behaviors from heterogeneous interaction data. We then distill these behaviors into a context-conditioned interaction prior that captures reusable motion structure across locomotion and manipulation. Finally, we initialize downstream task policies from the pretrained prior and adapt them through prior-regularized online RL post-training. Experiments on a diverse suite of humanoid interaction tasks show that our approach supports scene-aware locomotion, contact-rich object manipulation, and compositional behaviors such as environment-aware object transport and long-horizon skill sequencing, while producing smooth transitions and physically plausible motion.
Read the full abstract
Machine Learning
Layer-Wise Gate-Controlled Prompt Truncation in a Multimodal Chest X-Ray Classifier
Mixture of Prompt Experts (MoPE) adapts multimodal transformers through input-dependent prompt composition, while retaining a fixed prompt length. We investigate a layer-wise gating extension in a binary chest X-ray classification pilot study. The controller predicts a retention ratio for each sample, averages these ratios within a mini-batch, and uses the resulting integer length to truncate the static and mixed visual prompts. Retained mixed prompts are also scaled by the individual ratios. In one recorded run per configuration, the gated model reached a best validation accuracy of 0.8996, compared with 0.8969 for the fixed-length baseline; the corresponding final values were 0.8963 and 0.8802. The exported gate statistics imply a retained length of one at all recorded training points, relative to a configured maximum of six. This reduces the complete visual sequence from 210 to 200 tokens, but no direct runtime measurements establish an acceleration benefit. Report-derived labels, report text as input, sequential data partitioning, and the absence of repeated controlled experiments limit interpretation. The findings document prompt shortening under the configured gate penalty; they do not establish sample-specific length allocation, superiority over fixed short prompts, or clinical utility. Code is available at: https://github.com/jingtaolei/mope-dynamic-prompt-truncation.
Read the full abstract
Group Theory
Hierarchical geometry and right-angled Artin groups in graph braid groups
For the unordered discrete configuration space $\mathrm{UD}_n(\mathsf{\Gamma})$ of $n$ particles on a connected finite graph $\mathsf{\Gamma}$, we construct an explicit factor system on its universal cover. Its factors are encoded by legal pairs, namely subgraphs equipped with particle distributions. The nesting, orthogonality, and product regions in the resulting hierarchically hyperbolic group (HHG) structure admit explicit descriptions in terms of configuration-space geometry, and we show that this structure satisfies the additional properties needed for constructing and obstructing subgroups isomorphic to right-angled Artin groups (RAAGs). Using sufficiently subdivided models, we apply this hierarchy to graph braid groups. We give a finite combinatorial formula for the maximal rank of a free abelian subgroup and show that every RAAG occurs as an undistorted subgroup of some graph braid group. For graph $2$-braid groups, we obtain stronger restrictions: every RAAG subgroup has bipartite defining graph, and the embedding problem is characterized by an induced-subgraph condition in the expanded core graph of the hierarchy. For the RAAG defined by the four-vertex path, this condition is equivalent to a finite graphical criterion on the underlying graph.
Read the full abstract
Data Structures and Algorithms
A 52-Addition, Rank-23 Scheme for Exact 3 x 3 Matrix Multiplication
We present a rank-23 algorithm for general 3 x 3 matrix multiplication using 52 additions or subtractions, together with a Karstadt-Schwartz-style basis change [1, 2]. This gives, to the best of our knowledge, a new best-known candidate for the addition-minimization problem for rank-23 general 3 x 3 matrix multiplication.
Read the full abstract
High Energy Astrophysical Phenomena
Chandra X-ray imaging and IC/CMB model for the inner jet of PKS 0637-752
We present the X-ray surface brightness maps of the jet from the quasar PKS 0637-752, using two epochs of archival Chandra observations (1999 and 2017). We present, for the first time, a model of the faint inner jet extending from 3.4 to 7 arcsec from the core, interpreting its X-ray emission as inverse Compton scattering of cosmic microwave background photons by the synchrotron-emitting relativistic electrons. The inner jet contrasts with the bright outer part of the jet, dominated by several discrete knots for which upper limits to the Fermi gamma-ray flux rule out the inverse Compton mechanism. It is the first detailed inverse Compton model published for this inner jet. We examine three physically motivated scenarios, distinguished by the high-energy cutoff of the electron distribution, that can account for the observed radio, millimeter/submillimeter, and X-ray emission while remaining consistent with optical and gamma-ray upper limits. We also report for the first time X-rays from the radio lobe at the end of the receding jet.
Read the full abstract
Multiagent Systems
Certifying cooperation: a novel approach to cooperative multi-agent task generation
A shared reward gives agents a common objective, but leaves open when, how and even whether they must cooperate to succeed. We address these questions in the Laser Learning Environment, a multi-agent path-finding environment where cooperation materializes as one agent blocking a laser to let a teammate pass safely. We represent these interactions through temporal cooperation graphs whose timed edges connect helpers to beneficiaries, define six cooperation profiles as overlapping graph predicates, and prove that every cooperative trajectory satisfies at least one. By encoding the environment dynamics and profile predicates as propositional formulae, we distinguish tasks that admit}a profile in some winning trajectory from those that require it in every winning trajectory within a specified horizon. Used as filters, these queries turn a random layout sampler into a generator of tasks with certified cooperation requirements. Experiments with five multi-agent reinforcement learning algorithms show that training diversity improves joint success on unseen tasks when cooperation-free solutions exist. When cooperation is required, greater diversity improves individual-agent exits, but joint success remains near zero. Across five profile-certified pools, final exit rates averaged over algorithms separate the pools into four statistically distinguishable levels but this ordering primarily reflects partial completion: policies collect rewards for individual exits but rarely exhibit the profile required for joint success. Our framework exposes this gap between rewarded partial completion and realized cooperation by certifying what cooperation successful completion requires and using temporal cooperation graphs to reveal what policies exhibit.
Read the full abstract
Systems and Control
Assessing Fixed-Batch Reporting for Deadline-constrained Inference in Intermittently Powered IoT
Energy-harvesting Internet of Things (IoT) devices must decide whether to transmit each observation immediately or accumulate several observations before reporting to the edge. Early reports make information from initial observations available sooner at the edge but require more transmission actions, whereas larger batches save reports while delaying that information and retaining more state. We develop a unified analytical framework to compare this fixed-batching choice in scenarios with repeated, deadline-constrained inference cycles. Every configuration processes the same ordered observations and yields the same final posterior if all reports arrive, enabling a controlled comparison of the persistent state, actions, and energy costs induced by batching. Using reductions in Bayesian risk under the continuous ranked probability score (CRPS), we express long-run timely value exactly as a statistical-value-weighted sum of expected decision-weighted report availabilities. This separates the inferential value of observations from their availability at application-relevant decision times. We construct exact Markov-reward models accounting jointly for intermittent harvesting, finite storage, energy carry-over, unreliable delivery, retransmissions, and deadlines. We prove that the long-run regime is well defined and derive exact batch-size comparisons, timing benchmarks, and a decomposition of harvesting-law effects into within-cycle and carry-over contributions. Directly evaluable Gaussian and Gaussian-mixture belief specializations show that the preferred batch size can change with the prior, the decision-time profile, link reliability, harvested-energy statistics, and accumulation cost.
Read the full abstract
Analysis of PDEs
The periodic Wulff problem in two dimensions
We characterize the minimizers of the anisotropic perimeter in the two-dimensional flat torus under an area constraint. We show that, as the prescribed area increases, global minimizers undergo two phase transitions, changing from a droplet (a rescaled Wulff shape) to a flat band wrapping around the torus in a preferred direction determined by the anisotropy (lamellar phase), and finally to a bubble (the complement of a reflected and rescaled Wulff shape). The transition thresholds are given explicitly in terms of the area and the lattice width of the Wulff shape. For certain non-symmetric surface tensions, the lamellar phase is absent altogether. Finally, we characterize the surface tensions for which further minimizers appear: this may happen only in the lamellar regime, and exactly when the Wulff shape has a corner whose normal cone contains, in its interior, a direction realizing the lattice width; in this case there are infinitely many minimizers.
Read the full abstract
Probability
A Functional Central Limit Theorem for Window Counts of Hardy–Szegő Zeros
The Hardy–Szegő zero process, investigated in the disk by Peres and Virág through the independent identically distributed Gaussian analytic function, is a canonical conformally invariant determinantal point process. This paper studies its upper half-plane realization. Although conformally equivalent to the disk model, this realization has its own natural geometry: real-translation invariance turns the process into a stationary object along the boundary and makes long horizontal windows the natural observables. For every admissible height window, we prove a Donsker-type functional central limit theorem for the centered zero counts in expanding horizontal windows, with an explicit intensity and variance depending on the height window. The proof is based on factorial cumulants and Brillinger mixing. The main technical input is a family of all-order integrability estimates for reduced cumulant densities, obtained by exploiting the determinantal cycle structure before integrating over the height variables. As further consequences, we derive an explicit covariance density, an asymptotic variance formula, and a macroscopic Gaussian white-noise limit for linear statistics.
Read the full abstract
Physics and Society
Blind directions of physical learning networks: where to measure and what to measure
A physical learning network is read at a few accessible nodes. Every task and learning rule that uses only the steady voltages and currents there, at a fixed operating point, acts through the boundary response map. Changes in the kernel of its Jacobian are blind to first order. A walk along one fiber ran to a 600-step cap, one edge then at 15.2 times its start. A decomposition theorem splits the response Jacobian over the hidden components. The blind dimension adds over components whose surviving slots are disjoint. A boundary-to-boundary edge adds one parameter and deletes one slot. Exposing a hidden node changes only its component. For one hidden node the contribution counts the bipartite components of the non-adjacency graph of its neighbors. For a pocket of h hidden nodes a factor-analysis bound caps what outside electrodes can expose. It is attained when every pocket node meets every neighbor and no edge joins two of those neighbors, so past a threshold further electrodes outside such a pocket expose nothing. An electrode inside such a pocket, when its hidden nodes form a clique, is worth h-1 directions where one outside is worth none. Read as vector displacements rather than potentials, the same nodes left no deficit beyond counting in all 90 spring networks tested, each a pocket fully joined to five or more accessible nodes, and nothing blind in 88. What limits the reading is the quantity measured as much as the number of contacts. Maximum-weight spanning forests give a proved upper bound on the blind dimension. The matching equality is proved for one hidden node and conjectured beyond. It holds in all 5,343 components whose maximum could be attained and certified, and the forest count matched the certified blind dimension in 1,448 of 1,500 held-out networks, where the maximum must be searched. A self-learning circuit shows the split on hardware.
Read the full abstract
Computer Vision
Reading Decoder Trajectories: Training-Free Counterfactual Query-Trajectory Reliability for Small-Object Detection
Small-object detection remains challenging because limited pixels cause information loss and suppress the scale knowledge encoded in pretrained detectors. Existing approaches mainly improve representations through multiscale training, architecture redesign, or parameter adaptation, implicitly assuming that frozen models lack the required capability. We challenge this assumption and hypothesize that small-object knowledge already exists in frozen detectors but remains underactivated and unstable during query evolution. To test this hypothesis, we propose Counterfactual Query-Trajectory Reliability (CQTR), a training-free framework that elicits latent responses through counterfactual scale interventions and interprets candidate reliability from decoder-internal spatial convergence, semantic persistence, and cross-scale conflicts. A small unlabeled training subset selects the appropriate correction mechanism for each model-data stream, without parameter updates or target-domain annotations. Across 27 combinations of nine frozen detectors and three datasets, CQTR consistently improves average precision (AP) and average precision for small objects (APs). Closed-loop analyses further show that scale intervention activates latent responses, trajectory evidence predicts ground-truth support, and unlabeled routing selects the more effective branch. CQTR therefore reframes small-object detection from external scale augmentation to the activation and reliability assessment of latent scale knowledge.
Read the full abstract
Optimization and Control
Stochastic Nonconvex Bilevel Optimization: Improved Rates Without Rare-Visit Assumption
We investigate stochastic simple bilevel optimization with smooth and possibly nonconvex upper- and lower-level objectives. Existing stochastic extensions of dynamic barrier gradient descent (DBGD) either obtain fast convergence under an unverifiable trajectory-dependent “rare-visit” assumption, or remove this assumption at a substantially higher oracle cost. We show that a simple denominator-only regularization of the DBGD multiplier eliminates the need for such an assumption while preserving fast convergence rates. Specifically, our method achieves $(\varepsilon, \varepsilon)$-stationarity in $O(\varepsilon^{-2})$ iterations using $O(\varepsilon^{-4})$ upper-level and $O(\varepsilon^{-7})$ lower-level stochastic gradients, which improves upon the best assumption-free complexities. We additionally derive anytime parameter schedules.
Read the full abstract
Cryptography and Security
A TTP by TTP Approach: Precise Malware Detection via Malicious TTP Recognition
Machine learning methods, and especially neural networks, are now routinely used for malware detection in network traffic. Though very effective, systems based on such methods often (i) are purely data-driven, ignoring the substantial body of available knowledge about the tactics, techniques, and procedures (TTPs) possibly used, and, consequently (ii) are not precise, since they either cannot correlate malicious activity with TTP usage, or if they do, they are unable to explain which TTP has been maliciously used. In this paper we demonstrate that it is possible to precisely detect malware by (i) providing the neural network model with information about the TTPs used by any given sample, and (ii) teaching the neural network to detect not just the malicious activity as a whole, but which specific TTPs are maliciously used. We show that our approach consistently outperforms the three alternative models, which either do not exploit TTP information, or which are not taught to detect the malicious usage of TTPs, or both. Moreover, we show that our approach (i) is particularly beneficial in detecting malware that utilises rarely-used TTPs, a scenario which is particularly challenging for the other systems; (ii) allows for TTP by TTP tuning, further improving its ability to detect the malicious usage of TTPs; (iii) consistently outperforms other systems across a wide-range of scenarios, including when relying on limited training data or when subjected to adversarial attack.
Read the full abstract
Computer Vision
Learning to Use Imagination: Progress-Conditioned Future Utilization for World Action Models
World Action Models (WAMs) extend Vision-Language-Action (VLA) models by incorporating future visual dynamics into action generation. However, existing WAMs often utilize imagined futures with limited adaptation to evolving execution progress, potentially introducing distracting or unreliable predictive cues. This limitation arises from two empirically identified forms of non-uniformity in future utility: (i) at the inter-progress level, the utility of imagined futures varies across execution stages as control demands change; and (ii) at the intra-progress level, individual future latents exhibit heterogeneous relevance within the same progress state. To address these limitations, we propose ProWAM, a Progress-Conditioned World Action Model that introduces execution progress as an explicit intermediate representation for adaptive imagination utilization. ProWAM comprises two tightly coupled components: (1) To obtain a reliable representation of execution progress, we propose the Self-Supervised Dual-Temporal Progress Encoder (SS-DTPE). SS-DTPE couples short-term action-observation interaction modeling with long-term recurrent progress aggregation to capture recent execution feedback and accumulated task history. (2) Conditioned on the progress representation from SS-DTPE, we propose the Hierarchical Progress-Conditioned Imagination Modulation (HPIM) to adapt imagination utilization to execution progress. HPIM operates at two complementary levels: an inter-progress global modulation mechanism adapts future utilization across execution stages, while an intra-progress relevance mechanism differentiates individual future latents within each progress state. Extensive experiments demonstrate consistent gains over strong VLA and WAM baselines.
Read the full abstract
Logic
Representing a ring as the endomorphism ring of an abelian group
We investigate Baer's realization problem for almost free abelian groups, focusing on the extent to which rings can be represented as endomorphism rings under strong freeness conditions. Building on earlier work that relied on additional set-theoretic principles such as the diamond or strong black boxes, we develop new methods that significantly weaken these assumptions. The main result is obtained in ZFC (assuming a mild cardinal arithmetic configuration): for a strong limit singular cardinal $\mu$ with $\mu^+ < 2^\mu < 2^{\mu^+}$, and for a wide class of cotorsion-free rings, we construct $\mu^+$-free modules whose endomorphism rings are isomorphic to the given ring. This provides a substantial partial solution to a problem of Göbel and Trlifaj. The key innovation is the integration of $\kappa$-frame constructions with Shelah's Super Black Box, enabling a delicate diagonalization that eliminates nontrivial endomorphisms while preserving high degrees of freeness.
Read the full abstract
Number Theory
Optimization of Quadratic Sieve Algorithm Implementation for Large Integer Factorization
The quadratic sieve method is a core tool in number theory. In this paper, we present two optimization methods for the Quadratic Sieve algorithm. In the sieving process, the original polynomial root value accumulation step is changed from the original di to the mdi (m is a small integer), which can change the complexity from O(n) to O(n/m). Another optimization method is that for all parameter lookup steps, the original traversal lookup can be changed to an efficient binary search, which can change the complexity of the loop from O(n) to O(logn). This enhancement reduces the computational complexity of RSA modulus factorization in practical settings.
Read the full abstract
Statistical Methodology
How Wrong Can a Rank-Based Sample-Size Calculation Be? A Sharp Bound of 16/9 for Ordinal Outcomes
Rank-based tests need no distributional assumptions to be valid, but the sample size they require does depend on the shapes of the two outcome distributions, which are unknown at the design stage. Standard practice substitutes a variance calibrated under the null. We ask how wrong that substitution can be. Writing $\Pi$ for the ratio of the true asymptotic variance of the estimated relative effect to the substituted one, we prove that under balanced allocation $\Pi \le 16\theta(1-\theta)/\{2+\theta(1-\theta)\} \le 16/9$ for all ordinal distributions in any number of categories: within the first-order asymptotic calculation the required sample size can exceed the calculated one by at most $77.8\%$, and an explicit two-point family attains the bound at every effect size. The effect-specific envelope, not the constant, is the operative quantity for a design: the ceiling falls to $1.63$ at $\theta=0.65$ and $1.37$ at $\theta=0.75$, so a trial powered for a larger effect is correspondingly less exposed. The proof is elementary. In five extracted trial comparisons and 4,711 generated alternatives the realized cost stays within a few percent, because the extremal configuration is one that shift-type treatment mechanisms do not produce. These facts are complementary, and fix how the bound should be used: it is a design sensitivity certificate, not an inflation factor. A protocol can report the conventional sample size alongside the largest requirement consistent with any ordinal configuration.
Read the full abstract
Functional Analysis
Equivalence between $N$-particle log-Sobolev inequalities and non-linear Łojasiewicz inequalities for a class of mean field systems
The convergence rate of a free energy Wasserstein gradient flow is quantified by its so-called Polyak-Lojasiewicz (PL) constant $\lambda$, which relates the objective function to its dissipation along the flow. Such a flow is the mean-field limit as $N$ goes to infinity of a system of $N$ interacting particles, whose convergence rate in relative entropy towards its Gibbs measure is quantified by its log-Sobolev constant $\lambda_N$. Different behaviours of $\lambda_N$ as $N$ goes to infinity thus describe drastically different phenomena, such as fast relaxation or metastability, with many models undergoing phase transitions between these regimes, depending typically on temperature. Under fairly general conditions, a uniform-in-$N$ log-Sobolev constant (i.e. fast exponential convergence for the particle system) is known to induce a positive PL constant (i.e. exponential convergence for the mean-field flow). A conjecture was stated by Delgadino, Gvalani, Pavliotis and Smith according to which the converse implication was true ($\lambda>0$ implies $\liminf \lambda_N >0$), even with $\lim \lambda_N =\lambda$. First, we will prove this converse implication, although without the equality $\lim \lambda_N = \lambda$, for a general class of mean-field models. Second, we also notice that this implication fails if the free energy minimiser is not unique, and provide an explicit counter-example. Third, we also consider the same question of relating $N$-particle and mean-field inequalities in the context of more general Lojasiewicz inequalities, which correspond to polynomial (instead of exponential) convergence rates, and can describe the situation exactly at a phase transition.
Read the full abstract
Artificial Intelligence
A Translational Note on AI Safety Evaluation
Recent studies report that automated red-teaming finds more vulnerabilities, at lower cost, than human red-teaming on standard AI safety benchmarks, and some read this as evidence that human evaluators are becoming dispensable. The comparison measures one thing and the conclusion claims another. A benchmark measures how thoroughly an attacker searches a predefined set of harms, fixed in advance by the developers, and a harm left out of that set is invisible to any attacker working inside it, automated or not. The same blind spot appeared in academic cryptography and in clinical drug trials, where an evaluation that was internally valid stayed silent about the population it was never pointed at. We call the AI-safety version the threat-model coverage gap, and find that it persists in a current open-weight model, where harms surface in non-English prompts that English benchmarks miss. Closing it requires evaluators whose deployment context differs from the developers'. The case for those evaluators is methodological, grounded in coverage, and the existing evaluation frame is unlikely to produce them on its own.
Read the full abstract
Quantum Physics
Quantum bivariate bicycle codes with weight-8 checks surpassing the BB benchmark
Bivariate bicycle (BB) codes of Bravyi et al.~\cite{Bravyi2024} are quantum low-density parity-check codes with weight-$6$ checks, exemplified by $[[144,12,12]]$ with $kd^2/n=12$. We develop the algebraic structure theory of BB-type codes with weight-$8$ checks (weight-$4$ generator polynomials) and use it, together with an exactly validated search pipeline, to construct and certify new codes. We prove an exact dimension formula $k=2\dim R/(A,B)$ (forcing even $k$), a $4\ell m$-element symmetry group on generator pairs, an $X/Z$ distance equality $d_X=d_Z$, and a family of subgroup-coset kernel vectors giving rigorous distance upper bounds and a design rule for high-distance constructions; all distances are computed exhaustively by a cross-validated bit-mask verifier. At $n=144$ the pipeline returns a census of $53$ codes whose strongest members surpass the BB benchmark: $[[144,6,d\ge 15]]$ exceeds the benchmark distance $12$ (certified $d\ge 15$), $[[144,10,12]]$ reaches it with weight-$8$ checks, and $[[144,16,10]]$ encodes a third more logical qubits at $kd^2/n=11.11$ ($7.4\%$ below benchmark) while decoding no worse. At $n=72$, $[[72,14,8]]$ attains $kd^2/n=12.44$—more than twice the same-length BB code—and decodes better; a circuit-level memory experiment places our weight-$8$ codes at $\approx 0.1\%$ pseudo-threshold versus $\approx 0.4\%$ for the BB reference under an identical model, quantifying the threshold cost of the heavier checks. All structural statements are verified numerically on the whole census.
Read the full abstract
High Energy Physics (Phenomenology)
The Inert Doublet Model of Dark Matter and the LUX-ZEPLIN High-Recoil Event
The recent LUX-ZEPLIN (LZ) search reported a nuclear-recoil event near $248~{\rm keV}$. Such a high-recoil event can be interpreted in terms of endothermic inelastic dark matter scattering, which typically requires a mass splitting of order a few hundred keV between the initial and final dark states. The inert doublet model (IDM) provides a natural realization of this scenario through the $Z$-mediated transition $H+N\to A+N$. In this work, we systematically examine whether this interpretation can be consistently realized in the IDM under the relevant theoretical constraints and existing experimental bounds. We perform a detailed profile-likelihood analysis of the LZ event, and find a viable high-mass IDM region with a profile best fit at $m_H=1080~{\rm GeV}$ and $m_A-m_H=369~{\rm keV}$.
Read the full abstract
Information Theory
The list size of random linear and LDPC codes at capacity
We show that for every prime power $q$ and $\rho\in(0,1-\frac1q)$ there exists $\varepsilon_0(q, \rho) > 0$ such that for all positive $\varepsilon < \varepsilon_0(q, \rho)$, a random linear code over $\mathbb{F}_q$ of rate $1-h_q(\rho)-\varepsilon$ has list size $\lfloor h_q(\rho)/\varepsilon\rfloor$ or $\lfloor h_q(\rho)/\varepsilon\rfloor+1$ with probability $1-o(1)$. Before this work, the list size was known only up to a constant factor for $q\ge3$, and for $q=2$ it was known to be either $\lfloor h_2(\rho)/\varepsilon\rfloor-1$, $\lfloor h_2(\rho)/\varepsilon\rfloor$ or $\lfloor h_2(\rho)/\varepsilon\rfloor+1$. We also show that the same two-point concentration holds for the list size of random LDPC codes. This follows from a general theorem establishing that random LDPC codes and random linear codes have the same threshold rate for distance, list decoding, list recovery from errors and any other convex property, which answers a question of Mosheiff, Resch, Ron-Zewi, Silas and Wootters.
Read the full abstract
Combinatorics
On the Roots of Connected Domination Polynomials
We determine the closure of the connected domination roots. The main tool is a substitution formula for the lexicographic product with a complete graph, $D_c(G[K_n],x)=D_c(G,(x+1)^n-1)$, proved in Theorem~\ref{thm:cd}. Combined with two explicit families of seed roots—the real roots of the cycles $C_n$ and the real roots of the joins $C_m\vee C_n$ lying in $(-1,0)$—this formula gives the two main results: the closure of the real connected domination roots is $(-\infty,0]$, and the closure of all connected domination roots is the whole complex plane. These are the connected domination analogues of the root-density theorems of Brown and Tufts and of Brown and Beaton for the ordinary domination polynomial.
Read the full abstract
Complex Variables
Prescribed Limits and Cluster Sets of Complex Monge-Ampere Measures
Motivated by Bedford's question, we study the possible cluster sets, in the vague topology, of Monge–Ampère measures associated with bounded plurisubharmonic sequences $u_j\to\varphi$ locally in $L^1$, without assuming a common bound. On a bounded domain $\Omega\subset\mathbb C^n$ ($n\geq2$), and for a bounded maximal plurisubharmonic $\varphi$, the possible sets of all vague subsequential measure limits are precisely the vaguely closed sets of nonnegative Radon measures, including the empty set. This conclusion holds for every bounded plurisubharmonic $\varphi$ when $\Omega$ is hyperconvex, pseudoconvex and Runge, or a domain obtained by removing a relatively closed pluripolar set from a bounded hyperconvex domain. Under these hypotheses, every nonnegative Radon measure $\nu$ can also be realized by such a sequence with $(dd^cu_j)^n\to\nu$ vaguely. The main analytic result holds on every bounded domain: for any bounded plurisubharmonic $\varphi$ and nonnegative Radon measure $\mu$, we construct $u_j\leq\varphi$ converging to $\varphi$ in $L^p(\Omega)$ for every $1\leq p<\infty$, with $(dd^cu_j)^n\to(dd^c\varphi)^n+\mu$ vaguely. The approximants can be chosen smooth when $\varphi$ is continuous. On arbitrary pseudoconvex domains, prescribed measure limits can also be realized using locally bounded approximants. Under an additional localization condition, the approximants can be chosen globally bounded when the limit function is bounded.
Read the full abstract
Atomic Physics
Floquet-sideband-enhanced shortwave electrometry with Rydberg atoms
Rydberg atomic electric-field sensors, under the framework of optical excitation and readout, can overcome the size-to-wavelength constraint imposed by the Chu limit. However, their sensitivity for decametric-wavelength shortwave electric fields is substantially lower than that for microwave ones, stemming from the off-resonant nature of low-frequency signals with Rydberg transitions. Here, we demonstrate a high-sensitivity heterodyne shortwave sensor based on microwave-dressed Rydberg atoms, leveraging precisely modulated Floquet sidebands. Around local- and microwave-field-engineered Floquet sidebands, the steep response gradient, arising from the enhanced atom-shortwave interaction through additionally created coherent channels, induces pronounced amplification of the heterodyne intermediate-frequency signal. As a result, compared to the same atomic heterodyne setup without microwave modulation, such Floquet-sideband-enhanced shortwave measurement boosts the sensitivity by four orders of magnitude, yielding a sensitivity of -122.7 dBm/Hz for shortwave at 30 MHz. This work offers a potential route to high-sensitive portable shortwave receivers in radio astronomy, radar and long-distance communications.
Read the full abstract
Solar and Stellar Astrophysics
Stage-dependent superhump waveform evolution and non-stationary positive-superhump timing in the near-period-gap dwarf nova YZ Cancri
We present a photometric and timing study of the near-period-gap SU~UMa-type dwarf nova YZ~Cancri, based on nearly continuous Transiting Exoplanet Survey Satellite (TESS) photometry and long-baseline ground-based observations. Our main observational result is that the positive-superhump (SH) waveform follows a repeatable, stage-dependent sequence during superoutbursts (SOs). In the two well-covered TESS SOs, and consistently in the long-baseline ground-based SO sample, the plateau waveform evolves from an early saw-tooth profile (ST), through a double-humped profile with unequal maxima (DHd), to a more symmetric double-humped profile with nearly similar maxima (DHs). The global and time-resolved Lomb–Scargle periodograms show that power near the positive-SH time scale and its harmonics is concentrated during SOs, whereas quiescent and normal-outburst intervals lack a comparably persistent SH-band signal. The dense TESS maxima–minima timing sequence shows different clock stability in different waveform stages: precursor modulations have slightly longer local periods, the middle-to-late DHs plateau is the most regular timing interval, and the post-plateau evolution is affected by phase switching and possible secondary/late-SH contamination. The TESS data also reveal profile-clock coupling, with SH amplitude and rise/decay durations evolving together with the timing residuals. As a secondary timing constraint, we obtain a common TESS-timing-based mean positive-SH period of $P'_{\rm sh}=0.09043(27)$~d, corresponding to a SH excess of $4.03(31)\%$ and an approximate mass ratio of $q=0.175(11)$. The repeatable ST–DHd–DHs sequence makes YZ~Cnc a useful system near the lower edge of the period gap, and may trace the growth, redistribution, stabilization, and decay of the light source associated with an eccentric, precessing accretion disk during SOs.
Read the full abstract
Chaotic Dynamics
The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincaré Sections
A Poincaré section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the Rössler system, a 32-mode Kuramoto–Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$–$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$–$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.