Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 4 May

Analysis of PDEs

A stiff limit of non-homogeneous conservation laws for crowd motion modeling

We propose a new approach for crowd motion models where the density constraint can only slow down the motion of each agent, with no effect on those agents who are not in a saturated area or who have no saturated density ”in front” of them. This is done by means of a limit of conservation laws inspired by the equations used for traffic as in Follow the leader-type models. We study the asymptotics of the solutions of these conservation laws in a certain asymptotic regime, and obtain a PDE at the limit of a whole new type. One of the main goals of the paper is to prove uniform BV estimates on the density, and thus strong compactness to prove the existence of solutions to this limit equation. We also discuss the qualitative behavior of solutions, provide numerical illustrations both in dimension 1 and 2, and establish the new entropy inequalities associated with this limit equation.
Read the full abstract

Combinatorics

Shadows of Uniform Hypergraphs under a Minimum Degree Condition

Given a set $X$ and an integer $t$, let $\mathcal{F}$ be a family of $k$-subsets of $X$. The Kruskal–Katona theorem implies that if $|\mathcal{F}|\geq \binom{t}{k}$, then $|\partial_\ell\mathcal{F}|\geq\binom{t}{\ell}$. The minimum degree version of this problem asks: if $\delta(\mathcal{F})\geq \binom{t}{k-1}$, how small can $|\partial_\ell\mathcal{F}|$ be? We call a hypergraph extremal if it achieves the minimum value of $|\partial_\ell \mathcal{F}|$ subject to the degree condition $\delta(\mathcal{F}) \geq \binom{t}{k-1}$. Füredi and Zhao [SIAM J. Discrete Math. 36(4), 2022] proved that for $k=3$, $\ell=2$ and $t\ge 2$, every extremal hypergraph contains an isolated copy of $K_{t+1}^3$ when $|X| > \frac{1}{4}(t+1)^2(t+2)$. In this article, we study the general case $k > \ell \geq 2$. By developing a hypergraph transformation that combines shifting operations with antilexicographic compression, we prove that, for every integer $t\ge k-1$, there exists an extremal hypergraph containing an isolated copy of $K^{k}_{t+1}$ whenever $|X| > \frac{1}{4}(t+1)^2\binom{t-1}{\ell-2} + 3t+1$. In the case when $k=3$ and $\ell=2$, this gives the threshold $\frac14(t+1)^2+3t+1$, which is smaller than $\frac14(t+1)^2(t+2)$ for every $t\ge3$; for $t=2$, the two thresholds give the same integer condition on $|X|$.
Read the full abstract

Number Theory

Cusp forms and parabolic cohomology classes for symmetric spaces of rank one

For any rank-one Riemannian symmetric space S of non-compact type and any discrete, cofinite, non-cocompact, torsion-free group $\Gamma$ of orientation-preserving Riemannian isometries on S, we develop a cohomological interpretation for the cusp forms of $\Gamma$. To that end, we identify certain $\Gamma$-submodules of smooth semi-analytic vectors in the spherical principal series representation with spectral parameter $\nu$ as well as certain subspaces of parabolic cohomology spaces of $\Gamma$ of degree dim S-1 with these $\Gamma$-submodules. We provide explicit isomorphisms between the spaces of cusp forms of spectral parameter $\nu$ and these specific cohomology subspaces. The isomorphisms from cusp forms to cohomology are given by an integral transform, and the explicit form of the inverse isomorphism takes advantage of a certain reproducing property of the integral transform. The result is uniform for all these symmetric spaces and does not rely on their classification.
Read the full abstract

All authors Roelof Bruggeman, YoungJu Choie, Roberto Miatello, Anke Pohl

Combinatorics

A Quadratic Vertex Threshold for Isolated Cliques in the Minimum Degree Kruskal-Katona Problem for 3-Uniform Hypergraphs

