Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 26 March

Number Theory

Poly-Bernoulli numbers from shifted log-sine integrals

In 1999, Arakawa and Kaneko introduced a zeta function connecting multiple zeta values with poly-Bernoulli numbers through its special values. Log-sine integrals are also known to be related to zeta values at positive integers. In this article, we study the values of a shifted log-sine integral at negative integers and establish a connection with anti-diagonal sums of poly-Bernoulli numbers. This gives a refinement of Stephan's observation on the central binomial series.
Read the full abstract

Numerical Analysis

Computing Saddle Points in Stiff Problems via a Preconditioned High-index Saddle Dynamics Method

High-index saddle dynamics (HiSD) is an effective approach for computing saddle points of a prescribed Morse index and constructing solution landscapes for complex nonlinear systems. However, for problems with ill-conditioned Hessians arising from fine discretizations or stiff potentials, the efficiency of standard HiSD deteriorates as its convergence rate worsens with the spectral condition number $\kappa$. To address this issue, we propose a preconditioned HiSD (p-HiSD) framework that reformulates the continuous dynamics within a Riemannian metric induced by a symmetric positive definite preconditioner $M$. By generalizing orthogonal reflections and unstable-subspace tracking to the $M$-inner product, the proposed scheme modifies the geometry of the saddle-search dynamics while remaining computationally efficient. Rigorous theoretical analysis confirms that the equilibria and their Morse indices are invariant under this metric. Furthermore, we establish the local exponential stability of the continuous dynamics and prove a discrete linear convergence rate governed by the preconditioned condition number $\kappa_M$. Consequently, the iteration complexity is sharply reduced from $O(\kappa\log(1/\epsilon))$ to $O(\kappa_M\log(1/\epsilon))$. We validate the method on nine numerical tests spanning finite-dimensional model problems, stiff lattice systems, and PDE discretizations. The results demonstrate that p-HiSD resolves stiffness-induced convergence failures, permits substantially larger step sizes, and significantly reduces iteration counts.
Read the full abstract

All authors Bingzhang Huang, Hua Su, Lei Zhang, Jin Zhao

Logic

Complex cells in sharply o-minimal structures

We extend the theory of complex cells introduced by Binyamini and Novikov to the sharply o-minimal setting, obtaining cellular preparation and parameterization theorems which are polynomially effective in the degrees of the relevant sets. Our constructions are definable, and so applying them to sets in a given reduct of R_an yields cells and cellular maps definable in the same reduct.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Analytical Solutions of One-Dimensional ($1\mathcal{D}$) Potentials for Spin-0 Particles via the Feshbach-Villars Formalism

We present a unified analytical and numerical study of the one-dimensional Feshbach–Villars (FV) equation for spin-0 particles in the presence of several representative external potentials. Starting from the FV formulation of the Klein–Gordon equation, we derive the corresponding one-dimensional master equation and analyse its solutions for Coulomb, power-exponential, Cornell, Pöschl–Teller, and Woods–Saxon interactions. For the singular Coulomb and Cornell cases, a Loudon-type cutoff regularisation is implemented on the full line, allowing a mathematically controlled treatment of the origin and an explicit classification of the states by parity. The Coulomb problem exhibits the expected near-degenerate even–odd structure in the cutoff limit, while the Cornell potential combines short-distance Coulomb behaviour with long-distance confinement and produces a finite set of bound states for fixed parameters. The power-exponential potential with $p=1$ is reduced to a Whittaker-type equation and yields an intrinsically relativistic spectrum with no standard Schrödinger bound-state limit in the parameter regime considered. For the smooth short-range Pöschl–Teller and Woods-Saxon potentials, the FV formalism reveals, respectively, the effects of definite parity and spatial asymmetry on the spectrum, wave functions, and particle–antiparticle mixing. In all cases, we reconstruct the full FV spinor, analyse the associated charge density, and compare the relativistic behaviour with the corresponding non-relativistic expectations whenever such a limit exists. The results provide a coherent set of analytical and numerical benchmarks for relativistic scalar bound states in one dimension.
Read the full abstract

Analysis of PDEs

