Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 6 May

Optimization and Control

Approximate Dynamic Programming for Real-time Assignment of Extraboard Transit Operators

This study investigates real-time assignment decisions for extraboard transit operators, who are responsible for covering open work due to unexpected events such as driver absenteeism. Efficient usage of extraboard operators is critical as open work negatively affects service reliability. The problem is formulated as a Markov decision process, designed to capture its stochastic and sequential nature. Due to the problem's very large state space, an approximate policy is proposed in the form of an integer program, which maps a system state to assignment decisions such that the sum of immediate and expected future rewards is maximized. As part of off-line training, future value functions for individual operators are computed using a backward dynamic program. Then, the overestimation in the aggregate value obtained by summing individual values is corrected to account for the interaction among operators. Case studies are conducted based on the operations at a real-world transit agency. Key performance metrics including uncovered open work and extraboard utilization rates are examined for varying absenteeism rates and extraboard roster sizes. The approximate policy is shown to outperform benchmark decision rules mirroring real-world assignment strategies. Further numerical experiments are conducted to analyze different operational policies: (1) inclusion of overtime drivers in the reserve operator roster; (2) reward weights for work tasks that consider passenger wait time saved. Observations from these computational analyses provide actionable insights into extraboard sizing, overtime usage, and real-time dispatch practices at transit agencies.
Read the full abstract

Optimization and Control

Predictive and Prescriptive AI toward Optimizing Wildfire Suppression

Intense wildfire seasons require critical prioritization decisions to allocate scarce suppression resources over a dispersed geographical area. This paper develops a predictive and prescriptive approach to jointly optimize crew assignments and wildfire suppression. The problem features a discrete resource-allocation structure with endogenous wildfire demand and non-linear wildfire dynamics. We formulate an integer optimization model with crew assignments on a time-space-rest network, wildfire dynamics on a time-state network, and linking constraints between them. We develop a two-sided branch-and-price-and-cut algorithm based on: (i) a two-sided column generation scheme that generates fire suppression plans and crew routes iteratively; (ii) a new family of cuts exploiting the knapsack structure of the linking constraints; and (iii) novel branching rules to accommodate non-linear wildfire dynamics. We also propose a data-driven double machine learning approach to estimate wildfire spread as a function of covariate information and suppression efforts, mitigating observed confounding between historical crew assignments and wildfire growth. Extensive computational experiments show that the optimization algorithm scales to otherwise intractable real-world instances; and that the methodology can enhance suppression effectiveness in practice, resulting in significant reductions in area burned over a wildfire season and guiding resource sharing across wildfire jurisdictions.
Read the full abstract

All authors Leonard Boussioux, Alexandre Jacquillat, Ryne Reger, Jacob Wachspress

Information Theory · Cross-listed from cond-mat.stat-mech

The unique, universal entropy for complex systems

A unique, universal definition for the entropy of nonlinear, complex systems is proposed. The Shannon entropy is shown to measure energetic, configurational, and nonlinear degrees of freedom (DOF). An entropy calibrated to the asymptotic nonlinearity of the distribution reduces the nonlinear DOF to zero and modifies the configurational DOF with a generalized logarithm. Physical axioms regarding the asymptotic growth of states, the calibration from an informational scale, and nonlinear dynamics provide a foundation for the proof that the calibrated entropy is unique and comprehensive across the short- and long-range dependency classes. The informational scale quantifies the linear uncertainty independent of the nonlinearity. This entropy, when constrained by the informational scale, is maximized by the coupled stretched exponential distributions (CSED). A consistent thermodynamics for nonequilibrium systems is proposed with the temperature equal to the scale constraint divided by the Boltzmann constant. Physical and informational applications are highlighted.
Read the full abstract

Logic

Comparing the Effective Content of Subshifts

Motivated by Ziegler's computability-theoretic characterisation of finite absolute presentability between groups, we prove an analogous theorem in symbolic dynamics. We introduce the notion of one subshift being finitely determined over another and show that this relation is characterised by Ziegler reducibility between their co-languages. We further investigate a notion of existential closure for subshifts.
Read the full abstract