Given a set $X$ and an integer $t$, let $\mathcal{F}$ be a family of $k$-subsets of $X$. The Kruskal-Katona theorem states that if $|\mathcal{F}|\geq \binom{t}{k}$, then $|\partial_{k-1}\mathcal{F}|\geq\binom{t}{k-1}$. The minimum degree version of this problem asks: if $\delta(\mathcal{F})\geq \binom{t}{k-1}$, how small can $|\partial_{k-1}\mathcal{F}|$ be? In this article, for the case $k=3$, we prove that, for every sufficiently large integer \(t\), every extremal hypergraph for this problem contains an isolated copy of $K_{t+1}^3$ whenever $|X| \geq ct^2 + o(t^2)$, with the constant $c = 1 + \sqrt{928/33}$. Our proof uses a graph transformation that regularizes the neighborhood structure of extremal graphs, reducing the problem to a counting argument on the neighbors of a disjoint clique family. This gives a quadratic-order threshold for the every-extremal version of the problem, compared with the cubic-order threshold of Füredi and Zhao [SIAM J.\ Discrete Math.\ 36(4), 2022].
Read the full abstract

Dynamical Systems

A geometric correspondence for reparameterizations of geodesic flows

For any non-elementary, torsion-free hyperbolic group, we provide a correspondence between the left-invariant Gromov-hyperbolic metrics on the group that are quasi-isometric to a word metric, and continuous reparameterizations of the associated Mineyev's flow space. From this correspondence, we produce the first examples of continuous reparameterizations of geodesic flows on negatively curved manifolds with all periodic orbits having integer lengths. For surface and free groups, this also yields isometric actions on Gromov-hyperbolic spaces on which loxodromic elements are precisely the non-simple elements. Key ingredients in our proof are an analysis of the geometry of Mineyev's flow space (such as the metric-Anosov property recently proven by Dilsavor), and the density of Green metrics in the moduli space of (symmetric) metrics on the group.
Read the full abstract

Optimization and Control

Linear Decision Tree Policies for Integer Linear Programs

We study optimal decision policies, represented as linear decision trees, for integer linear programs with a fixed feasible set and varying cost vectors. Once synthesized for a given feasible set, they return an optimal solution for any queried cost vector through a sequence of linear tests. We show that there exists a policy performing this operation in a polynomial number of arithmetic operations in the worst case. In contrast, deciding whether there exists an exact policy with a prescribed maximum number of leaves is $\Sigma_2^p$-complete. Alongside these theoretical results, we develop a practical construction framework to synthesize policies within a specific subclass of linear decision trees. Our computational experiments show that, although policy synthesis can be time-intensive, it allows one to retrieve optimal solutions orders of magnitude faster than classical and specialized solution methods on repeated queries. Overall, this paradigm provides a different perspective on the solution of integer linear programs and offers a principled offline-online approach for repeated optimization.
Read the full abstract

All authors Théo Guyard, Cleber Oliveira, Maximilian Schiffer, Eduardo Uchoa, Thibaut Vidal

Algebraic Geometry

Anabelian geometry for Deligne-Mumford curves

We develop an anabelian framework for general Deligne-Mumford curves, showing that their stack and orbifold structures are encoded in the group-theoretic properties of their étale fundamental groups. After establishing the required properties for profinite F-groups, we prove that fundamental geometric features, including hyperbolicity, affineness, and inertia data, can already be detected from low-level solvable quotients of the associated profinite groups, namely at the optimal 3-step level. As a consequence, we obtain some anabelian reconstruction results for Deligne-Mumford curves, their rigidifications, and their coarsification. While the m-step Grothendieck conjecture doesn't hold for Deligne-Mumford curves, we establish a 5-step anabelian theorem for the rigidification of affine Deligne-Mumford curves, namely affine stacky curves. A certain emphasis is given to the role of stack inertia groups.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.mtrl-sci

Rigorous foundations of the effective mass approximation: analyticity and symmetry of band extrema

The effective mass approximation is widely used across models of carrier transport, optical response, and excitons in semiconductors and insulators, but its validity hinges on the assumption that the band dispersion $E_n(\mathbf{k})$ at the relevant extremum is analytic. We prove that analyticity holds at any non-degenerate extremum for Kohn-Sham density functional theory (DFT) with local or hybrid exchange-correlation functionals, for Hartree-Fock, and for band-edge $G_0 W_0$ quasiparticle energies in gapped systems. Band non-analyticity (or warping) in these settings is therefore intrinsically tied to degeneracy. We then use group theory to determine the symmetry-allowed form of the effective mass tensor for each of the 32 crystallographic point groups, providing a stringent consistency check on first-principles calculations. As a representative application, we show that the electron and hole effective masses at the $K$ point of monolayer MoS$_2$ must be strictly isotropic at the DFT and $G_0W_0$ levels.
Read the full abstract

