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)

Monday 20 April

Information Theory · Cross-listed from eess.SP

Joint Detection and Velocity Estimation in OFDM-ISAC Cell-Free Massive MIMO Networks

This paper develops a sensing framework for cell-free massive MIMO (CF-mMIMO) networks operating under orthogonal frequency division multiplexing (OFDM)-based integrated sensing and communication (ISAC). The framework explicitly incorporates the 3D bistatic Doppler geometry across distributed access points (APs) into a generalized likelihood ratio test (GLRT) detector. To address system scalability, a user-target-centric AP association approach is utilized. The 3D velocity vector of the target is estimated, and several search and optimization strategies, including coarse grid search, gradient-based refinement, and particle swarm optimization (PSO), are developed and evaluated. Simulation results demonstrate that the proposed PSO-aided detector achieves the most favorable accuracy-complexity trade-off, while Doppler mismatch can cause substantial sensing signal-to-noise ratio (SNR) degradation in high-mobility scenarios. Additionally, leveraging more OFDM subcarriers enhances frequency-domain diversity and yields further sensing-SNR gains.
Read the full abstract

All authors Maryam Darabi, Sergi Liesegang, Emanuele Grossi, Stefano Buzzi

Algebraic Geometry

On the classification of toric $2$-Fano manifolds: generic $\mathbb{P}^2$-bundles

In this paper, we advance the classification of toric 2-Fano manifolds by continuing the investigation of the minimal projective bundle dimension $m(X) \in \{1,\dots,\dim(X)\}$ introduced in our previous work. This invariant captures the minimal degree of a dominating family of rational curves on $X$ and admits a natural combinatorial interpretation in terms of centered primitive collections. We develop an approach that relates, via toric blowdowns and flips, a toric Fano manifold $X$ to a toric manifold $Y$ that admits a $\mathbb{P}^{m(X)}$-bundle structure on a big open subset. We then compare positivity of the second Chern characters of $X$ and $Y$, and show that the only toric 2-Fano manifold $X$ with $m(X) = 2$ is $X\cong \mathbb{P}^2$. In the example-driven Appendix B, we demonstrate that extending this strategy to the case $m(X)>2$ requires either a substantially more detailed analysis of the combinatorics of primitive collections or a fundamentally new approach.
Read the full abstract

All authors Carolina Araujo, Roya Beheshti, Ana-Maria Castravet, Kelly Jabbusch, Svetlana Makarova, Enrica Mazzon, Nivedita Viswanathan

Statistics Theory · Cross-listed from stat.ME

A Bayesian framework with adaptive elastic nets for the inference of Gaussian graphical models

Estimating conditional independence graphs from high-dimensional Gaussian data is challenging because methods must detect relevant edges while rigorously controlling statistical errors. We propose a Bayesian framework based on a prior accounts for degree heterogeneity edge sparsity, and graph topology the graph. The resulting posterior distribution is incorporated into a multiple testing procedure for graph inference with false discovery rate control. Computation is carried out through a combination of adaptive elastic nets and a variational expectation–maximization algorithm. In simulations, the method achieves reliable false discovery rate control while maintaining strong power, especially in heterogeneous networks such as graphs with hubs, and remains competitive under structural misspecification. Applications to breast cancer gene expression data and financial return networks show that the method yields sparse and interpretable conditional dependence graphs while retaining the most stable interactions detected by competing approaches.
Read the full abstract

Mathematical Physics

Spherical singularities in compactified Ruijsenaars–Schneider systems

