Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 22 April

Optimization and Control · Cross-listed from eess.SY

A Systematic Review and Taxonomy of Reinforcement Learning-Model Predictive Control Integration for Linear Systems

The integration of Model Predictive Control (MPC) and Reinforcement Learning (RL) has emerged as a promising paradigm for constrained decision-making and adaptive control. MPC offers structured optimization, explicit constraint handling, and established stability tools, whereas RL provides data-driven adaptation and performance improvement in the presence of uncertainty and model mismatch. Despite the rapid growth of research on RL–MPC integration, the literature remains fragmented, particularly for control architectures built on linear or linearized predictive models. This paper presents a comprehensive Systematic Literature Review (SLR) of RL–MPC integrations for linear and linearized systems, covering peer-reviewed and formally indexed studies published until 2025. The reviewed studies are organized through a multi-dimensional taxonomy covering RL functional roles, RL algorithm classes, MPC formulations, cost-function structures, and application domains. In addition, a cross-dimensional synthesis is conducted to identify recurring design patterns and reported associations among these dimensions within the reviewed corpus. The review highlights methodological trends, commonly adopted integration strategies, and recurring practical challenges, including computational burden, sample efficiency, robustness, and closed-loop guarantees. The resulting synthesis provides a structured reference for researchers and practitioners seeking to design or analyze RL–MPC architectures based on linear or linearized predictive control formulations.
Read the full abstract

All authors Mohsen Jalaeian Farimani, Roya Khalili Amirabadi, Davoud Nikkhouy, Malihe Abdolbaghi, Mahshad Rastegarmoghaddam, Shima Samadzadeh, Mahdi Ghane

Optimization and Control

Integrated packing, placement, scheduling, and routing of personalized production: a pharmaceutical Industry 4.0 use-case with a planar transport system

The recent emergence of planar transport systems necessitates re-evaluation of Flexible Manufacturing Systems (FMS) to address the simultaneous scheduling of internal logistics and production operations. By operating on a tile-based planar grid, these systems allow independent movers full two-dimensional freedom, mitigating inefficiencies inherent to traditional sequential lines. This paper applies a planar FMS framework to a real-world use case in the pharmaceutical industry: the automated production of personalized drugs. Implementing this system requires solving optimization problems at both tactical and operational levels. The tactical level involves decisions regarding production line layout and the positioning of drug dispensers. A Mixed-Integer Quadratic Programming model is utilized for the packing problem to exploit drug co-occurrence patterns found in historical patient data. Subsequently, we solve the placement problem - a bi-level problem combining an assignment problem with Shortest Hamiltonian paths with neighborhoods - to arrange dispensers in a layout minimizing expected travel distances. The operational level is encountered daily, scheduling individual movers to process new orders as quickly as possible. This scheduling problem is formulated using Constraint Programming, modeling movers as reservoir resources to ensure order completeness, complemented by a routing phase using an iterative conflict-resolution mechanism and DAG-based reasoning to convert schedules into conflict-free paths. Evaluation using real-world prescription data for 40 drugs shows the framework scales efficiently across several layout topologies for up to 500 orders, with schedules that are highly effective and computationally tractable for daily operations.
Read the full abstract

All authors Viktor Emil Korladinov, Antonin Novak, Zdeněk Hanzálek, Erik Sonntag, František Štěpánek

Dynamical Systems

Modeling and Control for Distributed Measurements of the Earth's Energy Imbalance

This paper presents a modeling and control framework for distributed systems in low Earth orbit, with the scientific objective of obtaining high accuracy estimates of the Earth's Energy Imbalance (EEI). This metric robustly quantifies the difference between the absorbed solar radiation, and the infrared radiation emitted into space. Formally, the EEI represents the globally and annually integrated net radiative flux at the top of the atmosphere. The EEI is directly correlated with physical variations in the Earth system. Obtaining accurate measurements hereof poses a major technological challenge, attributed to calibration errors of current spaceborn radiometers. This work presents a modeling and control framework for in-orbit EEI monitoring and mapping with high precision, using a distributed array of spherical spacecraft. Perturbations and their effects on orbit and attitude are modeled, accounting for spacecraft shape and thermo-optical properties, and are subsequently used to derive optimal control for maintaining an appropriate spin rate. This enables each spacecraft to align closely with the orbital normal with coordinated attitudes across the formation, leading to improved spatiotemporal resolution in EEI estimation.
Read the full abstract