Low regularity potentials in heterogeneous Cahn–Hilliard functionals

In this paper, we study the prototypical model of liquid-liquid phase separation, the Cahn-Hilliard functional, in a highly irregular setting. Specifically, we analyze potentials with low regularity vanishing on space-dependent wells. Under remarkably weak hypotheses, we establish a robust compactness result. Strengthening the regularity of the wells and of the growth of the potential close to the wells only slightly, we completely characterize the asymptotic behavior of the associated family of functionals through a $\Gamma$-convergence analysis. As a notable technical result, we prove the existence of geodesics for a degenerate metric and establish a uniform bound on their Euclidean length.
Read the full abstract

Number Theory

Computing the local $2$-component of a non-selfdual automorphic representation of $\mathrm{GL}_3$

In this paper, we explicitly determine the local $2$-adic component of a non-selfdual automorphic representation $\Pi$ of $\mathrm{GL}_3$ constructed by van Geemen and Top. We prove that $\Pi_2$ is a parabolically induced representation of $\mathrm{GL}_3(\mathbb{Q}_2)$ given by $\Pi_2 = \mathrm{Ind}_P^{\mathrm{GL}_3(\mathbb{Q}_2)}(\pi\boxtimes \chi)$, where $P$ is the standard parabolic subgroup of $\mathrm{GL}_3$ with Levi subgroup $\mathrm{GL}_2 \times \mathrm{GL}_1$, $\chi$ is an unramified character of $\mathbb{Q}_2^\times$ satisfying $\chi(2) = -2\sqrt{-1}$, and $\pi$ is a supercuspidal representation of $\mathrm{GL}_2(\mathbb{Q}_2)$. Furthermore, we describe $\pi$ explicitly as a compactly induced representation $\pi = \mathrm{c-Ind}_{J_\alpha}^{\mathrm{GL}_2(\mathbb{Q}_2)} \Lambda$ and determine the representation $\Lambda$ explicitly. The proof relies on explicit computations of Hecke eigenvalues using computer calculations. The automorphic representation $\Pi$ is realized in the cuspidal cohomology of the congruence subgroup $\Gamma_0(128) \subset \mathrm{SL}_3(\mathbb{Z})$. By computing the Hecke eigenvalues of an associated Hecke eigenvector, we are able to uniquely identify the local structure of $\Pi_2$. As an application, we obtain an explicit description of the $2$-adic local component of the Galois representation $\rho_{\mathrm{vGT},\ell}$ associated with $\Pi$.
Read the full abstract

Combinatorics

Localization of the clique spectral version of Zykov's theorem

Zykov's theorem shows that $r$-partite Turán graph uniquely has the maximum number of $K_t$ among all $n$-vertex $K_{r+1}$-free graphs for $2\le t\le r$. The clique tensor is a high-order extension of the adjacency matrix of a graph. Yu and Peng \cite{peng1} gave a spectral version of the Zykov's theorem via clique tensor. In this paper, we give some upper bounds on the spectral radius of the clique tensor of a graph, which can be viewed as the localizations of the spectral version of Zykov's theorem.
Read the full abstract

Information Theory

New bounds for codes over Gaussian integers based on the Mannheim distance

We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere packing bound and constraints on the parameters of two-error-correcting perfect codes. We prove several other useful bounds, and exhibit families of codes meeting these bounds for some parameters, thereby showing that these bounds are tight. We also discuss self-dual codes over Gaussian integers and obtain upper bounds on their minimum Mannheim distance for certain parameter regions using a Mannheim version of the Macwilliams-type identity. Finally, we present decoding algorithms for codes over Gaussian integer residue rings. We give examples showing that certain errors which are not correctable under the Hamming metric become correctable under the Mannheim metric.
Read the full abstract

All authors Minjia Shi, Xuan Wang, Junmin An, Jon-Lark Kim

Analysis of PDEs

A sharp quantitative stability result near infinitely concentrated minimisers

