We consider spherically symmetric Yang-Mills equations with gauge group $SO(d)$ in $d+1$ dimensional Minkowski spacetime. For any given odd $d\geq 11$, we establish existence and uniqueness (modulo reflection symmetry) of exactly $N$ smooth self-similar solutions, where $N$ is the number of zeros of an explicit polynomial $P_m(z)$ of degree $m=(d-5)/2$ in the interval $0<z<1$. The number $N$ can be determined algorithmically by an explicit computation. Our extensive computations for large odd dimensions suggest that $N=3$ for all odd $d\geq 11$. Two of these self-similar solutions admit closed-form expressions: one has been known previously, while the other appears to be new. Our result points toward a relatively simple landscape of possible blowup scenarios for high-dimensional Yang-Mills equations. Beyond its purely mathematical interest, this rigidity of self-similar blowup may also be relevant from a physical perspective, as it constrains the possible ultraviolet dynamics of non-abelian gauge fields in higher-dimensional Yang-Mills theories arising in string-inspired extra-dimensional setups and in holographic models.

We propose a Bayesian framework for feedback boundary control of hyperbolic balance laws. The method propagates a probability distribution over feedback parameters using Lyapunov decay estimates as a likelihood. For linear models, it recovers available analytical stability results and extends to nonlinear regimes where theory is limited. Using first-order local Lax-Friedrichs (LLF) discretizations, we validate the approach on the decoupled wave system and the linearized Saint-Venant equations, reproducing known stability intervals and mixed boundary couplings. We then treat nonlinear and stochastic problems, including the nonlinear Saint-Venant system, one- and two-dimensional Burgers equations, Burgers equation with random initial data, and nonconservative perturbations with source terms, and show that the inferred stability domains are robust with respect to the indicator and the prior. Finally, we demonstrate transfer to a second-order semi-discrete LLF scheme and to a two-parameter feedback model for laser powder bed fusion with power regulation.

In this paper we build a bijection between the meet-irreducible elements of the lattice of the compositions of $n$ with parts in $[1,p]$ equipped with the dominance order, and the edges of the $(n,p)$-Turán graph. Using this bijection, we then compute asymptotically the average value of some statistics on those meet-irreducible compositions.

We prove that, if $G$ is a finite almost simple group and $H$ is a maximal subgroup of $G$, then the $10$th term of the derived series of $H$ is perfect. The same is true if $G$ is perfect and $H$ is core-free. The constant $10$ is best possible.

In the 1980's K.S. Brown proved that the Houghton group $H_n$ is of type $\operatorname{F}_{n-1}$ but not $\operatorname{FP}_n$. We show that, provided $n\ge3$, the same conclusion holds for all subgroups $G$ of $H_n$ that are 'large' in the sense that there is an epimorphism $G\twoheadrightarrow\mathbb{Z}^{n-1}$. Our research leads naturally to the study of generalised permutational wreath products in which the base of the wreath product is a direct product of finite groups which are allowed to vary in isomorphism type from one orbit to another. Such generalised wreath products arise naturally amongst the large subgroups of Houghton groups and are accommodated by a generalised Jordan--Wielandt theorem.

In this paper, we present a new spectral deferred corrections (SDC) method to solve semi-explicit differential-algebraic equations (DAEs) with the ability to be parallelized. The new scheme restricts numerical integration to differential equations. In Y. Xia et al. (2007), it was shown that each correction elevates the order of the solution by one. We show that this carries over to the new SDC scheme. The derivation of the method combines the approach of SDC and the idea to enforce the algebraic constraints without numerical integration as shown in the $\varepsilon$-embedding method by E. Hairer and G. Wanner (1996). Keeping the algebraic equations as an implicit condition of the system allows an efficient solve of semi-explicit DAEs with high-accuracy. The proposed scheme is compared with other DAE methods. We demonstrate that the proposed SDC scheme is competitive with Runge-Kutta methods for DAEs in terms of accuracy and its parallelized versions are very efficient compared to their associated sequential SDC variants.

In this paper, we consider the Dirichlet problem for a class of prescribed Hessian quotient type curvature equations in Minkowski space. For non-convex domains, we prove the existence theorem by establishing the \emph{a priori} estimates without subsolution assumption and Serrin-type condition.

