Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 27 April
We study the Ehrhart $h^\ast$-polynomial of (the boundary of) a lattice polytope via regular unimodular triangulations and Gröbner degenerations of toric ideals. Our main result is a boundary analogue of the well-known Sturmfels correspondence. This allows us to connect the boundary $h^\ast$-polynomial to the $h$-polynomial of any regular unimodular triangulation, in analogy to the classical Betke-McMullen Theorem. Providing a direct link between Ehrhart theory and the face enumeration of simplicial complexes, we then transfer structural results from the theory of simplicial polytopes to the setting of lattice polytopes. In particular, we derive general Dehn-Sommerville-type relations between $h^\ast(P)$ and $h^\ast(\partial P)$. Under the additional assumption of $\partial P$ admitting a regular unimodular triangulation, we recover old and prove new characterization results concerning symmetry or unimodality, as well as upper and lower bounds for coefficient-wise differences within $h^\ast(P)$.
Optimization and Control · Cross-listed from econ.GN
Optimal incentive scheme for ESG disclosure
This paper characterises optimal incentive schemes for ESG disclosure in a continuous-time principal-agent setting. We model a risk-averse principal (e.g., a platform or standard-setter) contracting with a team of heterogeneous agents whose disclosure signals are each correlated with a traded climate risk factor. The optimal contract balances incentive provision against the variance of aggregate payouts by leveraging three instruments: own-signal loading, cross-signal loadings across agents, and hedging tilts on the traded asset. We derive closed-form linear optimal controls in a tractable linear-quadratic-Gaussian framework. When the principal is nearly risk-neutral, the contract uses the traded asset purely to hedge the specific `enforcement risk' generated by high-powered incentives. As the principal's risk aversion increases, the optimal scheme converges to a `market-neutral' regime where aggregate asset exposure is eliminated and the cross-signal structure tightens to an `identity pooling' constraint. We characterise this limit analytically as a constrained quadratic program governed by an M-matrix. In the high-risk-aversion regime, heterogeneity creates genuinely new effects absent under symmetry: the cross-section of S-tilts must change sign (unless degenerate), and an agent's own-signal diagonal can turn negative when that row is too strongly exposed to the common traded factor relative to the rest of the group. The results provide a theoretical foundation for `mixed' compensation structures in Regenerative Finance (ReFi), rationalising the use of both stable payments and volatile governance tokens to optimise risk-sharing.
Read the full abstract
Analysis of PDEs
A PDE formulation of Lyapunov stability for contact-type Hamilton-Jacobi equations
We study the Lyapunov stability of stationary viscosity solutions of contact-type Hamilton–Jacobi equations on a compact manifold. We consider Hamiltonians of the form $H(x,p,u)=G(x,p)+W(x,u)$, where $G$ is continuous, convex and coercive in $p$. We establish sufficient conditions for asymptotic stability and instability in terms of viscosity subsolutions and one-sided derivatives of a perturbed critical value. These criteria do not require the construction of a smooth contact Hamiltonian flow. Under the stability condition, solutions starting sufficiently close to a stationary solution converge to it at an exponential rate. To prove instability, we use the superposition principle for closed measures to construct calibrated curves. We also establish conditions ensuring uniqueness of stationary solutions and global asymptotic stability. Our results also cover examples with nonmonotone dependence on the unknown function, including an equation with an eikonal term $|p|$. Finally, we obtain an $O(\sqrt{\varepsilon})$ convergence rate for a class of stationary Hamilton–Jacobi equations with nonlinear dependence on the unknown function and multiscale spatial dependence.
Read the full abstract
Analysis of PDEs
Existence of stationary solutions for some systems of integro-differential equations with Laplace and bi-Laplace operators
The article is devoted to the solvability of a system of integro-differential equations in the case of the difference of the standard Laplacian and the bi-Laplacian in the diffusion terms. The proof of the existence of solutions is based on a fixed point technique. We use the solvability conditions for the elliptic operators without the Fredholm property in unbounded domains.
Read the full abstract
Combinatorics · Cross-listed from cs.DS
Identification to Subclasses of Chordal Graphs
An identification of two vertices \(u\) and \(v\) in a graph replaces them with a new vertex that is made adjacent to every vertex of \(N(u)\cup N(v)\setminus \{u,v\}\). We study the \(\mathcal{H}\)-Identification problem, which is to decide whether a given graph \(G\) can be transformed (“identified”) to a graph in \(\mathcal{H}\) by applying at most \(k\) vertex identifications. We determine the classical and parameterized complexity of this problem for various subclasses \(\mathcal{H}\) of chordal graphs, obtaining an almost complete picture for two parameters: \(k\) and \(n-k\). We also consider the Identification problem, which is to test, for two given graphs \(G\) and \(H\), whether \(G\) can be identified to \(H\). We determine the parameterized complexity of this problem when \(H\) is a graph from one of our testbed classes, taking the number of simplicial vertices of \(H\) as the parameter.
Read the full abstract
Numerical Analysis
Strong convergence and temporal-spatial regularity for tamed Euler approximations of Lévy-driven SDEs
We study the temporal-spatial regularity properties of tamed Euler approximations for Lévy-driven SDEs with superlinearly growing drift and diffusion coefficients. We first introduce a novel tamed Euler-type scheme and establish its strong convergence. We then derive temporal-spatial regularity estimates with respect to the initial value, the initial time, and the evaluation time. In particular, we obtain a stability estimate for fixed step size and a corresponding continuity estimate in the vanishing step-size regime. Numerical experiments are presented to support the theoretical results.
Read the full abstract
Analysis of PDEs
Vanishing interfaces in an asymmetric fast reaction limit
We study the fast reaction limit for a two-component reaction-diffusion system with asymmetric reaction terms, where only one component diffuses. For nonnegative and mutually segregated initial data, we prove that the initial interface vanishes instantaneously. More precisely, the diffusive component converges uniformly to the solution of the heat equation, while the non-diffusive component vanishes away from the initial time. The proof is based on explicit barriers and a comparison argument, and applies under both Dirichlet and Neumann boundary conditions.
Read the full abstract
Analysis of PDEs
Local regularity for anisotropic magnetic operators with general codimension singularities
We study local regularity properties of solutions to stationary anisotropic magnetic Schrödinger equations in $\mathbb{R}^d$, $d \ge 2$, arising from singular magnetic potentials concentrated along manifolds of general codimension $2 \le n \le d$. The magnetic interaction is modeled through a covariant gradient of the form \[ \nabla_m u = (iM\nabla + A)u, \] where $M^T M$ is a uniformly elliptic matrix encoding anisotropy and $A$ is a magnetic potential with critical Hardy-type scaling along the $n$-codimensional singular set $\Sigma_0$; that is, $A\sim \mathrm{dist}(\cdot,\Sigma_0)^{-1}$. We establish local Hölder $C^{0,\alpha}$ and Schauder $C^{1,\alpha}$ estimates for weak solutions via a blow-up analysis adapted to the magnetic structure. The regularity is deeply influenced by the combined effect of anisotropy and the singular magnetic potential, which determines the spectrum of the limiting spherical Laplace-Beltrami operator arising in the blow-up at the singular set. Our model is motivated by the study of magnetic potentials generated by shrinking solenoids onto an axis $\Sigma_0$, in the three-dimensional setting $d=3$, $n=2$, leading to Aharonov-Bohm-type (AB) models. In this framework, we show that the geometry of the solenoidal loops plays a crucial role: in particular, any deviation from planar cross-sections orthogonal to $\Sigma_0$ induces a twofold effect. On the one hand, it breaks the ideal AB configuration, in the sense that the magnetic field outside the solenoid is no longer vanishing. On the other hand, it yields an unexpected regularizing mechanism on the wave functions, through a positive shift in the eigenvalues of the asymptotic spectral problem. This purely three-dimensional effect is consistent with our $C^{1,\alpha}$ regularity.
Read the full abstract
Algebraic Geometry
On the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$
Explicit formulas determining the dimension and the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$ are given in terms of the graded Betti numbers of the minimal free resolution of the corresponding Jacobian algebra. This gives in particular new restrictions which must be satisfied by such graded Betti numbers. We define a homologically strictly plus-one generated hypersurface, and show that such a hypersurface has a singular locus of dimension $n-2$ under some conditions.
Read the full abstract
Algebraic Topology
Gyration Stability for Products
A gyration is an operation on Poincaré Duality complexes that arises from a certain surgery on the product of a given complex $N$ and a sphere, parametrised by a chosen twisting. Of particular recent interest is the notion of gyration stability; that is, $N$ is gyration stable when all of its gyrations have the same homotopy type, regardless of the twisting used. We prove that a product $N\times M$ of two Poincaré Duality complexes is gyration stable when one of the product terms is itself gyration stable, and provide some examples of interest.
Read the full abstract
Group Theory
Local automorphisms of some classical groups
A map on a group into itself is called a local automorphism if at any two points of the group, it can be interpolated by an automorphism of that group. In this paper we investigate the question of how local automorphisms of some classical groups are related to automorphisms. In some cases it turns out that the local automorphisms are in fact automorphisms. In the remaining cases we show that the local automorphisms are still closely related to the automorphisms.
Read the full abstract
Functional Analysis
$H^\infty$–functional calculus for generators of semigroups that admit lower bounds
We study $C_0$-semigroups on UMD Banach spaces under the assumption that a single semigroup operator admits a lower bound. We establish boundedness of $H^\infty$ functional calculi for the negative generator of such semigroups. Our approach is based on a dilation argument: combining a recent construction due to Madani with transference results for groups on UMD spaces, we embed the semigroup into a $C_0$-group on a larger space and transfer functional calculus estimates back to the original generator. As a byproduct, we obtain quantitative exponential lower bounds for the semigroup. We also show that equivalences due to Batty and Geyer, valid in Hilbert spaces, fail in the general Banach space setting.
Read the full abstract
Numerical Analysis · Cross-listed from quant-ph
On the encoding complexity of quantum numerical integration: an angle-structure characterization
We study numerical integration on $[0,1]$ by quantum amplitude estimation (QAE), with emphasis on the cost of constructing the amplitude oracle. We introduce a hierarchy of grid functions $\mathcal{G}_n^{(d)}$ whose angle map $\Theta_g:\{0,1\}^n\to[0,\pi]$ is multilinear of degree at most $d$. Membership is classically checkable in $O(n2^n)$ time by the Walsh–Hadamard transform, and each $g\in\mathcal{G}_n^{(d)}$ admits a canonical encoding circuit with $\sum_{k=0}^d\binom{n}{k}$ multi-controlled $R_Y$ gates. Combining this circuit bound with classical discretisation estimates, we obtain a depth-versus-accuracy trade-off: for $g\in C^\alpha[0,1]$, total gate count $O((\log(1/\varepsilon))^d\varepsilon^{-1})$ suffices for $\varepsilon$-accuracy with constant probability; in the affine case $d=1$ this is $O(\varepsilon^{-1}\log(1/\varepsilon))$ at fixed discretisation. We also show that encoding degree and Sobolev smoothness are independent: for every $s\in(0,1/2)$, $\mathcal{G}_n^{(1)}$ contains restrictions of functions in $W^{s',2}(0,1)$ for all $s'<s$ but not in $W^{s,2}(0,1)$. Experiments on the SpinQ Triangulum (NMR) and IBM Kingston (superconducting) processors at $n=2$ validate the predicted hierarchy: affine encodings run reliably on both platforms, while quadratic encodings exceed the Triangulum coherence budget but execute on Kingston.
Read the full abstract
Combinatorics
Perfect matchings and $A_{\alpha}$-spectral radius in 1-binding graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $\alpha\in[0,1)$, we use $A_{\alpha}(G)$ and $\rho_{\alpha}(G)$ to denote the $A_{\alpha}$-matrix and the $A_{\alpha}$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}$. If $\mbox{bind}(G)\geq1$, then $G$ is called 1-binding. A perfect matching in $G$ is a set of nonadjacent edges covering every vertex of $G$. Tutte proved that a graph $G$ of even order has a perfect matching if and only if $o(G-S)\leq|S|$ holds for every $S\subseteq V(G)$ [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107–111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph $G$ of even order $n$ with $n\geq n(\alpha)$ has a perfect matching unless $G=K_1\vee(K_{n-5}\cup K_3\cup K_1)$ if $\rho_{\alpha}(G)\geq\rho_{\alpha}(K_1\vee(K_{n-5}\cup K_3\cup K_1))$, where $n(\alpha)$ is defined as follows: $n(\alpha)=\max\{18,\frac{2+8\alpha}{1-2\alpha}\}$ if $\alpha\in[0,\frac{1}{2})$, and $n(\alpha)=18$ if $\alpha=\frac{1}{2}$.
Read the full abstract
Classical Analysis and ODEs
On a family of strong fractional maximal operators
We study a parametrized family of strong maximal fractional operators. We prove their $L^p$ to $L^q$ boundedness for $1<p\le q<\infty$.
Differential Geometry
The Flat CR Twistor Model $Q^{2,2}$ and Its Algebraic Sections
We study the flat CR twistor model $Q^{2,2}\subset \mathbb{CP}^3$ by explicit projective methods. Using the anti-holomorphic involution $j$ associated with the twistor fibration, we classify the projective lines contained in $Q^{2,2}$ into twistor fibres and transverse lines, and relate the latter to round $2$-spheres in $S^3$ through an explicit incidence–tangency correspondence. We classify hyperplane sections under the twistor-compatible symmetry group $PSp(1,1)$ and describe the induced CR geometries on $S^3$. For smooth $j$-invariant quadric sections, we obtain a complete relative classification in terms of Coxeter's inversive distance and show that, in the disjoint case, the construction yields an explicit one-parameter family of globally defined real-analytic non-spherical Levi-nondegenerate CR structures on $S^3$.
Read the full abstract
Dynamical Systems
Emergent behaviors of Winfree oscillators on special orthogonal group
We propose a generalized matrix-valued synchronization model which can be regarded as matrix generalization of the classical Winfree model to the special orthogonal group, and we provide several sufficient frameworks leading to the emergent behaviors of the Winfree matrix model. For $SO(2)$ case, the proposed model reduces to the classical Winfree model. For the general (non-identical) case, we prove the existence of a positively invariant trapping region, establish a leader–follower mechanism in which sufficiently strong coupling draws all oscillators into a neighborhood of the identity whenever at least one oscillator is initially nearby, and show $\ell^1$-exponential stability of solutions, from which we deduce existence, uniqueness, and exponential convergence to an equilibrium. In the identical-oscillator regime, we show that complete state synchronization and oscillator death both occur exponentially fast with an explicit decay rate, and we classify all equilibrium configurations as solutions to a fixed-point equation for the mean influence.
Read the full abstract
Combinatorics · Cross-listed from cs.DS
A Complexity Dichotomy for Edge Subdivision to $H$-Free Graphs
For a fixed graph $H$, \HFS\ asks whether at most $k$ edge subdivisions can make an input graph contain no induced copy of $H$. We establish a complexity dichotomy for every fixed nonempty $H$: the problem is polynomial-time solvable if every component of $H$ is a subdivided star or a subdivided bistar and at most one component is a subdivided bistar; it is NP-complete otherwise. In every NP-complete case, the Exponential Time Hypothesis rules out a $2^{o(k)}n^{O(1)}$-time algorithm. For every fixed $H$, the problem admits a $2^{O(k)}n^{O(1)}$-time algorithm.
Read the full abstract
Optimization and Control
Continuum-marginal optimal transport: a mesh-free kernel method
In this paper we study continuum-marginal optimal transport. Given a time-continuous family of probability marginals, the problem is to recover the minimum-energy velocity field whose flow reproduces every marginal. This problem is the continuum limit of the classical two-marginal Benamou-Brenier formulation, and also the deterministic limit of the Nelson problem of stochastic optimal transport. We propose a practical mesh-free solver for this problem. The weak continuity equation is embedded in a reproducing kernel Hilbert space, yielding a sample-only objective that requires no spatial discretization. The velocity is parametrized by any linear-in-parameters dictionary or neural network, and is optimized by mini-batch stochastic methods. Synthetic experiments confirm that the method achieves accurate drift recovery and marginal consistency. The same computational framework also applies to the Nelson problem.
Read the full abstract
Combinatorics
On Detecting $H$-Induced Minors for Small $H$
We consider the $H$-Induced Minor problem: for a fixed graph~$H$, decide whether a given graph $G$ contains $H$ as an induced minor. While the problem is known to be NP-complete for some trees~$H$ on more than $2^{300}$ vertices, the complexity for small trees remains unresolved. In particular, the case where $H$ is the $7$-vertex tree consisting of a path on five vertices with a pendant vertex attached to the second and fourth vertex was a long-standing open problem. We show that this case is polynomial-time solvable by developing algorithms that detect a sequence of carefully chosen substructures. Complementing this, we prove that detecting some of these substructures individually is NP-hard. We also give polynomial-time algorithms for three cases where $H$ is a graph on five vertices (that is not a tree). In this way, we completed the classification of $H$-Induced Minor for graphs $H$ on five vertices and answered an open problem of Dallard, Dumas, Hilaire and Perez (2025).
Read the full abstract
Combinatorics
Continued fractions related to Narayana polynomials
The generating functions of some sequences of Catalan numbers and Narayana polynomials have simple expansions as continued fractions of Jacobi type. We give an overview of these facts and prove analogous results for q-Narayana polynomials at q=-1.
Operator Algebras
The real and stable rank of tracially complete C*-algebras
We prove that a factorial tracially complete C*-algebra with CPoU has real rank zero and stable rank one. This leads to an essentially complete description of the Cuntz semigroup of these algebras. In particular, the results of this paper hold for the uniform tracial completions of $\mathcal{Z}$-stable C*-algebras.
Read the full abstract
Combinatorics
Structural Classes for Chollet's Permanent Conjecture
In 1982, Chollet conjectured that $\operatorname{per}(A\circ B)\leq \operatorname{per}(A)\operatorname{per}(B)$ for Hermitian positive semidefinite matrices $A,B$, where $\circ$ denotes the Hadamard (entrywise) product. In this paper, we study natural structural classes for which the conjecture holds. We first show that a stronger inequality holds for a broad class of matrices with bipartite support. We then introduce a simple way of joining positive semidefinite matrices and give conditions under which Chollet's inequality is preserved under this operation. For graph Laplacians, this operation corresponds to vertex coalescence and gives larger structured graph families satisfying Chollet's inequality from simpler graph classes.
Read the full abstract
Probability
Malliavin calculus and densities for chaos-driven stochastic differential equations
We study stochastic differential equations driven by finite-order chaos processes on abstract Wiener spaces, with pathwise Riemann-Stieltjes integration. The driving noise is an $\mathbb{R}^m$-valued chaotic process given by multiple Wiener-Itô integrals of fixed order, allowing for non-Gaussian dynamics. Under mild smoothness assumptions on the coefficients and Hölder-type regularity of the noise, we establish existence and uniqueness of solutions. We then prove Malliavin differentiability and absolute continuity of the law of the solution. Since the usual Gaussian isonormal framework is unavailable, we rely on the Kusuoka-Stroock approach to Malliavin calculus and develop a Taylor expansion for multiple integrals under Cameron-Martin shifts. Under suitable ellipticity, independence, and non-degeneracy conditions, the Bouleau-Hirsch criterion yields density results. Applications to multidimensional Hermite-driven equations are provided.
Read the full abstract
Combinatorics
Conflict-free chromatic index of bipartite graphs
An edge coloring of a graph $G$ is called conflict-free if, for every edge, its closed neighborhood contains a color that appears exactly once. The least number of colors required for such a coloring is the conflict-free chromatic index of $G$, denoted by $\chi'_{CF}(G)$. Kamyczura, Meszka, and Przybyło conjectured that $\chi'_{CF}(G)\le 3$ for any bipartite graph $G$ without isolated vertices. In this paper, we confirm this conjecture.
Read the full abstract
Mathematical Physics
Liouville Quantum Duality and Random Planar Maps II
This is Part II of our project on block-weighted planar maps and Liouville quantum duality. Focusing on the scaling properties at the dual critical point, we derive the conditional distribution of the root block size given the total size, as well as, conversely, the distribution of the total size for a fixed root block size. We show that these laws are in perfect agreement with the results of Liouville quantum gravity (LQG), obtained by modifying the standard Liouville random measure with additional atomic contributions representing localized quantum areas. The ratio of dual and direct partition functions with punctures is shown to be universal, its explicit LQG expression exactly matching its combinatorial analogue. We also investigate the block distance profile for doubly rooted maps, which is here rigorously related to the distance profile of maps consisting of a single block. Finally, we analyze the multifractal properties of the usual and dual Liouville measures, predicting the associated spectra, from both quantum and Euclidean perpectives. We illustrate our results through specific realizations of block-weighted planar maps, i.e., quadrangulations decomposed into simple blocks, tree-like structures formed by attaching quartic maps, and bicubic maps decomposed into 3-connected blocks. For each model, we give the single non-universal constant which uniquely determines the strength of the corresponding atomic Liouville measure.
Read the full abstract
Number Theory
On D-cap-Modules of Finite Length on Rigid Analytic Spaces
We show that for quasi-compact smooth rigid analytic spaces, the extension functor sends holonomic D-modules to coadmissible D-cap-modules which are of finite length as weakly holonomic D-cap-modules. Using this, we show that the meromorphic connections considered by Bode–Bitoun and the local cohomology groups considered by Ardakov–Bode–Wadsley are of finite length as weakly holonomic D-cap-modules for quasi-compact smooth rigid analytic spaces. As a central tool, we introduce and study Hilbert polynomials for finitely generated modules over completed Weyl algebras.
Read the full abstract
Category Theory
Diagrammatics for lax and Frobenius monoidal functors and weak morphism classifiers
The theory of 2-monads entails that, for a strict monoidal category C, there is a strict monoidal category L(C) such that strict monoidal functors from L(C) are precisely the lax monoidal functors from C. We give an elementary, diagrammatic, construction of L(C) and of its variants for oplax and Frobenius lax functors. The diagrams used are analogous to the diagrammatics for lax monoidal functors studied by McCurdy.
Read the full abstract
Combinatorics
Permanental Energy of Graphs
For a simple graph $G$ with adjacency matrix $A(G)$, let $\pi(G,x):=\mathrm{per}(xI-A(G))$ be its permanental polynomial with roots $\mu_1,\ldots,\mu_n \in \mathbb{C}$, and define the permanental energy $E_{\mathrm{per}}(G):=\sum_{i=1}^n |\mu_i|$. We prove a sharp universal lower bound: for every $m$-edge graph $G$, $E_{\mathrm{per}}(G) \ge 2\sqrt{m}$, with equality if and only if $G$ is a star together with isolated vertices. We also prove the general upper bound $E_{\mathrm{per}}(G) \le n\rho(G)$, where $\rho(G)$ is the spectral radius, and we study $E_{\mathrm{per}}(G)$ on several graph families.
Read the full abstract
Algebraic Geometry
A Bornological Perspective on the Representability of Derived Moduli Stacks of Solutions to PDEs
Proving representability of derived moduli stacks of solutions to non-linear elliptic partial differential equations generally requires significant analytic machinery. In this paper, we instead show that representability naturally follows from an Artin-Lurie style representability theorem. This necessitates the development of a new model for derived differential geometry using an extension of $C^\infty$-rings that we call $C^\infty$-bornological rings. This new theory embeds into the theory of derived bornological geometry recently proposed by Ben-Bassat, Kelly, and Kremnizer.