We investigate certain Liouville integrable systems constructed earlier via reduction of the quasi-Hamiltonian double of $\mathrm{SU}(n)$. These systems live on compact connected symplectic manifolds of dimension $2(n-1)$ and can be interpreted as compactified trigonometric Ruijsenaars–Schneider systems. Depending on the value of a parameter $0<y< \pi$, they arise in two drastically different forms: in type (i) these are toric systems, while in the type (ii) cases they possess globally continuous action variables that generate a Hamiltonian torus action (only) on a dense open subset of the phase space. The principal goal of the paper is to study those fibers of the action map (alias the $\mathbb{T}^{n-1}$ momentum map) which are contained in the complement of the domain of the densely defined torus action occurring in the type (ii) cases. We demonstrate that all such `singular fibers' are smooth connected isotropic submanifolds. We also work out a model of the fibers as quotient spaces of certain subgroups of $\mathrm{SU}(n)$ with respect to an action of another subgroup. The general results are exemplified by determining the vertices of the polytope filled by the action variables in the simplest type (ii) cases that appear for any $n\geq 4$ with $\pi/(n-1) <y < \pi/(n-2)$, and proving that the fibers over the `singular vertices' are diffeomorphic to $S^3 \simeq \mathrm{SU}(2)$ in these cases. In this way, our findings enrich the set of examples of Liouville integrable systems with spherical singularities.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.AO

A Unified Theory of Edge Weights: Stability of General Laplacian Networks from Matrix Phases and Asymmetry Rayleigh Ratios

We study the properties and stability of networks with arbitrary Laplacian coupling. Classic approaches to studying networked systems require unrealistic assumptions, including homogeneous node dynamics, one-dimensional and undirected edges, or constant edge weights. We develop a unified formulation of Laplacian-style couplings that drops these assumptions, providing a unified notion for the edge weights of adaptive, directed, and multi-dimensional edges. We show that the recently developed theory of matrix phases can capture essential stability properties of the network and its edges. We quantify the impact of the asymmetry of the higher-dimensional edge dynamics on the system's phase properties by introducing the Asymmetry Rayleigh Ratio. These theoretical advances allow us to derive new sufficient stability conditions for AC power grids, directed diffusion, and the Kuramoto-Sakaguchi model. The resulting conditions are less conservative than the specific results known for these systems.
Read the full abstract

Optimization and Control

An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand

Line planning in public transport is the strategic problem of selecting lines and their operating frequencies. This problem is important as it defines the passenger service, based on available connections and expected travel times, and drives operational cost in terms of the number of vehicles required. This paper presents a line planning model that minimizes the weighted sum of passenger travel time, including in-vehicle time and frequency-dependent waiting and transfer times, and operating costs for the public transport agency. Unlike traditional approaches that assume demand to be fixed, our approach requires a minimum service level for demand to be captured, ensuring that services are provided only when they are attractive to users and cost-efficient to operate. The introduced capacity constraints ensure sufficient capacity on the lines and help guide the trade-off between expected demand on selected lines and their frequencies. The resulting mixed-integer program presents a challenging combinatorial problem as the number of passenger paths grows rapidly in relation to the number of lines and frequencies considered. To address this, we propose an iterative exact algorithm that utilizes a reduced problem representation and dynamically expands it with additional frequencies and paths. Evaluated on four networks with varying complexity and cost trade-offs, our method achieves significant speed-ups and tighter bounds compared to solving the complete model directly by CPLEX, particularly when operator and passenger costs are more evenly balanced in the objective. Furthermore, we demonstrate how accounting for lost demand leads to more efficient resource use from an overall perspective.
Read the full abstract

All authors Siv Marie Cartland Hansen, Rowan Hoogervorst, Otto Anker Nielsen, Richard Martin Lusby, Evelien van der Hurk

Numerical Analysis · Cross-listed from cs.LG

Neural Shape Operator Surrogates – Expression Rate Bounds

We prove error bounds for operator surrogates of solution operators for partial differential and boundary integral equations on families of domains which are diffeomorphic to one common reference (or latent) domain $D_{ref}$. The pullback of the PDE to $D_{ref}$ via affine-parametric shape encoding produces a collection of holomorphic parametric PDEs on $D_{ref}$. Sufficient conditions for (uniformly with respect to the parameter) well-posedness are given, implying existence, uniqueness and stability of parametric solution families on $D_{ref}$. We illustrate the abstract hypotheses by reviewing recent holomorphy results for a suite of elliptic and parabolic PDEs. Quantified parametric holomorphy implies existence of finite-parametric, discrete approximations of the parametric solution families with convergence rates in terms of the number $N$ of parameters. We obtain constructive proofs of existence of Neural and Spectral Operator surrogates for the shape-to-solution maps with error bounds and convergence rate guarantees uniform on the collection of admissible shapes. We admit principal-component shape encoders and frame decoders. Our results support in particular the (empirically reported) ability of neural operators to realize data-to-solution maps for elliptic and parabolic PDEs and BIEs that generalize across parametric families of shapes.
Read the full abstract