We consider the question of quantitative stability of minimisers for a well-known variational problem for which the infimum of the energy is not achieved in the classical sense, namely for the Dirichlet energy of degree $1$ maps from closed surfaces $(\Sigma,g_{\Sigma})$ of positive genus into the unit sphere $S^2\subset \mathbb{R}^3$. For this variational problem it is natural to view configurations which consist of a constant map from the given domain and an infinitely concentrated rotation as generalised minimisers and to hence ask whether the distance of almost minimisers $v:\Sigma\to S^2$ to this set of infinitely concentrated minimisers can be controlled in terms of the energy defect $\delta_v=E(v)-\inf E=E(v)-4\pi$. In this paper we develop a new dynamic approach that allows us to change the topology of the domain in a well controlled manner and to deform almost minimising maps from surfaces of general genus into harmonic maps from the sphere in a way that yields sharp quantitative estimates on all key features that characterise the distance to the set of infinitely concentrated minimisers, i.e. the scale of concentration, the $H^1$-distance to the nearest bubble on the concentration region and the $H^1$-distance to the nearest constant away from the concentration point.
Read the full abstract

Mathematical Physics · Cross-listed from nlin.SI

From pencils of Novikov algebras of Stäckel type to soliton hierarchies

In this article we construct evolutionary soliton hierarchies from pencils of Novikov algebras of Stäckel type. We start by defining a special class of associative Novikov algebras, which we call Novikov algebras of Stäckel type, as they are associated with classical Stäckel metrics in Viète coordinates. We obtain sufficient conditions for pencils of these algebras so that the corresponding Dubrovin-Novikov Hamiltonian operators can be centrally extended, producing sets of pairwise compatible Poisson operators. These operators lead to coupled Korteweg-de~Vries (cKdV) and coupled Harry Dym (cHD) hierarchies, as well as to a triangular cKdV hierarchy and a triangular cHD hierarchy.
Read the full abstract

Optimization and Control

Optimal Dividend, Reinsurance, and Capital Injection for Collaborating Business Lines under Model Uncertainty

This paper considers an insurer with two collaborating business lines that faces three critical decisions: (1) dividend payout, (2) reinsurance coverage, and (3) capital injection between the lines, in the presence of model uncertainty. The insurer considers the reference model to be an approximation of the true model, and each line has its own robustness preference. The reserve level of each line is modeled using a diffusion process. The objective is to obtain a robust strategy that maximizes the expected weighted sum of discounted dividends until the first ruin time, while incorporating a penalty term for the distortion between the reference and alternative models in the worst-case scenario. We completely solve this problem and obtain the value function and optimal (equilibrium) strategies in closed form. We show that the optimal dividend-capital injection strategy is a barrier strategy. The optimal proportion of risk ceded to the reinsurer and the deviation of the worst-case model from the reference model are decreasing with respect to the aggregate reserve level. Finally, numerical examples are presented to show the impact of the model parameters and ambiguity aversion on the optimal strategies.
Read the full abstract

Statistics Theory

Quantitative analysis of non-exchangeability in bivariate copulas: Sharp bounds, statistical tests and mixing constructions

This paper studies the degree to which a bivariate copula fails to be symmetric under coordinate permutation, a property known as non-exchangeability. Working within an axiomatic framework that quantifies this asymmetry through a family of $L^p$-based measures, we establish sharp bounds linking non-exchangeability to classical dependence and concordance measures, prove exact scaling laws under convex mixing that enable explicit construction of copulas with any prescribed degree of asymmetry, and characterise the class of maximally non-exchangeable copulas together with the feasible range of asymmetry–concordance pairs. On the inferential side, we propose a nonparametric permutation test for exchangeability with exact finite-sample error control and consistency against all asymmetric alternatives, validated by Monte Carlo simulation and illustrated on a real data set.
Read the full abstract

Mathematical Physics

Chern-Simons theory in mathematics, condensed matter theory and cosmology

Various applications of Chern-Simons theory in algebraic topology, in particular knot theory, condensed matter physics and cosmology are reviewed. Special attention is paid to appearances of Chern-Simons actions in the theory of the (integer and fractional) quantum Hall effect. A mechanism related to five-dimensional abelian Chern-Simons theory that may be at the origin of the observed intergalactic magnetic fields in the universe is described.
Read the full abstract