We show that the monoids totM_{k,1} introduced by Birget and their generalizations tot nM_{k,r} which extend the Brin-Higman-Thompson groups, can be realized as the endomorphism monoids of higher-dimensional Jónsson-Tarski algebras. We also show how elements of these monoids can be thought of as "rewrite rules". We use these representations to show that the monoids are finitely presented.

In this work we study the mean-field description of Consensus-Based Optimization (CBO), a derivative-free particle optimization method. Such a description is provided by a non-local SDE of McKean-Vlasov type, whose fields lack of global Lipschitz continuity. We propose a novel approach to prove the well-posedness of the mean-field CBO equation based on a truncation argument. The latter is performed through the introduction of a cut-off function, defined on the space of probability measures, acting on the fields. This procedure allows us to study the well-posedness problem in the classical framework of Sznitman. Through this argument, we recover the established result on the existence of strong solutions, and we extend the class of solutions for which pathwise uniqueness holds.

We present an algorithm based on the alternating direction method of multipliers (ADMM) for solving nonlinear matrix decompositions (NMD). Given an input matrix $X \in \mathbb{R}^{m \times n}$ and a factorization rank $r \ll \min(m, n)$, NMD seeks matrices $W \in \mathbb{R}^{m \times r}$ and $H \in \mathbb{R}^{r \times n}$ such that $X \approx f(WH)$, where $f$ is an element-wise nonlinear function. We evaluate our method on several representative nonlinear models: the rectified linear unit activation $f(x) = \max(0, x)$, suitable for nonnegative sparse data approximation, the component-wise square $f(x) = x^2$, applicable to probabilistic circuit representation, and the MinMax transform $f(x) = \min(b, \max(a, x))$, relevant for recommender systems. The proposed framework flexibly supports diverse loss functions, including least squares, $\ell_1$ norm, and the Kullback-Leibler divergence, and can be readily extended to other nonlinearities and metrics. We illustrate the applicability, efficiency, and adaptability of the approach on real-world datasets, highlighting its potential for a broad range of applications.

In 1977, Chung, Chung and Liu generalized the definition of the Ramsey number. They introduced the $s$-chromatic Ramsey number as follows. Let $1\leq s< t$ be integers and let $A_{1}, A_{2}, \dots, A_{c}$ be subsets with size $s$ of $[t]$, where $c= {t\choose s}$. For given graphs $G_{1}, G_{2}, \dots, G_{c}$, the {\it $s$-chromatic Ramsey number} $r^{s, t}(G_{1}, G_{2}, \dots, G_{c})$, is the minimum positive integer $N$ such that every $t$-coloring of $E(K_{N})$ yields a copy of $G_{i}$ whose edges are colored by colors in the color set $A_{i}$ for some $i\in [c]$. The {\it star-critical $s$-chromatic Ramsey number} $r_{*}^{s, t}(G_{1}, G_{2}, \dots, G_{c})$, is the minimum integer $\ell$ such that every $t$-coloring of the edges in $K_{N}- E(K_{1, N- 1- \ell})$ yields a copy of $G_{i}$ whose edges are colored by colors in the color set $A_{i}$ for some $i\in [c]$, where $N= r^{s, t}(G_{1}, G_{2}, \dots, G_{c})$. If $G_{1}= G_{2}= \dots= G_{c}= G$, then we simplify them to $r^{s, t}(G)$ (also called the {\it weakened Ramsey number}) and $r^{s, t}_{*}(G)$, respectively. In this paper, we determine all the values of $r^{s, t}(K_{1, m})$ and $r_{*}^{s, t}(K_{1, m})$, and part of the value of $r^{s, t}(K_{1, m_{1}}, K_{1, m_{2}}, \dots, K_{1, m_{c}})$.

Over an arbitrary field, we conduct a comprehensive study of the polynomial identities and codimensions of two- and three-dimensional metabelian non-Lie Leibniz algebras. In addition, we compute the images of multihomogeneous polynomials on two-dimensional Leibniz algebras and, as a consequence, prove that the image of any multilinear polynomial evaluated on such algebras is always a vector space. Our analysis includes the three nontrivial isomorphism classes in dimension two and the ten isomorphism classes in dimension three, all of which are metabelian. In particular, we determine finite bases for their corresponding $T$-ideals and provide explicit bases for the associated relatively free graded algebras.