Statistics Theory

Multi-stream Quickest Change Detection: Foundations and Recent Advances

This paper provides an overview of recent developments in quickest change detection (QCD) for high-dimensional multi-sensor systems, with an emphasis on settings involving structural constraints and limited sensing resources. Classical QCD methodologies, while well understood in low-dimensional and fully observed regimes, face significant challenges when extended to modern applications characterized by large-scale data, constrained sampling or communication, and heterogeneous signal structures. We review key approaches for handling high dimensionality, including methods that exploit sparsity, and other forms of signal heterogeneity. Additionally, we discuss sampling constraints, where observations must be selected or acquired sequentially under resource limitations. Multi-stream applications can require making multiple detections, for example when detecting changes separately in different streams. The underlying assumptions on probability models, the types of changes taking place, commonly used decision-making criteria, performance indices, and error types are described. We also briefly discuss the application of machine learning in cases where the underlying probability models are not known or there is a need to select which sensors should monitor the phenomena because of the large scale of the system.
Read the full abstract

Information Theory

Polar and Convolutional Codes for the Unequal Message Protection Problem

This paper proposes the design of polar and convolutional coset codes for the unequal message protection (UMP) in the short blocklength regime, to overcome the rate loss introduced by preamble-based solutions. After providing conditions to ensure message class disjointness, a two-step decoding architecture is proposed: it first identifies the message class via a likelihood ratio test–computable exactly for convolutional codes and approximated for polar codes–and subsequently performs maximum (or near) likelihood decoding among the codewords of the chosen message class. Numerical results show that our construction closely tracks finite-length benchmarks. Specifically, the analyzed CRC-aided polar codes perform comparable to existing polar code approaches, without requiring specific code design, while offering a robust and spectrally efficient solution for UMP scenarios.
Read the full abstract

All authors Alexander Sauter, Riccardo Schiavone, Lucía Balsa Picado, Gianluigi Liva

Representation Theory

Homological Aspects of Separable Extensions of Triangulated Categories

We investigate the homological behaviour of compactly generated triangulated categories under separable extensions. We show that homological invariants (finiteness of global dimension, gorensteinness and regularity) are preserved under such extensions. We also establish a relation between singularity categories in this setting, proving that the singularity category of a separable extension is equivalent, up to retracts, to a separable extension of the singularity category. Our results unify and extend classical phenomena from commutative and equivariant algebra, and provide new examples involving separable extensions of rings, quotient schemes, and skew group dg algebras.
Read the full abstract

Analysis of PDEs

Existence theorems for nonlinear stationary Kolmogorov equations with partially degenerate diffusion matrices

We study nonlinear stationary Kolmogorov equations with degenerate diffusion matrices and discontinuous coefficients. The existence of a solution is proved. We propose a new approach based on an integral condition with Lyapunov functions and a regularity of projections of solutions in the partially degenerate case. Examples are given to illustrate the results.
Read the full abstract

Probability

Schauder estimates and classical solutions of the Dirichlet problem for stochastic parabolic equations

We study second-order stochastic parabolic equations in a cylindrical domain with homogeneous Dirichlet boundary conditions. Under a natural compatibility condition on the gradient-type noise, we establish global Schauder estimates in stochastic Hölder spaces for the Dirichlet problem. The coefficients and free terms are assumed to be Hölder continuous in the spatial variables, while only their boundary traces are required to be Hölder in time. As a consequence, we obtain existence and uniqueness of quasi-classical solutions in stochastic Hölder spaces, and further derive pathwise classical solvability in Hölder classes.
Read the full abstract

Information Theory

Mismatch Capacity under Stochastic Decoding