Numerical Analysis

Analysis of gradient flow for computing defocusing action ground states of rotating nonlinear Schrödinger equations

This work focuses on the numerical computation of defocusing action ground states for rotating nonlinear Schrödinger equations (RNLS) using a direct gradient flow (DGF) method. We address theoretical gaps in the existing literature concerning the stability and convergence of this DGF scheme. Firstly, we prove the unconditional stability of the DGF scheme, demonstrating that the action functional is monotonically non-increasing along the discrete flow for arbitrary time step sizes. Secondly, we establish a rigorous convergence analysis, proving global convergence under minor assumptions and local exponential convergence to the action ground state under a reasonable non-degeneracy condition. The analysis relies on the uniform boundedness of sublevel sets of the action functional and introduces a tailored $H^1$-distance between phase-shift equivalence classes to handle complex-valued ground states with quantized vortices. A novel analytical framework is also developed to establish the exponential convergence rate. Numerical experiments are presented to validate the theoretical findings, demonstrating both the global migration towards a neighborhood of the ground state and subsequent exponential convergence.
Read the full abstract

All authors Wei Liu, Tingfeng Wang, Yongjun Yuan, Xiaofei Zhao

Numerical Analysis · Cross-listed from physics.comp-ph

CDFCI: High-Performance Parallel Software for Quantum Many-Body Eigenvalue Problems

CDFCI is a shared-memory parallel numerical program for computing low-lying eigenpairs of large-scale, non-relativistic fermionic Hamiltonians. The software is designed to handle a broad class of many-body quantum models, including both ab initio electronic structure Hamiltonians and lattice-based Hamiltonians arising in condensed matter physics. CDFCI combines an efficient coordinate-descent-based selected configuration interaction algorithm with dedicated parallelization strategies, achieving high performance on modern multi-core architectures. Benchmark results on representative quantum chemistry and condensed matter test cases demonstrate that CDFCI attains state-of-the-art accuracy with competitive performance compared to established selected configuration interaction (such as CIPSI or SHCI) and DMRG implementations. The software is open-source, extensively documented, and provides a Python interface for seamless integration with PySCF and other many-body simulation workflows.
Read the full abstract

All authors Yuejia Zhang, Zhe Wang, Jianfeng Lu, Yingzhou Li

Numerical Analysis

Geometric Milstein Scheme for Stochastic Differential Equations on SO(n) and SE(n)

In the paper, we propose a higher-order geometry-preserving numerical method for stochastic differential equations (SDEs) evolving on the Lie groups SO(n) and SE(n). Most existing Lie group integrators rely on Magnus expansion of the exponential map, which makes the construction of higher-order stochastic schemes difficult. To overcome this limitation, we develop a tangent-space parameterization corrected Milstein method (TaSP-CM), extending the tangent space parameterization (TaSP) framework from Lie-group ODEs to the stochastic setting. Although TaSP is a well-established method for Lie ODEs, the extension to SDEs is non-trivial and requires new stochastic corrections that ensure both geometric consistency and higher-order accuracy. We prove that the proposed scheme achieves strong convergence of order 1 under both commutative and non-commutative noise. Numerical experiments illustrate the theoretical results and demonstrate the efficiency and robustness of the proposed method.
Read the full abstract

Differential Geometry

Topology of gradient Ricci shrinkers via weighted $L^2$ cohomology

This paper proves several topological results for smooth gradient Ricci shrinkers. We establish upper bounds for the Betti numbers, a vanishing theorem for cohomology, and a dichotomy for the number of ends. We also prove a full Hodge theorem for a large class of shrinkers. The methods are based on weighted $L^2$ cohomology and extend to self-shrinkers of the mean curvature flow.
Read the full abstract

Dynamical Systems

Programming sequential deployment of origami via kinematic transition fronts