Number Theory

Second order Recurrences, quadratic number fields and cyclic codes

Wall-Sun-Sun primes (shortly WSS primes) are defined as those primes $p$ such that the period of the Fibonacci recurrence is the same modulo $p$ and modulo $p^2.$ This concept has been generalized recently to certain second order recurrences whose characteristic polynomials admit as a zero the principal unit of $\mathbb{Q}(\sqrt{d}),$ for some integer $d>0.$ Primes of the latter type we call $WSS(d).$ They correspond to the case when $\mathbb{Q}(\sqrt{d})$ is not $p$-rational. For such a prime $p$ we study the weight distributions of the cyclic codes over $\mathbb{F}_p$ and $\mathbb{Z}_{p^2}$ whose check polynomial is the reciprocal of the said characteristic polynomial. Some of these codes are MDS (reducible case) or NMDS (irreducible case).
Read the full abstract

All authors Minjia Shi, Xuan Wang, Bouazzaoui Zakariae, Jon-Lark Kim, Patrick Solé

Optimization and Control · Cross-listed from cond-mat.stat-mech

Optimal threshold resetting in collective diffusive search

Stochastic resetting has attracted significant attention in recent years due to its wide-ranging applications across physics, biology, and search processes. In most existing studies, however, resetting events are governed by an external timer and remain decoupled from the system's intrinsic dynamics. In a recent Letter by Biswas et al, we introduced threshold resetting (TR) as an alternative, event-driven optimization strategy for target search problems. Under TR, the entire process is reset whenever any searcher reaches a prescribed threshold, thereby coupling the resetting mechanism directly to the internal dynamics. In this work, we study TR-enabled search by $N$ non-interacting diffusive searchers in a one-dimensional box $[0,L]$, with the target at the origin and the threshold at $L$. By optimally tuning the scaled threshold distance $u = x_0/L$, the mean first-passage time can be significantly reduced for $N \geq 2$. We identify a critical population size $N_c(u)$ below which TR outperforms reset-free dynamics. Furthermore, for fixed $u$, the mean first-passage time depends non-monotonically on $N$, attaining a minimum at $N_{\mathrm{opt}}(u)$. We also quantify the achievable speed-up and analyze the operational cost of TR, revealing a nontrivial optimization landscape. These findings highlight threshold resetting as an efficient and realistic optimization mechanism for complex stochastic search processes.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

The quantum mechanics of experiments

This note starts with a recapitulation of what people call the “Measurement Problem” of Quantum Mechanics (QM). The dissipative nature of the quantum-mechanical time-evolution of averages of states over large ensembles of identical isolated systems consisting of matter interacting with the radiation field is discussed and shown to correspond to a stochastic time-evolution of states of individual systems. The importance of dissipation for the successful completion of measurements is highlighted. To conclude, a solution of the “Measurement Problem” is sketched in an idealized model of a double-slit experiment.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Causality is rare: some topological properties of causal quantum channels

Sorkin's impossible operations demonstrate that causality of a quantum channel in QFT is an additional constraint on quantum operations above and beyond the locality of the channel. What has not been shown in the literature so far is how much of a constraint it is. Here we answer this question in perhaps the strongest possible terms: the set of causal channels is nowhere dense in the set of local channels. We connect this result to quantum information, showing that the set of causal unitaries has Haar measure $0$ in the set of all unitaries acting on a lattice. Finally, we close with discussion on the implications and connections to recent QFT measurement models.
Read the full abstract

Information Theory · Cross-listed from cs.LO

A Linear-Size Block-Partition Fibonacci Encoding for Gödel Numbering

We construct an encoding of finite strings over a fixed finite alphabet as natural numbers, based on a block partition of the Fibonacci sequence. Each position in the string selects one Fibonacci number from a dedicated block, with unused indices between blocks guaranteeing non-adjacency. The encoded number is the sum of the selected Fibonacci numbers, and Zeckendorf's theorem guarantees that this sum uniquely determines the selection. The encoding is injective, the string length is recoverable from the code, and the worst-case digit count of the encoded number grows as $\Theta(m)$ for strings of length $m$, matching the information-theoretic lower bound up to a constant factor. We also prove that the natural right-nested use of Rosko's (2025) binary carryless pairing for sequence encoding has worst-case $\Theta(2^m)$ digit growth, an exponential blowup that the block-partition construction avoids entirely.
Read the full abstract