All authors Rayan Mazouz, Marco Quadrelli, Rashied Amini, Maria Hakuba, Charles Reynerson, David Wiese

Optimization and Control · Cross-listed from cs.LG

SGD at the Edge of Stability: The Stochastic Sharpness Gap

When training neural networks with full-batch gradient descent (GD) and step size $\eta$, the largest eigenvalue of the Hessian – the sharpness $S(\boldsymbol{\theta})$ – rises to $2/\eta$ and hovers there, a phenomenon termed the Edge of Stability (EoS). \citet{damian2023selfstab} showed that this behavior is explained by a self-stabilization mechanism driven by third-order structure of the loss, and that GD implicitly follows projected gradient descent (PGD) on the constraint $ S(\boldsymbol{\theta})\leq 2/\eta$. For mini-batch stochastic gradient descent (SGD), the sharpness stabilizes below $2/\eta$, with the gap widening as the batch size decreases; yet no theoretical explanation exists for this suppression. We introduce stochastic self-stabilization, extending the self-stabilization framework to SGD. Our key insight is that gradient noise injects variance into the oscillatory dynamics along the top Hessian eigenvector, strengthening the cubic sharpness-reducing force and shifting the equilibrium below $2/\eta$. Following the approach of \citet{damian2023selfstab}, we define stochastic predicted dynamics relative to a moving projected gradient descent trajectory and prove a stochastic coupling theorem that bounds the deviation of SGD from these predictions. We derive a closed-form equilibrium sharpness gap: $\Delta S = \eta \beta \sigma_{\boldsymbol{u}}^{2}/(4\alpha)$, where $\alpha$ is the progressive sharpening rate, $\beta$ is the self-stabilization strength, and $\sigma_{ \boldsymbol{u}}^{2}$ is the gradient noise variance projected onto the top eigenvector. This formula predicts that smaller batch sizes yield flatter solutions and recovers GD when the batch equals the full dataset.
Read the full abstract

Differential Geometry

Diameter estimates and Hitchin-Thorpe inequality for four-dimensional compact Quasi-Einstein manifolds

We study compact $m$-quasi-Einstein manifolds and derive geometric estimates relating the oscillation of the potential function to the diameter of the manifold. We obtain lower bounds for the diameter in terms of the oscillation of the potential function. As an application in dimension four, we derive diameter conditions ensuring that compact $m$-quasi-Einstein manifolds satisfy the Hitchin–Thorpe inequality. Our results extend diameter estimates in smooth metric measure spaces and are consistent with known bounds in the limiting case corresponding to Ricci solitons. Finally, we provide a volume estimate involving the oscillation.
Read the full abstract

Representation Theory

Strong factorization theorem for smooth vectors of exponential solvable Lie group representations

We establish new strong factorization properties for the smooth vectors of representations of exponential solvable Lie groups on Fréchet spaces. In particular, our results improve upon the Dixmier-Malliavin factorization theorem for simply connected nilpotent Lie groups.
Read the full abstract

All authors Santiago Chaves, Andreas Debrouwere, Alberto Hernández Alvarado, Jasson Vindas, Rafael Zamora

Optimization and Control

Optimization Workshop Notes for Mathematical Programming with Equilibrium Constraints (MPECs): Second-Order Optimality Conditions

