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)

Friday 3 April

Information Theory

From Gaussian Fading to Gilbert-Elliott: Bridging Physical and Link-Layer Channel Models in Closed Form

Dynamic fading channels are modeled at two fundamentally different levels of abstraction. At the physical layer, the standard representation is a correlated Gaussian process, such as the dB-domain signal power in log-normal shadow fading. At the link layer, the dominant abstraction is the Gilbert-Elliott (GE) two-state Markov chain, which compresses the channel into a binary “decodable or not” sequence with temporal memory. Both models are ubiquitous, yet practitioners who need GE parameters from an underlying Gaussian fading model must typically simulate the mapping or invoke continuous-time level-crossing approximations that do not yield discrete-slot transition probabilities in closed form. This paper provides an exact, closed-form bridge. By thresholding the Gaussian process at discrete slot boundaries, we derive the GE transition probabilities via Owen's $T$-function for any threshold, reducing to an elementary arcsine identity when the threshold equals the mean. The formulas depend on the covariance kernel only through the one-step correlation coefficient $\rho = K(D)/K(0)$, making them applicable to any stationary Gaussian fading model. The bridge reveals how kernel smoothness governs the resulting link-layer dynamics: the GE persistence time grows linearly in the correlation length $T_c$ for a smooth (squared-exponential) kernel but only as $\sqrt{T_c}$ for a rough (exponential/Ornstein–Uhlenbeck) kernel. We further quantify when the first-order GE chain is a faithful approximation of the full binary process and when it is not, reconciling two diagnostics, the one-step Markov gap and the run-length total-variation distance, that can trend in opposite directions. Monte Carlo simulations validate all theoretical predictions.
Read the full abstract

Numerical Analysis

Entropy correction artificial viscosity for high order DG methods using multiple artificial viscosities

Entropy stable discontinuous Galerkin (DG) methods display improved robustness for problems with shocks, turbulence, and under-resolved features by enforcing an entropy inequality. Such methods have traditionally relied on entropy conservative (EC) fluxes that are computationally expensive to evaluate. An alternative approach for enforcing an entropy inequality is through a minimally dissipative “entropy correction" artificial viscosity. We review how to construct such an artificial viscosity formulation and extend this approach to multiple types of viscosity (e.g., viscosity and thermal diffusivity). We determine simple analytical expressions for optimal viscosity parameters. We compare this to the case of a single monolithic viscosity parameter for different 1D and 2D problems, and show that the proposed method allows users to more precisely target specific physical phenomena while retaining robustness for general problem settings.
Read the full abstract

Optimization and Control

Observer design for classes of nonlinear port-Hamiltonian systems

This paper presents a systematic observer design methodology for a class of port-Hamiltonian (pH) systems with state-dependent input matrices. Such systems can model a wide range of electromechanical systems, including magnetic levitation systems, MEMS devices, and electro-active polymer actuators such as DEA actuators, HASEL actuators, etc. In these applications, state-dependent input matrices naturally arise when the system is modeled under quasi-static electrical assumptions. An LPV polytopic embedding framework, together with LMI-based synthesis conditions, is proposed. The nonlinear error dynamics are represented as a convex combination of linear vertex systems using an integral mean value representation, which enables systematic computation of the observer gains that ensures exponential convergence. Both constant-gain and gain-scheduled observers are derived. Numerical results demonstrate the effectiveness of the proposed observer, with the gain-scheduled design achieving a significant increase in the maximum certifiable decay rate compared with constant-gain approaches, thereby reducing conservatism.
Read the full abstract

All authors Filippo Ugolini, Ning Liu, Yongxin Wu, Yann Le Gorrec, Alessandro Macchelli

Mathematical Physics

Scattering of TE and TM waves by inhomogeneities of a 2D material, low-frequency behavior of the scattering amplitude, and low-frequency invisibility