Propagating transition fronts, in which local interactions sequentially trigger state changes, are widely observed across natural, biological, and engineered systems. While such propagation has been engineered using energy-driven instabilities, front propagation governed purely by geometric constraints remains underexplored and lacks a general design framework. In particular, how to program sequential deployment in origami through such kinematic propagation remains an open challenge. Here, we develop a systematic design framework for kinematic transition fronts based on their correspondence with heteroclinic orbits in discrete dynamical systems. Focusing on strips of developable and flat-foldable degree-4 origami vertices, we show that asymmetric coupling between adjacent creases produces nonlinear recurrence relations whose composition generically gives rise to heteroclinic orbits connecting developed and flat-folded states, enabling domino-like sequential deployment. We further show that macroscopic shape can be programmed independently of propagation behavior by exploiting invariances in the recurrence relation, and illustrate the approach through a representative thick-panel origami prototype. These results enable programmable sequential deployment in origami via transition fronts, while also establishing a general framework for kinematic transition fronts in geometrically constrained systems.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Augmented transfer regression learning for completely missing covariates

Large-scale population-level datasets, such as the UK Biobank and the All of Us Research Program, often lack covariates needed for a specific analysis, such as genetic or lifestyle measures, while related studies measure them. This creates a cross-population missing data problem in which covariates are completely unobserved in the target population, rather than partially missing within one dataset. We propose an augmented transfer regression learning method for this setting. The key identifying condition is a sub-population shift assumption: the joint distribution of the outcome and observed covariates may differ across source and target populations, but the conditional distribution of the missing covariates given observed variables is invariant. We combine importance-weighted estimating equations with imputation terms for first- and second-order moments of the missing covariates. The resulting estimator is doubly robust and remains consistent if either the density ratio model or both imputation models are correctly specified. It is n^{1/2}-consistent and asymptotically normal, and attains the semiparametric efficiency bound when both
Read the full abstract

Optimization and Control

Distributed TD Tracking with Linear Function Approximation over Directed Communication Networks

We study the policy evaluation problem in multi-agent reinforcement learning (MARL) over directed communication networks, where agents cooperate with each other to explore an unknown environment and accomplish a specific task. We propose a Push-Pull-type distributed algorithm, named PP-DTD, for policy evaluation in MARL within the framework of temporal difference (TD) learning with linear function approximation. PP-DTD integrates TD learning with the Push-Pull mechanism to accommodate directed communication networks, and further utilizes variance reduction techniques to enhance both algorithmic stability and convergence rate. We show that PP-DTD achieves linear convergence to a neighborhood of the optimum under constant step-sizes and a convergence rate of $\mathcal{O}({T^{-1}})$ under decaying step-sizes when the sample is independent and identically distributed or Markovian. To the best of our knowledge, PP-DTD is the first distributed algorithm for policy evaluation in MARL over directed graphs that achieves a comparable convergence rate to single-agent TD. The numerical experiments on cooperative navigation tasks demonstrate the robustness and effectiveness of PP-DTD.
Read the full abstract

Rings and Algebras

On the structural behavior of images of polynomials

The study of images of noncommutative polynomials on algebras has attracted considerable attention. We investigate polynomial images and the additive structures they generate in associative algebras, focusing on sums and products of values. Motivated by results on additive commutators, we show that finite sums of such products on a nonzero ideal must contains a nonzero ideal, with only minor exceptions. Consequently, for a simple algebra, the subring generated by the image of a noncentral polynomial coincides with the whole algebra, up to a small exceptional case. We further study representations of elements as sums of products of polynomial values, and examine products of additive commutators for matrices over division rings. To simplify multilinear polynomials, we introduce decomposable polynomials and show that, in many cases, their images equal the whole algebra. Finally, we consider polynomial commutators and prove that every noncommutative infinite simple algebra is generated by such elements, together with results on multiplicative commutators, including a complete description for real quaternions.
Read the full abstract

Analysis of PDEs

Stabilization by a background magnetic field: global well-posedness of the compressible isentropic ideal MHD equations with velocity damping