Numerical Analysis · Cross-listed from stat.CO

Fast and accurate conditioning for large-scale Gaussian process prediction problems

Gaussian Process (GP) models provide a flexible framework for prediction and uncertainty quantification. For most covariance functions, however, exact GP prediction with $n$ points scales as $\mathcal{O}(n^3)$, making it prohibitively expensive for large datasets or large numbers of prediction points. While nearest neighbor-based prediction can work well in certain settings, non-pathological circumstances (like measurement noise, for example) can severely restrict its efficiency. This work presents a complementary approach where one conditions on carefully designed linear combinations of data, which is particularly effective in the setting of jointly predicting many values in large connected regions of the data domain. For kernel functions that are smooth away from the origin and simple prediction domains, this method can be exponentially convergent in the number of linear combinations $r$ used for conditioning. The procedure costs $\mathcal{O}(T r^2)$ work, where $T$ is the cost of solving a linear system with the data covariance matrix, and so in many cases can be computed in linear or near-linear cost by exploiting rank structure in well-behaved covariance matrices. At the cost of $\mathcal{O}(nr^2)$ additional precomputation work, this approach can also provide predictions at arbitrary points of a designated region in $\mathcal{O}(1)$ online work, making it particularly attractive for problems where prediction points are not known in advance. After establishing favorable theoretical properties, we provide several example applications to problems in prediction and matrix approximation.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Construction of Quantum Rank-Metric Codes Using Hermitian Orthogonality

Stacked quantum memory is an architecture in which multiple layers of qubits are stacked. Quantum rank-metric codes are effective for error correction in stacked quantum memories. However, the previously proposed quantum Gabidulin codes based on the CSS construction had a problem: due to algebraic constraints, the applicable memory layouts were strictly limited to square shapes of odd length. In this paper, we first propose a framework for constructing quantum rank-metric codes from classical linear codes with symplectic self-orthogonality. Building upon this, we propose a new construction method for quantum Gabidulin codes by combining the Hermitian self-orthogonality of classical Gabidulin codes–utilizing the self-dual basis that exists when the extension degree of the finite field is even–with the quantum code construction method using Hermitian orthogonality by Matsumoto and Uyematsu. The proposed method succeeds in approximately doubling the ratio of the minimum rank distance to the number of physical qubits while maintaining the code rate. Furthermore, it eliminates the restriction of the conventional method that requires the number of cells and layers of the stacked memory to be odd, realizing the construction of quantum rank-metric codes applicable to memories with an even number of cells and layers. This construction improves the relative error correction capability of the stacked quantum memory architecture and increases the degree of freedom in design while preserving the code rate.
Read the full abstract

Analysis of PDEs

The obstacle problem for singular quasi-linear elliptic equations

Existence of solutions to an obstacle $p$-Laplacian problem exhibiting a singular, discontinuous reaction is proved. The reaction term may be discontinuous in a Lebesgue-negligible set. Moreover, solutions are shown to be locally $C^{1,\alpha}$ far away from the contact set. Under a differentiability hypothesis on the obstacle, solutions belong to $C^{1,\alpha}(\overline{\Omega})$.
Read the full abstract

Analysis of PDEs

Quantitative homogenization of elliptic equations with infinitely many scales

In this paper, we develop a general homogenization theory for elliptic equations with coefficients that oscillate periodically at infinitely many scales $\varepsilon = (\varepsilon_1, \varepsilon_2, \cdots) \in (0,1)^\infty$, with $\varepsilon_1>\varepsilon_2>\cdots$ and $\varepsilon_n \to 0$ as $n \to \infty$. Such problems arise naturally in the study of fractal materials and diffusion in fluids. Under suitable scale-separation assumptions, we prove a qualitative homogenization theorem and obtain optimal $L^2$ convergence rates. We also establish interior and boundary Lipschitz estimates that are uniform in $\varepsilon$.
Read the full abstract