The propagation of the transverse electric (TE) and transverse magnetic (TM) waves in an effectively two-dimensional (2D) isotropic medium is described by Bergmann's equation of acoustics. We develop a dynamical formulation of the stationary scattering of these waves and explore its application in the study of the low-frequency behavior of the scattering data. Specifically, we introduce a suitable notion of fundamental transfer matrix for TE and TM waves in 2D. This is an integral operator $\widehat{\mathbf{M}}$ that carries the information about the scattering properties of the medium and admits a Dyson series expansion involving a non-Hermitian Hamiltonian operator. For situations where the inhomogeneities of the medium are confined to a layer of thickness $\ell$, we use the Dyson series for $\widehat{\mathbf{M}}$ to construct the series expansion of the scattering amplitude in powers of $k\ell$, where $k$ is the incident wavenumber. We derive analytic expressions for the leading- and next-to-leading-order terms of this series, verify the effectiveness of their application to a class of exactly solvable models, and use them to study low-frequency invisibility. In particular, we develop a low-frequency cloaking scheme which is applicable for both TE and TM waves. Our results have immediate applications in the study of low-frequency scattering of acoustic waves in a 2D fluid as these waves are also described by Bergmann's equation.
Read the full abstract

Number Theory

A generalization of Bressoud's beautiful bijection

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes equinumerosity and provides an explicit constructive mapping. The second is a generalization to any natural d, preserving bijectivity. It shows the combinatorial structure remains stable under changes in the parameter, with Young diagrams serving as a universal language. A notable and non-obvious aspect of this generalization is the symmetry revealed in the construction. Intuitively, it was not evident that one could consider not only the natural order of residues but also any permutation of them.
Read the full abstract

Probability

Persistence of the Wiener sausage: sampling stability and limit theorems for Betti-curve functionals of drifted planar Brownian motion

We study the persistent homology of the offset filtration generated by the range of a planar Brownian motion with constant nonzero drift (Wiener sausages of increasing radius). We prove what are, to our knowledge, the first law of large numbers and central limit theorem for its smoothed Betti-curve functionals. For every bounded Borel weight $\psi$ supported in a compact radius window $[r_0,r_1]\subset(0,\infty)$, the functional $\Phi_\psi(T)=\int_{r_0}^{r_1}\beta_1(T,r)\psi(r)\,dr$, where $\beta_1(T,r)$ counts the holes of the radius-$r$ sausage at time $T$, satisfies $\Phi_\psi(T)/T\to\rho_\psi$ almost surely and in every $L^p$, for a deterministic constant $\rho_\psi$. This yields a finite positive Betti-curve intensity measure on the radius axis, which we identify as absolutely continuous through a fixed-radius law of large numbers along regeneration times, valid at almost every radius. We also prove Gaussian fluctuations at scale $\sqrt{T}$, for one weight and jointly for finitely many, with a Green-Kubo variance over the regeneration cycles. The proof combines a renewal structure along the drift direction, obtained by the method of Sznitman and Zerner without invoking the strong Markov property at the cut times, with a Mayer-Vietoris control of the non-additivity of topology under concatenation and a deterministic bound on the integrated hole count of a planar offset proved in a companion paper. A sampling theorem bounds the bottleneck distance between the diagram of the continuous filtration and that of a time-sampled point cloud by the pathwise modulus of continuity, placing these objects in a data-analytic framework.
Read the full abstract

Probability

Exit times from time-dependent random domains: continuity, weak convergence, and exit-time profiles

We study exit times from time-dependent domains under joint perturbations of the trajectory and the domain. Representing a moving domain as the negativity set of a continuous barrier on space-time, we reduce the exit problem to a one-dimensional first-passage problem for the scalarized path, namely the barrier evaluated along the trajectory. Our first main result is a deterministic continuity theorem: the exit-time functional is continuous, under Skorokhod J1 convergence of the path and locally uniform convergence of the barrier, at every configuration satisfying an explicit nontangency condition (NT). This condition is sharp: it characterizes the continuity set of the functional. As a consequence, exit times converge in distribution whenever paths and barriers converge jointly in distribution and the limiting pair satisfies (NT) almost surely; no independence or other structural restriction between trajectory and domain is required. Our second main result is a functional limit theorem: the profile of exit times indexed by the barrier level, regularized to be right-continuous on a compact level interval, converges in distribution in the Skorokhod M1 topology under the same joint convergence, provided the limiting pair satisfies (NT) almost surely at the two end levels; an example shows that J1 convergence can fail. Verification routes for (NT) are provided, including a non-characteristic criterion for Ito diffusions. The framework is illustrated by two Donsker-type examples; in the second one, the domain is random, is approximated jointly with the trajectory, and is coupled to the state.
Read the full abstract