The outlines of a "Galois theory" for bimeromorphic geometry is here developed, via the study of model-theoretic definable binding groups in the theory CCM of compact complex spaces. As an application, a structure theorem about principal meromorphic bundles with algebraic structure group, and admitting no horizontal subvarieties, is deduced. Examples of algebraic groups arising as binding groups are provided, as is a characterisation of when they are linear. Using binding groups in CCM it is shown that, in contrast to the situation in differentially closed fields, there are many algebraic groups which admit nontrivial definable torsors over acl-closed sets in the theory DCCM of existentially closed differential CCM-structures. A self-contained exposition of the binding group theorem in totally transcendental theories, that emphasises the bitorsorial nature of the construction, is also included.

This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in a trivial tail $σ$algebra. A classical example known since the 1930's is that a time series is fully determined by its values on the negative integers if its spectrum has a gap, or at least a sufficiently deep zero. We extend such results to higher dimensions and continuous settings by establishing a connection with the concept of uniqueness pairs, rooted in the uncertainty principle of harmonic analysis. We present several other manifestations of this principle, unify and strengthen seemingly unrelated results across different models: quasicrystals and stealthy processes are shown to be maximally rigid on cones, and discrete integer-valued processes are necessarily periodic when they have a simply connected spectrum. Finally, we identify a surprising class of continuous fields with seemingly standard behavior, such as linear variance and finite dependency range, that undergo a phase transition: they are perfectly interpolable on B(0, $ρ$) for $ρ$ ___ 2 $π$ but exhibit no rigidity for $ρ$ > 2.

A fundamental property of Segre classes is their birational invariance. This invariance implies that the Segre class of a closed subscheme only depends on the integral closure of the defining ideal sheaf. In this paper, we show that, conversely, the Segre class of a closed subscheme encodes an integral dependence criterion for its defining ideal sheaf. As an application, we prove that Aluffi's Segre zeta function provides an integral dependence criterion for homogeneous ideals in polynomial rings.

We study energy minimization problems in quantum chemistry through the lens of computational algebraic geometry. We focus on minimizing the Rayleigh quotient of a Hamiltonian over a tensor train variety. The complex critical points of this problem approximate eigenstates of the quantum system, with the global minimum approximating the ground state. We call the number of critical points the Rayleigh-Ritz degree. We first study the Rayleigh-Ritz degree and introduce the Rayleigh-Ritz discriminant, which describes Hamiltonians that lead to a deficient number of critical points. We then specialize this framework to tensor train varieties: we identify instances when they are Segre products of projective spaces, report what we know about their defining ideals, and present a birational parametrization from products of Grassmannians. We use homotopy continuation to compute all critical points of this optimization problem over various tensor train and determinantal varieties. Finally, we use these results to benchmark state-of-the-art methods, the Alternating Linear Scheme and Density Matrix Renormalization Group.

The goal of the paper is to introduce a convergence à la Gromov-Hausdorff for Lorentzian spaces, building on $ε$-nets consisting of causal diamonds and relying only on the time separation function. This yields a geometric notion of convergence, which can be applied to synthetic Lorentzian spaces (Lorentzian pre-length spaces) or smooth spacetimes. Among the main results, we prove a Lorentzian counterpart of the celebrated Gromov's pre-compactness theorem for metric spaces, where controlled covers by balls are replaced by controlled covers by diamonds. This yields a geometric pre-compactness result for classes of globally hyperbolic spacetimes, satisfying a uniform doubling property on Cauchy hypersurfaces and a suitable control on the causality, and a curvature-driven pre-compactness result. The final part of the paper establishes several applications: we show that Chruściel-Grant approximations are an instance of the Lorentzian Gromov-Hausdorff convergence here introduced, we prove that timelike sectional curvature bounds are stable under such a convergence, we introduce timelike blow-up tangents and discuss connections with the main conjecture of causal set theory.

A persistence diagram is a finite multiset of birth-death pairs representing the lifetimes of topological features across a filtration. Existing functional and kernel representations of persistence diagrams are typically constructed extrinsically through embeddings into auxiliary spaces. For filtrations with finite indexing sets, the associated virtual persistence diagram group obtained by Grothendieck completion of the persistence diagram monoid is a finitely generated lattice. We define a phase map sending each persistence interval to a circular coordinate and a character map aggregating the phases of intervals in a virtual persistence diagram. We introduce heat damping on characters of virtual persistence diagram groups to suppress the unstable frequencies. We derive Lipschitz bounds for the resulting kernels and apply them in a synthetic segmentation experiment.