Numerical Analysis

Well-Balanced Subcell Limiting for Discontinuous Galerkin Discretizations of the Shallow-Water Equations

High-order discontinuous Galerkin (DG) methods equipped with subcell finite-volume (FV) limiters provide an efficient framework for the simulation of nonlinear hyperbolic balance laws featuring shocks and complex flow structures. However, for systems with non-conservative terms, the design of hybrid DG/FV schemes that simultaneously guarantee high-order accuracy, robustness, and well-balancedness remains challenging. In particular, for the shallow water equations with variable bottom topography, standard flux-differencing formulations combined with node-wise subcell limiting generally destroy the well-balanced property, even if both the underlying DG and FV methods are individually well-balanced. In this work, we propose a novel flux-differencing formulation for non-conservative systems that enables node-wise subcell limiting while preserving steady states exactly. The key idea is to construct staggered DG fluxes whose non-conservative contributions are in local-times-jump form and vanish individually at equilibrium. To achieve this, we introduce a reformulation of the shallow water equations in which the source term is proportional to the gradient of the total water height. This reformulation allows the design of staggered fluxes that preserve equilibrium locally at the node level, thereby enabling arbitrary nodal blending with low-order FV fluxes. The resulting DG/FV method is high-order accurate, robust, and exactly well-balanced under node-wise limiting. Numerical experiments, including two-dimensional dam-break configurations with wet/dry fronts and complex obstacle interactions, demonstrate the improved stability and accuracy of the proposed approach. Although this work focuses on the shallow water equations, the well-balanced hybrid DG/FV methods developed here are applicable to a broader class of nonlinear systems of balance laws.
Read the full abstract

All authors Andrés M. Rueda-Ramírez, Patrick Ersing, Andrew R. Winters, Gregor J. Gassner

Analysis of PDEs

On Spectral multiplier theorem for sub-Laplacians with drift on Métivier groups

In this paper, we prove a spectral multiplier theorem for sub-Laplacians with drift on Métivier groups. We improve the result of [Martini, Ottazzi and Vallarino, Rev. Mat. Iberoam, 2019] in case of Métivier groups, by reducing the required smoothness condition on the multiplier function from homogeneous dimension to the topological dimension of the underlying group.
Read the full abstract

Operator Algebras

On the Shilov boundary ideal for Fréchet local operator systems

We show that the Shilov boundary ideal for a separable Fréchet local operator system is given by the intersection of the kernels of all its $\Gamma$-boundary representations.

Combinatorics

Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number

For integers $k\ge 1$ and $m\ge 2$, let $g(k,m)$ be the least integer $n\ge 1$ such that every graph with chromatic number at least $n$ contains a $(k+1)$-connected subgraph with chromatic number at least $m$. We prove that \[ g(k,m)\le \max(m+2k-2,\,3k+1) \] for all $k\ge 1$ and $m\ge 2$, establishing the 1983 conjecture of Thomassen that $g(k,k+1)\le 3k+1$. The key new ingredient is a Hall-feasibility argument replacing the final numerical step in the proof of Nguyen.
Read the full abstract

Analysis of PDEs

On the onset of correlations in Wave Turbulence close to singularities

In this paper we describe in a formal way how the derivation of the turbulent wave equation for the Schrödinger equation breaks down for times close to the self similar blow up of the wave turbulence kinetic equation. To this end, we study how the derivation of the cumulants hierarchy can not be approximated using solutions of the wave turbulence kinetic equation near the blow up time. It tuns out that near the blow up time the kinetic equation has to be replaced by a hierarchy of equations which is equivalent to a random field, defined for times $t\in (-\infty, \infty)$ and satisfying a nonlinear non autonomous Schrödinger equation.
Read the full abstract

Combinatorics

Self-dual codes with group actions and invariants

