Algebraic Geometry
Some remarks on degeneracy of tridimensional tensors
Alessandro Gimigliano and Monica Idà
We study tridimensional tensors on the complex field from the point of view of hypermatrices, taking into consideration the problem of determining whether they are degenerate or not, concise or not, what is their essential format if they are non-coincise, and, in some cases, their tensor rank. We use a geometrical approach to these problems which, in part, goes back to Schläfli and consists in studying certain determinantal schemes associated to the hypermatrix.
Read the full abstract ▾
Algebraic Geometry
Canonical forms and moment-generating functions of plane polypols
Boris Shapiro
We study two closely related objects associated with plane domains bounded by rational algebraic arcs: canonical forms in the sense of positive geometry and normalized moment-generating functions, or Fantappie transforms. For polygons these objects are related by polarity: the normalized Fantappie transform of a polygon is the canonical form of the polar polygon. For genuinely curved polypols the same dual-
geometric mechanism survives, but the transform is no longer a rational logarithmic canonical form; rather, it is a holonomic, generally branched period whose singularities are controlled by vertex hyperplanes and by the projective dual curves of the nonlinear boundary components. We give explicit examples, including sectors and half-disks, and explain how harmonic moment generating functions arise as one-dimensional restrictions of the same Fantappi`e transform.
Read the full abstract ▾
Combinatorics
Enumeratively Chromatic-Choosable Theta Graphs
Yanghong Chi, Seoju Lee, Fennec Morrissette et al. (+3 more)
Chromatic choosability is a notion of fundamental importance in list coloring. A graph $G$ is chromatic-choosable when its chromatic number, $\chi(G)$, is equal to its list chromatic number $\chi_{\ell}(G)$. In 1990, Kostochka and Sidorenko introduced the list color function of a graph $G$, denoted $P_{\ell}(G,m)$, which is the list analogue of the chromatic
polynomial of $G$, $P(G,m)$. A graph $G$ is said to be enumeratively chromatic-choosable when $P_{\ell}(G,m)=P(G,m)$ for every $m \in \mathbb{N}$. Theta graphs and their generalizations have played an important role in graph coloring problems over the years; for example, they appear in the characterization of chromatic-choosable graphs with chromatic number 2. In this paper we characterize the enumeratively chromatic-choosable theta graphs. Our proof utilizes ideas from DP-coloring (a.k.a. correspondence coloring), providing yet another example of how the more general setting of DP-coloring can be leveraged to attack a problem in list coloring.
Read the full abstract ▾
All authors Yanghong Chi, Seoju Lee, Fennec Morrissette, Jeffrey A. Mudrock, Gavin Nguyen, Benjamin Whatley
Numerical Analysis
Relaxation via Separable Estimators: Arithmetic and Implementation
Yanlin Zha, Mario Eduardo Villanueva, Boris Houska et al. (+1 more)
This article presents an arithmetic, called superposition relaxation, for bracketing the graph of a multivariate factorable function on a compact domain between a pair of underestimating and overestimating functions that are both separable. Propagation rules are established for affine and nonlinear composition operations, with a focus on exploiting global monotonicity and convexity properties in the composition. The local convergence properties of this arithmetic are also analyzed in both the pointwise and Hausdorff sense, including conditions under which quadratic pointwise convergence propagates through composition. Parameterizations of the univariate summands in a superposition relaxation either as piecewise-constant or continuous piecewise-linear functions are discussed for a practical implementation. It is shown through numerical case studies that superposition relaxations can be consistently tighter than McCormick relaxations, including for the relaxation of artificial neural networks. But superposition relaxations also incur a higher computational cost than McCormick relaxations. Further investigations are thus warranted as applications in global optimization seek to balance a relaxation's tightness with its computational cost.
Read the full abstract ▾
All authors Yanlin Zha, Mario Eduardo Villanueva, Boris Houska, Benoît Chachuat
Analysis of PDEs
Well-posedness of a generalized Stokes operator on domains with cylindrical ends via layer-potentials
Mirela Kohr, Victor Nistor and Wolfgang Wendland
We study the generalized Stokes operator \begin{equation*} \bsXi \ede \bsXi _{V,V_0} \ede \left(\begin{array}{ccc} \bsL + V & \nabla \\ \nabla^* & -V_0 \end{array}\right) \end{equation*} on a domain with straight cylindrical ends $\Omega$ using the method of layer potentials on $M \supset \Omega$. The operator $\bsXi_{0, 0}$ is the classical Stokes operator. Under suitable positivity assumptions on $V$ and $V_{0}$, we prove that $\bsXi$ is Fredholm. This allows us then to define the single- and double-layer potentials $\bsS$ and $\frac12 + \bsK$. Under further positivity assumptions, we prove that $\bsS$ and $\frac12 + \bsK$ are also Fredholm. Under slightly stronger assumptions on $V$ and $V_{0}$, we prove the invertibility of the operators $\bsXi$, $\bsS$, and $\frac12 + \bsK$. The invertibility of these operators leads to well-posedness results for the associated (linear) Stokes boundary value problem with Dirichlet boundary conditions on $\Omega$. The proofs of these results required us to develop many related tools. In particular, we develop an “
algebra tool kit” to deal with limit and jump relations of layer potentials. We also develop Green formulas and energy estimates for our generalized Stokes operator $\bsXi$ on
manifolds with straight cylindrical ends, which requires a careful
geometric study of the related differential operators, such as the deformation operator $\Def$. For completeness, we review suitable classes of pseudodifferential operators on
manifolds with straight cylindrical ends that were studied in some previous papers of ours (including “The Stokes operator on
manifolds with cylindrical ends,” J. Diff. Equations, 2024). As an application, we prove the well-posedness result for the Dirichlet problem for the generalized Navier-Stokes system with small data on a domain with cylindrical ends.
Read the full abstract ▾
Statistics Theory · Cross-listed from econ.EM
Higher-Order Neyman Orthogonality in Moment-Condition Models
Stéphane Bonhomme, Koen Jochmans, Whitney K. Newey et al. (+1 more)
We construct moment functions that are Neyman-orthogonal to a chosen order in moment-condition models that involve finite-dimensional nuisance parameters. These moment functions reduce sensitivity to estimation error in the nuisance parameters and, as such, offer a unified and tractable route to higher-order debiasing in a wide range of econometric models. The number of additional nuisance parameters required by our construction, beyond those already present in the original moment conditions, is independent of the order of orthogonalization and can be reduced to a single scalar if desired.
Read the full abstract ▾
All authors Stéphane Bonhomme, Koen Jochmans, Whitney K. Newey, Martin Weidner
Logic · Cross-listed from cs.LO
Constant time testability of first-order logic with modulo counting on finitary graphs
Isolde Adler and Jenny Stimpson
This paper studies algorithmic meta
theorems for property testing with constant running time in the bounded degree model. In (Adler, Harwath 2018) it was shown that on graph classes $\mathcal C^{w}_d$ consisting of all graphs with both degree at most $d$ and treewidth at most $w$, every problem expressible in monadic second-order logic with counting (CMSO) is testable with polylogarithmic running time (where $d,w\in \mathbb N$ are fixed). It was left open whether this can be improved to constant running time. In this paper we give a positive answer for testing CMSO on classes $\mathcal C^{c}_d$, where $d$ bounds the degree and $c$ bounds the component size. Our main result shows constant time testability of first-order logic with modulo counting (FOMOD) on $\mathcal C^{c}_d$. For our proof we tailor Hanf normal form of FOMOD to our setting, and we exhibit a number-theoretic `patchability' condition that allows to infer global information on the input graph from a local sample of constant size. We believe that our `patchability' might be of independent interest. The step from FOMOD to CMSO then follows from a result by (Eickmeyer, Elberfeld, Harwath, 2017) on the expressive power of order invariant monadic second-order logic on classes of bounded treedepth.
Read the full abstract ▾
Differential Geometry
On an invariant curvature cone along 4-dimensional Ricci flow
Hongting Ding, Shaochuang Huang and Zhuo Peng
In this paper, we study 4-dimensional complete noncompact
manifolds (M,g) satisfying Rm(g) $\in\mathfrak{C}_{\eta,\mu}$ via
Ricci flow. Under the additional assumption of maximal volume growth, we prove topological and
geometric gap
theorems. We also study 4-dimensional complete
manifolds satisfying a lower bound with respect to $\mathfrak{C}_{\eta,\mu}$ and obtain regularity results for Gromov-Hausdorff limits of complete volume non-collapsed
manifolds satisfying such
curvature lower bounds.
Read the full abstract ▾
Differential Geometry
Convergence of the Yang-Mills flow on ALE gravitational instantons
Anuk Dayaprema and Alex Waldron
We prove a sharp convergence
theorem for the Yang-Mills flow on an $\mathrm{S}\mathrm{U}(r)$-bundle over a locally hyperKähler ALE 4-
manifold. Our main result is a noncompact version of the "
parabolic gap
theorem" previously established by the authors.
Optimization and Control
Switching-Geometry Analysis of Deflated Q-Value Iteration
Donghwan Lee
This paper develops a joint spectral radius (JSR) framework for analyzing rank-one deflated Q-value iteration (Q-VI) in discounted Markov decision process control. Focusing on an all-ones residual correction, we interpret the resulting
algorithm through the geometry of switching systems and, to the best of our knowledge, give the first JSR-based convergence analysis of deflated Q-VI for policy optimization problems. Our analysis reveals that the standard Q-VI switching system model has JSR exactly the discount factor $\gamma\in (0,1)$, since all admissible subsystems share the all-ones vector as an invariant direction. By passing to the quotient space that removes this direction, we obtain a projected switching system model whose JSR governs the relevant error dynamics and may be strictly smaller than $\gamma$. Therefore, the deflated Q-VI admits a potentially sharper convergence-rate characterization than the ambient-space $\gamma$-bound. Finally, we prove that the correction is equivalent to a scalar recentering of standard Q-VI. Hence, the projected trajectory, and therefore the greedy-policy sequence, is unchanged relative to standard Q-VI initialized from the same point. The benefit of deflation is not a change in the induced decision-making problem, but a more precise JSR-based description of the convergence geometry after the redundant all-ones component is removed.
Read the full abstract ▾
Spectral Theory
Berry's phase under topology change
Pavel Kurasov, Vladislav Shubin and Axel Tibbling
Laplacians on metric graphs are used to construct continuous families of
Hamiltonians with different topological structure. One such family is used to demonstrate that
Hamiltonians with real-valued eigenfunctions may possess non-trivial
geometric Berry's phase. Connections between non-trivial Berry's phase and
topology change are discussed.
Read the full abstract ▾
Optimization and Control
Implicit Neural Optimal Transport via Fixed-Point Optimization
Yesom Park, Eric Gelphman, Stanley Osher et al. (+1 more)
We propose an implicit neural formulation of optimal transport that eliminates
adversarial min–max optimization and multi-network architectures commonly used in existing approaches. Our key idea is to parameterize a single potential in the Kantorovich dual and reformulate the associated c-transform as a proximal fixed-point problem. This yields a stable single-network framework in which dual feasibility is enforced exactly through proximal optimality conditions rather than
adversarial training. Despite the inner fixed-point computation, gradients can be computed without differentiating through the fixed-point iterations, enabling efficient training without requiring implicit differentiation. We further establish convergence of
stochastic gradient descent. The resulting framework is efficient, scalable, and broadly applicable: it simultaneously recovers forward and backward transport maps and naturally extends to class-conditional settings. Experiments on high-dimensional Gaussian
benchmarks, physical
datasets, and image translation tasks demonstrate strong transport accuracy together with improved training stability and favorable computational and
memory efficiency.
Read the full abstract ▾
All authors Yesom Park, Eric Gelphman, Stanley Osher, Samy Wu Fung
Analysis of PDEs
Entropy Structures and Long-Time Relaxation for 3-Wave Kinetic Equations
Gigliola Staffilani and Minh-Binh Tran
We establish a new class of
entropy structures for \(3\)-wave kinetic equations with a broad family of interaction weights. Unlike the classical
entropies arising from detailed balance, these estimates are generated by a one-sided algebraic balance condition encoded in the interaction weights. To the best of our knowledge, this family of
entropy estimates has not previously appeared in the physical literature on wave
turbulence. These estimates form the central a priori mechanism of the paper and are the key ingredient in the construction of global weak \(L^1_{\mathrm{loc}}\) solutions. We also prove a long-time
rigidity result, showing that the solutions obtained by this
entropy compactness method relax locally to the zero
equilibrium as \(t\to\infty\).
Read the full abstract ▾
Combinatorics
Star observations in bounded-degree graphs
Balazs Szegedy
Similarity metrics are central in the theory of large networks and graph limits. For bounded-degree graphs, the Benjamini–Schramm metric records the distribution of rooted neighbourhoods, while the stronger colored-neighbourhood metric gives rise to local-global convergence. In this paper we show that this intricate
topology is already determined by much smaller observations. For technical convenience and greater generality, we work with graphings, which are measurable generalizations of finite graphs and include all finite graphs as special cases. We prove that, for graphings of uniformly bounded degree, convergence of all colored degree distributions, or equivalently of all colored
star statistics, is equivalent to local-global convergence. We also introduce an even more economical sampling procedure, the colored cherry metric, in which one observes only the root and two randomly chosen neighbours, and prove that it induces the same
topology. Thus the full local-global structure can be reconstructed, at the level of
topology, from families of very small colored observations. Our
star-observation
theorem was previously announced in the work of Backhausz and the author as an important ingredient in the proof that the so-called action convergence unifies dense graph limit theory with local-global convergence, thereby providing a general graph limit theory for sparse, dense, and intermediate-density graphs.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
On the KAK Decomposition and Equivalence Classes
Dawei Ding, Yu Liu and Zi-Wen Liu
The KAK decomposition is a fundamental tool in Lie theory and
quantum computing. Despite its widespread use, the mathematical foundations remain incomplete, particularly regarding the precise conditions for the decomposition and the characterization of equivalence classes under multiplication by elements of $K$. Here, we present a mathematical theory of the KAK decomposition for connected compact semisimple Lie groups and derive the decomposition for $\mathrm{SU}(4)$. In particular, we clarify the relationship between various definitions of a Cartan decomposition in the literature and give a complete proof of a general KAK decomposition
theorem. We then distinguish two distinct notions of KAK equivalence classes, double coset equivalence and projective equivalence, thereby addressing mathematical inconsistencies regarding KAK classification in the literature. Specifically, for $\mathrm{SU}(4)$, we show that local equivalence classes under multiplication by $\mathrm{SU}(2)\otimes \mathrm{SU}(2)$ are geometrically represented not by the usual "Weyl chamber" as claimed in the existing literature. Instead, the "Weyl chamber" is only recovered by the projective-local equivalence which disregards global phases. We develop a systematic theory for determining equivalence and uniqueness for both notions of equivalence. Our work establishes a rigorous Lie-theoretic foundation for the theory of
quantum gates and
circuits.
Read the full abstract ▾
Combinatorics
Computational and Combinatorial Results on Conflict-free Choosability
Shiwali Gupta and Rogers Mathew
The conflict-free closed neighborhood (CFCN$^*$) chromatic number of a graph $G = (V,E)$ is the smallest positive integer $k$ for which there exists a coloring of a subset of vertices using $k$ colors such that, for every vertex in $V$, there exists a color that appears exactly once in its closed neighborhood. The conflict-free open neighborhood (CFON$^*$) chromatic number is defined analogously. In this paper, we study `list variants' of the above-mentioned coloring parameters. The conflict-free closed neighborhood (CFCN$^*$) choice number of a graph $G = (V,E)$ is the smallest positive integer $k$ such that for every assignment of lists of size $k$ to its vertices, there exists a coloring of a subset of vertices, say $V'$, in which (i) every vertex in $V'$ receives a color from its list, and (ii) for every vertex in $V$ there exists some color that appears exactly once in its closed neighborhood. The conflict-free open neighborhood (CFON$^*$) choice number is defined analogously. Dębski and Przybyło [Journal of Graph Theory, 2022] showed that for any graph $G$ with maximum degree $\Delta$, the CFCN$^*$ chromatic number of its line graph is $O(\ln \Delta)$. This result was later extended to claw-free graphs by Bhyravarapu et al. [Journal of Graph Theory, 2025], who proved that every $K_{1,k}$-free graph $G$ admits a CFCN$^*$ coloring using $O(k\ln \Delta)$ colors. In this paper, we generalize this result to the list setting and show that every $K_{1,k}$-free graph $G$ has a CFCN$^*$ choice number of $O(k\ln \Delta)$. Further, we answer some questions concerning the hardness of computing CFCN$^*$/CFON$^*$ choice numbers posed by Gupta and Mathew [SOFSEM, 2026]; in particular, we show that it is NP-hard to determine whether the CFCN$^*$/CFON$^*$ choice number a graph is equal to $k$, for $k=1,2$.
Read the full abstract ▾
Optimization and Control
On the global convergence of gradient flow for wide shallow models beyond homogeneous nonlinearities
Romain Petit, Clarice Poon and Gabriel Peyré
A surprising phenomenon in the training of neural networks is the ability of gradient descent to find global minimizers of the training loss despite its non-convexity. Following earlier work, we investigate this behavior for wide shallow models. Existing global convergence results primarily concern models with positively one-homogeneous nonlinearities, such as ReLU activations, and models with scalar output weights and bounded nonlinearities, such as sigmoid activations. We study a broader class of models, including multi-head
attention layers and two-layer networks with bounded or asymptotically positively one-homogeneous activations and vector output weights. Building upon [Chizat and Bach, 2018], we prove that, in the limit of many hidden
neurons or
attention heads, non-global minimizers of the training loss are unstable under mean-field gradient flow dynamics by constructing "escape regions" in the parameter space. Our global convergence statements are conditional in the following sense: if the mean-field gradient flow converges in W2, then its limit must be a global minimizer. We revisit the bounded nonlinearity, scalar-output setting of [CB18], giving an escape region construction adapted to unbounded nonlinear parameter domains. We also propose new constructions for nonlinearities with at most linear growth under a non-degeneracy assumption and for asymptotically positively one-homogeneous nonlinearities. Finally, we show the well-posedness and stability estimates for the mean-field training dynamics under sub-Gaussian initializations.
Read the full abstract ▾
Statistics Theory
When Are Trade-Off Functions Testable from Finite Samples?
Kaining Shi, Qiaosen Wang and Cong Ma
We study finite-sample inference for the trade-off function of two unknown probability distributions, the function that traces the optimal type I/type II error frontier in binary testing. Given samples from distributions $P$ and $Q$, we consider the problem of testing whether their trade-off function lies above a
benchmark curve $f_0$ or falls below a weaker
benchmark $f_1$. Without structural restrictions, this problem is impossible uniformly over nonparametric classes. We identify a sharp condition under which it becomes possible. The key structural assumption is that the Neyman–Pearson rejection regions for $(P,Q)$ are attainable, up to null sets, by a prescribed class $S$ of measurable sets. Within this exact attainability framework, finite Vapnik–Chervonenkis dimension of $S$ is both sufficient and necessary for nontrivial finite-sample testing. We construct a test with nonasymptotic error guarantees: type I error control is valid without assuming attainability, while power holds uniformly over attainable alternatives satisfying an explicit separation condition. By inverting the test, we also obtain simultaneous confidence bands for the whole trade-off curve. Finally, we study the sharpness and robustness of the procedure. In the monotone likelihood-ratio model, we derive local separation rates and prove matching lower bounds up to logarithmic factors. We also allow approximate, rather than exact, attainability; this extension yields finite-sample guarantees for univariate log-concave distributions by approximating their rejection regions with unions of intervals.
Read the full abstract ▾
Combinatorics
A solution to a strengthened conjecture of Bukh, van Hintum and Keevash on additive bases
Zixiang Xu
Motivated by the change-of-domain problem for additive bases, Bukh, van Hintum and Keevash conjectured that if \(A,B\subseteq \mathbb{Q}^{n}\) and \(\{\boldsymbol{e}_i+\boldsymbol{e}_j:1\le i\le j\le n\}\subseteq A+B,\) then \(|A|+|B|\ge 2n\). They further proposed the strengthened
conjecture: if \(|A|=n-t\), then \(|B|\ge n+\binom{t+1}{2}.\) Bukh also explicitly asked whether the same bounds hold for \(A,B\subseteq \mathbb{R}^{n}\) and an arbitrary basis \(S\) of \(\mathbb{R}^{n}\), under the assumption \(S+S\subseteq A+B\). We prove the full strengthened statement over \(\mathbb{R}^{n}\): if \(S+S\subseteq A+B\) and \(|A|\le n-t\) with \(0\le t\le n-1\), then \(|B|\ge n+\binom{t+1}{2},\) which is sharp for every basis \(S\) and every \(0\le t\le n-1.\) The proof is short, using edge contractions in a graph-theoretical framework and a new coloring lemma over \(\mathbb F_2^n\).
Read the full abstract ▾
Numerical Analysis · Cross-listed from quant-ph
Unitaria: Quantum Linear Algebra via Block Encodings
Matthias Deiml, Oliver Hüttenhofer, Ram Mosco et al. (+2 more)
We introduce Unitaria, a Python library that brings the simplicity of classical linear
algebra toolkits such as NumPy and SciPy to the implementation of
quantum algorithms based on block encodings, a general-purpose abstraction in which a
matrix is embedded as a sub-block of a larger
unitary operator. Their implementation has so far required deep knowledge of low-level
circuit construction, which Unitaria aims to eliminate. The library provides a composable, array-like interface through which users can define block encodings of
matrices and vectors, combine them through standard operations such as addition, multiplication, tensor products, and the
Quantum Singular Value Transformation, and extract the resulting
quantum circuits automatically. A key feature is a
matrix-arithmetic evaluation path in which every operation can be computed directly on encoded vectors and
matrices without dependence on ancilla
qubits or
circuit simulation. This enables correctness verification and classical simulation that scale well beyond what state vector simulation permits and also allows resource estimation, including gate counts,
qubit counts, and normalization constants, without executing any
circuit. Together, these capabilities allow researchers to develop, verify, and analyze
quantum linear
algebra algorithms today, ahead of the availability of error-corrected hardware. Unitaria is open source and available at https://github.com/tequilahub/unitaria.
Read the full abstract ▾
All authors Matthias Deiml, Oliver Hüttenhofer, Ram Mosco, Jakob S. Kottmann, Daniel Peterseim
Functional Analysis
Some properties of Fourier quasicrystals and measures on a strip
Sergii Favorov and Özkan Deǧer
We extend certain results of the theory of
Fourier quasicrystals on the real line to the case of a horizontal strip of finite width. For measures in a strip we use a natural generalization of the usual
Fourier transform for measures on the line. We consider positive or translation bounded measures $\mu$ on a strip whose
Fourier transform is a pure point measure $\hat\mu=\sum_{\gamma\in\Gamma}b_\gamma\delta_\gamma$ (as usual, $\delta_\gamma$ is the unit mass at the point $\gamma$). We prove that the measure $\nu=\sum_{\gamma\in\Gamma}|b_\gamma|^2\delta_\gamma$ has the exponential growth. Moreover, if for some $\eta>0$ the points of $\Gamma$ in every interval of length $\eta$ are linearly independent over integers, then the measure $\hat\mu$ also has the exponential growth.
Read the full abstract ▾
Functional Analysis
Obstructed subhomogeneous-bundle extensions and embeddings
Alexandru Chirvasitu
We address a number of problems concerning the (im)possibility of either extending locally trivial subbundles of possibly singular
Banach/$C^*$ bundles globally,
embedding subhomogeneous bundles into homogeneous ones, or recovering locally trivial compact-Lie-group-equivariant
Banach or $C^*$ bundles as pullbacks along equivariant maps to compact spaces. The results include (1) the global extensibility of a locally trivial
Banach/
Hilbert/
Banach-
algebra/$C^*$ subbundle from a closed subspace of a paracompact space given appropriate homotopy constraints; (2) the homogeneous embeddability of equivariant subhomogeneous
Banach/
Hilbert bundles locally trivial along the singular locus under the same homotopy constraints, and (3) the characterization of finite-type equivariant locally trivial subhomogeneous $C^*$ bundles on normal spaces as precisely those (a) locally trivial as plain vector bundles, or (b) pulled back from the universal equivariant compactification or (c) pulled back from an equivariant map into a smooth
manifold. The latter extends results of Phillips concerning non-equivariant
matrix-
algebra bundles restricted along the StoneČech compactification.
Read the full abstract ▾
Differential Geometry
Homogeneity of magnetic geodesics in the Heisenberg group
Jun-ichi Inoguchi and Marian Ioan Munteanu
We prove that
magnetic geodesics in the $3$-dimensional Heisenberg group derived from the canonical contact structure are homogeneous.
Differential Geometry
Kunneth formula for Hessian manifolds
Pavel Osipov
We study Dolbeault–Koszul
cohomology $H^{p,q}(M)$ of flat affine
manifolds. We proove a Künneth formula \[ H^{p,q}(M\times N) \cong \bigoplus_{i,j} H^{i,j}(M)\otimes H^{p-i,q-j}(N) \] for flat affine
manifolds $M,N$ with at least one compact. For compact
manifolds we also give a proof via Hodge theory on flat affine
manifolds, analogous to the classical Künneth formula for Dolbeault
cohomology. We apply this formula to Hessian
manifolds. A Hessian metric $g$ defines a class $[g]\in H^{1,1}(M)$, and metrics in the same class differ by $D\alpha$ for a closed $1$-form $\alpha$. Using the Künneth formula we describe all Hessian metrics on products, on products with
hyperbolic manifolds, and on
manifolds admitting a flat Riemannian metric.
Read the full abstract ▾
Complex Variables
Maximal Plurisubharmonic Functions and Fujii-Seo Determinants in Hilbert spaces
Per Åhag, Rafał Czyż, Antti Perälä et al. (+1 more)
A maximal plurisubharmonic function on an infinite-dimensional
Hilbert space can have an injective, noncompact Levi operator at every point. This raises the question of what replaces the finite-dimensional determinant criterion for maximality. We prove that a twice continuously differentiable plurisubharmonic function is maximal if its Levi operator is compact at every point, without any boundedness assumption on the function. Using the normalized determinants of Fujii and Seo, we also characterize local maximality by the condition that the infimum of the spectrum of the Levi operator is zero. The same condition characterizes maximality when the function is bounded on the closure of every bounded open set whose closure lies in the domain. The compactness result follows from a more general spectral criterion. Its proof combines a bounded transformation with the smooth variational principle of Borwein and Preiss to establish comparison on bounded open sets whose closures need not be compact.
Read the full abstract ▾
All authors Per Åhag, Rafał Czyż, Antti Perälä, Jani Virtanen
Optimization and Control
Decentralized Contingency MPC based on Safe Sets for Nonlinear Multi-agent Collision Avoidance
Max Studt and Georg Schildbach
Decentralized collision avoidance remains challenging, particularly when
agents do not communicate any information related to planned trajectories. Most existing approaches either rely on conservative coordination mechanisms or provide limited guarantees on recursive feasibility and convergence. This paper develops a decentralized contingency MPC framework for multi-
agent systems with nonlinear dynamics that achieves collision-free motion under a state-only information pattern. Each
agent follows the same consensual rule set, enabling safe decentralized planning without communication. Each
agent solves a local optimization problem that couples a nominal trajectory with a contingency certificate ensuring a feasible backup maneuver under receding-horizon operation. A novel
geometric and decentralized safe-set update mechanism prevents feasibility loss between consecutive time steps. The resulting scheme guarantees recursive feasibility, including collision avoidance, and establishes a Lyapunov-type convergence result to an admissible safe
equilibrium. Simulation results demonstrate performance in both sparse and dense multi-
agent environments, including cluttered bottleneck scenarios and under plug-and-play operation.
Read the full abstract ▾
K-Theory and Homology
Equivariant Hochschild cohomology of group algebras and relative $\operatorname{Ext}$
Andrada Pojar and Constantin-Cosmin Todea
For a finite group $\Gamma$, acting on a finite group $G,$ we find necessary conditions for which the first $\Gamma_0$-equivariant Hochschild
cohomology of the group
algebra $kG$ is non-trivial, where $k$ is a field of characteristic $p$ dividing the order of $G$ and $\Gamma_0$ is the stabilizer subgroup in $\Gamma$ of some element in $G.$ For any field $k$ we show that the $\Gamma$-equivariant Hochschild
cohomology of $\Gamma$-
algebras with coefficients in a $\Gamma$-equivariant bimodule (Jensen, 1996) is isomorphic with some $k\Gamma$-relative $\operatorname{Ext},$ in the context of relative homological
algebra.
Read the full abstract ▾
Differential Geometry · Cross-listed from cs.LG
Kernel-Gradient Drifting Models
Maria Esteban-Casadevall, Jorge Carrasco-Pollo, Max Welling et al. (+3 more)
We propose kernel-gradient drifting, a one-step generative modeling framework that replaces the fixed Euclidean displacement direction in drifting models with directions induced by the kernel itself. Standard drifting is attractive because it enables fast, high-quality generation without distilling a large pretrained
diffusion model, but its theory is currently understood mainly for Gaussian kernels, where the drift coincides with smoothed score matching and is identifiable. Our gradient-based reformulation exposes this score-based structure for general kernels: the resulting drift is the score difference between kernel-smoothed data and model distributions, yielding identifiability for characteristic kernels and a smoothed-KL descent interpretation of the smoothed drifting dynamics. Since kernel gradients are intrinsic tangent vectors, the same construction extends naturally to Riemannian
manifolds and to discrete data via the Fisher-Rao geometry of the probability simplex. Across spherical geospatial data, promoter DNA and molecule generation, kernel-gradient drifting enables state-of-the-art one-step generation beyond the Euclidean setting without
distillation. Code is available \href{https://github.com/jcarrascopollo/kgd_thesis}{here}.
Read the full abstract ▾
All authors Maria Esteban-Casadevall, Jorge Carrasco-Pollo, Max Welling, Jan-Willem van de Meent, Erik J. Bekkers, Floor Eijkelboom
Mathematical Physics
Vacuum and thermal fluctuations of a scalar field with point interactions
Davide Fermi and Marco Gurgoglione
We investigate the
vacuum and thermal fluctuations of a neutral massless scalar field living in Minkowski spacetime and interacting with a finite number of point-like obstacles, modelled by zero-range potentials. The system is described rigorously in terms of self-adjoint realizations of the
Laplacian, under assumptions ensuring the absence of instabilities. Using the relative
zeta-function technique, we determine the renormalized connected partition function and derive explicit expressions for the thermodynamic observables, characterizing both their low- and high-temperature behaviours. Furthermore, we derive of a convergent Born series expansion for the Casimir energy, which identifies multiple-scattering processes as the mechanism underlying
vacuum forces. The latter decompose into pairwise contributions directed along the lines joining the obstacles, with intensities depending non-locally on the full configuration. We also present some numerical results for identical obstacles, indicating that the Casimir forces are always attractive in this context.
Read the full abstract ▾
Information Theory · Cross-listed from quant-ph
Selective Placement of Hollow-Core Fibers for QKD and Classical Communication Coexistence
Giovanni Simone Sticca, Alessandro Gagliano, Memedhe Ibrahimi et al. (+3 more)
We investigate the benefits of partially upgrading optical networks with hollow-core fibers for QKD-classical communication coexistence. Results show that upgrading 40% of links in a metro
topology can reduce the number of
quantum modules by up to 49%.
Read the full abstract ▾
All authors Giovanni Simone Sticca, Alessandro Gagliano, Memedhe Ibrahimi, Alberto Gatto, Francesco Musumeci, Massimo Tornatore