2604.03129 · 3 Apr · This new version (version 2) supersedes version 1, which was titled "Exit times from time-dependent random domains: continuity, weak convergence, and exit-time profiles Draft - currently under review at Stochastic Processes and their Applications". It corrects errors in version 1 and extends and strengthens its results. The manuscript is currently under review at SPA (round 2)

Mathematical Physics · Cross-listed from hep-th

Worldsheet Duals to One-Matrix Models

We derive a concrete closed string dual to any interacting Hermitian one-matrix model, away from the double-scaling limit. Matrix and string correlators manifestly agree, to all orders in the genus expansion and all orders in the 't Hooft coupling(s). The worldsheet theory consists of a supersymmetric B-twisted Landau-Ginzburg model coupled to 2d topological gravity. We provide a precise dictionary between traces of the matrix and vertex operators on the worldsheet. Matrix model correlators are explicitly mapped to computable integrals over the moduli space of Riemann surfaces. We perform several direct cross-checks on both sides of the duality. This work furnishes a detailed instantiation of gauge/string duality, in the standard 't Hooft regime, and hopefully a useful worldsheet toy model for the AdS/CFT correspondence, away from the free field limit.
Read the full abstract

Probability

First Passage through a Continuous Barrier: Pathwise Decomposition, Random-Time Structure, and Compensators

Let t be the first-passage time of a continuous barrier by a càdlàg adapted process. We show that t admits a canonical fourfold pathwise decomposition into continuous contact, contact from the left followed by an upward jump, exact hit by jump, and strict overshoot by jump from below. This refinement is more informative than the classical contact-versus-overshoot dichotomy for random-time purposes, because it separates modes with different predictability properties. In particular, the left-contact component always defines an accessible stopping time and becomes predictable under a no-premature-left-contact condition, which we prove to be both sufficient and necessary for the canonical running-supremum announcing sequence to work. On the gap side, under a structural exclusion of predictable gap-crossings, the corresponding restricted time is totally inaccessible. In the semimartingale setting, we obtain a sharp compensator criterion for the predictable-side condition, explicit compensator formulas for the jump-driven crossing modes, and a decomposition of the compensator of the default indicator into its predictable jump part and continuous part. As an application, for a mean-reverting affine jump-diffusion with upward exponential jumps, we derive the boundary-value problem governing the overshoot mode, prove that the differentiated third-order ODE is equivalent to the original problem only when a boundary compatibility condition is retained, and establish verification and uniqueness for the discounted problem. This yields an explicit Green-Volterra representation, a first-order small-q expansion expansion, and, in the undiscounted case, closed formulas for the overshoot and creeping probabilities
Read the full abstract

Optimization and Control

Swarm-Based Inertial Methods for Optimization

We introduce a new class of swarm-based inertial methods (SBIMs) for global minimization, formulated as coupled dissipative inertial dynamical systems derived from the generalized Onsager principle. The proposed framework identifies the friction operator and the scaling of the potential energy, namely the objective function to be minimized, as the key ingredients governing relaxation dynamics over the energy landscape. Within this framework, we propose a new underdamped inertial dynamics whose damping mechanisms incorporate both gradient and Hessian information, allowing the system to adjust damping or acceleration according to the agent trajectories and the curvature of the landscape. Under suitable conditions, we prove that the underdamped system satisfies an energy dissipation law, from which we establish an upper bound on the asymptotic decay rate of the gap between the objective function and its global minimum, given by $O(1/\delta(t))$ (defined in \S 3). We further construct structure-preserving discretizations that retain both discrete energy dissipation and the convergence rate estimate, $O(1/\delta_k)$ (defined in \S3). In addition, we present several other efficient numerical algorithms for the dynamical system. Numerical experiments for all proposed algorithms validate the theory on convex test problems and demonstrate convergence rates in function values that are substantially faster than the theoretical guarantees ($O(1/\delta_k)$). On nonconvex benchmark problems, the proposed methods achieve high success rates in reaching the global minimum, and exhibit more stable energy decay than swarm-based gradient descent and Nesterov methods. Overall, this work provides a systematic framework for the construction and analysis of SBIMs from an energy-dissipative perspective.
Read the full abstract

Numerical Analysis

Nested Multilevel Monte Carlo with Preintegration for Efficient Risk Estimation