In this paper, we define dual codes over arbitrary finite rings with respect to arbitrary bilinear forms and provide a generalization of Hayden's theorem (Bridges, Hall, and Hayden, 1981). Building on this foundation, we introduce the concept of $G$-dual codes for codes invariant under a permutation group $G$, referred to as $G$-codes. We then present several generalizations of Atsumi's MacWilliams identity (Atsumi, 1995; Chakraborty and Miezaki, 2023) for $G$-codes over finite rings with respect to general bilinear forms. Furthermore, we establish a $G$-analogue of the MacWilliams identity for $G$-full weight enumerators and introduce the notions of $G$-quadratic maps and $G$-representations for twisted modules, twisted rings, quadratic pairs, and form rings. By defining transformation groups for $G$-full weight enumerators, we extend the theory of Clifford–Weil groups (Nebe, Rains, and Sloane, 2004, 2006). Finally, we provide generalizations of Gleason-type theorems for these weight enumerators, demonstrating that the $G$-full weight enumerators of $G$-self-dual and $G$-isotropic codes are invariant under the Clifford–Weil groups and span the invariant subspaces of these groups.
Read the full abstract

Commutative Algebra

Toric rings associated with root systems and conic divisorial ideals via matroid theory

We study conic divisorial ideals from the viewpoint of matroid theory and apply the resulting framework to toric rings arising from root systems. For a toric ring, we describe the polytope representing divisor classes corresponding to conic divisorial ideals in terms of matroids. We then turn to the toric ring $R_P$ associated with a certain subset $P$ of a classical root system, called a signed poset. We compute the divisor class group and characterize the ($\mathbb{Q}$-)Gorenstein property of $R_P$ in terms of $P$. Moreover, we also construct a polytope characterizing the conic divisorial ideals of $R_P$. This recovers and extends previous results on Hibi rings to our toric rings.
Read the full abstract

Representation Theory

Orthogonal polynomials and the centres of the universal central extensions of superelliptic Krichever–Novikov algebras

We study the universal central extensions of the derivation and current algebras of a superelliptic curve $u^m=P(x)$, for $P$ palindromic of degree $2r$. Both centres are finite-dimensional and canonically isomorphic. On the derivation side the dimension is known at every covering degree, while reducing an arbitrary class has been done only for the double cover $m=2$; we do it at every $m$. The spanning classes split into $r(m-1)$ chains, each an associated ultraspherical family whose parameters come from the sector and the residue, and we determine which chains carry a positive orthogonality measure. For quadratic $P$ we evaluate the mixed cocycle in closed form, as a combination of two Legendre antiderivatives, at every pair of generators of total index at least three.
Read the full abstract

Algebraic Geometry

Deligne-Lusztig varieties whose canonical divisors have negativity

We investigate compactified Deligne-Lusztig varieties whose canonical divisor, when expressed as a linear combination of boundary divisors, has all coefficients strictly negative or zero. In dimension two we obtain explicit descriptions: The case $C_2$ gives the supersingular K3 surface with Artin invariant $\sigma=1$ in characteristic two. The arguments rely on properties of the Tutte-Coxeter graph; in this connection we also gain some insight into the arithmetic of quasi-elliptic Weierstrass equations and rational double points. The twisted cases ${}^2A_2$ and ${}^2C_2$ and ${}^2G_2$ yield particular ruled surfaces, attached in a canonical way to supersingular elliptic curves in characteristic two, or the Ree curve in characteristic three. The latter is a curve of genus fifteen with outstanding symmetries. In the former cases, the surfaces can also be expressed as symmetric squares. To obtain such results, we develop a new general framework for Deligne-Lusztig varieties that relies on the Isogeny Theorem, and works over prime fields rather than their algebraic closures, and includes the notorious Suzuki-Ree cases without effort.
Read the full abstract

Dynamical Systems

Graphons, Geometry, and Dynamics: Forward and Inverse Perspectives