This article investigates channel capacity under mismatched stochastic decoding. Feinstein- and Verdú-Han-type bounds on the error probability of coded communication are derived for sequences of $n$-letter channels and decoding metrics. These are used to obtain an information-spectrum formula for the corresponding channel capacity: the supremum, over all input distribution sequences, of the limit inferior in probability of the sequence of normalized mismatched information densities. This formula yields the mismatched analog of the Verdú-Han channel capacity formula. For discrete-memoryless channels and product metrics, uniform integrability allows to show that the limit product-space improvements of the generalized mutual information and the LM rate give the mismatch capacity under stochastic decoding. This establishes the stochastic decoding counterpart of the Csiszár-Narayan conjecture. Relationships among the capacity formulas of related decoders are investigated. A number of examples are discussed including the case of binary-input binary-output channels and decoding metrics, where capacity is characterized in single-letter form.
Read the full abstract

Representation Theory

The interval neighborhoods in the real Grothendieck groups

For a finite dimensional algebra $A$, the TF equivalence on the real Grothendieck group $K_0(\operatorname{\mathsf{proj}} A)_\mathbb{R}$ can be regarded as a completion of the $g$-fan. For example, the silting cones $C^\circ(U)$ of 2-term presilting complexes $U$ give the most fundamental family of TF equivalence classes. The next step is studying the TF equivalence classes around each silting cone $C^\circ(U)$. Thus, in this paper, we investigate the closed interval neighborhood $D(U)$ of $C^\circ(U)$. As our main result, we give a $2^{|U|}:1$ correspondence between the TF equivalence classes in $D(U)$ and those in $K_0(\operatorname{\mathsf{proj}} B)_\mathbb{R}$, where $B$ is the algebra appearing in the $\tau$-tilting reduction at $U$. For this purpose, we give an explicit description of defining inequalities and the faces of $D(U)$ as a polyhedral cone, by using 2-term simple-minded collections and $M$-TF equivalences.
Read the full abstract

Differential Geometry

Complex normalizing flows can almost be information Kähler-Ricci flows

We develop interconnections between the complex normalizing flow for data drawn from Borel probability measures on the twofold realification of the complex manifold and a nonlinear flow nearly Kähler-Ricci. The complex normalizing flow relates the initial and target realified densities under the complex change of variables, necessitating the log determinant of the ensemble of Wirtinger Jacobians. The Ricci curvature of a Kähler manifold is the second order mixed Wirtinger partial derivative of the log of the local density of the volume form. Therefore, we reconcile these two facts by drawing forth the connection that the log determinant used in the complex normalizing flow matches a Ricci curvature term under differentiation and conditions. The log density under the normalizing flow is kindred to a spatial information metric under an augmented Jacobian and a Bayesian perspective to the parameter, thus under the continuum limit the log likelihood matches a Fisher metric, or more closely a Kähler cross-entropy Hessian. This recovers a Kähler-Ricci flow variation up to a time derivative and expectation, or an average-valued Kähler-Einstein flow. Using this framework, we establish other relevant results, attempting to bridge the statistical and ordinary behaviors of the complex normalizing flow to the geometric features of our derived Kähler flow.
Read the full abstract

Numerical Analysis

Adaptive finite element methods with optimally preconditioned GMRES guarantee optimal complexity

We analyze optimal complexity of adaptive finite element methods (AFEMs) for general second-order linear elliptic partial differential equations (PDEs) in the Lax-Milgram setting. To this end, we formulate an adaptive algorithm which steers the local mesh-refinement as well as the termination of a generalized minimal residual solver (GMRES) with optimal preconditioner to solve the arising non-symmetric finite element systems. Algorithmic interplay of mesh-refinement and iterative solver is shown to be optimal: A natural and fully computable quasi-error monitoring discretization error and algebraic solver error guarantees unconditional convergence for any choice of adaptivity parameters, i.e., the algorithm cannot fail to converge. This is ensured algorithmically via a novel adaptive feedback-control for the solver-termination parameter that monitors and ensures full R-linear convergence. Finally, the quasi-error even decays with optimal rates with respect to the overall computational complexity if the adaptivity parameters are chosen sufficiently small.
Read the full abstract

