Functional Analysis
Kippenhahn's Conjecture Revisited
Michael Stessin
In 1951 paper \cite{Ki} Kippenhahn conjectured that if the characteristic
polynomial \ $P_A(x_1,x_2,x_3)=\mbox{det}(x_1A_1+x_2A_2-x_3I)$, \ where $A_1$ and $A_2$ are $n\times n$ Hermitian
matrices, has a repeated factor in the
polynomial ring $\C[x_1,x_2,x_3]$, then the pair $(A_1,A_2)$ is
unitary equivalent to a direct sum $(C_1\oplus C_2, \ D_1\oplus D_2)$ where $C_i, D_i\in M_{n_i}(\C) $ for some $1\leq n_i<n, \ n_1+n_2=n, i=1,2$. Kippenhahn verified the
conjecture whenever the degree of the minimal
polynomial of $x_1A_1 + x_2A_2$ is 1 or 2. In subsequent works \cite{Sh1,Sh2} Shapiro obtained a number of results which supported the
conjecture. In particular, she showed that it held if $n \leq 5$. In 1983 Laffey \cite{La} showed that, in general, Kippenhahn's
conjecture was not true by constructing a counterexample for $n=8$. Since then additional counterexamples were worked out (see \cite{Wa} for example). Some positive results in this direction including the
quantum version of the
conjecture can be found in \cite{F1, F2, KVo1, Law}. In this paper we use methods of recently developed local spectral analysis to give some necessary and sufficient conditions for the affirmative answer to Kippenhahn's
conjecture in terms of the characteristic
polynomials of certain elements of the
algebra generated by the
matrices in the tuple.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Hysteretic squashed entanglement in many-body quantum systems
Siddhartha Das, Alexander Yosifov and Jinzhao Sun
Entanglement in many-body
quantum systems is distributed across spatial regions, where its structure often dictates the information-processing capabilities of the state. Yet, characterizing the
entanglement structure, especially for mixed states, remains a challenge. In this work, we propose hysteretic squashed
entanglement $T_{sq}$, a conditional
entanglement monotone that measures the genuine
quantum correlations between two subregions, conditioned on a third region, in a many-body
quantum state. $T_{sq}$ is upper bounded by the convex-roof extension of
quantum conditional mutual information and exhibits several desirable properties like monogamy, convexity, asymptotic continuity, faithfulness, and additivity for tensor-product states. We study the conditional
entanglement generation in a one-dimensional transverse-field Ising model under quench, where we show that $T_{sq}$ effectively squashes classical contributions and can detect genuine
quantum correlations across both adjacent and long-range subsystems. We elucidate the utility of this measure as a robust quantifier of topological
entanglement entropy for mixed states. This opens new operational resource-theoretic avenues for probing topological order and criticality.
Read the full abstract ▾
Algebraic Topology
Homotopy Posets, Postnikov Towers, and Hypercompletions of $\infty$-Categories
David Gepner and Hadrian Heine
We show that basic homotopical notions such as homotopy sets and groups, connected and truncated maps, cellular constructions and skeleta, etc., extend to the setting of $(\infty,\infty)$-categories, as well as to presentable categories enriched in $(\infty,\infty)$-categories under the Gray tensor product. The homotopy posets of an $(\infty,\infty)$-category are indexed by boundaries of categorical disks; in particular, there is a fundamental poset for each pair of objects, which we regard as a oriented point where the source and target objects have opposite orientation. In contrast to the situation in
topology, weakly contractible
geometric building blocks such as oriented polytopes typically have nontrivial homotopy posets. The homotopy posets assemble to form an oriented analogue of the long exact sequence of a fibration and form the layers of a categorical Postnikov tower, which converges for any $(\infty,n)$-category but not for general $(\infty,\infty)$-categories. We show that the full subcategory consisting of the Postnikov complete $(\infty,\infty)$-categories is obtained by inverting the coinductive equivalences and canonically identifies with the limit of the categories of $(\infty,n)$-categories taken along the truncation functors. We also study truncated morphisms in general oriented categories and connected morphisms in presentable oriented categories.
Read the full abstract ▾
Logic
On the Concept of Arithmetic Conseqeunce
Alexander V. Gheorghiu
Gödel's second incompleteness
theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in which arithmetical
language is evaluated with respect to an independently given structure of natural numbers. This paper develops an alternative perspective grounded in proof-theoretic semantics. We distinguish between derivability and a semantic notion of consequence given by support, defined compositionally in terms of the inferential roles fixed by a theory. For suitable arithmetical theories A formulated in a finite signature (such as Robinson's Q and Peano Arithmetic), these two notions can diverge in a principled way: although A does not prove its own consistency, it nevertheless supports its formalized consistency statement, and more generally supports sentences not derivable within it. This does not conflict with Gödel's incompleteness
theorem, but instead reframes incompleteness as a divergence between two internally determined notions of consequence associated with a single theory, rather than as a gap between syntactic provability and truth in a mind-independent structure. The result clarifies the relationship between reflection, consistency, and inferentialist approaches to meaning, and shows how substantial semantic determinacy may arise from the inferential structure of arithmetic itself.
Read the full abstract ▾
Number Theory
The SQInstructor: a guide to SQIsign and the Deuring Correspondence with level structures
Giacomo Borin, Luca De Feo, Guido Maria Lido et al. (+1 more)
We explore the use of level structures to generalize the SQIsign signature scheme. We give a general framework where, given the public key and the commitment, the challenge is to exhibit an isogeny between them with an additional requirement, namely to map a chosen level structure to another. We then instantiate the framework using 1-dimensional and 2-dimensional isogenies. In doing that we provide a new explicit Deuring correspondence for supersingular
elliptic curves with level structures and solve new constrained norm equations.
Read the full abstract ▾
All authors Giacomo Borin, Luca De Feo, Guido Maria Lido, Sina Schaeffler
Analysis of PDEs
Finite-energy solutions to Einstein-scalar field Lichnerowicz equations on complete Riemannian manifolds
Bartosz Bieganowski, Pietro d'Avenia and Jacopo Schino
We consider the singular
elliptic problem of the form \[ -\Delta u + V(x)u = \mathcal{B}(x)|u|^{2^*-2}u + \frac{\mathcal{A}(x)}{|u|^{2^*}u}, \qquad u\in H^1(M), \] where the coefficients are allowed to have low regularity. Under natural spectral assumptions on $-\Delta+V$,
geometric assumptions on the
manifold $M$ ensuring the Sobolev
embedding $H^1(M)\hookrightarrow L^{2^*}(M)$, and a suitable global integrability/smallness condition involving $\mathcal{A}$, $\mathcal{B}$, and a function $\psi \in H^1(M)$, we prove the existence of a nonnegative finite-energy supersolution. If, in addition, the
Ricci curvature is nonnegative and $\mathcal{B}\ge 0$, we obtain a positive finite-energy solution. The proof relies on a family of $\varepsilon$-regularized problems, mountain pass arguments, and a limiting procedure in which Harnack's inequality plays a crucial role in handling the singular term on noncompact
manifolds. We also prove a nonexistence result showing that the global integrability condition on $\mathcal{A}$ is, in a precise sense, necessary for the existence of nonnegative supersolutions.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
Dynamics and interaction of solitons in the BPS limit and their internal modes
S. Navarro-Obregón
The main objective of this thesis has been to analyse
soliton dynamics in detail, with special
attention paid to the role of the internal modes associated with these configurations. Specifically, the thesis has focused on the study of one- and two-dimensional models, with the aim of developing a solid basis that can then be extended to the study in three-dimensional theories. This thesis concentrates on the study of kinks, oscillons,
vortices, and sphalerons. Nevertheless, field theories constitute systems with an infinite number of degrees of freedom, which poses challenges both for obtaining analytical results and for predictive modeling. To address these challenges, this thesis employs the construction of effective models that retain the essential degrees of freedom required to capture the phenomenology observed in numerical simulations of the full theory, using the well-known collective coordinate method. In addition, other complementary mathematical tools, such as perturbative techniques, have also been employed. Among the main achievements of this doctoral thesis, it is worth highlighting the introduction, for the first time, of genuine radiation modes within the collective coordinate framework. Furthermore, a generalisation of Samols'
moduli space metric for local
vortices in the Abelian-
Higgs model has been developed through the incorporation of vibrational degrees of freedom. Additionally, a new class of sphalerons that we have coined semi-BPS sphalerons has been identified and analysed. Finally, the role of oscillatory internal modes in the decay process of sphalerons has been studied in detail, leading to the proposal of a dynamic stabilisation mechanism. This mechanism has been further explained and extended to more general models, demonstrating the robustness and potential applicability of this phenomenon to physically relevant theories.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Optimal Universal Bounds for Quantum Divergences
Gilad Gour
We identify a universal structural principle underlying the smoothing of classical divergences: the optimizer of the smoothing problem is a clipped probability vector, independently of the specific divergence. This yields a divergence-independent characterization of all smoothed classical divergences and reveals a common
geometric structure behind seemingly different quantities. Building on this structural insight, we derive optimal universal bounds for smoothed
quantum divergences, including
quantum Rényi divergences of arbitrary order and the hypothesis-testing divergence. Our inequalities relate divergences of different orders through bounds of the form $D_\beta^{\varepsilon} \le D_\alpha + \mathrm{correction}$ and $D_\beta^{\varepsilon} \ge D_\alpha + \mathrm{correction}$, and we prove that the correction terms are optimal among all universal, state-independent inequalities of this type. Consequently, our results strictly improve previously known bounds whenever those were suboptimal, and in cases where earlier bounds coincide with ours, our analysis establishes their optimality. In particular, we obtain optimal universal bounds for the hypothesis-testing divergence.
Read the full abstract ▾
Algebraic Geometry
Linear Code Equivalence via Plücker Coordinates
Gessica Alecci and Giuseppe D'Alconzo
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear codes are equivalent. This equivalence is represented by a monomial
matrix $ Q$, i.e. the product of a diagonal
matrix $D$ and a permutation
matrix $P$. The recovery of $Q=DP$ is known to be reduced to the recovery of the permutation
matrix $ P$ alone. Exploiting this fact, we construct an algebraic model for LCE involving only the
matrix $P$. To this end, we study the action of monomial
matrices on linear codes using tools from algebraic geometry, including Plücker coordinates and fields of invariant rational functions. In particular, we analyse the action of diagonal
matrices on linear codes, which can be interpreted as diagonal scaling of the coordinates of elements of the Grassmannian. We propose a method to determine algebraically independent generators of the field of rational functions invariant under this action, without relying on Reynolds operators or Gröbner basis computations. Furthermore, given two equivalent codes, we apply our results to explicitly construct, for each invariant function, a
polynomial having $P$ as a root. However, the resulting
polynomials are not of practical use: their degrees are high for cryptographically relevant parameters, and the number of monomials grows exponentially, making them infeasible to manipulate. Despite this limitation, our results are of theoretical interest, as they constitute the first application of these tools to the cryptanalysis of LCE and provide insight into how algebraic geometry and invariant theory can be employed in Cryptography.
Read the full abstract ▾
Optimization and Control
Sparse Cuts for the Positive Semidefinite Cone
Oktay Günlük, Paul Jünger, Jeff Linderoth et al. (+2 more)
We consider optimization problems containing nonconvex quadratic functions for which semidefinite programming (SDP) relaxations often yield strong bounds. We investigate linear inequalities that outer approximate the positive semidefinite cone and are sparse in the sense that they are supported only on the variables corresponding to products of variables present in quadratic functions. We show that these sparse linear inequalities yield an LP relaxation that gives the same bound as the SDP relaxation. We demonstrate how to identify these inequalities via a separation procedure that involves solving a structured “projection” SDP. In a computational study, we find that the sparse LP relaxations defined by these inequalities can accelerate branch-and-bound methods for globally solving nonconvex optimization problems.
Read the full abstract ▾
All authors Oktay Günlük, Paul Jünger, Jeff Linderoth, Andrea Lodi, James Luedtke
Optimization and Control · Cross-listed from quant-ph
Velocity Verlet-based optimization for variational quantum eigensolvers
Rinka Miura
The Variational
Quantum Eigensolver (VQE) is a key
algorithm for near-term
quantum computers, yet its performance is often limited by the classical optimization of
circuit parameters. We propose using the velocity Verlet
algorithm, inspired by classical molecular dynamics, to address this challenge. By introducing an inertial "velocity" term, our method efficiently explores complex energy landscapes. We compare its performance against standard optimizers on H$_2$ and LiH molecules. For H$_2$, our method achieves chemical accuracy with fewer
quantum circuit evaluations than L-BFGS-B. For LiH, it attains the lowest final energy, demonstrating its potential for high-accuracy VQE simulations.
Read the full abstract ▾
Analysis of PDEs
A fast dynamo on the three-torus
Michele Coti Zelati, Massimo Sorella and David Villringer
We study the kinematic dynamo equation on the three-
torus and provide a rigorous proof of fast dynamo action for a time-periodic, divergence-free, Lipschitz velocity field. Our construction is based on a stretch-fold-shear mechanism generating a uniformly
hyperbolic flow. To analyze the associated dynamics, we develop anisotropic
Banach spaces adapted to the underlying
hyperbolic structure, allowing us to recover a discrete spectral picture for the ideal dynamo operator. In the strong-chaos regime, we show that this operator admits an
eigenvalue with modulus strictly larger than one. We then prove that this instability persists under the singular perturbation induced by
diffusion, yielding exponential growth of the
magnetic field uniformly in the vanishing resistivity limit.
Read the full abstract ▾
Analysis of PDEs
On the simplicity of the sloshing eigenvalues
Marco Ghimenti, Anna Maria Micheletti and Angela Pistoia
This paper investigates sloshing problems defined by $-\Delta u=0$ in $\Omega$, with mixed boundary conditions: $\partial_{\nu}u=\lambda u$ on $S$, and either $\partial_{\nu}u=0$ or $u=0$ on $W$. Here, $\Omega$ represents a smooth bounded domain in $\mathbb{R}^n$ with boundary $\partial\Omega=S \cup W$. We demonstrate that under small domain perturbations, all resulting
eigenvalues are simple.
Read the full abstract ▾
Optimization and Control
On the relations between fundamental frequency and torsional rigidity in the case of anisotropic energies
Giuseppe Buttazzo and Raul Fernandes Horta
We consider variational energies of the form \[E_H(u)=\frac12\int_\Omega H^2(\nabla u)\,dx\] defined on the Sobolev space $H^1_0(\Omega)$, where $H$ is a general seminorm. Our primary objective is to investigate optimization problems associated with the first
eigenvalue $\lambda_H(\Omega)$ and the torsional
rigidity $T_H(\Omega)$ induced by the seminorm $H$. In particular, we focus on functionals of the type \[F_{q,\Omega}(H)=\lambda_H(\Omega)\,T_H^q(\Omega),\] where $q>0$ is a fixed real parameter. The optimization is performed with respect to the control $H$; we analyze both minimization and maximization problems for $F_{q,\Omega}(H)$, as $H$ ranges over a suitable class of seminorms.
Read the full abstract ▾
Analysis of PDEs · Cross-listed from cond-mat.stat-mech
Diffusive flux into a stochastically gated tube
Sean D Lawley
Diffusion-influenced reactions in the presence of gates which randomly open and close have been studied for decades in a variety of biophysical and biochemical scenarios. The diffusive flux from a large bulk reservoir to the end of a narrow tube with a stochastically gated entrance has been previously estimated. In this paper, we extend this gated flux estimate to be valid if (i) the tube is not necessarily narrow and/or (ii) the diffusivity differs in the tube versus the bulk. Extension (i) is challenging because it entails a nontrivial three-dimensional geometry. Extension (ii) is challenging because it introduces multiplicative noise. We derive an explicit flux estimate formula and prove that it is exact in certain parameter regimes. We further use
stochastic simulations to show that the estimate remains accurate across a very broad range of parameters. Our results differ from prior work on extensions (i) and (ii).
Read the full abstract ▾
Information Theory
Rate-Distortion Bounds for Heterogeneous Random Fields on Finite Lattices
Sujata Sinha, Vishwas Rao, Robert Underwood et al. (+4 more)
Since Shannon's foundational work, rate-distortion theory has defined the fundamental limits of lossy compression. Classical results, derived for memoryless and stationary ergodic sources in the asymptotic regime, have shaped both transform and predictive coding architectures, as well as practical standards such as JPEG. Finite-blocklength refinements, initiated by the non-asymptotic achievability and converse bounds of Kostina and Verdu, provide precise characterizations under excess-distortion probability constraints, but primarily for memoryless or statistically homogeneous models. In contrast, error-bounded practical lossy compressors for scientific computing, such as SZ, ZFP, MGARD, and SPERR, are designed for finite, high-dimensional, spatially correlated, and statistically heterogeneous random fields. These compressors partition data into fixed-size tiles that are processed independently, making tile size a central architectural constraint. Structural heterogeneity, finite
lattice effects, and tiling constraints are not addressed by existing finite-blocklength analyses. This paper introduces a finite-blocklength rate-distortion framework for heterogeneous random fields on finite
lattices, explicitly accounting for the tile-based architectures used in high-performance scientific compressors. The field is modeled as piecewise homogeneous with regionwise stationary second-order statistics, and tiling constraints are incorporated directly into the source model. Under an excess-distortion probability criterion, we establish non-asymptotic achievability, converse bounds and derive a second-order expansion that quantifies the impact of spatial correlation, region geometry, heterogeneity, and tile size on the rate and dispersion.
Read the full abstract ▾
All authors Sujata Sinha, Vishwas Rao, Robert Underwood, David Lenz, Sheng Di, Franck Cappello, Lingjia Liu
Optimization and Control
Control and stabilization of cascade coupled systems: application to a 1-d heat and wave coupled system
Lucas Davron, Pierre Lissy and Swann Marx
We study cascade coupled systems, for which our prototypical example is a 1-d heat equation coupled with a 1-d wave equation. The heat component is controlled through one boundary and the information is transmitted through another one to the wave component, while the wave component does not influence the heat component. Our aim is to understand the well-posedness, controllability and stabilizability properties for such a system. Establishing well-posedness is tedious using the classical energy method, which motivates us to take advantage of the cascade structure. Taking again advantage of this structure, we prove a simultaneous exact and approximate controllability result. Finally, we obtain
polynomial stabilization by means of a closed-loop control defined through the solution to a Sylvester equation. These results are all discussed in an abstract LTI framework and most of our findings apply to more general situations.
Read the full abstract ▾
Metric Geometry · Cross-listed from cs.CG
Prismatoid Band-Unfolding Revisited
Joseph O'Rourke
It remains unknown if every prismatoid has a nonoverlapping edge-unfolding, a special case of the long-unsolved "Dürer's problem." Recently nested prismatoids have been settled [Rad24] by mixing (in some sense) the two natural unfoldings, petal-unfolding and band-unfolding. Band-unfolding fails due to a specific counterexample [O'R13b]. The main contribution of this paper is a characterization when a band-unfolding of a nested prismatoid does in fact result in a nonoverlapping unfolding. In particular, we show that the mentioned counterexample is in a sense the only possible counterexample. Although this result does not expand the class of shapes known to have an edge-unfolding, its proof expands our understanding in several ways, developing tools that may help resolve the non-nested case.
Read the full abstract ▾
Differential Geometry · Cross-listed from gr-qc
Cosmological Spacetimes with Sign-Changing Spatial Curvature and Topological Transitions
Gerardo García-Moreno, Bert Janssen, Alejandro Jiménez Cano et al. (+3 more)
Observational evidence, together with practical computations and modeling, supports a Euclidean spatial sector in the current cosmological model based on the FLRW metric. This, however, would imply that the total amount of matter and energy immediately after the Big Bang must have been infinite, an implication that could only be avoided through a transition from a closed to an open universe, a process forbidden in standard FLRW models. In this article, we investigate the spacetimes resulting from promoting the spatial
curvature $k$ in FLRW spacetimes to a time-dependent function, $k \to k(t)$, allowing it to change sign and thereby allowing changes in the
topology of the constant-$t$ slices. Although previously dismissed due to a classical
theorem by Geroch, such transitions are shown to be consistent with global hyperbolicity when the comoving time is distinct from a Cauchy time, as recent work by one of the authors demonstrates. We construct three distinct geometries exhibiting this behavior using different representations of constant-
curvature spaces. We analyze their global properties and identify mild conditions under which they remain globally
hyperbolic. Furthermore, we characterize their Killing vectors, proving a general result for spherically symmetric spacetimes and compare them with known geometries in the literature.
Read the full abstract ▾
All authors Gerardo García-Moreno, Bert Janssen, Alejandro Jiménez Cano, Marc Mars, Miguel Sánchez, Raül Vera
Combinatorics
On R-disjoint graphs: a generalization of almost bipartite non-König-Egerváry graphs
Kevin Pereyra
An almost bipartite graph is a graph with a unique odd cycle. Levit and Mandrescu showed that in every non-König–Egerváry almost bipartite graph the equalities $\textnormal{ker}(G)=\textnormal{core}(G)$, $\textnormal{corona}(G)\cup N(\textnormal{core}(G)) = V(G)$ and $\left|\textnormal{corona}(G)\right|+\left|\textnormal{core}(G)\right|=2\alpha(G)+1$ hold. In this work, we present a generalization of this theory by introducing the family of $R$-disjoint graphs, which contains all non-König–Egerváry almost bipartite graphs, allowing the presence of multiple odd cycles under connectivity constraints based on the reach sets $R(C)$. We prove that $R$-disjoint graphs preserve the fundamental properties of almost bipartite graphs: $\textnormal{ker}(G)=\textnormal{core}(G)$ and $\textnormal{corona}(G)\cup N(\textnormal{core}(G))=V(G)$. Moreover, we establish the formula $\left|\textnormal{corona}(G)\right|+\left|\textnormal{core}(G)\right|=2\alpha(G)+k$, where $k$ is the number of disjoint odd cycles in $G$, which refines the previously known particular case when $k=1$. $R$-disjoint graphs naturally induce a canonical decomposition; we obtain structural properties of this decomposition and, as a consequence, verify a recent
conjecture of Levit and Mandrescu.
Read the full abstract ▾
Combinatorics
Sterboul-Deming Graphs: Characterizations
Kevin Pereyra
A graph is said to be a Sterboul–Deming graph if $KE(G)=\emptyset$, that is, if every vertex of $G$ belongs to a posy or a flower (structures introduced by Sterboul, Deming, and Edmonds). These graphs can be regarded as the structural counterparts of König–Egerváry graphs. In this paper, we present several characterizations of Sterboul–Deming graphs. We first study the case of graphs with a perfect matching and with a unique perfect matching, providing a constructive
algorithm to obtain the decomposition $(SD(G), KE(G))$. Then, we extend the analysis to the general case through the Gallai–Edmonds decomposition. In addition, we show that the class of Sterboul–Deming graphs is remarkably broad: it contains all graphs having a $\{C_n : n \textnormal{ odd}\}$-factor, providing a simple structural criterion for identifying such graphs. These results establish new connections between classical decomposition
theorems and the internal structure of non–König–Egerváry graphs.
Read the full abstract ▾
Combinatorics
Generalized Edmonds-Sterboul-Deming configurations. Part 1: Sterboul-Deming graphs
Daniel A. Jaume, Cristian Panelo and Kevin Pereyra
We introduce two new types of graph configurations, the Jflower and the Jposy, which generalize the classical flower and posy configurations of Edmonds, Sterboul, and Deming in the context of maximum matchings. These generalized configurations allow greater flexibility in characterizing non-Konig-Egerváry graphs and provide new tools for studying matching-theoretic properties. Our main result shows that the sets of vertices covered by classical configurations (flowers and posies), restricted configurations (Tposies), and generalized configurations (Jflowers and Jposies) coincide. This equivalence yields a unified characterization of what we call Sterboul-Deming graphs, graphs in which every vertex belongs to some configuration relative to an appropriate maximum matching.
Read the full abstract ▾
Numerical Analysis
Scalable s-step Preconditioned Conjugate Gradient with Chebyshev Basis and Gauss-Seidel Gram Solve
Pasqua D'Ambra, Massimo Bernaschi, Mauro G. Carrozzo et al. (+1 more)
We present a variant of the s–step Preconditioned Conjugate Gradient (PCG) method that combines a Chebyshev–stabilized Krylov basis with a Forward Gauss–Seidel (FGS) iteration for the solution of the reduced Gram systems. In s–step PCG, multiple search directions are generated per outer iteration, reducing global synchronization costs but requiring the solution of small dense Gram systems whose conditioning is critical for stability. For a raw Chebyshev Krylov block, we derive an exact moment–based representation of the associated Gram
matrix in the unpreconditioned setting and discuss its extension to left preconditioning. This representation provides a structural interpretation of the favorable Gram–
matrix behavior observed for moderate step sizes. Building on inexact Krylov theory and on the algebraic connection between FGS and Modified Gram–Schmidt (MGS), we derive residual bounds for the reduced solves and provide a rationale for using a fixed, moderate number of FGS sweeps. Numerical experiments assess the resulting accuracy of the Gram solves and the convergence behavior of the outer iteration. Large–scale experiments on modern NVIDIA GPU architectures, including weak-scaling tests with aggregation-based Algebraic MultiGrid (AMG) preconditioning, show that, within the tested configurations, the proposed Chebyshev–stabilized $s$–step PCG method with FGS Gram solves achieves convergence comparable to classical PCG while reducing global synchronization overhead. The results demonstrate its potential as a scalable communication–reducing solver for current and next–generation accelerator systems.
Read the full abstract ▾
All authors Pasqua D'Ambra, Massimo Bernaschi, Mauro G. Carrozzo, Stephen Thomas
Spectral Theory
Patterson-Sullivan distributions of finite regular graphs
Christian Arends and Guendalina Palmirotta
On finite regular graphs, we construct Patterson-Sullivan distributions associated with eigenfunctions of the discrete Laplace operator via their boundary values on the phase space. These distributions are closely related to Wigner distributions defined via a pseudo-differential calculus on graphs, which appear naturally in the study of
quantum chaos. Using a pairing formula, we prove that Patterson-Sullivan distributions are also related to invariant Ruelle distributions arising from the transfer operator of the geodesic flow on the shift space. Both relationships provide discrete analogues of results for compact
hyperbolic surfaces obtained by Anantharaman-Zelditch and by Guillarmou-Hilgert-Weich.
Read the full abstract ▾
Analysis of PDEs
Confinement and orbital stability of solitons of the NLS equation on metric graphs
Martino Caliaro and Diego Noja
We study the behavior of
soliton states for the subcritical, time-dependent focusing NLS equation on a large family of non-compact metric graphs with Kirchhoff boundary conditions. This family is characterized by a topological assumption (“Assumption H” in the literature) which rules out the existence of a ground state for all members of the class, with a single exception: the bubble-tower metric graph. We present two main results. First, we show that if the initial datum is close (in the energy norm) to a
soliton placed on a single half-line of the graph and sufficiently far from the nearest vertex, then the corresponding solution remains confined to the same half-line for all times, and close to the
soliton, up to a remainder that stays small in the energy norm. As a nontrivial application, this yields reflection of a slow
soliton upon collision with the compact core of the graph, a phenomenon that first we prove and then we further investigate numerically. Second, for the exceptional case of bubble-tower graphs, we prove that the ground state (which exists only in this case) is orbitally stable. We emphasize that this example does not allow an immediate application of the Cazenave–Lions orbital stability argument, which requires a suitable modification. Finally, we discuss how the ideas and methods developed here may extend beyond the class of metric graphs with Kirchhoff boundary conditions and satisfying Assumption H. In particular, we extend the results to the meaningful case of the line in the presence of a smooth potential or a delta interaction.
Read the full abstract ▾
Probability
Global universality via discrete-time signatures
Mihriban Ceylan and David J. Prömel
We establish global universal approximation
theorems for non-anticipative and general path-dependent functionals on spaces of piecewise linear paths, stating that linear functionals of the corresponding signatures are dense with respect to $L^p$- and weighted norms. We verify that these approximation results are applicable to piecewise linear interpolations of a class of Gaussian processes, including Brownian motion and fractional Brownian motion with Hurst parameter $H>1/4$. Moreover, we derive quantitative convergence rates for signatures of piecewise linear approximations of Gaussian processes towards their continuous-time counterparts. Consequently, we obtain $L^p$-approximation results for path-dependent functionals of Gaussian processes, as well as for random ordinary differential equations and
stochastic differential equations driven by Brownian motion.
Read the full abstract ▾
Combinatorics
Rainbow connectivity Maker-Breaker game
Juri Barkey, Bruno Borchardt, Dennis Clemens et al. (+3 more)
We study biased Maker-Breaker games on a graph system $\{G_1,\ldots,G_s\}$, in which Maker's goal is to claim certain rainbow structures, i.e., specified subgraphs consisting of at most one edge from each graph $G_i$. We consider the rainbow-connectivity game, in which Maker wants to claim a rainbow path between every pair of vertices. We analyse this game in detail, essentially determining the threshold bias when played on the system of complete graphs, and observing that whether the random graph intuition holds depends on the size of $s$. The key ingredient of our result is the analysis of a Maker's strategy that combines several randomized strategies with an appropriately designed balancing game. As a byproduct, we find the order of the threshold bias for the Maker-Breaker diameter game, and disprove a
conjecture by Balogh, Martin and Pluhár. Another natural and general way to analyse Maker-Breaker games that are played on a colored board is to require Maker to occupy a rainbow winning set of a given positional game. In the case of the connectivity game, Maker's goal is to claim a rainbow spanning tree. For this game played on the system of complete graphs, we establish matching upper and lower bounds on the threshold bias, up to constant factors.
Read the full abstract ▾
All authors Juri Barkey, Bruno Borchardt, Dennis Clemens, Milica Maksimović, Mirjana Mikalački, Miloš Stojaković
Combinatorics
Cocliques in the Kneser graph on $(n-1,n)$-flags of PG$(2n,q)$
Philipp Heering
In the finite projective space PG$(2n,q)$ we consider flags of type $(n-1,n)$, that is, pairs $(A,B)$ consisting of an $(n-1)$-space $A$ and an $n$-space $B$ that are incident. Two such flags $(A_1,B_1)$ and $(A_2,B_2)$ are opposite if $A_1\cap B_2=A_2\cap B_1=\emptyset$. Let $\Gamma_{2n}$ be the graph whose vertices are the flags of type $(n-1,n)$ of PG$(2n,q)$, with two vertices being adjacent if the corresponding flags are opposite. Using the Erdős-Matching
theorem for vector spaces shown by Ihringer, we determine, for $q$ large enough, the largest cocliques of $\Gamma_{2n}$ and obtain a stability result. This EKR-type
theorem proves a
conjecture of D'haeseleer, Metsch and Werner.
Read the full abstract ▾
Statistics Theory
The exact region between Chatterjee's and Blest's rank correlations
Marcus Rockel
Exact regions between rank correlations describe the set of all pairs of values that two dependence measures can attain simultaneously on the same copula and thus yield sharp inequalities between them. In this paper, we determine the exact region between Chatterjee's rank correlation $\xi$ and Blest's rank correlation $\nu$ over the class of all bivariate copulas. Our approach is based on a constrained optimization problem whose solution is characterized by Karush–Kuhn–Tucker conditions. This leads to a novel extremal copula family that uniquely traces the boundary of the region. For this family, we derive closed-form expressions for both $\xi$ and $\nu$, which provide an explicit parametrization of the exact attainable region.
Read the full abstract ▾
Optimization and Control
Age-Structured Harvesting Models: A Structural Comparison of Rate-Control and Effort-Control Optimality Systems
Jiguang Yu, Louis Shuo Wang and Ye Liang
We study optimal harvesting in continuous-time, age-structured population models of McKendrick–von Foerster type, and we compare two harvesting mechanisms. In the rate-control formulation, harvesting enters the state equation as an additive removal term; in the effort-control formulation, harvesting acts multiplicatively as an additional mortality intensity and the mortality coefficient depends on the aggregate stock. For the rate-control problem we first establish existence of an optimal control for the infinite-horizon discounted problem, and we then derive, under explicitly stated regularity and constraint-qualification assumptions, a conditional Pontryagin-type necessary optimality system consisting of the adjoint equation, the terminal-age and transversality conditions, the switching relations for the distributed and boundary controls, and the complementary-slackness relation for the state constraint. For the effort-control problem we formally derive the associated adjoint equation and identify the nonlocal coupling term generated by aggregate (density) dependence, with the sign of that term verified by a step-by-step variational computation; a rigorous infinite-horizon maximum principle for this nonlinear, nonlocally coupled problem is beyond the present scope and is stated as such. We complement the analysis with autonomous stationary reductions, with explicit representations of the state and adjoint, and with a reproducible numerical study. The central message is structural: the harvesting mechanism is not a cosmetic modelling choice. Rate-control produces an additive/affine/local optimality structure, whereas effort-control produces a multiplicative/nonlinear/nonlocal one, with direct consequences for persistence, stationary profiles, and bioeconomic interpretation.
Read the full abstract ▾