Nested Monte Carlo is widely used for risk estimation, but its efficiency is limited by the discontinuity of the indicator function and high computational cost. This paper proposes a nested Multilevel Monte Carlo (MLMC) method combined with preintegration for efficient risk estimation. We first use preintegration to integrate out one outer random variable, which effectively handles the discontinuity of the indicator function, then we construct the MLMC estimator with preintegration to reduce the computational cost. Our theoretical analysis proves that the strong convergence rate of the MLMC combined with preintegration reaches -1, compared with -1/2 for the standard MLMC. Consequently, we obtain a nearly optimal computational complexity. Besides, our method can also handle the high-kurtosis phenomenon caused by indicator functions. Numerical experiments verify that the smoothed MLMC with preintegration outperforms the standard MLMC and the optimal computational cost can be attained. Combining our method with quasi-Monte Carlo further improves its performance in high dimensions. Keywords: Nested simulation, Multilevel Monte Carlo, Risk estimation, Preintegration
Read the full abstract

Combinatorics

Range of random $\mathbb Z$-homomorphisms on weak expanders

We prove that random $\mathbb{Z}$-homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff for expanders, we first show that on any bipartite $(n, d, \lambda)$-graph with $\lambda \leq (1-\delta)d$, a uniformly chosen $\mathbb{Z}$-homomorphism has a range at most $O(\log \log n)$ with high probability, which is tight up to a constant factor. This provides an affirmative answer to their question in the spectral setting. As a concrete application, we prove that a random $\mathbb{Z}$-homomorphism on the middle layers of the Hamming cube takes at most $5$ values with high probability. This shows that the $O(1)$-flatness for the full Hamming cube, proved by Kahn and Galvin, persists even when the rigid structural properties are relaxed.
Read the full abstract

Algebraic Geometry

Hilbert scheme of points on non-reduced nodal curves

We construct a stratification of the punctual Hilbert scheme of points on a non-reduced and nodal plane curve, $x^uy^v=0$. Each stratum is indexed by a new combinatorial object we define: a weak diagonal partition. The approach is based on introducing filtrations on ideals, together with a valuation adapted to the non-reduced structure, which allows us to analyze generators and their degrees of freedom in a systematic way. In particular, each stratum is affine when $u=1,2$; and each stratum is isomorphic to an algebraic torus times an affine space, $(\mathbb{C}^*)^{m_1} \times \mathbb{C}^{m_2}$, when $u=v,v-1,v-2$. We consequently compute the Poincaré polynomials of the punctual Hilbert scheme of points on curves $x^uy^v=0$ when $u=1,2,v-2,v-1,v$. As an application, we prove the colored Oblomkov-Rasmussen-Shende conjecture for the Hopf link for $u=1, v$ arbitrary, showing that the Poincaré polynomial is the row-colored link homology up to change of variables.
Read the full abstract

Numerical Analysis

An unconditionally stable space-time isogeometric method for a biharmonic wave equation

This work presents a space-time isogeometric analysis of biharmonic wave problem, in contrast to the more common application of space-time methods to second order wave equations. We first establish the unique solvability of the continuous space-time variational formulation. In order to obtain $H^2$- conforming discretization of the biharmonic wave equation, we consider globally smooth B-spline functions having continuity higher than $C^0$. We prove that the resulting space-time discrete formulation is stable under a Courant-Friedrichs-Lewy (CFL) condition. Furthermore, we propose a stabilized formulation, achieved by adding a non-consistent penalty term, which yields unconditional stability. Exploiting the tensor product structure, an efficient direct solver is also provided for solving the linear system arising from the discrete formulation. A few numerical experiments are presented to demonstrate the stability and convergence properties of the proposed scheme as well as the efficiency of the proposed solver.
Read the full abstract

Representation Theory

On Zeta functions and $\mu$-series of string algebras

Let $\overline\mu_\Lambda(t):=\sum\limits_{m\geq1}\mu_\Lambda(m)t^m$ be the \emph{$\mu$-series} of a finite-dimensional tame algebra $\Lambda$ over an algebraically closed field, where $\mu_\Lambda(m)$ denotes the minimal number of one-parameter families of $\Lambda$-modules with total dimension $m$. When $\Lambda$ is a string algebra with $\mathrm{Ba}(\Lambda)$ as its set of bands up to cyclic permutation, define the zeta function $\zeta_\Lambda(t):=\prod\limits_{\mathfrak b\in\mathrm{Ba}(\Lambda)}(1-t^{|\mathfrak b|})^{-1}$, where $|\mathfrak b|$ is the length of $\mathfrak b$. We prove an analogue of the prime number theorem for string algebras and use it to conclude that non-domestic string algebras are of exponential growth. Finally, we show that a string algebra is domestic if and only if its $\mu$-series is rational.
Read the full abstract