In this workshop, we present a compact but rigorous introduction to second-order optimality conditions for mathematical programs with equilibrium constraints (MPECs). We start from the classical nonlinear programming template, then explain why it fails in the equilibrium-constrained setting, and develop the three main viewpoints used in the literature: (i) multiplier-based conditions, (ii) implicit-programming conditions based on the solution map of the lower-level equilibrium system, and (iii) piecewise-programming conditions obtained by decomposing complementarity structure into smooth pieces. The emphasis is on conceptual structure, critical cones, strong regularity, and the exact role of curvature terms.
Read the full abstract

Numerical Analysis

Accuracy and stability of Artificial Neural Networks for HP-Splines frequency parameter selection

This paper explores the use of artificial neural networks for the stable and data-driven selection of the frequency parameter in hyperbolic polynomial penalized splines (HP-splines). This parameter defines the underlying spline space and is essential for adapting the model to exponential patterns in the data, such as those encountered in signal processing. The theoretical approximation properties of deep neural network architectures are investigated to establish a connection between classical spline-based regression and modern data-driven learning methods. Based on this analysis, a neural network is designed to predict optimal HP-spline parameters by balancing approximation accuracy, stability analysis, and complexity control, thereby producing neural architectures that are both expressive and stable. Numerical experiments confirm that the proposed approach achieves both high accuracy and stable performance, validating the theoretical findings.
Read the full abstract

All authors Vittoria Bruni, Paola Erminia Calabrese, Rosanna Campagna, Domenico Vitulano

Optimization and Control

Optimization Workshop Notes for Mathematical Programming with Equilibrium Constraints (MPECs): Verification of MPEC Hypotheses

In this workshop, we present a compact but rigorous introduction to the basic language of nonlinear programming, variational inequalities, and complementarity systems. The goal is twofold. First, we explain the mathematical logic of hypotheses under which first-order optimality conditions for MPECs become valid. Second, we explain how to use that theory in research practice: how to classify a model, choose the appropriate verification route, prove the right hypotheses, and derive a correct first-order analysis.
Read the full abstract

Dynamical Systems

Graphon Limits of Graph Reaction–Diffusion Equations

A graph reaction–diffusion (RD) equation is a system of differential equations that is defined on the nodes of a graph. Consider a sequence of growing graphs that converges in cut norm to a limiting graphon. We show that the solutions of the sequence of graph RD equations converge in $L^p$ norm, for $p \in [1,\infty]$, to the solution of a limiting nonlocal RD equation, which we call a graphon RD equation. Furthermore, we show a large numbers result for a stochastic particle process that consists of a random walk and a birth-death process on graphs. For a sequence of graphs that converge in cut norm to a limiting graphon, the sequence of stochastic processes converges in probability to the solution of the graphon RD equation.
Read the full abstract

Dynamical Systems

The Riccati Characteristic Equation

The Riccati differential equation is examined in light of its connection to second order linear time varying systems. In that light it becomes the clear generalization for the characteristic equation of linear time invariant systems, and is called the Riccati Characteristic Equation (RCE). Consequently, the RCE becomes the unifying centerpiece for the study of linear systems. Its solutions are considered in complementary pairs that form a continuum based on a primitive pair. Pairs may always be found as purely real solutions, despite the fact that complex conjugate primitive solutions are shown to exist in many cases. Not only is the pairing unique, but the general form of solutions, shown here for the first time, is uniquely compact and encompasses all known solutions, while allowing for all initial conditions. Classical engineering mathematics examples are shown to conform to this approach, which provides new insights to all, especially Floquet theory.
Read the full abstract

Algebraic Geometry

$E_6$-local systems from cubic threefolds

We produce infinitely many local systems on (level covers of) the moduli space of smooth cubic threefolds, with algebraic monodromy group equal to the exceptional group $E_6$. These local systems arise in the middle cohomology of abelian étale covers of the Fano scheme parametrizing lines in the universal cubic threefold.
Read the full abstract

Analysis of PDEs

Quasi-resonant normal form and quadratic lifespan for 3D gravity-capillary water waves