Partial Differential Equations (PDEs) are fundamental mathematical models for describing physical phenomena, yet most PDEs of practical interest require numerical approximations. The feasibility of such methods is constrained by existing computational models. Since digital computers are the primary realizations of numerical computations, and Turing machines define their theoretical limits, computability of PDE solutions is of fundamental significance. It provides a rigorous framework to distinguish equations that are effectively solvable from those that encode undecidable or non-computable behavior. Once computability is established, complexity theory quantifies the resources required to approximate PDE solutions. In this work, we present a novel framework based on least-squares variational formulations and associated gradient flows to analyze the computability and complexity of PDE solutions from an optimization perspective. Our approach approximates PDE solution operators via discrete gradient flows, linking PDE properties, such as coercivity, ellipticity, and convexity, to solution complexity. Within this setting, we characterize representation- and discretization-dependent sufficient conditions for regimes where PDEs admit polynomial-time approximations, as well as regimes exhibiting complexity blowup, where polynomial-time input data produce solutions with super-polynomial complexity. In summary, this paper develops a variational framework for analyzing computability and computational complexity of PDE solution classes. The results show how PDE structure and solution regularity influence their complexity, by establishing sufficient conditions for computability and complexity bounds. Beyond the theoretical characterization, the framework provides guidelines for effective numerical methods and contributes to understanding the limitations of digital computation for PDE problems.

We generalize Milnor link invariants to surface-links in 4-space, possibly with boundary. To this end, we introduce the notion of cut-diagram, which is a 2-dimensional analogue of Gauss diagrams. To each cut-diagram, we associate a group extending the fundamental group of the exterior of a surface-link, and we extract Milnor-type invariants from its successive nilpotent quotients. We show that this yields concordance invariants for surface-links, and that some even are link-homotopy invariants. We give several concrete applications, including realization and classification results. The theory of cut-diagrams is further investigated, heading towards a combinatorial approach to surfaces in 4-space.

In gravitational theories containing matter fields and higher-derivative corrections, the standard Smarr formula often fails unless all dimensionful couplings are incorporated consistently. Traditionally, parameters such as the cosmological constant or the coefficients of higher-derivative terms are regarded as immutable features of the theory and therefore excluded from the thermodynamic phase space. In our recent work, we developed a fully general framework that promotes every such coupling to a dynamical, freely varying parameter of black hole solutions. This is accomplished by introducing, for each coupling, an auxiliary scalar and gauge field, through which the coupling appears as a conserved charge associated with the global sector of an emergent gauge symmetry. The corresponding conjugate variables naturally arise as electric potentials evaluated at the black hole horizon. As a result, the first law and the Smarr relation acquire additional, systematically determined contributions, yielding a consistent and universal extension of black hole thermodynamics. We illustrate the validity of this construction by revisiting several black hole examples in the literature where the Smarr formula remains inconsistent even after treating the cosmological constant as a thermodynamic variable. Our analysis shows that only by including all dimensionful couplings in this generalized manner can one obtain an internally consistent Smarr relation, thereby providing the foundation for a truly universal formulation of black hole thermodynamics.

We provide efficient algorithms to compute convergents of quadratic irrationals. We show that for square roots, in settings where Galois' refinement of Lagrange's theorem holds, certain decimations of the sequence of convergents are signed Chebyshev sequences, which can be also be generated by a Householder method.

We consider the optimal control of large-scale systems using distributed controllers whose network topology mirrors the coupling graph between subsystems. In this work, we introduce spatial regret, a graph-informed metric measuring the worst-case performance gap between a distributed controller and an oracle with access to additional sensor information. The oracle's graph is a user-specified augmentation of the information graph, yielding a benchmark policy that penalizes disturbances for which additional sensing would improve performance. Minimizing spatial regret yields distributed controllers - respecting the nominal information graph - that emulate the oracle's response to disturbances characteristic of large-scale networks, such as localized perturbations. We show that minimizing spatial regret admits a convex reformulation as an infinite program with a finite-dimensional approximation. To scale to large networks, we derive an upper bound on the spatial regret that can be efficiently minimized in a distributed way. Numerical experiments on power-system models show that the resulting controllers mitigate localized disturbances more effectively than those based on classical metrics.

We study double-well systems with strong magnetic fields and deep potential wells. We present lower bounds on tunneling rates for generic values of the coupling constant. This result was recently announced and complements our recent counter-example construction which exhibits vanishing tunneling for specially-constructed double-well potentials.