Numerical Analysis

High-order parametric local discontinuous Galerkin methods for anisotropic curve-shortening flows

We propose a family of high-order local discontinuous Galerkin (LDG) methods, built on a parametric representation and coupled with a semi-implicit backward Euler time discretization, for isotropic and anisotropic curve-shortening flows. The spatial LDG formulation introduces auxiliary variables and carefully designed numerical fluxes which inherit the underlying variational structure. We prove unconditional energy dissipation for the semidiscrete scheme and establish energy dissipation and well-posedness for the fully discrete scheme under certain assumptions. For $P^k$ approximations, the LDG method achieves high-order spatial convergence; extensive numerical experiments confirm optimal $(k+1)$-order accuracy when the surface energy is isotropic or weakly anisotropic. Compared to classical parametric finite element methods (PFEM), the proposed LDG schemes do not need to rely on good mesh distributions or auxiliary symmetrized surface energy matrices for strongly anisotropic surface energy cases, and remain numerically stable on severely degraded meshes that typically cause PFEMs failure. This intrinsic stability enables effective capture of complex geometric evolution and sharp corner singularities produced by strong anisotropy. The approach thus provides a flexible and reliable framework for the numerical simulation of a broader class of geometric flows.
Read the full abstract

Combinatorics

Spectral Properties of Zero-Divisor Graphs of Truncated Polynomial Rings

Let $R$ be a commutative ring with identity and let $Z^{\ast}(R)$ denote the set of nonzero zero-divisors of $R$. The zero-divisor graph $ \varGamma(R)$ is the simple graph with vertex set $V( \varGamma(R))=Z^{\ast}(R)$, where two distinct vertices$x,y\in Z^{\ast}(R)$ are adjacent if and only if $xy=0$ in $R$. In this paper we investigate the zero-divisor graph of the truncated polynomial ring $R=\mathbb{Z}_{p}[x]/\langle x^{c}\rangle,$ for $c\in\mathbb{N}.$ We determine the spectrum of the $A_{\alpha}$-matrix associated with $ \varGamma(R)$, and, as special cases, explicitly obtain both the adjacency spectrum and the signless Laplacian spectrum of $ \varGamma(R)$. Furthermore, we prove that the Laplacian eigenvalues, as well as the distance eigenvalues, of these graphs are all integers.
Read the full abstract

Dynamical Systems

Expansiveness of vertical subgroups of the Heisenberg group

In the paper we study expansiveness along distinguished subsets in the case of a continuous action of the discrete Heisenberg group on a compact metric space $(\mathbb X,\rho)$. Transferring the ideas proposed by Boyle and Lind for continuous actions of $\mathbb{Z}^D$, we embed the acting group in the (continuous) $(2D+1)$-dimensional Heisenberg group $\mathcal H$ and define expansive subsets of $\mathcal H$. We focus on the expansiveness of vertical subgroups of the Heisenberg group. In particular, we show that, if only the space $\mathbb X$ is infinite, the center of $\mathcal H$ cannot be expansive, and that there always exists at least one nonexpansive $2D$-dimensional vertical subgroup.
Read the full abstract

Numerical Analysis

A High-Order Fast Direct Solver for Surface PDEs on Triangles

We develop a triangular formulation of the hierarchical Poincaré-Steklov (HPS) method for elliptic partial differential equations on surfaces, allowing high-order discretizations on unstructured meshes and complex geometries. Classical HPS formulations rely on high-order quadrilateral meshes and tensor-product spectral discretizations, which enable efficient algorithms but restrict applicability to structured geometries. To overcome this restriction, we introduce a triangle-based hierarchical Poincaré-Steklov scheme (THPS) built on orthogonal Dubiner polynomial bases. As in the classical HPS framework, local solution operators and Dirichlet-to-Neumann maps are constructed and merged hierarchically, yielding a fast direct solver with $O(N \log N)$ complexity for repeated solves on meshes with $N$ elements. The reuse of precomputed operators makes the method particularly effective for implicit time-stepping of surface PDEs. Numerical experiments demonstrate that the proposed method retains spectral accuracy and achieves high-order convergence for a range of static and time-dependent test problems.
Read the full abstract