We study the long-time dynamics of small-amplitude solutions to the three-dimensional gravity-capillary water waves equations for an inviscid and irrotational fluid with periodic boundary conditions. We prove that, for almost all values of the surface tension parameter, solutions with initial size $\varepsilon$ exist and remain small over time intervals of order $\varepsilon^{-2}$. A major difficulty arises from the loss of derivatives caused by the quasilinear nature of the equations combined with severe quadratic and cubic small-divisor interactions in high space dimensions. Classical normal form methods applied to 3D water waves system typically fail to prevent derivative loss due to the accumulation of near-resonances. To overcome this obstruction, we develop a new analytical strategy that combines a sharp frequency partition with a quasi-resonant normal form transformation acting only on selected interaction scales. Our microlocal analysis reveals that the potentially dangerous interactions terms exhibit a block-diagonal structure, which stems from both the geometric properties of the quasi-resonant frequency sets and the Hamiltonian structure of the water waves system. As a consequence, these operators preserve Sobolev norms and do not produce energy growth. This structural insight, together with the quasi-resonant normal-form transformation, allows us to prevent derivative-loss mechanisms while avoiding the accumulation of harmful small denominators.
Read the full abstract

Combinatorics

A construction of the hat tilings by a Markov partition

We present a simple construction of hat tilings. The construction can be carried out by superimposing a triangular grid on a specially colored image and reading off the orientation of the tiles. We show that our construction produces valid hat tilings, and conversely, in an appropriate sense that is made precise in the paper, that every valid hat tiling can be obtained in this way.
Read the full abstract

Combinatorics

Sharp bounds for covering with large cliques and independent sets

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k, k) \geq 4k-O(k^\frac{2}{3})}$, and conjectured that $n(k,k)=4k-4$. We prove this conjecture, and also establish the optimal lower bound in the more general case where $k_1$ and $k_2$ are arbitrary. We further consider the generalisation of the problem to $r$-edge-coloured complete graphs in which every vertex is contained in a size-$k$ monochromatic clique of each colour, and obtain upper and lower bounds on the size of such graphs.
Read the full abstract

Algebraic Geometry · Cross-listed from hep-th

Twisted traces and quantization of moduli stacks of 3d $\mathcal{N}=4$ Chern-Simons-matter theories

We conjecture, and show in a plethora of examples, that the sphere partition function of 3d $\mathcal{N}=4$ Chern-Simons-matter theories equals a sum of twisted traces on tensor products of Verma modules over the quantization of the moduli spaces of vacua. This extends a conjecture of Gaiotto-Okazaki to Chern-Simons-matter theories. We also show that the partition function of every Abelian gauge theory with higher charges has such twisted trace decomposition, and uncover new Abelian dualities between theories with and without Chern-Simons couplings.
Read the full abstract

Rings and Algebras

Left modularity and extremality for (some) infinite lattices

For some important families of complete infinite lattices, we study some generalizations of two fundamental notions which are mostly treated for finite lattices. Specifically, for well-separated $\kappa$-lattices, and also for weakly atomic completely semidistributive lattices, we generalize the notions of left modularity and extremality. These two families of lattices coincide if restricted to finite lattices, but are distinct when infinite lattices are also included. For both families, we prove that extremality and left modularity imply each other. Furthermore, for weakly atomic completely semidistributive lattices, we give several conceptual characterizations of left modular elements, and show that the set of left modular elements form a complete distributive sublattice. Our results, combined with some recent work on finite lattices, imply that the weakly atomic completely semidistributive lattices that are left modular (or extremal) generalize the semidistributive trim lattices; from finite to infinite lattices. We then apply our results to the lattice of torsion classes of finite dimensional algebras, which are known to fall in the intersection of the two families treated in our work. For an algebra $A$, we obtain that the lattice of torsion classes is left modular (equivalently, extremal) if and only if $A$ is brick-directed. This leads to an abundance of concrete examples and non-examples.
Read the full abstract

