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)

Tuesday 14 April

Optimization and Control · Cross-listed from stat.ML

Rare Event Analysis via Stochastic Optimal Control

Rare events such as conformational changes in biomolecules, phase transitions, and chemical reactions are central to the behavior of many physical systems, yet they are extremely difficult to study computationally because unbiased simulations seldom produce them. Transition Path Theory (TPT) provides a rigorous statistical framework for analyzing such events: it characterizes the ensemble of reactive trajectories between two designated metastable states (reactant and product), and its central object–the committor function, which gives the probability that the system will next reach the product rather than the reactant–encodes all essential kinetic and thermodynamic information. We introduce a framework that casts committor estimation as a stochastic optimal control (SOC) problem. In this formulation the committor defines a feedback control–proportional to the gradient of its logarithm–that actively steers trajectories toward the reactive region, thereby enabling efficient sampling of reactive paths. To solve the resulting hitting-time control problem we develop two complementary objectives: a direct backpropagation loss and a principled off-policy Value Matching loss, for which we establish first-order optimality guarantees. We further address metastability, which can trap controlled trajectories in intermediate basins, by introducing an alternative sampling process that preserves the reactive current while lowering effective energy barriers. On benchmark systems, the framework yields markedly more accurate committor estimates, reaction rates, and equilibrium constants than existing methods.
Read the full abstract

All authors Yuanqi Du, Jiajun He, Dinghuai Zhang, Eric Vanden-Eijnden, Carles Domingo-Enrich

Combinatorics

Fractional Strict Degeneracy of Graphs

DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by Dvořák and Postle in 2015. The DP-chromatic number of a graph $G$, $\chi_{_{DP}}(G)$, is the analogue of the chromatic number of $G$ in the DP context and is bounded above by the degeneracy of $G$ plus one. Over the last two years a plethora of authors have introduced variations on the notion of degeneracy and used these new ideas to give improved bounds on the DP-chromatic number of certain families of graphs. Fractional DP-coloring is a generalization of fractional list coloring introduced by Bernshteyn, Kostochka, and Zhu in 2019. In this paper we introduce two analogues of the degeneracy of a graph to the fractional context, each of which bound its fractional DP-chromatic number from above. We use these analogues to bound the fractional DP-chromatic number of a variety of graphs including unicyclic graphs, some complete bipartite graphs, and sparse graphs.
Read the full abstract

Numerical Analysis

A robust iterative scheme for the slightly compressible Darcy-Forchheimer equations

We study the slightly compressible Darcy-Forchheimer equations modeling gas flow in porous media, particularly in applications related to combustion processes. The equations are discretized in time using the backward Euler method and in space via a mixed finite element scheme. As a result, a nonlinear algebraic system is obtained at each time step. We propose and analyze a general iterative linearization scheme for the efficient solution of such systems and study its convergence properties at the discrete level. The performance and robustness of the scheme are assessed through a series of numerical experiments. The method is compared with standard iterative solvers, and further tested on problems with discontinuous permeability fields. The results demonstrate its reliability and competitiveness in regimes characterized by strong nonlinear effects.
Read the full abstract

All authors Laura Portero, Andrés Arrarás, Francisco J. Gaspar, Florin A. Radu

Symplectic Geometry

Reduced Gromov-Witten invariants without ghost bubble censorship

We give a definition of all-genus reduced Gromov-Witten invariants of symplectic manifolds by using effectively supported multivalued perturbations on derived orbifold/Kuranishi charts, which bypasses the hard analytical result of sharp compactification/ghost bubble censorship of Zinger, Doan-Walpuski, and Ekholm-Shende.
Read the full abstract

Numerical Analysis · Cross-listed from cs.AI

Numerical Instability and Chaos: Quantifying the Unpredictability of Large Language Models