Number Theory

Functoriality and the theta correspondence

We study the functoriality of the local theta correspondence for classical $p$-adic groups. This is realized via the adaptation of the Adams conjecture to ABV-packets. We provide evidence for the conjecture, especially in the case of general linear groups.

Dynamical Systems · Cross-listed from eess.SY

On Data-Driven Koopman Representations of Nonlinear Delay Differential Equations

This work establishes a rigorous bridge between infinite-dimensional delay dynamics and finite-dimensional Koopman learning, with explicit and interpretable error guarantees. While Koopman analysis is well-developed for ordinary differential equations (ODEs) and partially for partial differential equations (PDEs), its extension to delay differential equations (DDEs) remains limited due to the infinite-dimensional phase space of DDEs. We propose a finite-dimensional Koopman approximation framework based on history discretization and a suitable reconstruction operator, enabling a tractable representation of the Koopman operator via kernel-based extended dynamic mode decomposition (kEDMD). Deterministic error bounds are derived for the learned predictor, decomposing the total error into contributions from history discretization, kernel interpolation, and data-driven regression. Additionally, we develop a kernel-based reconstruction method to recover discretized states from lifted Koopman coordinates, with provable guarantees. Numerical results demonstrate reliable prediction of nonlinear delay systems, with potential relevance to future control applications.
Read the full abstract

All authors Santosh Mohan Rajkumar, Dibyasri Barman, Kumar Vikram Singh, Debdipta Goswami

Analysis of PDEs

Embedding transmission problems for Maxwell's equations into elliptic theory

We embed general boundary value problems for the time-harmonic Maxwell equations into the elliptic boundary value theory. This is achieved by introducing two new scalar functions to the electromagnetic field and imposing additional boundary conditions, after which the problem becomes elliptic. The results are applied to general problems for Maxwell's equations in bounded and unbounded domains, as well as to the transmission problem with inhomogeneities on the right-hand side of the equations and at all boundaries. Relations between the inhomogeneities of the elliptic problem are established that provide a one-to-one correspondence between the solutions of Maxwell's problem and the solutions of the elliptic boundary value problem. As an application, the existence of an orthogonal basis from the eigenfunctions of the general Maxwell's problem is justified.
Read the full abstract

Logic

An unstable abstract elementary class of modules: A variation of Paolini-Shelah's example

We construct a class $\hat{K}$ of torsion-free abelian groups such that $\hat{\mathbf{K}}=(\hat{K}, \leq_p)$ is an abstract elementary class with $\operatorname{LS}(\hat{\mathbf{K}})=\aleph_0$ such that: $(\cdot)$ $\hat{\mathbf{K}}$ is not stable; $(\cdot)$ $\hat{\mathbf{K}}$ has the joint embedding property and no maximal models, but does not have the amalgamation property; $(\cdot)$ $\hat{\mathbf{K}}$ is $(<\aleph_0)$-tame. The class we construct is a variation of [PaSh, Section 4] which isolates the core mechanism of the Paolini-Shelah construction.
Read the full abstract

Optimization and Control

The Quadratic Bin Packing Problem: Exact Formulations and Algorithm

In this article, we introduce and study the Quadratic Bin Packing Problem (QBPP), which generalizes the classical bin packing problem by introducing a fixed cost for each used bin and a pairwise cost (or profit) incurred whenever two items are packed together. Beyond its theoretical relevance, the QBPP is of practical interest due to its numerous real-world applications, mainly related to cluster analysis. To address the QBPP, we propose three compact mixed-integer linear programming (MILP) formulations, along with a set-partitioning formulation. For each compact model, we present an enhanced version with a strengthened continuous relaxation, while, for the set-partitioning formulation, we develop a tailored Branch-and-Price algorithm. Computational experiments on benchmark instances demonstrated that, while the enhanced compact formulations can be effectively solved by a standard MILP solver for small-sized instances, the Branch-and-Price approach delivered superior performance overall, especially on larger and more challenging instances.
Read the full abstract

All authors Vítor Gomes Chagas, Alberto Locatelli, Flávio Keidi Miyazawa, Manuel Iori

Numerical Analysis

A Construction of $C^{r}$ Conforming Finite Elements on the Alfeld Split in Any Dimension