All authors Thomas Führer, Paula Hilbert, Ani Miraçi, Dirk Praetorius

Optimization and Control · Cross-listed from cs.DS

Flow Shop Scheduling with Stochastic Reentry

We study flow shop scheduling with stochastic reentry, where jobs must complete multiple passes through the entire shop, and the number of passes that a job requires for completion is drawn from a discrete probability distribution. The goal is to find policies that minimize performance measures in expectation. Our main contribution is a reduction to a stochastic scheduling problem on identical parallel machines augmented by machine arrivals. This reduction preserves objective values and enables the transfer of structural results and performance guarantees from the auxiliary problems to the reentrant flow shop setting. We demonstrate the usefulness of this reduction by proving the optimality of simple priority policies for minimizing the makespan and the total completion time in expectation under geometric and, more generally, monotone hazard rate distributions. For minimizing the total weighted completion time, we derive an approximation guarantee for a simple priority policy that depends only on the squared coefficient of variation of the underlying distributions. Our results constitute the first optimality and approximation guarantees for flow shops with stochastic reentry and demonstrate that established scheduling policies naturally extend to this setting through the proposed reduction.
Read the full abstract

Category Theory · Cross-listed from cs.LO

A 2-adjunction between representations and preorder morphisms

The recently introduced model of representations has been defined and motivated somewhat ex-nihilo. In this document, I will show that representations are related to a more ”classical” model through a 2-adjunction. The target model is that of preorder morphisms, i.e. maps between sets equipped with reflexive and transitive relation that satisfy some natural preservation property. The aim of this is two-fold: first, this provides in my opinion a further justification of representations, as an object in non-trivial yet tight connection to some natural constructs; and secondly it suggests some classical results about order preserving maps could have interesting consequences for representations. This work has been presented (but not published or peer-reviewed) at RAMiCS 2026.
Read the full abstract

Metric Geometry

Wasserstein barycenters on metric graphs

In this paper we provide conditions for a Wasserstein barycenter to be absolutely continuous with respect to its Hausdorff measure away from the vertices of the graph. One assumption removed in v2, the result is now optimal.

Numerical Analysis

Optimal Linear Interpolation under Differential Information: application to the prediction of perfect flows

Approximation of functions satisfying partial differential equations (PDEs) is paramount for simulation of physical fluid flows and other problems in physics. Recently, physics-informed machine learning approaches have proven useful as a data-driven complement to numerical models for partial differential equations, bringing faster responses and allowing us to capitalize on past observations. However, their efficiency and convergence depend on the availability of vast training datasets. For sparse observations, Gaussian process regression or Kriging has emerged as a powerful interpolation model, offering principled estimates and uncertainty quantification. Several attempts have been made to condition Gaussian processes on linear PDEs via artificial or collocation observations and kernel design.These methods suffer from scalability issues in higher dimensions and limited generalizability. The aim of this study is to explore the extension of the Kriging predictor in the presence of linear PDE information at a finite number of collocation points. Two approaches are proposed: 1) A collocated co-Kriging with primary observations of the physical field and auxiliary differential observations; 2) A constrained Kriging optimization problem strongly satisfying linear PDE constraints at the points of prediction through a Lagrangian formulation. Numerical experiments are given for ordinary differential equations, 2D harmonic PDEs and an application to perfect flows around a cylinder. This work highlights a trade-off between the computational efficiency of the Lagrange multipliers approach and the strict interpolation of observations.
Read the full abstract

All authors Soumyodeep Mukhopadhyay, Didier Rullière, Rodolphe Le Riche, David Gaudrie, Xavier Bay, Laurent Genest, David Gaudrie

Operator Algebras

On groupoids beyond partial actions, inner amenability, and models for Kirchberg algebras