As Large Language Models (LLMs) are increasingly integrated into agentic workflows, their unpredictability stemming from numerical instability has emerged as a critical reliability issue. While recent studies have demonstrated the significant downstream effects of these instabilities, the root causes and underlying mechanisms remain poorly understood. In this paper, we present a rigorous analysis of how unpredictability is rooted in the finite numerical precision of floating-point representations, tracking how rounding errors propagate, amplify, or dissipate through Transformer computation layers. Specifically, we identify a chaotic "avalanche effect" in the early layers, where minor perturbations trigger binary outcomes: either rapid amplification or complete attenuation. Beyond specific error instances, we demonstrate that LLMs exhibit universal, scale-dependent chaotic behaviors characterized by three distinct regimes: 1) a stable regime, where perturbations fall below an input-dependent threshold and vanish, resulting in constant outputs; 2) a chaotic regime, where rounding errors dominate and drive output divergence; and 3) a signal-dominated regime, where true input variations override numerical noise. We validate these findings extensively across multiple datasets and model architectures.
Read the full abstract

All authors Chashi Mahiul Islam, Alan Villarreal, Mao Nishino, Shaeke Salman, Xiuwen Liu

Differential Geometry

New examples of affine Calabi-Yau 3-folds with maximal volume growth

We construct examples of complete Calabi-Yau metrics on smoothings of 3-dimensional Calabi-Yau cones that are not products of lower-dimensional Calabi-Yau cones and that have orbifold singularities away from the vertex.

Mathematical Physics

Deferred Cyclotomic Representation for Stable and Exact Evaluation of q-Hypergeometric Series

We introduce a cyclotomic representation for finite $q$-hypergeometric series and $q$-deformed amplitudes that separates algebraic structure from evaluation. By expressing each summand in a sparse exponent basis over irreducible cyclotomic polynomials, all products and ratios of quantum factorials reduce to integer vector arithmetic. This ensures that cancellations between numerator and denominator are resolved exactly prior to any evaluation. This formulation yields the deferred cyclotomic representation (DCR), a parameter-independent combinatorial object of the series, from which evaluation in any target field is realized as a ring homomorphism. For quantum recoupling coefficients, we demonstrate that this framework achieves linear memory scaling in the compilation phase, eliminates intermediate expression swell in exact arithmetic, and substantially extends the range of reliable double-precision computation by reducing cancellation-induced error amplification. Beyond its computational advantages, the DCR provides a unified perspective on $q$-deformed amplitudes. Structural properties like admissibility at roots of unity, and the classical limit all emerge as intrinsic properties of a single underlying combinatorial object.
Read the full abstract

Geometric Topology

Boundary Dehn twists are often commutators

For $X$ any complete intersection of even complex dimension or any connected sum thereof (or, more generally, any space among certain broad classes of smooth manifolds), we concretely construct diffeomorphisms $a,c$ of punctured $X$ rel boundary whose commutator $[a,c]$ represents the smooth mapping class (rel boundary) of the boundary Dehn twist. This shows that boundary Dehn twists on 4-manifolds known to be nontrivial in the smooth mapping class group rel boundary by work of Baraglia-Konno, Kronheimer-Mrowka, J. Lin, and Tilton become trivial after abelianization, generalizing work of Y. Lin, who applied an argument based on the global Torelli theorem and an obstruction of Baraglia-Konno to prove that the abelianized boundary Dehn twist on the punctured $K3$ surface is trivial.
Read the full abstract

History and Overview of Mathematics

From Manipulation to Abstraction: The Impact of Flexible Decomposition on Numerical Competence in Primary School