All authors Sota Asai, Osamu Iyama, Kaveh Mousavand, Charles Paquette

General Mathematics

Introduction to generalised Cesaro convergence III

This is the third and last of three papers introducing generalised Cesaro convergence and is split into two parts. In part 1 we introduce the notion of a "Cesaro-adapted scale" and use it to prove the key generalised Cesaro summation/convergence theorems developed in the first paper in this series. We also use it to trivially extend these results to the case of remainder Cesaro summation/convergence relative to arbitrary $z_{0}\in\mathbb{C}$ (not just $z_{0}=0$). In the course of the working we introduce the concepts of "formal symbols" and "formal function elements", which allow us to express many results in extremely compact form and simplify our arguments considerably. Part 2 is self-contained and devoted to further exploring this "formal" world. We express a number of additional results in surprisingly compact form using formal symbols and function elements, and use them to give simple proofs of several non-trivial results. We also investigate their fascinating properties. These include the need to avoid evaluating too early; the consequent need to retain stand-alone zeros (both "to the left" and "to the right") lest they be brought back to life before evaluation; and the need to use continuous limits to resolve singular ratios in final evaluation when required. Finally, we consider in detail the formal extension we have introduced of our Cesaro-adapted scale to a 1-parameter continuum of period-1 functions $\overset{\lor}{q}_{\rho}(\alpha)$, $\rho\in\mathbb{C}$. We analyse their distributional aspects when $\rho\in\mathbb{Z}_{<0}$ and derive their Fourier-series coefficients in general. We conclude with a miscellany of further observations, including a formal re-casting of the general Euler-McLaurin sum formula in very compact form, and a number of additional analytical and combinatorial characteristics of the $\overset{\lor}{q}_{\rho}(\alpha)$ and associated operators.
Read the full abstract

Commutative Algebra

Smith Form Equivalence for Several Classes of Multivariate Polynomial Matrices

This paper investigates the equivalence reduction for several classes of multivariate polynomial matrices and their Smith forms, establishing some criteria for such reduction. In particular, we employ algebra isomorphisms as a key tool to study this equivalence problem. We then leverage the Quillen-Suslin and Lin-Bose theorems to extend these results to non-square and rank-deficient matrices. Moreover, the verification of our criteria is achievable algorithmically via existing Gröbner basis methods.
Read the full abstract

Information Theory

DiP-SD: Distributed Pipelined Speculative Decoding for Efficient LLM Inference at the Edge

Speculative decoding has emerged as a promising technique for large language model (LLM) inference by accelerating autoregressive decoding via draft-then-verify. This paper studies a new edge scenario with multi-user inference, where draft tokens are generated locally on devices and subsequently offloaded to a centralized edge server for batch verification. The key challenge is to sustain high throughput under coupled decisions of (i) batching and pipeline scheduling and (ii) per user draft token length. We propose DiP-SD, which exploits two complementary parallelism dimensions: device-level distributed drafting and phase-level draft-verify pipelining. We formulate a throughput-maximization objective, defined as the expected number of accepted tokens per unit time, and jointly optimize the number of batches, user-to-batch assignment, and integer draft lengths. To solve the resulting fractional mixed-integer program, DiP-SD scans the batch number and iteratively alternates between an association subproblem and a draft-length subproblem. Numerical results under a Qwen3-1.7B/Qwen3-32B device-edge deployment show that DiP-SD achieves up to 17.89x throughput over autoregressive decoding (AD) and 1.93x over AD with greedy batching.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Absorber LLM: Harnessing Causal Synchronization for Test-Time Training