We study the Cauchy problem for the three-dimensional isentropic compressible ideal (inviscid and non-resistive) magnetohydrodynamic equations with velocity damping on the periodic torus $\mathbb{T}^3$. The system admits a steady equilibrium consisting of a constant density $\bar{\rho}$ and a uniform background magnetic field $\omega\in\mathbb{R}^3$. We prove that this equilibrium is nonlinearly stable. More precisely, we show that if the initial data are a sufficiently small perturbation of $(\bar{\rho},\mathbf{0},\omega)$ in the Sobolev space $H^N(\mathbb{T}^3)$ with $N\geq 6r+4$, and if $\omega$ satisfies a Diophantine condition, then the system admits a unique global smooth solution. Moreover, the perturbations decay algebraically in time. To the best of our knowledge, this is the first global well-posedness result for the multi-dimensional isentropic compressible ideal MHD system. The proof reveals a hidden dissipation mechanism: although neither the density equation nor the magnetic field equation contains explicit diffusion or damping, the coupling between the velocity and the magnetic field through the background field $\omega$, combined with a Diophantine–Poincaré inequality, generates effective dissipation for both the density perturbation and the magnetic field perturbation, which together with the velocity damping yields global regularity and time decay.
Read the full abstract

All authors Liening Qiao, Jiahong Wu, Fuyi Xu, Xiaoping Zhai

Numerical Analysis

Long-time $L^2$&$H^1$-stability of the Family of DLN Methods for the Two-dimensional Incompressible Navier-Stokes Equations

In this report, we study the long-time stability of the family of one-leg DLN methods for the two-dimensional incompressible Navier-Stokes equations. The family of DLN methods (with one parameter $\theta$), non-linear energy stable ($G$-stable) and second-order accurate under arbitrary time grids, has been widely applied to the simulations of various fluid models with success. We derive a new version of the $G$-stability identity for the family of DLN methods under uniform time grids and mild time constraints. Then we utilize this crucial auxiliary tool and the discrete uniform Grönwall inequality lemma to prove the uniform-in-time stability of the numerical solutions. Essentially, the bounds are independent of the time interval and the initial conditions, consistent with the theories of the continuous case.
Read the full abstract

Logic · Cross-listed from cs.LO

Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability

Coalition Logic studies what coalitions can enforce. Recent work treats inability as simple non-ability: $\neg\Eff{C}\varphi$. This conflates two distinct configurations – a coalition unable to force $\varphi$ may still force $\neg\varphi$, retaining adversarial control rather than genuine inability. We introduce Full Inability ($\FI$): the symmetric condition in which a coalition can enforce neither a proposition nor its negation. Combining coalitional effectivity with propositional negation yields a four-fold spectrum: Full Control ($\FC$), Positive Determination ($\PD$), Adverse Determination ($\AD$), and Full Inability ($\FI$). These categories partition a coalition's strategic status exhaustively and exclusively. We establish their algebraic and order-theoretic structure. Under $\alpha$-duality, propositional negation and coalition complementation generate a Klein four-group symmetry. In playable models, the four power regions are order-convex in the powerset lattice, yielding interval-stable verification of inability. We axiomatize $\CLFI$, a definitional extension treating Full Inability as a primitive modality. Via elimination translation, we prove soundness, completeness, and conservativity over Coalition Logic. The extension preserves expressive power and complexity ($\PSPACE$-complete), but provides direct proof-theoretic access to symmetric inability, strategic dependence, propositional dummyhood, and containment verification.
Read the full abstract

Commutative Algebra

Depth of edge ideals and vertex connectivity of finite graphs

Let $G$ be a finite graph on $[n]:=\{1, \ldots, n\}$ and $\kappa(G)$ its vertex connectivity. Let $S=K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G^c)$ the edge ideal of the complementary graph $G^c$ of $G$. It is a classical result that ${\rm depth} S/I(G^c) \leq \kappa(G) + 1$. We give a sharp lower bound of ${\rm depth} S/I(G^c)$ in terms of $n$ and $\kappa(G)$. Furthermore, a sharp lower bound of ${\rm depth} S/I(G^c)^2$ as well as that of ${\rm depth} S/I(G^c)^{(2)}$ in terms of $n$ and $\kappa(G)$ is given.
Read the full abstract