We construct the first explicit examples of locally compact Hausdorff étale groupoids that are not inner amenable and that do not arise as transformation groupoids associated to partial actions of discrete groups. This answers questions of Anantharaman–Delaroche and Exel. Our examples include all Higson–Lafforgue–Skandalis groupoids associated to non-amenable residually finite groups, as well as their principal variants constructed by Alekseev–Finn–Sell. These can be chosen to be second countable, ample, and in the latter case even principal. We also show that large classes of Deaconu–Renault groupoids with connected unit space do not arise from partial actions of discrete groups, including cases whose $C^*$-algebras are Kirchberg algebras in the UCT class. We contrast this with the totally disconnected case by giving ample transformation groupoid models for all unital Kirchberg algebras in the UCT class as well as many higher rank graph algebras. Finally, we characterize precisely when coarse groupoids arise from partial actions of discrete groups in terms of coarse embeddings into groups.
Read the full abstract

Functional Analysis

A Kantorovich-type variant of Grünwald Interpolation Operators

In this paper, we introduce a new sequence of operators based on the Grünwald interpolation operators on Chebyshev nodes on the space $L^p[0,{\pi}]$. The operators we consider are integral variants of the Grünwald interpolation operators, inspired from the classical Kantorovich operators. Unlike the original Grünwald interpolation operators, our construction enables the derivation of convergence results not only on $C[0,{\pi}]$ but also in the space $L^p[0,{\pi}]$. First, we establish the uniform boundedness of this sequence on these spaces and subsequently prove the convergence of the operators. We obtain quantitative estimates using modulus of continuity and a suitable K-functional. Furthermore, we derive a point-wise estimate via the Hardy-Littlewood maximal operator. By invoking a Korovkin-type theorem, we extend the convergence results to several Banach function spaces on a nontrivial subspace. In particular, we establish these results for weighted Lebesgue spaces, Grand Lebesgue spaces, Morrey spaces, Orlicz spaces etc.
Read the full abstract

Operator Algebras

Crossed-Product von Neumann Algebras for Incompressible Navier–Stokes Flows and Spectral Complexity Indicators

We introduce a traceable operator-algebraic framework for incompressible transport on M= T3 (and, more generally, compact Riemannian manifolds endowed with a smooth invariant probability measure). Given an autonomous divergence-free velocity field u, the time-1 map $\Phi$ induces the Koopman unitary U on L2(M) and the crossed-product finite von Neumann algebra Mu\,:= L$\infty$(M) ___$\alpha$ Z= W$\star$(L$\infty$(M),U), equipped with its canonical faithful normal trace $\tau$u. Within Mu we define tracial complexity functionals from commutators [U,Mf] (with Mf the multiplication operators) and associated positive elements, and we connect these quantities to Fuglede–Kadison determinants and entropy-like tracial functionals. In parallel, we introduce bounded regularized advection operators T(s) u\,:= KsTuKs as differential-level probes of transport oncommutativity, and we recall the Lie-bracket commutator identity at the formal generator level. This provides a natural algebraic setting in which tracial invariants are well posed and, in principle, computable on discretizations (e.g. cavity flow and vortex benchmarks).
Read the full abstract

Mathematical Physics

Synthetic Seismograms from Particle Bed Interactions and Turbulent River Flow: Modeling and Comparison with Observations

We present a physics based numerical model that estimates the seismic radiation generated by water sediment flows in gravel-bed rivers. The model reproduces the trajectories of individual particles, evaluates impact and rolling forces from grain scale dynamics, and accounts for broadband turbulence and vortex shedding in the water column. Synthetic seismic signals are propagated to the receivers using the Rayleigh wave Green s function approach and synthetic ground-velocity signals are estimated. Application to a controlled test case shows how intermittent, size selective sediment transport mechanisms produce distinct spectral signatures. Comparison with seismic data from a flood event in a mountain torrent in the Tuscan Apennines displays general agreement with the observed frequency bands and clarifies the relative width of particle collisions and turbulent flow. These results show that resolved grain scale dynamics provides a framework for discriminating sediment transport and flow induced contributions to river seismic noise.
Read the full abstract

All authors Sara Nicoletti, Giacomo Belli, Omar Morandi, Emanuele Marchetti

Combinatorics