Constructing $C^r$ conforming finite element spaces in any dimension is a long-standing problem. For general triangulations, this problem was recently addressed by Hu-Lin-Wu (2024), under certain conditions on supersmoothness and polynomial degree. In this paper, a first unified construction on the Alfeld split in any dimension is given, where the supersmoothness conditions and the polynomial degree requirement are relaxed.
Read the full abstract

Metric Geometry

On the Inscribed Sphere and Concurrent Lines through the Centers of Apollonius Spheres in $\mathbb{R}^n$

The Apollonius problem asks for a sphere tangent to $n+1$ given spheres or hyperplanes in $\mathbb{R}^n$. This problem has been widely studied for an isolated configuration of $n+1$ spheres. In this paper, we study relations among the solutions of the Apollonius problem arising from a common family of spheres within the framework of Lie sphere geometry. More precisely, we consider a configuration of $n+2$ spheres in $\mathbb{R}^n$ and the solutions of the Apollonius problem corresponding to all its subsets of size $n+1$. The first main result concerns lines passing through the centers of pairs of solutions to the Apollonius problem. We prove that all these lines intersect at a single point $P_X$. We then introduce a two–step construction of further Apollonius spheres and show that the lines determined by their centers also pass through $P_X$. This yields numerous applications in two and three dimensions and, at the same time, automatically extends them to $\mathbb{R}^n$. The second main result is an $n$–dimensional generalization of K. Morita's three-dimensional theorem on the inscribed sphere in a configuration of mutually tangent spheres. We show that Morita's theorem is a special case of our result for an arbitrary configuration of $n+2$ spheres in $\mathbb{R}^n$, not necessarily mutually tangent. Moreover, we connect this result with the preceding ones by proving that the center of the corresponding inscribed sphere is again the point $P_X$.
Read the full abstract

Algebraic Geometry

On de Rham–Witt Cohomology of Classifying Stacks

We give an example of proper smooth fourfold over a perfect field k of characteristic p > 0 with asymmetric Hodge–Witt numbers in total degree 3. Our example is sharp both in terms of dimension and total degree. We arrive at our example by computing and approximating the Hodge–Witt cohomology groups of the classifying stack B alpha_p.
Read the full abstract

Analysis of PDEs

Linear Asymptotic Stability of the Smooth 1-Solitons for the Degasperis-Procesi Equation

In this paper, we study the asymptotic stability of smooth 1-solitons in the Degasperis-Procesi (DP) equation. Such solutions necessarily exist on a non-zero background, and their spectral and orbital stability has previously been verified by Li, Liu & Wu and by Lafortune & Pelinovsky. Using the complete integrability of the DP equation to establish the strong spectral stability of smooth solitary waves, namely that the origin is the only eigenvalue of the associated linearized operator acting on $L^2(\mathbb{R})$ and that, moreover, in appropriate exponentially weighted spaces the non-zero spectrum for the linearized operator admits a spectral gap away from the imaginary axis. This spectral gap result {{is then}} upgraded to an exponential decay estimate on the semigroup associated with the linearized operator, establishing a linear asymptotic stability result in exponentially weighted spaces. Finally, we outline analytical challenges with extending our result to the nonlinear level.
Read the full abstract

Analysis of PDEs

Regularization operators for identifying the unknown source in the time-fractional convection-diffusion-reaction equation

This article presents a mathematical study of the problem of identifying a time-dependent source term in transport processes described by a timefractional parabolic equation, based on noisy time-dependent measurements taken at an arbitrary position. The problem is analytically solved using Fourier techniques, and it is shown that the solution is unstable. To address this instability, three one-parameter families of regularization operators are proposed, each designed to counteract the factors responsible for the instability of the inverse operator. Additionally, a new rule for selecting the regularization parameter is introduced, and an error bound is derived for each estimate. Numerical examples with varying characteristics are provided to illustrate the advantages of the proposed strategies.
Read the full abstract

Metric Geometry

A New Lemoine-Type Circle Construction

This paper presents a new Lemoine-type construction arising from a configuration of six concyclic points. We prove the concyclicity result, establish a converse theorem, and relate the resulting circle to previously known Lemoine circles, in particular the circle introduced by Q. T. Bui. We also note that the resulting circle does not belong to the family of Tucker circles.
Read the full abstract