Analysis of PDEs

Asymptotics of Minimizers for Ginzburg–Landau-type Functionals in High Dimensions

We investigate local minimizers of Ginzburg–Landau-type functionals in dimension $n\geq 3$ that satisfy logarithmic energy bounds, assuming the potential has a vacuum manifold with a finite fundamental group. We show that the normalized energy measures converge to an $(n-2)$-rectifiable measure associated with a stationary varifold, with quantized density determined by the homotopy classes of the vacuum manifold. Away from the support of the $(n-2)$-rectifiable measure, the minimizers converge strongly in $H^1_{\text{loc}}$ to a minimizing harmonic map, which is smooth outside an $(n-3)$-rectifiable singular set.
Read the full abstract

Combinatorics

Extremal problems on $[a, b]$-covered graphs

A graph $G$ is $[a,b]$-covered if for each edge $e$ of $G$ there is an $[a,b]$-factor containing it. For $a=b=1$, an $[a,b]$-covered graph is a matching covered graph. The structural theory of matching covered graphs constitutes a cornerstone of modern matching theory. Determining whether a given graph is matching covered is a fundamental problem in structural graph theory. Lucchesi et al. [SIAM J. Discrete Math., 2018] showed that a connected graph $G$ is matching covered if and only if every barrier of $G$ is a stable set. In this paper, we completely characterize the extremal graphs that maximize the size or the spectral radius among all non-matching-covered graphs. For $a \leq b$ and $b \geq 2,$ Hao and Li [Electron. J. Combin., 2024] investigated the extremal problems on $[a,b]$-factor graphs: If $G$ contains no $[a,b]$-factors, then $e(G)\leq \binom{n-1}{2}+a-1$ with equality if and only if $G\cong H_{n,a},$ where $H_{n,a} = K_{a-1} \vee (K_{n-a} \cup K_1).$ Moreover, if $G$ contains no $[a,b]$-factors, then $\rho(G)\leq \rho(H_{n,a})$ with equality if and only if $G \cong H_{n,a}.$ Judging from the structral characterization, non-$[a,b]$-covered graphs exhibit highly complex structures, making the associated extremal problems significantly challenging. To overcome this, we develop a novel minimum-degree forcing technique. Combining this technique and spectral-structural analysis, we in this paper provide complete characterizations of the extremal graphs that maximize the size or the spectral radius within the set of non-$[a,b]$-covered graphs. An intriguing phenomenon revealed by our results is that $H_{n,a}$ remains both the size-extremal graph and the spectral extremal graph for this larger set of non-$[a,b]$-covered graphs. Consequently, our results strengthen the results of Hao-Li.
Read the full abstract

Geometric Topology

Implementation of the Habegger–Lin decision algorithm

Habegger and Lin gave a classification of link-homotopy classes of links in terms of that of string links modulo certain group actions. As an application, they constructed an algorithm for determining whether given two links are link-homotopic. In \cite{KM4}, we explicitly computed these group actions for the 4- and 5-component cases. Consequently, the Habegger–Lin algorithm can be effectively applied in these cases. In this paper, we present an implementation of this algorithm, which is available at \cite{KMcode}, and exhibit new pairs of links that are not link-homotopic yet cannot be distinguished by Milnor's link-homotopy invariants, called $\overline{\mu}$-invariants.
Read the full abstract

Functional Analysis

Random Fixed Point Theorems for Relaxed Asymptotic Contractions in Random Normed Modules

We introduce the notion of a random relaxed asymptotic contraction in the setting of random normed modules. The contraction condition employs two quasi-metrics that are built directly from the random operator: a lower quasi-metric which adaptively switches between a four-point minimum and the ordinary one-step distance, and an upper quasi-metric which takes the maximum of four fundamental distances. The bounds are allowed to depend on the iteration index and are required to converge locally uniformly almost surely to a Boyd–Wong function. Using the fibre decomposition method based on \(\sigma\)-stability and the local property, we show that any such mapping defined on an essentially bounded, \(\sigma\)-stable and \(L^0\)-closed set admits a unique random fixed point, and all iterates converge in the \((\epsilon,\lambda)\)-topology. Our result strictly generalizes the random analogue of Kirk's asymptotic contraction theorem and unifies several deterministic and random fixed point theorems under a single flexible framework.
Read the full abstract