In this work, we explore the interplay between graph limit theory, the geometry of underlying probability spaces, spectral theory, and network dynamical systems. We investigate two primary questions concerning forward and inverse perspectives: first, whether a graphon retains information about the geometry of the space on which it is defined, and second, whether spectral properties can distinguish graphons that originate from different geometric spaces. To address these questions, we differentiate between combinatorial equivalence and geometric structure, highlighting how these concepts are captured simultaneously by the class of pure graphons. Furthermore, we construct explicit examples of isospectral graphons – graphons whose integral operators share the same spectrum – that differ in their underlying geometry. By utilizing the heat kernels of Neumann- and Dirichlet-isospectral drums, we demonstrate that these graphons are not combinatorially equivalent. Finally, we establish new connections between the geometric aspects of graph limit theory and dynamical systems by analyzing a continuum Kuramoto model with graphon-defined interactions. We demonstrate that while isospectrality implies identical stability properties in certain cases, this correspondence breaks down when the differing boundary conditions of our specific Neumann and Dirichlet constructions are considered.
Read the full abstract

Information Theory

Computability Limits of Sequential Hypothesis Testing

Sequential hypothesis testing asks for decision rules that update as data arrive. A natural goal is eventual correctness: the rule may change its mind early on, but it should make only finitely many wrong decisions almost surely. Starting from Cover's theorem, which guarantees such behavior for membership in a countable set of candidate means, we ask a sharper question: which sets actually admit computable sequential decision procedures with finitely many errors? We answer this optimally by giving a complete characterization both necessary and sufficient of the subsets of $\Q$ that admit a computable finite-error sequential membership test. We further extend the characterization to any effectively presented countable family of real means, exactly the setting in which Cover's identification rule can be implemented computably. Beyond the technical boundary, the results clarify within a precise probabilistic setting what it can mean for inquiry to “converge to the truth,” and they formalize a limit to which empirical methods can be expected to succeed when only eventual stabilization (rather than fixed-time guarantees) is demanded. keywords: Cover's theorem, sequential decision procedures, finite error learning, limit computability, $\Delta^0_2$ sets.
Read the full abstract

Probability

Genealogical structures under interactive neutral reproduction: factorial moment duality via a Frankenstein process

We establish a genealogical framework for an existing analytical moment duality between a Wright–Fisher type SDE and a counting process with interaction. To achieve this, we construct a finite-population Moran model featuring interactive neutral reproduction as a novel mechanism. In the corresponding events, an individual, regardless of its own type, can only reproduce if a randomly encountered partner is of the “fit” type. This Moran model has a relatively simple counting process as its factorial moment dual, whose genealogical meaning appears to be cryptic: after all, the line-counting process of the natural genealogical process of the model, namely the ancestral influence graph (AIG), exhibits a complex hierarchical structure not reflected in the factorial moment dual. Since moment duality is a property in expectation, we are allowed to systematically remove information from the AIG and merge different realizations of the ancestry. We call the result the Frankenstein process. Based on this, we establish the factorial moment duality from a genealogical perspective. The moment duality in the diffusion limit follows in a natural way.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures

We consider the routing of neutral atoms on a reconfigurable lattice in terms of hypergraph transformations. We prove the routing number of a Ramanujan $(d,r)$-regular hypergraph on $N$ vertices satisfies $\mathrm{rt}(H) = \Theta(\log N)$, where routing is via matchings in the clique expansion graph $G_{\mathrm{cl}}(H)$. Hypergraphs reframe the qubit routing problem by replacing Nenadov's two-sided spectral gap hypothesis with a one-sided condition based on eigenvalue centering. Song–Fan–Miao (SFM) coverings scale for Ramanujan families of every uniformity. A virtual overlay theorem establishes a capacity–depth tradeoff for 3D acousto-optic lens (AOL) architectures, with multi-layer stacking achieving $\Theta(\log N)$ routing with $L = O(\log N)$ independent overlay layers. An abelian Alon–Boppana barrier shows that fixed-degree Cayley graphs on $\mathbb{Z}_n^2$ cannot be Ramanujan and affine derandomization on such graphs achieves 15–30% congestion reduction. Towers of $k$-fold Ramanujan coverings yield $\mathrm(H_L) = O(\log N)$ by recursive routing lift. Entanglement-assisted routing by pre-distributed Bell pairs achieves $O(\log N)$ teleportation depth with a stable crossover at $\sim\!4$ routing rounds. Displacement energy analyzes greedy adaptive routing, identifying stalling and a hybrid greedy–Valiant protocol achieving $\sim\!3\times$ speedup at practical scales. Hierarchical multi-scale routing achieves $O(\log^2 N / \log b)$ depth with boundary-only transfers at capacity $k = O(\sqrt{N} \log N)$, and $O(\log N)$ depth with optimal block size $b = \Theta(\sqrt{n})$.
Read the full abstract