Probability

Matrix liberation process III: Unitary Brownian motion and martingale analysis

We investigate the rate functions that emerge in our previous works towards large deviation principle for the matrix liberation process driven by the unitary Brownian motion as well as the unitary Brownian motion itself. Our approach is grounded in the viewpoint of the martingale problem. Specifically, we formulate and solve a "free martingale problem" within this framework, which provides a new perspective on the underlying stochastic structure.
Read the full abstract

Number Theory

The Prime times of twisted Diophantine approximation

The seminal work of Kurzweil (1955) provides for any fixed badly approximable $\alpha$ and monotonically decreasing $\psi$ a Khintchine-type statement on the set of the inhomogeneous real parameters $\gamma$ for which $\lVert n \alpha + \gamma\rVert \leq \psi(n)$ has infinitely many integer solutions, and further shows that the assumption of $\alpha$ being badly approximable is necessary. In this article, we generalize Kurzweil's statement to restricting $n \in \mathcal{A}$, where $\mathcal{A} \subseteq \mathbb{N}$ is a set with some multiplicative structure. We show that for badly approximable $\alpha$, the result of Kurzweil extends to a general class of sets $\mathcal{A}$, which allows us to establish the Kurzweil-type result in particular along the primes and along the sums of two squares. Furthermore, we construct non-trivial sets $\mathcal{A}$ where the assumption of $\alpha$ being badly approximable is necessary. In particular, this criterion applies to $\mathcal{A}$ being the set of square-free numbers, providing a novel characterization of the badly approximable numbers. These statements in particular allow for improving the best known bounds for $\lVert n \alpha + \gamma\rVert \leq \psi(n)$ for infinitely many $n \in \mathcal{A}$ for fixed badly approximable $\alpha$ and for various sets $\mathcal{A}$ of number-theoretic interest when accepting an exceptional set for $\gamma$ of Lebesgue measure $0$.
Read the full abstract

Information Theory

CSI-tuples-based 3D Channel Fingerprints Construction Assisted by MultiModal Learning

Low-altitude communications can promote the integration of aerial and terrestrial wireless resources, expand network coverage, and enhance transmission quality, thereby empowering the development of sixth-generation (6G) mobile communications. As an enabler for low-altitude transmission, 3D channel fingerprints (3D-CF), also referred to as the 3D radio map or 3D channel knowledge map, are expected to enhance the understanding of communication environments and assist in the acquisition of channel state information (CSI), thereby avoiding repeated estimations and reducing computational complexity. In this paper, we propose a modularized multimodal framework to construct 3D-CF. Specifically, we first establish the 3D-CF model as a collection of CSI-tuples based on Rician fading channels, with each tuple comprising the low-altitude vehicle's (LAV) positions and its corresponding statistical CSI. In consideration of the heterogeneous structures of different prior data, we formulate the 3D-CF construction problem as a multimodal regression task, where the target channel information in the CSI-tuple can be estimated directly by its corresponding LAV positions, together with communication measurements and geographic environment maps. Then, a high-efficiency multimodal framework is proposed accordingly, which includes a correlation-based multimodal fusion (Corr-MMF) module, a multimodal representation (MMR) module, and a CSI regression (CSI-R) module. Numerical results show that our proposed framework can efficiently construct 3D-CF and achieve at least 27.5% higher accuracy than the state-of-the-art algorithms under different communication scenarios, demonstrating its competitive performance and excellent generalization ability. We also analyze the computational complexity and illustrate its superiority in terms of the inference time.
Read the full abstract

All authors Chenjie Xie, Li You, Ruirong Chen, Gaoning He, Xiqi Gao

Combinatorics

Negative Avoiding Sequences