Transformers suffer from a high computational cost that grows with sequence length for self-attention, making inference in long streams prohibited by memory consumption. Constant-memory alternatives such as RNNs and SSMs compress history into states with fixed size and thus lose long-tail dependencies, while methods that memorize contexts into parameters, such as Test-Time Training (TTT), are prone to overfitting token-level projection and fail to preserve the causal effect of context in pretrained LLMs. We propose Absorber LLM, which formulates long-context retention as a self-supervised causal synchronization: after absorbing historical contexts into parameters, a contextless model should match the original model with full context on future generations. We optimize this objective by synchronizing internal behaviors of the updated model with the original one, ensuring context absorption and generalization. Experiments on long-context and streaming benchmarks show that Absorber LLM reduces inference memory and improves accuracy over prior parameter-as-memory baselines.
Read the full abstract

All authors Zhixin Zhang, Shabo Zhang, Chengcan Wu, Zeming Wei, Meng Sun

Differential Geometry

Homogeneous $\mathbb Z/2$-Harmonic Forms and Spinors on $\mathbb{R}^4$ from Regular 4-Polytopes

We describe novel local singularity models for $\mathbb Z/2$ harmonic 1-forms, self-dual 2-forms and spinors in dimension 4. These models are homogeneous versions on $\mathbb{R}^4$ whose singular sets are cones on the 1-skeletal of certain regular 4-dimensional polytopes.

Mathematical Physics · Cross-listed from hep-th

Beyond Hagedorn: A Harmonic Approach to $T\bar{T}$-deformation

We apply harmonic analysis to study the $T\bar{T}$-deformed torus partition function. We first express the CFT partition functions in terms of Maass waveforms, including the Eisenstein series and cusp forms. These basis functions turn out to deform in a very simple way under the $T\bar{T}$-deformation. The spectral decomposition provides a numerically stable and efficient method to compute the partition function at finite values of the deformation parameter $\lambda$, allowing us to clearly resolve the analytic structure of the partition function as a function of $\lambda$. The resulting deformed partition function exhibits a Hagedorn singularity. Building on harmonic analysis approach, we propose a natural analytic continuation beyond the Hagedorn singularity, which enables us to compute the full partition function for any value of $\lambda$.
Read the full abstract

Optimization and Control

Solving Minimax Problems with Bilinear Objectives with ADMM

We consider minimax (saddle-point) problems of the form max_{c \in C} min_{\beta \in S} g(c; \beta), where C and S are compact convex sets, and g is concave-convex. Applying the Alternating Direction Method of Multipliers (ADMM) requires evaluating a proximal operator that is, in general, as hard as the original problem. We show that when the outcome function g is bilinear, i.e. g(c; \beta) = c^T A \beta, the proximal operator reduces to a generalized projection onto the confidence region S. This reduction is exact – it involves no approximation or linearization. The resulting ADMM algorithm alternates between (i) a generalized projection onto S and (ii) a Euclidean projection onto C. We describe the derivation, state the algorithm, and discuss convergence.
Read the full abstract

Probability

Failure of ambient closed-set large-deviation upper bounds in entropic optimal transport

Large-deviation upper bounds on compact sets do not, in general, extend to arbitrary closed sets without additional tightness. We show that this obstruction already occurs in static entropic optimal transport. More precisely, we construct a fixed-cost model with continuous cost and nonatomic marginals for which the entropic minimisers converge in total variation to an optimal plan with noncompact support, the known compact-set upper bound remains valid, but the corresponding closed-set upper bound fails on a specific closed subset of the ambient space. For a fixed closed set, we identify the exact tail criterion for passing from compact to closed sets. We show that there does not exist a full large-deviation principle (LDP) on the ambient space at speed $1/\varepsilon$ with an arbitrary lower semicontinuous rate function.
Read the full abstract

Commutative Algebra

On $S$-Prime Element Principle

In this paper, we introduce $S$-prime elements in $V$-lattices, where $S$ is a multiplicatively closed subset of a $V$-lattice $L$. In addition, we introduce the $S$-Prime Element Principle to prove that certain elements in $V$-lattices are $S$-prime elements. This principle leads to a direct and uniform approach to the results on the existence of prime elements in multiplicative lattices when $S=\{1\}$.
Read the full abstract

Spectral Theory

Topologically protected interface modes in multi-band damped lattice models