Optimization and Control

Closed Forms for Gaussian Kullback–Leibler Unbalanced Optimal Transport without Coupling Entropy

We obtain an explicit solution for the static Kullback–Leibler (KL) unbalanced optimal transport problem between finite non-degenerate Gaussian measures with quadratic cost, two independent positive marginal relaxation parameters, and no entropy penalty on the coupling. The minimizer is a scaled Wasserstein coupling between two adjusted Gaussian marginals and is supported on an affine graph; in entropic Gaussian unbalanced transport, by contrast, the optimal plan is non-degenerate on the product space. The covariance map is the unique positive definite solution of a Riccati equation and admits a principal-square-root representation. Compared with the known equal-penalty Gaussian Hellinger–Kantorovich endpoint, the result treats the asymmetric two-sided Kullback–Leibler relaxation and gives the modified marginals, joint minimizer, value, and a direct quadratic KL-dual certificate. The large-relaxation limit recovers the Gaussian Wasserstein cost for equal masses.
Read the full abstract

Differential Geometry

On Bismut–Ambrose–Singer manifolds

We investigate Bismut–Ambrose–Singer (BAS) manifolds, namely Hermitian manifolds whose Bismut connection has parallel torsion and parallel curvature. We first establish a canonical reduction theorem for complete, simply-connected BAS manifolds. We then classify simply-connected BAS manifolds in the three fundamental homogeneous settings: the compact case, the non-compact semisimple case, and the nilpotent case. Building on this, we construct BAS manifolds in which these three geometries are combined, generalizing all previously known examples. Finally we classify complete, simply-connected, pluriclosed BAS manifolds.
Read the full abstract

Algebraic Geometry

The Algebraic Boundary of Graph Elliptopes

This paper studies the algebraic boundary of the elliptope $\mathcal{E}(G)$ of a graph $G$. In particular, we completely characterize the algebraic boundary of $\mathcal{E}(G)$ when $G$ is cycle completable. In this case, the boundary is a union of determinantal hypersurfaces and Lissajous varieties, i.e., images of rational linear subspaces under the coordinatewise cosine map. As an application, we show that the algebraic boundary of $\mathcal{E}(G)$ is disjoint from its interior precisely when $\mathcal{E}(G)$ is a spectrahedron or, equivalently, when $G$ is a chordal graph. A central ingredient for the defining equation of the boundary hypersurface is the cycle polynomial, which captures the algebraic boundary of the elliptope $\mathcal{E}(C_n)$ of the $n$-th cycle graph $C_n$. We show that the cycle polynomial of $C_n$ is the resultant of two smaller cycle polynomials. Via this result, Sylvester's determinantal formula offers an inductive method for computing the cycle polynomial which mirrors a geometric property of metric polytopes. We also determine the degree of the homogeneous cycle polynomial, settling an open question of Sturmfels and Uhler (2010).
Read the full abstract

Analysis of PDEs

Quantitative observability of the Schrödinger equation in the torus from open sets

We study the observability of the Schrödinger equation on the $d$-dimensional torus $\T^d=\R^d/(2\pi\Z)^d$, $d \geq 1$, from an open subset $\omega \subset \T^d$. Our main result establishes a quantitative observability estimate for the free Schrödinger equation in the regime of small times $T$ and small observation sets of the form $\omega = \prod_{j=1}^{d}(a_j,b_j)$. A central ingredient in the proof is a cluster decomposition method combined with an induction scheme introduced by Bourgain and further developed by Burq and Zhu.
Read the full abstract

2605.02480 · 4 May · This version replaces the last one that was containing a gap in the proofs of the main result. We have saved one of our main result about the quantitative observability of the Schrödinger equation, but we have lost the one about the potential unfortunately