Negative avoiding sequences of span $n$ are periodic sequences of elements from $\mathbb{Z}_k$ for some $k$ with the property that no $n$-tuple occurs more than once in a period and if an $n$-tuple does occur then its negative does not. They are a special type of cut-down de Bruijn sequence with potential position-location applications. We establish a simple upper bound on the period of such a sequence, and refer to sequences meeting this bound as maximal negative avoiding sequences. We then go on to demonstrate the existence of maximal negative avoiding sequences for every $k\geq3$ and every $n\geq2$.
Read the full abstract

Numerical Analysis

An efficient compact splitting Fourier spectral methods for computing the dynamics of rotating spin-orbit coupled spin-2 Bose-Einstein condenstates

This paper investigates the dynamics of spin-2 Bose-Einstein condensates (BECs) with rotation and spin-orbit coupling (SOC). In order to better simulate the dynamics, we present an efficient high-order compact splitting Fourier spectral method. This method splits the Hamiltonian into a linear part, which consists of the Laplace, rotation and SOC terms, and a nonlinear part that includes all the remaining terms. The wave function is well approximated by the Fourier spectral method and is numerically accessed with discrete Fast Fourier transform (FFT). For linear subproblem, the handling of rotation term and SOC term poses a major challenge. Using a function mapping based on rotation, we can integrate the linear subproblem exactly and explicitly. This mapping we propose not only helps eliminate the rotation term, but also prevents the SOC term from evolving into a time-dependent form. The nonlinear subproblem is integrated analytically in physical space. Such "compact" splitting involves only two operators and facilitates the design of high-order splitting schemes. Our method is spectrally accurate in space and high order in time. It is efficient, explicit, unconditionally stable and simple to implement. In addition, we derive some dynamical properties and carry out a systematic study, including accuracy and efficiency tests, dynamical property verification, the SOC effects and dynamics of vortex lattice.
Read the full abstract

All authors Xin Liu, Ziqing Xie, Yongjun Yuan, Yong Zhang, Xinyi Zhao

Information Theory

List Estimation

Classical estimation outputs a single point estimate of an unknown $d$-dimensional vector from an observation. In this paper, we study \emph{$k$-list estimation}, in which a single observation is used to produce a list of $k$ candidate estimates and performance is measured by the expected squared distance from the true vector to the closest candidate. We compare this centralized setting with a symmetric decentralized MMSE benchmark in which $k$ agents observe conditionally i.i.d.\ measurements and each agent outputs its own MMSE estimate. On the centralized side, we show that optimal $k$-list estimation is equivalent to fixed-rate $k$-point vector quantization of the posterior distribution and, under standard regularity conditions, admits an exact high-rate asymptotic expansion with explicit constants and decay rate $k^{-2/d}$. On the decentralized side, we derive lower bounds in terms of the small-ball behavior of the single-agent MMSE error; in particular, when the conditional error density is bounded near the origin, the benchmark distortion cannot decay faster than order $k^{-2/d}$. We further show that if the error density vanishes at the origin, then the decentralized benchmark is provably unable to match the centralized $k^{-2/d}$ exponent, whereas the centralized estimator retains that scaling. Gaussian specializations yield explicit formulas and numerical experiments corroborate the predicted asymptotic behavior. Overall, the results show that, in the scaling with $k$, one observation combined with $k$ carefully chosen candidates can be asymptotically as effective as – and in some regimes strictly better than – this MMSE-based decentralized benchmark with $k$ independent observations.
Read the full abstract

All authors Nikola Zlatanov, Amin Gohari, Farzad Shahrivari, Mikhail Rudakov

Numerical Analysis

Numerical Analysis of a Cut Finite Element Approach for Fully Eulerian Fluid-Structure Interaction with Fixed Interface

This work develops and analyzes a variational-monolithic unfitted finite element formulation of a linear fluid-structure interaction problem in Eulerian coordinates with a fixed interface. The overall discretization is based on a backward Euler scheme in time and finite elements in space. For the spatial discretization we employ a cut finite element method on a mesh consisting of quadrilateral elements. We use a first-order in time formulation of the elasticity equations, inf-sup stable finite elements in the fluid part and Nitsche's method to incorporate the coupling conditions. Ghost penalty terms guarantee the robustness of the approach independently of the way the interface cuts the finite element mesh. The main objective is to establish stability and a priori error estimates. We prove optimal-order error estimates in space and time and substantiate them with numerical tests.
Read the full abstract