Tridiagonal $k$-Toeplitz operators provide a natural framework for modelling one-dimensional $k$-periodic lattice systems. A fundamental connection is obtained between Coburn's lemma for tridiagonal $k$-Toeplitz operators and the existence of edge modes. We reveal that topological edge modes are characterised by the eigenvalues of the leading principal submatrix of the symbol function. A complete analysis of tridiagonal interface operators satisfying global inversion symmetry is then presented. These results are applied to finite one-dimensional $k$-periodic chains of damped resonators that satisfy both local and global inversion symmetry. Additionally, disordered tight-binding interface operators are shown to support a topologically robust zero-energy interface state. Numerical simulations are conducted to illustrate the theoretical findings.
Read the full abstract

Combinatorics

A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes

We study the Zarankiewicz problem for $r$-partite, $r$-uniform intersection hypergraphs arising from $r$ families of axis-parallel boxes in $\mathbb{R}^d$ with prescribed directions $F_1, \dots, F_r \subseteq \{1, \dots, d\}$. This extends the problems studied by Chan and Har-Peled on points and $d$-dimensional boxes in $\mathbb{R}^d$, corresponding to $(F_1,F_2)=(\varnothing,[d])$, as well as by Chan, Keller, and Smorodinsky on $r$ families of $d$-dimensional boxes, corresponding to $(F_1,\dots,F_r)=([d],\dots,[d])$. Our main result establishes a sharp dichotomy for the Zarankiewicz number in this setting: it is either $\Theta_r(tn^{r-1})$ or at least $\Omega \bigl( tn^{r-1} \cdot \frac{\log n}{\log\log n} \bigr)$, depending only on a simple set-theoretic condition on $(F_1,\dots,F_r)$, which we call $2$-coherence. Informally, $2$-coherence captures whether the configuration contains an underlying two-dimensional incidence structure, which is precisely what gives rise to the extra polylogarithmic factor. Our proof proceeds via a sequence of reductions and a geometric slicing argument that reduces the problem to planar incidence bounds.
Read the full abstract

All authors Ting-Wei Chao, Zichao Dong, Hong Liu, Xichao Shu, Shuaichao Wang

Numerical Analysis

Rigorous High-Order Hausdorff Dimension Estimation of Limit Sets of Continued Fraction Iterated Function Systems via B-Splines

We develop a method for the rigorous estimation of Hausdorff dimensions of limit sets produced by continued fraction iterated function systems. Our method is based on the approximation of a Perron-Frobenius operator using the finite element method with B-splines as the choice of basis functions. This choice provides key numerical advantages including higher-order convergence and computational flexibility. We prove an analogue of Falk and Nussbaum's result on “hidden positivity" for B-spline quasi-interpolants to give rigorous upper and lower bounds for the Hausdorff dimensions of various limit sets. We provide numerical results for degree 4 B-spline interpolants in one and two dimensions.
Read the full abstract

Information Theory

DNA storage approaching the information-theoretic ceiling

Synthetic DNA approaches 227.5 exabytes per gram of storage density with stability over millennial timescales. Realising this capacity requires error-correction codes that recover data from substantial synthesis and sequencing errors. Existing codecs convert noisy sequencer output into discrete base calls before error correction, discarding probabilistic information about which positions are reliable. Here we present a coding scheme that retains the sequencer's per-position posterior distributions through an integrated decoder of profile hidden Markov model alignment, log-product fusion across reads, and ordered-statistics decoding. On the DT4DDS channel simulator, the codec recovers 155.8 and 25.9 exabytes per gram of dsDNA under high- and low-fidelity conditions, exceeding the highest prior-art density on each channel by 11 and 52 percent. Under a single-encode-then-degrade protocol mapped to depurination kinetics at 25 {\deg}C in the dry state, the codec projects 282 years of decodable storage at 17.1 exabytes per gram. These results place DNA storage density within reach of the Shannon bound of the underlying channel.
Read the full abstract