Dirac's theorem and the switch geometry of perfect matchings

Let $G$ be a graph on an even number $n$ of vertices and let ${\cal M}_G$ be the collection of perfect matchings in $G$. Dirac's theorem says that if the minimum degree $\delta(G)$ of $G$ is at least $n/2$, then ${\cal M}_G$ is guaranteed to be non-empty, while this is not necessarily the case if $\delta(G) \le n/2-1$. Given an integer $k\ge 2$, let $\mathcal H_k(G)$ be the reconfiguration graph formed on ${\cal M}_G$ by connecting two distinct $M_1,M_2\in {\cal M}_G$ by an edge in $\mathcal H_k(G)$ if $M_1$ can be obtained from $M_2$ by switching at most $k$ edges. Besides non-emptiness, as per Dirac's theorem, what other natural properties of $\mathcal H_k(G)$ are guaranteed based on the minimum degree $\delta(G)$ of $G$? We show that if $\delta(G) \ge \lfloor2n/3\rfloor+1$, then $\mathcal H_2(G)$ must be connected and an expander, while for each $\delta\le \lfloor(2n-2)/3\rfloor$ there are $n$-vertex graphs $G$ with minimum degree $\delta$ such that $\mathcal H_2(G)$ is disconnected. We also show that, if $\delta(G) \ge n/2+2$, then $\mathcal H_3(G)$ must be connected and an expander, while for each $\delta\le n/2-C_k$ there are $n$-vertex graphs $G$ with minimum degree $\delta$ such that $\mathcal H_k(G)$ is disconnected, for some $C_k$ depending on $k\ge 3$. Furthermore, for every $\varepsilon >0$, there exists a $c>1$ such that for every $k\ge 2$ and every large enough $n$, there are $n$-vertex graphs $G$ with $\delta(G) \ge \frac{n}2-\varepsilon kn$ such that $\mathcal H_k(G)$ has at least $c^n$ components. With respect to guaranteeing that $\mathcal H_k(G)$ has positive minimum degree (or, equivalently, no isolated vertices) we show that if $\delta(G) \ge n/2+1$, then $\mathcal H_2(G)$ must have positive minimum degree. For $k\ge 3$, we show how this threshold for $\delta(G)$ is related to the notorious Caccetta-Häggkvist conjecture.
Read the full abstract

Numerical Analysis

A Coupling Method of Mixed and Lagrange Finite Elements for Linear Elasticity Problem

This paper proposes a finite element method that couples mixed and Lagrange finite elements to efficiently capture stress concentrations in elasticity problems. The method employs conforming mixed finite elements in regions with stress concentration, while standard Lagrange elements are used elsewhere, achieving a balance between stress accuracy and computational efficiency. The well-posedness of the coupled formulation and optimal a priori error estimates are established, even when the size of the mixed finite element subregion is $O(h)$. Numerical experiments are presented to verify the theoretical convergence rates and to demonstrate the effectiveness and efficiency of the proposed method.
Read the full abstract

All authors Wei Chen, Jun Hu, Limin Ma, Mingyan Zhang

Combinatorics

On Spielman's Laplacian Eigenratio Conjecture and Related Problems

Let $G$ be an $n$-vertex graph with Laplacian eigenvalues $0=\lambda_1(G)\le \lambda_2(G)\le\cdots\le \lambda_n(G)$. Motivated by the Alon-Boppana bound and the Ramanujan phenomenon for regular graphs, Spielman conjectured that, for every graph $G$ with fixed average degree $d\ge 1$, its Laplacian eigenratio satisfies $$ \frac{\lambda_2(G)}{\lambda_n(G)} \le \frac{d-2\sqrt{d-1}}{d+2\sqrt{d-1}}+o_n(1), $$ where $o_n(1)\to 0$ as $n\to\infty$. The main purpose of this paper is to investigate this conjecture. We show that the situation is mixed. On the negative side, the conjecture fails for infinitely many average degrees $d>2$, via constructions based on bipartite Ramanujan graphs. On the positive side, it holds in two important settings: we verify it for all average degrees $d\le 2$, and we prove it for all regular graphs. In fact, for regular graphs we obtain stronger bounds comparing higher Laplacian eigenvalues. As a consequence, we show that for every fixed $d\ge 3$ and every $\varepsilon>0$, every sufficiently large $d$-regular Ramanujan graph has linearly many adjacency eigenvalues below $-2\sqrt{d-1}+\varepsilon$, thereby strengthening earlier results of Li and Cioabă by giving an unconditional result of this form. We also settle two related conjectures: one of You and Liu concerning the maximum Laplacian eigenratio of trees, and one of Gu concerning the Hamiltonicity of graphs with large Laplacian eigenratio.
Read the full abstract