Numerical Analysis

Structure-Preserving and Pressure-Robust PINNs for Incompressible Oseen Problems

We develop a new class of physics-informed neural network approximations for the stationary Oseen equations based on stability-consistent loss constructions. In contrast to standard PINN formulations, which are typically heuristic, the proposed consistent PINN (CPINN) framework is systematically derived from the stability structure of the continuous problem. Within this setting, we introduce two fundamentally new approaches. First, we design standard CPINN formulations that exhibit clear improvements over conventional PINNs. Second, we propose pressure-robust CPINN formulations that provably eliminate the influence of gradient forces on the velocity approximation, yielding velocity errors that depend solely on the divergence-free component of the forcing and are independent of the pressure. The framework accommodates both exactly divergence-free architectures and unconstrained velocity approximations, providing a unified treatment of these two paradigms. Using techniques from optimal recovery theory, we establish, for the first time in the PINN setting for Oseen-type problems, quantitative recovery estimates and optimal error bounds for both velocity and pressure under suitable Besov regularity assumptions. In particular, we obtain optimal rates for the velocity in $\boldsymbol{H}^1(\Omega)$ and for the pressure in $L^2(\Omega)$. The proposed methodology introduces a pressure-robust CPINN paradigm for incompressible flows, combining structural consistency, robustness with respect to irrotational forces, and rigorous accuracy guarantees. Numerical experiments corroborate the theoretical findings and demonstrate the effectiveness of the approach.
Read the full abstract

Optimization and Control

A Numerical Investigation of Extremum-Seeking-Based Command Generation for Adaptively Controlled Systems

We develop an adaptive feedback control technique that combines an extremum-seeking-based command generator (ECG) with indirect adaptive control. In particular, ECG is used to generate commands that asymptotically optimize a cost function that is measured but whose functional form is unknown. For feedback control with command following and stabilization, the present paper combines ECG with predictive cost adaptive control (PCAC), which is an indirect adaptive control extension of model predictive control (MPC). PCAC extends generalized predictive control (GPC) by using quadratic programming to enforce output constraints and recursive least squares (RLS) with variable-rate forgetting (VRF) for system identification. The resulting ECG/PCAC framework combines command generation with closed-loop system identification and online optimization. The contribution of this paper is a numerical investigation of ECG/PCAC for adaptive stabilization, command following, and disturbance rejection
Read the full abstract

All authors Jhon Manuel Portella Delgado, Aidan Rice, Jacob C. Vander Schaaf, Dennis S. Bernstein

Optimization and Control · Cross-listed from cs.LG

Demystifying Manifold Constraints in LLM Pre-training

The recent success of matrix optimizers (e.g., Muon) suggests that specific normalization of momentum, such as orthogonalization and row-wise normalization, benefits both the stability and acceleration of LLM training. Consequently, several recent studies have suggested that weights should also be normalized, leading to a Riemannian optimization problem. While such constrained training frameworks demonstrate superior performance, the effects of explicitly constraining weights, and their interaction with existing stabilization mechanisms, remain less understood. To bridge this gap, we study manifold constrained training dynamics through activation scales, rotational dynamics, and the update-to-weight ratio. We propose a Riemannian spectral steepest descent optimizer called MACRO, alongside a radius selection principle to serve as our testbed. Our analysis and numerical experiments reveal that RMSNorm and manifold constraints serve overlapping roles, and that weight decay can be completely eliminated when manifold constraints are applied. By controlling the update-to-weight ratio, constrained training significantly alleviates update cancellation, empirically demonstrating that MACRO is robust to low-precision computation and competitive with existing algorithms for standard LLM pre-training.
Read the full abstract

All authors Kang An, Jiaxiang Li, Donald Goldfarb, Shiqian Ma

Number Theory