All authors Stefan Frei, Tobias Knoke, Marc C. Steinbach, Anne-Kathrin Wenske, Thomas Wick

Dynamical Systems

Global Stability Analysis of the Age-Structured Chemostat With Substrate Dynamics

In this paper we study the stability properties of the equilibrium point for an age-structured chemostat model with renewal boundary condition and coupled substrate dynamics under constant dilution rate. This is a complex infinite-dimensional feedback system. It has two feedback loops, both nonlinear. A positive static loop due to reproduction at the age-zero boundary of the PDE, counteracted and dominated by a negative dynamic loop with the substrate dynamics. The derivation of explicit sufficient conditions that guarantee global stability estimates is carried out by using an appropriate Lyapunov functional. The constructed Lyapunov functional guarantees global exponential decay estimates and uniform global asymptotic stability with respect to a measure related to the Lyapunov functional. From a biological perspective, stability arises because reproduction is constrained by substrate availability, while dilution, mortality, and substrate depletion suppress transient increases in biomass before age-structure effects can amplify them. The obtained results are applied to a chemostat model from the literature, where the derived stability condition is compared with existing results that are based on (necessarily local) linearization methods.
Read the full abstract

Algebraic Geometry

The crisp topology, a refinement of the fpqc topology

We introduce the crisp topology for schemes as a refinement of the fpqc topology. This Grothendieck topology uses the new notion of crisp morphisms, which generalise universal injectivity from ring homomorphisms to arbitrary morphisms of schemes. We study basic properties and demonstrate that this topology is well-behaved.
Read the full abstract

Geometric Topology

Secant-quandle: an invariant of braids and knots

We construct a novel invariant of braids and knots, called the secant-quandle (SQ), derived from homotopy classes of generic secants and generic horizontal trisecants. This invariant provides a natural generalization of the usual knot quandle, capturing richer topological information.
Read the full abstract

Combinatorics

Inverse Kazhdan–Lusztig polynomials of fan matroids

The inverse Kazhdan–Lusztig polynomial of a matroid was introduced by Gao and Xie, and the inverse $Z$-polynomial of a matroid was introduced by Ferroni, Matherne, Stevens, and Vecchi. In this paper, we study these two polynomials for fan matroids, a family of graphic matroids associated with fan graphs. We first derive the generating functions for the inverse Kazhdan–Lusztig polynomials of fan matroids using their recursive definition, and then deduce the explicit formulas of these polynomials therefrom. For the inverse $Z$-polynomials of fan matroids, we obtain their generating functions using a parallel generating function approach, and further derive their explicit expansions based on these generating functions. Additionally, we provide alternative proofs for the above generating functions using the deletion formulas for inverse Kazhdan–Lusztig and inverse $Z$-polynomials. As an application of the explicit formula for inverse Kazhdan–Lusztig polynomials, we prove that the coefficients of the inverse Kazhdan–Lusztig polynomial of the fan matroid form a log-concave sequence with no internal zeros.
Read the full abstract

Optimization and Control

Vertical Contracts for Safety Control

We propose a methodology that exploits the contract formalism to characterize the continuous-time safety control problem, which is often difficult to address, in terms of a discrete-time one, for which numerous efficient solution scheme exist. We construct contracts as pairs of assumptions and guarantees which are set-valued mappings that describe the safe boundaries within which the system must operate. By formalizing safety control as contract implementation, we develop a vertical hierarchy according to which we translate implementation from continuous to discrete time. We accomplish this by constructing a discrete-time system and a contract such that a solution to the continuous-time implementation problem can be characterized in terms of a solution to its discrete-time counterpart. We then use this characterization to construct a control input that establishes implementation in continuous time on the basis of the control sequence that achieves implementation in discrete time.
Read the full abstract