We study an inverse boundary value problem for the nonlinear wave equation in $2 + 1$ dimensions. The objective is to recover an unknown potential $q(x, t)$ from the associated Dirichlet-to-Neumann map using real-valued waves. We propose a direct numerical reconstruction method for the Radon transform of $q$, which can then be inverted using standard X-ray tomography techniques to determine $q$. Our implementation introduces a spectral regularization procedure to stabilize the numerical differentiation step required in the reconstruction, improving robustness with respect to noise in the boundary data. We give rigorous justification and optimal stability estimates for the regularized spectral differentiation of noisy measurements, which may be of independent interest. Numerical experiments demonstrate the feasibility of recovering potentials from boundary measurements of nonlinear waves and illustrate the advantages of the Radon-based reconstruction.

We prove that the poset of $q$-decreasing words equipped with the componentwise order forms a lattice. We enumerate the join-irreducible elements for arbitrary $q>0$, and for any positive rational number $q$, we determine the number of coverings, intervals and meet-irreducible elements. The latter present the same structure as words over an alphabet of $2\lceil q\rceil+1$ letters avoiding $\lceil q\rceil^2+2\lceil q\rceil-1$ consecutive patterns of length 2. Furthermore, we analyze the asymptotic behavior of several of these quantities.

In 2018, Kalck and Yang showed that the singularity categories associated with $3$-dimensional Gorenstein quotient singularities are triangle equivalent (up to direct summands) to small cluster categories associated with McKay quivers with potential. We introduce higher McKay quivers with potential and generalize Kalck and Yang's theorem to arbitrary dimensions. The singularity categories we consider occur as the stable categories of categories of Cohen-Macaulay modules. We refine our description of the singularity categories by showing that these categories of Cohen-Macaulay modules are equivalent to Higgs categories in the sense of Wu. Moreover, we describe the singularity categories in the non-Gorenstein case.

We study the large-$N$ asymptotics of the central trace of the heat kernel on compact classical groups. For every classical family $G_N\subset \mathrm{GL}_N(\C)$, we prove a full large-$N$ asymptotic expansion, using a highest weights/partitions correspondence adapted to the large-rank regime, under which the eigenvalues of the Laplace--Beltrami operator stabilize as observables in the algebra of shifted symmetric functions. Then, we prove a random surface representation of the trace in terms of ramified coverings of the torus. We provide two independent applications: an explicit large-rank counting law for the Casimir spectrum, with exponential Hardy--Ramanujan-type growth in contrast with the polynomial behavior of Weyl's law at fixed rank, and a rigorous probabilistic formulation of the Yang--Mills/Hurwitz duality on a two-dimensional torus initiated by Gross and Taylor, completing a previous work of the authors. We also extend this duality to a Yang--Mills/Gromov--Witten duality by expressing the coefficients of the central heat trace as explicit functionals of the generating function of Gromov--Witten invariants.

Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust combinatorial abstraction of convexity. Supersolvable convex geometries and antimatroids appear in the study of poset closure operators, Coxeter groups, and matroid activities. We prove that the building sets on a finite meet-semilattice form a supersolvable convex geometry. As an application, we demonstrate that building sets and nested set complexes respect certain restrictions of finite meet-semilattices unifying and extending results of several authors.

Matrix-product state (MPS) skeletons are connected networks of Hamiltonians with exact MPS ground states that underlie a phase diagram. Such skeletons have previously been found in classes of free-fermion models. For the translation-invariant BDI and AIII free-fermion classes, it has been shown that the underlying skeleton is dense, giving an analytic approach to MPS approximation of ground states anywhere in the class. In this paper, we partially expose the skeleton in certain interacting spin chains: the $N$-state Onsager-integrable chiral clock families. We construct MPS that form a dense MPS skeleton in the gapped regions surrounding a sequence of fixed-point Hamiltonians (the generators of the Onsager algebra). Outside these gapped regions, these MPS remain eigenstates, but no longer give the many-body ground state. Rather, they are ground states in particular sectors of the spectrum. Our methods also allow us to find further MPS eigenstates; these correspond to low-lying excited states within the aforementioned gapped regions. This set of MPS excited states goes beyond the previous analysis of ground states on the $N=2$ free-fermion MPS skeleton. As an application of our results, we find a closed form for the disorder parameter in a family of interacting models. Finally, we remark that many of our results use only the Onsager algebra and are not specific to the chiral clock model representation.