Fixed points and exact periods of Chebyshev polynomials modulo odd prime powers

Passing from a prime modulus to a higher prime power can change both the lengths and the number of cycles of a polynomial map. We determine these changes for Chebyshev polynomials $T_n$ modulo $p^k$, for every degree $n\ge2$, every odd prime $p$, and every $k\ge1$. The results apply whether or not $T_n$ permutes the residue classes. We give explicit formulas for the number of fixed points, all possible cycle lengths, and the number of cycles of each length. The fixed-point formula involves four greatest common divisors and a correction specific to $p=3$. We explain this exception by showing how distinct rational fixed points become congruent modulo $3$. When $p\mid n$, each cycle modulo $p$ corresponds to exactly one cycle of the same length modulo every $p^k$. When $p\nmid n$, we determine how many cycles arise from each cycle modulo $p$ and when longer cycles first appear. The proofs combine the classical relation between Chebyshev polynomials and power maps with $p$-adic arithmetic.
Read the full abstract

Combinatorics

Uniform Mixing in Chiral Quantum Walks

This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing $\sigma$, the complete graph $K^\sigma_n$ has probabilistic uniform mixing. In contrast, Ahmadi \etal (2003) proved that no complete graph has uniform mixing except for $K_2$, $K_3$, and $K_4$. Our technique is based on a stopping rule for quantum walks which reduces global to local uniform mixing. As a corollary, we found an orientation of $H(n,4)$ that mixes to uniform faster than any other Hamming graphs, which improves a result of Godsil and Zhan (2019). We also show that there are infinite families of oriented circulants with average uniform mixing. This is a chiral violation of a No-Go theorem due to Godsil (2013) which states that no graph has average uniform mixing except for $K_2$.
Read the full abstract

All authors Luke Levine, Jessy Jacob Mesapam, Benjamin Mustico, Christino Tamon, Gabriel Tucker, Hanmeng Zhan

Number Theory

Thin subbases of Piatetski-Shapiro sequences

For a non-integral real number $c>1$, let $\mathbb{N}_{(c)}:=\{\lfloor n^c\rfloor ~|~ n\in\mathbb{N}\}$. We show that $\mathbb{N}_{(c)}$ contains thin subbases of every order $h\geq 5$ when $1<c<2$, and $h\geq (\lfloor 2c\rfloor+1)(\lfloor 2c\rfloor+2)+1$ when $c>2$. In fact, for every regularly varying function $F$ such that \[ \frac{F(x)}{\log x}\to\infty\quad\text{ and } \quad F(x)\leq (1+o(1))\frac{\Gamma(1+1/c)^h}{\Gamma(h/c)} x^{h/c-1}, \] there exists $A\subseteq\mathbb{N}_{(c)}$ with $r_{A,h}(n)\sim F(n)$. We also establish analogous results for $k$-th powers of Piatetski-Shapiro numbers and Piatetski-Shapiro primes for small $c$.
Read the full abstract

Logic

Computable Scott Sentences and the Friedman-Stanley embedding

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on isomorphism types is explained by the existence of simple formulas that, uniformly, interpret the input structure in the output structure. For the embeddings of graphs in trees, and in linear orderings, there is no uniform interpretation. We focus on a version of the Friedman-Stanley embedding introduced by Harrison-Trainor and Montalban that takes each structure $A$ for the language of graphs to a labeled tree $T_A$. Gonzalez and Rossegger showed that this embedding preserves Scott complexity. We refine this result, showing that for an $X$-computable ordinal, if one of $A$, $T_A$ has a computable infinitary Scott sentence, then so does the other, and the complexities match. Let $\mathbb{T}$ be the class of labeled trees isomorphic to those in the range of the embedding, and let $\mathbb{T}^\alpha$ be the subclass consisting of structures of Scott rank at most $\alpha$. It follows from results of Gao that $\mathbb{T}$ is not Borel. We show that for each $\alpha$, $\mathbb{T}^\alpha$ is Borel. In fact, if $\alpha$ is an $X$-computable ordinal, then $\mathbb{T}^\alpha$ is complete $X$-effective $\Pi_{2\alpha+2}$.
Read the full abstract