This study examines a structured instructional approach to the decomposition and recomposition of large numbers in six primary school classes (three 4th-grade and three 5th-grade, N = 120), using a quasi-experimental pre-test/post-test design with a control group and a four-week delayed post-test. The 12-week intervention follows the Concrete-Pictorial-Abstract (CPA) progression. The experimental groups achieved mean gains of 34.0 points (4th grade) and 29.6 points (5th grade) out of 100, against 16.4 and 11.1 points in the control groups (all p < 0.001). The Time x Group interaction in the mixed ANOVA gave partial $\eta^2$ = 0.931. An ANCOVA with the pre-test as covariate estimated an adjusted difference of 18.25 points, 95% CI [17.59, 18.92], F(1, 117) = 2,978.10, p < 0.001, partial $\eta^2$ = 0.962. The advantage was present on all five components of the test. At the delayed post-test the experimental groups retained 93.7% of their gain, against 78.6% in the control groups. Internal consistency of the instrument at pre-test was acceptable (Cronbach's $\alpha$ = 0.735). The effects are unusually large, and the limits of the design that bear on their interpretation are discussed.
Read the full abstract

Dynamical Systems

The interplay between partial specification, average shadowing, and Besicovitch completeness

Let $(X,T)$ be a compact dynamical system. This article proves that if $(X,T)$ has the partial specification property, then it has the average shadowing property. It is also proven that if $(X,T)$ is surjective and has the partial specification property, then the set of ergodic measures of $(X,T)$ is dense in the space of its invariant measures. An example of a compact dynamical system that is not Besicovitch complete is also given.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Bilinear products and the orthogonality of quasinormal modes on hyperboloidal foliations

We explore the properties of bilinear products for black-hole quasinormal modes (QNMs) formulated on hyperboloidal foliations. We find that, although QNM solutions are smooth and finite on future-directed hyperboloids, the integrand of the bilinear form with respect to which the modes are orthogonal is still divergent. This is a result of the reflection (equivalently, CPT) transformation required in the definition of the products, which modifies the behaviour of the integrand at the boundaries. We present several regularisation procedures that yield a finite and well-defined bilinear form. In addition, we examine an alternative definition of the bilinear products that incorporates flux contributions, discussing its advantages and limitations. Finally, we define the QNM excitation factors and coefficients within the hyperboloidal framework in terms of the bilinear products, and compute them explicitly for a choice of mode numbers and constant initial data. For concreteness, we work with the QNMs associated to scalar perturbations of the Schwarzschild family of spacetimes.
Read the full abstract

All authors Marica Minucci, Rodrigo Panosso Macedo, Christiana Pantelidou, Laura Sberna

Optimization and Control

HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization

This paper presents HUANet, a constrained deep neural network architecture that unrolls the Alternating Direction Method of Multipliers (ADMM) into a trainable neural network for accelerating parametric constrained convex optimization. Existing end-to-end learning methods operate as black-box mappings from parameters to solutions, often without explicitly incorporating optimality principles or guaranteeing constraint satisfaction. To address these limitations, HUANet embeds a hard-constrained neural network within each unrolled ADMM iteration, where a differentiable correction stage enforces the affine equalities of the primal subproblem. Furthermore, we incorporate first-order optimality conditions into a self-supervised training loss to promote the convergence of the proposed unrolled algorithm. Extensive numerical experiments for benchmark optimization problems and a control application demonstrate and validate the effectiveness of HUANet in accelerating constrained convex optimization solving.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Covariant phase space approach to noncommutativity in tensile and tensionless open strings

We study noncommutativity in open strings using the covariant phase space formalism. For tensile open strings in a constant Kalb-Ramond background, we show that the (pre)-symplectic current splits into a bulk kinetic term plus an exact boundary term, recovering the Seiberg-Witten noncommutativity parameter. We then extend the analysis to intrinsically tensionless strings. In the absence of background fields, the reduced phase space is degenerate and carries no intrinsic Poisson structure. In the presence of a constant Kalb-Ramond field, the symplectic current localises entirely on the boundary, so that the physical phase space becomes purely boundary-supported and the endpoint coordinates acquire a noncommutative Poisson algebra. Including a boundary gauge-field coupling similarly leads to a boundary symplectic form governed by the effective Born-Infeld combination on the D-brane. Our results provide a unified description of noncommutativity in both tensile and tensionless open strings.
Read the full abstract

Probability

The Distributional Tail of Worst-Case Quickselect

We study the almost surely finite random variable $S$ defined by the distributional fixed-point equation \[ S \stackrel{d}{=} 1 + \max\{US', (1-U)S''\}, \qquad U \sim \mathrm{Unif}(0,1), \] where $S'$ and $S''$ are independent copies of $S$, independent of $U$. This random variable arises as the almost sure limit of the normalized worst-case number of key comparisons used by classical Quickselect with uniformly chosen pivots in the model of Devroye. Our first contribution concerns the right tail of $S$. We prove explicit one-sided bounds for the rate function $-\log \mathbb{P}(S>t)$ and, in particular, identify its first-order asymptotic growth: \[ -\log \mathbb{P}(S>t) = t \log t + O(t \log \log t), \qquad t \to \infty. \] The argument combines a binary-search-tree embedding and a one-level second-moment method with a moment-generating-function comparison inspired by ideas of Alsmeyer and Dyszewski for the nonhomogeneous smoothing transform. As a byproduct, we obtain an explicit pointwise Chernoff majorant for the tail. Our second contribution is a distribution-function scheme for deriving explicit upper bounds on $\mathbb{E}[S]$. Starting from the fixed-point equation at the level of the distribution function, we construct an order-preserving lower iteration and a conservative mesh discretization suited to computer-assisted upper bounds on the mean. We illustrate the latter numerically in floating-point arithmetic, but do not pursue a certified numerical proof here.
Read the full abstract

Probability · Cross-listed from stat.ML

Adaptive Learning via Off-Model Training and Importance Sampling for Fully Non-Markovian Optimal Stochastic Control. Complete version

This paper studies continuous-time stochastic control problems whose controlled states are fully non-Markovian and depend on unknown model parameters. Such problems arise naturally in path-dependent stochastic differential equations, rough-volatility hedging, and systems driven by fractional Brownian motion. Building on the discrete skeleton approach developed in earlier work, we propose a Monte Carlo learning methodology for the associated embedded backward dynamic programming equation. Our main contribution is twofold. First, we construct explicit dominating training laws and Radon–Nikodym weights for several representative classes of non-Markovian controlled systems. This yields an off-model training architecture in which a fixed synthetic dataset is generated under a reference law, while the dynamic programming operators associated with a target model are recovered by importance sampling. Second, we use this structure to design an adaptive update mechanism under parametric model uncertainty, so that repeated recalibration can be performed by reweighting the same training sample rather than regenerating new trajectories. For fixed parameters, we establish non-asymptotic error bounds for the approximation of the embedded dynamic programming equation via deep neural networks. For adaptive learning, we derive quantitative estimates that separate Monte Carlo approximation error from model-risk error. Numerical experiments illustrate both the off-model training mechanism and the adaptive importance-sampling update in structured linear-quadratic examples.
Read the full abstract

All authors Dorival Leão, Alberto Ohashi, Simone Scotti, Adolfo M.D da Silva

General Mathematics

Equivalence Problem for Non-Linearizable Fourth-Order ODEs with Five-Dimensional Lie Symmetry subalgebra via Inductive Cartan Equivalence Method

Four coframes of invariant 1-forms are explicitly constructed using the Inductive Cartan equivalence method with rank zero corresponding to four distinct branches. These coframes are employed to characterize non-linearizable fourth-order ODEs under point transformation with a five-point symmetry Lie subalgebra. Moreover, we propose a procedure for obtaining the point transformation by using the derived invariant coframes, demonstrated through examples.
Read the full abstract

All authors Sondos R. Khalil, Ahmad Y. Al-Dweik, Marwan Aloqeili, F. M. Mahomed

Probability

From Gaussian to Gumbel: extreme eigenvalues of complex Ginibre products with exact rates

We consider the product of \(k_{n}\) independent \(n\times n\) complex Ginibre matrices and denote its eigenvalues by \(Z_{1},\ldots ,Z_{n}\). Let \(\alpha = \lim_{n\to\infty} n / k_{n}\). Using the determinantal point process method, we reduce the study of extremal eigenvalues to the evaluation of determinants of certain \(n\times n\) matrices. In the modulus case, rotational invariance makes the relevant matrix diagonal, which yields a product representation in terms of Gamma tail probabilities. In the real-part case, the matrix is no longer diagonal; we handle this by a polar-coordinate reduction that introduces an independent uniform angle and leads to explicit formulas involving Gamma variables and trigonometric integrals. After appropriate rescaling, the spectral radius \(\max_{1\leq j\leq n}|Z_{j}|\) converges weakly to a nontrivial distribution \(\Phi_{\alpha}\) when \(\alpha \in (0, +\infty)\), to the Gumbel distribution when \(\alpha = +\infty\), and to the standard normal distribution when \(\alpha = 0\). The family \(\{\Phi_{\alpha}\}_{\alpha >0}\) extends continuously to the boundary regimes: \(\Phi_{\alpha}\) converges weakly to the standard normal law as \(\alpha \to 0^{+}\) and to the Gumbel law as \(\alpha \to +\infty\). Thus the three limiting regimes are connected by the single parameter \(\alpha\), yielding a continuous transition from Gaussian to Gumbel distribution. For the spectral radius, we obtain the exact rates of convergence both in the fixed-\(\alpha\) regime and at the boundaries \(\alpha = 0\) and \(\alpha = +\infty\). For the rightmost eigenvalue \(\max_{1\leq j\leq n}\Re Z_{j}\), we establish the convergence rates in the boundary regimes, while for \(\alpha \in (0, +\infty)\) we show that the limiting distribution, though not available in closed form, still interpolates continuously between the normal and Gumbel laws.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Partial majorization and Schur concave functions on the sets of quantum and classical states

We construct for a Schur concave function $f$ on the set of quantum states a tight upper bound on the difference $f(\rho)-f(\sigma)$ for a quantum state $\rho$ with finite $f(\rho)$ and any quantum state $\sigma$ $m$-partially majorized by the state $\rho$ in the sense described in [1]. We also obtain a tight upper bound on this difference under the additional condition $\frac{1}{2}\|\rho-\sigma\|_1\leq\varepsilon$ and find simple sufficient conditions for vanishing this bound with $\,\min\{\varepsilon,1/m\}\to0\,$. The obtained results are applied to the von Neumann entropy. The concept of $\varepsilon$-sufficient majorization rank of a quantum state with finite entropy is introduced and a tight upper bound on this quantity is derived and applied to the Gibbs states of a quantum oscillator. We also show how the obtained results can be reformulated for Schur concave functions on the set of probability distributions with a finite or countable set of outcomes.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

Asymptotically Faster Algorithms for Recognizing $(k,\ell)$-Sparse Graphs

For fixed integers $k,\ell$ with $0\leq\ell<3k$, we study the problem of deciding whether a graph is $(k,\ell)$-sparse, a notion arising in combinatorial optimization and rigidity theory. Standard pebble-game algorithms take $O(n^2)$ time for $0\leq\ell<2k$ and $O(n^3)$ time for $2k\leq\ell<3k$, although faster algorithms were known for some parameter choices. We develop efficient recognition algorithms using bounded-indegree orientations, reductions to rooted arc-connectivity, augmenting paths, and centroid decomposition. For $0\leq\ell<2k$, they run in $O(n^{1+o(1)})$ time, yielding the first subquadratic bound valid throughout the entire range. Purely combinatorial implementations run in $O(n\sqrt n)$ time throughout this range. For graphs with $O(n)$ edges, we also improve the purely combinatorial running time for decomposing the edge set into a fixed number of forests, or certifying that no such decomposition exists, from $O(n\sqrt{n\log n})$ to $O(n\sqrt n)$. For simple graphs with $2k\leq\ell<3k$, the general recognition algorithm runs in $O(n^2)$ time when $\ell\leq2k+2$ and in $O(n^2\log n)$ time otherwise. When $\ell=2k$ and $k\leq3$, a specialized algorithm improves this to $O(n^{1+o(1)})$ and admits a purely combinatorial $O(n\sqrt n)$ implementation. Whenever the input graph is not $(k,\ell)$-sparse, our recognition algorithms return an explicit violating vertex set.
Read the full abstract

Optimization and Control · Cross-listed from quant-ph

Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent

We present the first analytical study of ECD, focusing on the one-dimensional setting for this first installment. We formalize a stochastic ECD dynamics (sECD) with energy-preserving noise, as well as a quantum analog of the ECD Hamiltonian (qECD), providing the foundation for a quantum algorithm through Hamiltonian simulation in a tractable model where the barrier-crossing mechanism can be computed explicitly. For one-dimensional double-well objectives in the under-guessing regime, we compute the expected dynamical hitting times from a local minimum to the global minimum. We prove that both sECD and qECD exhibit exponential improvements in continuous hitting time relative to their respective gradient-based baselines, stochastic gradient descent (SGD) and quantum tunneling walk (QTW). For objectives with tall barriers, qECD admits a further hitting time improvement over sECD. Mechanistically, ECD sidesteps the exponential cost associated with rare-escape events of SGD from local minima by moving from dissipative to energy-conserving dynamics.
Read the full abstract

All authors Yihang Sun, Huaijin Wang, Patrick Hayden, Jose Blanchet

Numerical Analysis

Finite element approximation of an anisotropic porous medium equation with fractional pressure

We study a nonlocal diffusion equation of porous medium type featuring a generalised fractional pressure with spatial anisotropy. We construct a finite element method for the numerical solution of the equation on a bounded open Lipschitz polytopal domain $\Omega \subset \mathbb{R}^{d}$, where $d = 2$ or $3$. The pressure in the model is defined as the solution of fractional elliptic problem involving the fractional power of a second order differential operator, in terms of its spectral definition. Under suitable assumptions on the fractional order and the coefficients of the operator, we rigorously prove convergence of the numerical scheme. The analysis is carried out in two stages: first passing to the limit in the spatial discretization, and then in the time step, ultimately showing that a subsequence of the sequence of finite element approximations defined by the proposed numerical method converges to a bounded and nonnegative weak solution of the initial-boundary-value problem under consideration. Finally, we present numerical experiments in two dimensions illustrating the computational aspects of the method and highlighting the interplay between nonlocal effects and spatial anisotropy under different configurations. We also show numerically the failure of the comparison principle and exponential decay of the numerical solution to a steady state.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem

This paper tackles the Electric Capacitated Vehicle Routing Problem (E-CVRP) through a bilevel optimization framework that handles routing and charging decisions separately or jointly depending on the search stage. By analyzing their interaction, we introduce a surrogate objective at the upper level to guide the search and accelerate convergence. A bilevel Late Acceptance Hill Climbing algorithm (b-LAHC) is introduced that operates through three phases: greedy descent, neighborhood exploration, and final solution refinement. b-LAHC operates with fixed parameters, eliminating the need for complex adaptation while remaining lightweight and effective. Extensive experiments on the IEEE WCCI-2020 benchmark show that b-LAHC achieves superior or competitive performance against eight state-of-the-art algorithms. Under a fixed evaluation budget, it attains near-optimal solutions on small-scale instances and sets 9/10 new best-known results on large-scale benchmarks, improving existing records by an average of 1.07%. Moreover, the strong correlation (though not universal) observed between the surrogate objective and the complete cost justifies the use of the surrogate objective while still necessitating a joint solution of both levels, thereby validating the effectiveness of the proposed bilevel framework and highlighting its potential for efficiently solving large-scale routing problems with a hierarchical structure.
Read the full abstract

All authors Yinghao Qin, Mosab Bazargani, Edmund K. Burke, Carlos A. Coello Coello, Zhongmin Song, Jun Chen

Combinatorics

Reconstructing a graph from its Bell colouring graph

The Bell colouring graph $\mathcal{B}(G)$ of a graph $G$ is the graph whose vertices are the partitions of the vertex set of $G$ into independent sets, with an edge between two partitions if and only if one can be obtained from the other by changing the part of a single vertex of $G$. Given a natural number $k$, the Bell $k$-colouring graph $\mathcal{B}_k(G)$ and the upper-Bell $k$-colouring graph $\mathcal{B}_{\geq k}(G)$ are the induced subgraphs of $\mathcal{B}(G)$ consisting of all partitions with at most $k$ parts and at least $k$ parts, respectively. We determine precisely when two finite graphs have isomorphic Bell colouring graphs. In particular, we show that every $n$-vertex graph $G$ with no vertices of degree $n-1$ is uniquely determined by its Bell colouring graph $\mathcal{B}(G)$, and by its upper-Bell colouring graph $\mathcal{B}_{\geq k}(G)$ if $k\leq n-2$. We also show that every $n$-vertex graph with maximum degree $\Delta(G)< \frac{1}{9}n-\frac{1}{3}$ is uniquely determined by its Bell $k$-colouring graph $\mathcal{B}_k(G)$ if $k>\chi(G)$. By taking graph complements, each of these results can be restated in terms of partitions into cliques.
Read the full abstract

Classical Analysis and ODEs

Uniqueness and non-uniqueness pairs for the fractional Laplacian

We study uniqueness and non-uniqueness pairs for the fractional Laplacian in the discrete setting. More precisely, under mild regularity assumptions on a function $f$ satisfying $f=0$ on $\Lambda$ and $(-\Delta)^s f=0$ on $M$, where $\Lambda, M \subset \mathbb{R}^d$ are discrete, we find sufficient conditions on these sets that force $f$ to vanish identically, and we provide examples in which non-uniqueness occurs. The uniqueness proofs combine decay estimates forced by discrete zero sets with analytic continuation, while the non-uniqueness results are obtained from an interpolation theorem.
Read the full abstract

Statistics Theory

Equivalence of optimal transport problems to regularization on the family of f-divergences

This work establishes that an optimal transport~(OT) problem regularized by a given $f$-divergence admits the same solution as another OT problem regularized by a different $g$-divergence, under an appropriate transformation of the cost function. This structural equivalence between OT problems regularized by distinct divergences, in the sense of sharing the same unique minimizer, is demonstrated within the framework of Polish spaces with bounded cost functions.
Read the full abstract

Mathematical Physics

A variationally consistent mesoscopic Cosserat theory with distributed defects and configurational forces

We develop a variationally consistent mesoscopic extension of Cosserat elasticity motivated by the breakdown of compatibility in classical formulations. By admitting compatibility-breaking perturbations, the classical theory ceases to remain closed under admissible variations, necessitating an enlargement of the constitutive framework. This leads naturally to a formulation in which torsion and curvature are treated as independent distributed measures of defects. The theory is constructed using a Palatini-type variational approach, with the coframe and connection as independent fields. The resulting Euler–Lagrange equations yield both the standard balance laws and defect-related excitation fields. Material invariance gives rise to configurational forces and moments, which emerge as Noether currents and are directly linked to defect transport governed by the Bianchi identities. The framework provides a unified description of defect kinematics, configurational mechanics, and microstructural evolution. Illustrative examples and numerical evaluations demonstrate how defect transport generates configurational forces and highlight the underlying Maxwell-type structure of the theory. The proposed formulation offers a consistent geometric foundation for the analysis of structured solids with evolving internal geometry and provides a basis for future developments in defect dynamics and dissipative processes.
Read the full abstract

Algebraic Geometry

Logarithmic Hochschild (co)homology of logarithmic orbifolds

Recently, the authors of this paper introduced logarithmic Hochschild (co)homology of logarithmic spaces in a geometric way using formality of derived intersections. In this paper, the authors extend the decomposition theorem for the logarithmic Hochschild (co)homology of firm orbifolds to general logarithmic orbifolds and consider two applications of the decomposition theorem. First, we consider two versions of a symmetric product and compute the logarithmic Hochschild homology of them. Second, we show that logarithmic Hochschild homology is invariant under root stack operations.
Read the full abstract

Geometric Topology

Fine projection complex and subsurface homeomorphisms with positive stable commutator length

Drawing inspiration from [BBF15], we construct a family of unbounded quasi-trees for a connected closed oriented surface $S_g$ of genus $g\geq 2$, upon which the group $\mathrm{Homeo}_0(S_g)$ acts coboundedly by isometries. As an application, we show that some surface homeomorphisms preserving a non-sporadic essential subsurface or an essential subsurface homeomorphic to a once-bordered torus can have positive stable commutator length in $\mathrm{Homeo}_0(S_g)$. Moreover, we provide a version of projection complex that does not require the finiteness condition.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.soft

Variations on the Three-Sphere: Laves' Labyrinth Lopped

Inspired by the structure of $srs$ Laves networks in $\mathbb{R}^3$ that underpin the celebrated gyroid surface, we construct a Laves network of identical three-coordinated vertices on $S^3$ with double-twist. This network is a subset of the vertices and edges of the 600-cell, and can be viewed as a bipartite graph of disjoint 24-cell vertices inscribed in the 600-cell. We describe mutually entangled realizations of this network on $S^3$, and describe their relation to the well-known $srs$ Laves network structure in $\mathbb{R}^3$.
Read the full abstract