All authors Jie Ma, Quanyu Tang, Yuchang Wang, Zhiheng Zheng

Geometric Topology

Ropelength-Filtered Knot Spaces

Ropelength is usually studied as a minimisation problem for one knot at a time. Here we instead use ropelength to filter the space of all realisations of a knot type. For a knot type $K$ and budget $\Lambda$, let $Y_\Lambda(K)$ be the space of unit-thickness $C^{1,1}$ configurations of length at most $\Lambda$, modulo rigid motions and constant-speed reparametrisation. We prove compact capture for smooth knot families, yielding homotopical and homological exhaustion of the ordinary knot space by finite ropelength levels. In the normalised Euclidean model, every $Y_\Lambda(K)$ is compact; connected components are right-continuous and their merge levels are attained, giving an ultrametric on the components of the ideal stratum. We also prove that $Y_L(K)$ strongly deformation retracts onto its exact-length shell, so path connectivity at a fixed level is fixed-length physical isotopy. The connected merge scale and the path merge scale, the min–max quantity for constrained deformation paths, take the same values, although only the former is known to be attained. Moreover, all configurations in any fixed finite sublevel become path connected to one another at some common finite higher level, even if the original sublevel has infinitely many components. For higher homotopy we introduce ropelength widths and relate them to known models of spaces of knots. We record mirror symmetry and prove finite factorization across every positive filtration gap in a marked weak model, yielding all-degree homological q-tameness. Finally, we relate the path filtration to the companion swept-area construction: the infimal budget for admissible endpoint connections agrees with the path merge threshold. The resulting framework separates geometric, topological, and physical-isotopy questions and provides a quantitative foundation for the study of ropelength-filtered knot spaces.
Read the full abstract

Functional Analysis

Complex hyper-power series and generalized complex analytic functions

This paper studies the equivalence between generalized holomorphic functions (GHF) and complex analytic functions in the framework of Robinson-Colombeau generalized numbers. In every non-Archimedean ring, the use of ordinary series is severely restricted by the topological property that a series converges (in a topology of infinitesimal neighborhoods) if and only if its general term is infinitesimal. Consequently, classical Taylor series representations for generalized functions are limited to infinitesimal neighborhoods. To overcome this drawback, we introduce and develop the theory of hyperpower series, defined by summation over the set of hyperfinite natural numbers. We establish the foundational algebraic and topological properties of hyperpower series, including their radii of convergence and sets of convergence. Building on this, we define generalized complex analytic functions and extend several fundamental theorems of complex analysis to the GHF setting, specifically, providing generalizations of Goursat's theorem, Lioville's theorem, the identity theorem, and a Paley-Wiener type theorem.
Read the full abstract

Algebraic Geometry

Automorphism groups of hyperelliptic curves of $2$-rank zero

In this paper, we determine the reduced automorphism groups of hyperelliptic curves of a small genus in characteristic $2$, when they are of $2$-rank $0$. Such a curve is an Artin-Schreier curve defined in the form $y^2-y=f(x)$ for a polynomial $f(x)$. After we clarify semidirect-product structures of the automorphism groups for an arbitrary genus, we derive the detailed group structures for the reduced automorphism groups of the curves of a small genus, through computations using the computational algebra system Magma. With these experiments, we formulate two conjectures, which are analogues for our curves of the Oort conjecture on automorphism groups of generic principally polarized supersingular abelian varieties.
Read the full abstract