Complex Variables

Circle companions of Hardy spaces of the unit disk

This paper gives a complete answer to the following problem: Find the circle companion of the Hardy space of the unit disk with values in the space of all bounded linear operators between two separable Hilbert spaces. Classically, the problem asks whether for each function $h$ on the unit disk, there exists a “boundary function" $bh$ on the unit circle such that the mapping $bh\mapsto h$ is an isometric isomorphism between Hardy spaces of the unit circle and the unit disk with values in some Banach space. For the case of bounded linear operator-valued functions, we construct a Hardy space of the unit circle such that its elements are SOT measurable, and their norms are integrable: indeed, this new space is isometrically isomorphic to the Hardy space of the unit disk via a “strong Poisson integral."
Read the full abstract

All authors Raul E. Curto, In Sung Hwang, Sumin Kim, Woo Young Lee

Analysis of PDEs

Existence, uniqueness, stability, and monotonicity of traveling waves for repulsion/attraction chemotaxis models with logistic type source

This paper is devoted to the study of existence, uniqueness, stability, and monotonicity of traveling wave solutions to the following parabolic-elliptic chemotaxis system with logistic type source \begin{equation}\label{E:main-abstract-eq}\tag{CM} \begin{cases} u_t=u_{xx}-\chi(u^m v_x)_x +u(1-u^\alpha),\quad &x\in\mathbb{R}\cr 0=v_{xx}-v+u^\gamma,\quad&x\in\mathbb{R}, \end{cases} \end{equation} where $m,\alpha,\gamma\ge 1$ and $\chi\in\mathbb{R}$. System (CM) can be used to describe the evolution of a biological species influenced by a chemical substance produced by the species itself. In this context, the function $u$ denotes the population density of the biological species, and $v$ denotes the concentration of the chemical agent. Traveling wave solutions of (CM) connecting the two constant solutions $(1,1)$ and $(0,0)$ are among important types of solutions, which characterize the front propagation phenomena in (CM). The existence of such traveling wave solutions to (CM) with $m=\alpha=\gamma=1$ has been studied in several papers. However, there is little study on the uniqueness, stability, and monotonicity of traveling wave solutions of (CM) in literature and there is also no study on the existence of traveling wave solutions of (CM) connecting $(1,1)$ and $(0,0)$ for general $m,\alpha,\gamma\ge 1$. In the current paper, we prove the existence of traveling wave solutions of (CM) connecting $(1,1)$ and $(0,0)$ for any $\chi\le 0$ with speed $c$ large than some number $c^*_{\chi,m,\gamma}$, or for $0<\chi<1/2$ with any speed $c>2$. We prove that the traveling wave solutions are monotone when $\chi\le 0$. We also prove the uniqueness and stability of traveling wave solutions of (CM) connecting $(1,1)$ and $(0,0)$ when the speed $c$ is larger than some number $c^{**}_{\chi,m,\alpha, \gamma}(\ge c^*_{\chi,m,\gamma})$.
Read the full abstract

Information Theory

Contextual Memory-Enhanced Source Coding for Low-SNR Communications

Separate Source-Channel Coding (SSCC) remains vulnerable in noisy text transmission due to the fragility of autoregressive source decoding, especially when Arithmetic Coding (AC) relies on Large Language Model (LLM)-based probability estimation. This letter proposes a Memory-Augmented Source Coding (MASC) scheme that internalizes contextual patterns into a source model. Specifically, MASC employs a shared Parameterized Contextual Memory (PCM) for multi-order $n$-gram patterns, and a Mixture-of-Memory-Experts Router (MMER) for sparse, hidden-state-dependent routing over memory experts. This adaptive activation refines source probability estimation, shortens codelength, and mitigates decoding sensitivity to residual channel errors. Experiments over Rayleigh fading and AWGN channels demonstrate its effectiveness.
Read the full abstract

All authors Ziqiong Wang, Rongpeng Li, Zhifeng Zhao, Honggang Zhang