Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 6 May
Given graphs $H$ and $F$, the generalized Turán number $\mathrm{ex}(n,H,F)$ is the maximum number of copies of $H$ among all $n$-vertex $F$-free graphs. The friendship graph $F_k$ consists of $k$ triangles sharing a common vertex. In this paper, we determine the value of $\mathrm{ex}(n,K_3,(t+1)F_k)$, where $K_3$ is a triangle, $t\geq 1$ is an integer, and $(t+1)F_k$ denotes a union of $(t+1)$ pairwise vertex-disjoint copies of $F_k$. Moreover, we characterize the extremal structure. Our result can be viewed as a generalization of the result of Zhu, Chen, Gerbner, Győri, and Hama Karim, as well as of the remaining case left open by Wang, Ni, Liu, and Kang. In contrast to the extremal graphs of $F_k$, the extremal graphs of $(t+1)F_k$ undergo a fundamental change. This structure is also different from those of previous similar problems.
Combinatorics
Minimal generating sets of transfer systems for more non-Abelian Groups
For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg–Hill and Rubin their homotopy category is equivalent to the poset of $G$–transfer systems on the subgroup lattice of $G$. In \cite{ABB+25} the authors defined the width $w(G)$ as the minimal size of a generating set for the complete $G$–transfer system and identified it with the number of conjugacy classes of proper meet irreducible subgroups of $G$, and the complexity $c(G)$ as the maximum, over all transfer systems $T$, of the size of a minimal generating set for $T$. We compute $w(G)$ for the semidihedral groups $\SD_{2^n}$ ($n\ge 4$) and the affine Frobenius groups $\AGL(1,p^n)\cong \mathbb{F}_{p^n}\rtimes \mathbb{F}_{p^n}^\times$, extending existing calculations and highlighting how subgroup lattice structure governs equivariant multiplicative complexity. We also compute $c(D_{p^n})$ for dihedral groups of order $2p^n$ with $p$ an odd prime, establishing $c(D_{p^n})=\lfloor 3n/2\rfloor+1$, and derive the lower bound $c(\SD_{2^n})\ge\lfloor 5(n-1)/2\rfloor$.
Read the full abstract
Numerical Analysis
Steady Incremental Viscosity Splitting Method for solving the stationary Navier-Stokes equation
We develop a novel and efficient iterative scheme for solving incompressible steady Navier-Stokes equations. The method is an adaptation of the Incremental Viscosity Splitting approximation for unsteady flows to steady equations. At each nonlinear iteration, the scheme requires solving an elliptic PDE for the velocity variable and a system with an SPD matrix for the pressure variable, which remains the same across all nonlinear iterations. The method can also be interpreted as an algebraic splitting approach. We prove boundedness and geometric convergence. Numerical tests illustrate the efficiency of the proposed algorithm.
Read the full abstract
Analysis of PDEs
Normalized solutions to a class of Kirchhoff type equations with a logarithmic perturbation
This paper is devoted to the study of normalized solutions to the Kirchhoff type equation with a logarithmic perturbation\[-\left(a+b\int_{\mathbb{R}^3}|\nabla u|^2 \,\mathrm{d}x \right) \Delta u=\lambda u+|u|^{p-2}u+u\log u^2,\quad x \in\mathbb{R}^3, \]under the normalized constraint $\int_{\mathbb{R}^3} u^2 \,\mathrm{d}x = c^2$, where $a,b>0$, $2<p\leq 6$, $c>0$ is a constant, and $\lambda\in\mathbb{R}$ emerges as a Lagrange multiplier which is not a priori known. A unified variational framework is developed based on Orlicz spaces together with the Pohozaev constraint method and refined fiber map analysis. For $2<p<\frac{14}{3}$ or $p=\frac{14}{3}$ with small mass, the energy functional is bounded from below and admits a positive radial ground state minimizer. For $\frac{14}{3}<p<6$, where the energy functional is unbounded from below, we establish the existence of two normalized solutions for small mass: a ground state $u_c^+$ obtained via local minimization, and a second solution $u_c^-$ obtained via minimization on the negative component of the Pohozaev manifold. For the Sobolev critical case $p=6$, we construct a ground state solution and, under a technical condition on the parameters, a second solution by introducing a proper auxiliary functional and precise energy estimates with Aubin-Talenti bubbles. Asymptotically as $c\to0^+$, the $L^{2}$ norm of the gradient of ground state solution vanishes for $2<p\le6$. Surprisingly, for $\frac{14}{3}<p<6$, the $L^{2}$ norm of the gradient of the second solution diverges to infinity as $c\to 0^+$, while for $p=6$ it concentrates around the Aubin-Talenti bubble with energy converging to the energy level of the corresponding critical Kirchhoff equation.
Read the full abstract
Numerical Analysis
A Generalized FC-Gram Approximation Framework with Analysis and Applications
The FC-Gram algorithm constructs high-order trigonometric approximations of nonperiodic functions by periodically extending them to a larger interval, with the quality of the blending continuation of Gram polynomials over the extension interval directly governing the approximation accuracy. We introduce GenFC, a generalized FC-Gram framework in which the continuation of each Gram polynomial is shaped by a cutoff function satisfying prescribed boundary flatness conditions. We establish a convergence theorem showing that for any such family the GenFC approximation error satisfies $O(n^{-\min(r+\beta,\,d)})$ in the supremum norm on the original interval, where $f \in C^r([0,1])$ has an integrable $(r+1)$th derivative, $d$ is the number of Gram polynomials, and $\beta \in [0,1]$ is the Fourier decay exponent of $f^{(r+1)}$. The modified FC-Gram algorithm, recently introduced by the authors, is recovered as a special case, and several explicit families satisfying these conditions are constructed in the paper. Numerical experiments across smooth, limited-regularity, and rapidly oscillating test cases confirm the theoretical predictions. The framework is further applied to high-order solvers for linear ODEs and parabolic PDEs via backward differentiation formulae (BDF) time-stepping, demonstrating high-order accuracy throughout.
Read the full abstract
Optimization and Control
Distributed Energy System Design including Unbalanced AC Power Flow for Large LV Networks with ADMM
With the addition of large numbers of distributed energy resources (DERs) to distribution networks comes the increasing risk that their operation may violate the safety constraints of these networks. The problem considered in this paper is that of combined siting, sizing and dispatch of these DERs, also known as distributed energy system (DES) design, to help meet electrical and heat loads within the network. Here, the operation of these DERs is modelled, along with the unbalanced three-phase alternating current (AC) power flow in the network. When this network power flow is considered, this admits a non-convex mixed-integer nonlinear program (MINLP) model formulation which scales poorly with network size in terms of solve time. To address this, the problem is decomposed into a series of algorithmic steps, starting with a mixed-integer linear program (MILP) formulation that does not consider network constraints, then fixing binary variables, adding power flow constraints and solving as a nonlinear program (NLP) and finally removing operational binary variables and replacing them with a complementarity reformulation. As the main contributors to the overall solve time, the NLP and Complementarity steps are solved using a hybrid spatial/temporal decomposition strategy and the alternating direction method of multipliers (ADMM) distributed optimisation method. Results are presented for networks based on the European low voltage test feeder with up to 55 loads and 120 timepoints, with the ADMM approach showing speed-ups of up to 13x when considering parallel computation of the subproblems, for a maximum observed optimality gap of 0.61%.
Read the full abstract
Representation Theory
On the semisimplicity and Schur elements of (super)symmetric superalgebras
In this paper, we use Schur elements to derive semisimplicity criteria for (super)symmetric superalgebras. We obtain a closed formula for the Schur elements of cyclotomic Hecke-Clifford superalgebras $\mathcal{H}^{f}_{\mathbb{K}}$. As applications, we prove that two trace functions $\gimel_n$ and $t_{1,n}$ on the Hecke-Clifford superalgebra, which are defined in different ways, are proportional. We give a semisimplicity criterion for $\mathcal{H}^{f}_{\mathbb{K}}$ when it is (super)symmetric. We also derive semisimplicity criteria for cyclotomic quiver Hecke superalgebras of types $A^{(1)}_{e}$, $C^{(1)}_{e}$, $A^{(2)}_{2e}$ and $D^{(2)}_{e+1}$.
Read the full abstract
Numerical Analysis · Cross-listed from cs.CE
Sequential topology optimization: SIMP initialization for level-set boundary refinement
Density-based topology optimization methods such as SIMP enable efficient topological exploration but produce diffuse material boundaries that require interpretation before manufacturing. Level-set methods maintain sharp interfaces but are sensitive to the initial design. This paper presents a sequential framework that addresses these complementary limitations through a signed distance function (SDF)-based geometry transfer, formulated for three-dimensional meshes. The SIMP density distribution is converted into an SDF that initializes subsequent level-set boundary refinement. From the level-set perspective, the SIMP-derived initialization mitigates sensitivity to the initial design. From the SIMP perspective, the level-set stage acts as optimization-driven post-processing that produces manufacturing-ready boundaries. Validation on three-dimensional cantilever and MBB benchmarks demonstrates compliance comparable to standalone level-set optimization, with up to 4.6x wall-clock speedup on the cantilever case. The full implementation is released under an open-source license to support reproducibility.
Read the full abstract
Combinatorics
Hamilton decompositions of equal-side directed tori
Let $D_d(m)$ be the Cartesian product of $d$ positively oriented directed cycles of length $m$. We prove that $D_d(m)$ decomposes into $d$ directed Hamilton cycles for every $m\ge3$ and $d\ge2$. The construction proceeds by splitting coordinate directions in directed multitori. An integer selection theorem supplies unit voltages compatible with the prescribed arc multiplicities; at even modulus, the decisive condition is the parity of each incidence component. For even $m$ and odd $d\ge7$, we satisfy this condition with a factorization having one additional cycle. A relative lifting theorem preserves the first-return data of a three-colour recolouring through successive coordinate splits, after which the recolouring removes the additional cycle on a set whose size is independent of the dimension. Explicit constructions complete the low-dimensional cases. The theorem yields Hamilton decompositions of Cartesian products of equal-order, equal-degree Hamilton-decomposable digraphs, of abelian Cayley digraphs whose generators partition into module bases, and of a family of height-stretched directed tori.
Read the full abstract
Combinatorics
The average distance of spanning trees in terms of independence number
Let $G$ be a connected graph with vertex set $V(G)$, and denote by $d_G(u,v)$ the distance from $u$ to $v$ in $G$, for any $u,v \in V(G)$. The average distance of an $n$-vertex connected graph $G$, denoted by $\mu(G)$, is defined to be the average of all distances between all pairs of vertices in $G$, i.e., $\mu (G) = \binom{n}{2}^{-1} \sum_{\{u,v\} \subset V(G)}d_G(u,v)$. The problem of finding a spanning tree of minimum average distance is known to be NP-hard, so establishing an upper bound for the minimum average distance among all spanning trees is of particular interest. Mukwembi (J. Graph Theory, 2014) showed that if $G$ is a connected graph of order $n$ with independence number $\alpha$, where $n > 2 \alpha - 1$, then $G$ has a spanning tree $T$ such that $\mu(T) \le \alpha + 2$. In this paper, we first improve the upper bound to $\mu(T) < \alpha + 1$ for $\alpha \ge 1$, and then we find the bound could be further improved when $\alpha$ becomes larger, so a better upper bound \[ \mu(T) < \left\{ \begin{array}{ll} \alpha+1 & \hbox{if } 1\le\alpha\le 6,\\ \alpha+\frac12+\frac{4(\alpha-1)}{\alpha^2} & \hbox{if } \alpha\ge 7, \end{array} \right. \] is established later. In the end, we give a remark to indicate our new upper bound is best possible in the sense of asymptotics (when $n$ and $\alpha$ are large enough).
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Dual Certified White-Box Inference for Input Convex Neural Networks
Input convex neural networks (ICNNs) are used to learn convex objectives whose minimizers define decisions, making efficient and reliable optimization central to inference. At nonsmooth inputs, automatic differentiation returns a single derivative rather than the full subdifferential governing optimality and descent. Second-order cone ICNNs (SOC-ICNNs) admit an exact representation as value functions of parametric second-order cone programs, providing a white-box approach to recovering their full subdifferentials from optimal dual multipliers and deriving explicit Hessians on smooth regions. Building on this representation, we develop dual-certified inference (DCI), which combines the network and feasible set geometries to obtain exact stationarity certificates and tangent common descent directions. DCI uses local curvature for Newton acceleration and an exact proximal safeguard. We establish global convergence and, under standard regularity conditions, local quadratic convergence near structurally nondegenerate interior minimizers. Numerical experiments validate the recovered geometry and demonstrate the reliability and efficiency of DCI. Code is avaliable at https://anonymous.4open.science/r/DCI-ICNN-507D/
Read the full abstract
Information Theory
A Framework of Secure Source Coding using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem
In this paper, we propose a framework of source encryption, where cryptographic processing is applied to a prescribed fixed length source code. The proposed source encryption framework is based on the secure communication framework of the Shannon cipher system. In the proposed framework, we use the mutual information as a measure of information leakage to an adversary. For the proposed framework, we explicitly establish the necessary and sufficient condition for reliable and secure communication under the condition that error probability and information leakage, respectively, are upper bounded by prescribed constants $\epsilon\in (0,1)$ and $\delta \in (0,\infty)$. We also show that the obtained necessary and sufficient condition does not depend on the constants $\epsilon\in (0,1)$ and $\delta\in (0,\infty)$, demonstrating that we have the strong converse theorem for the proposed framework of source encryption. We further prove the existence of encryption/decryption schemes, which are universal in the sense that they work effectively for any distributions of the plain text and those of the key used for the encryption.
Read the full abstract
Algebraic Geometry · Cross-listed from cs.SC
On Minimum CADs for Algebraic Sets in Dimension Three
Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may produce different outputs, and introduce unnecessary cell divisions. Recent work by Michel, Mathonet, and Zénaïdi in ISSAC 2024 formalised this issue by studying the refinement order on the set of all CADs adapted to $\mathcal{F}$ and analysing the existence of a minimum (coarsest) adapted CAD. It was shown that such a minimum adapted CAD always exists for subsets of $\mathbb{R}$ and $\mathbb{R}^2$, but not of $\mathbb{R}^n$ ($n \geqslant 3$) in general. It is natural to seek natural classes of subsets of $\mathbb{R}^n$ that admit a minimum adapted CAD. In this paper, we identify a class of subsets of $\mathbb{R}^3$ that contains all algebraic sets for which minimum adapted CADs do exist. This provides the first positive existence theorem for minimum CAD for a non-trivial class of sets.
Read the full abstract
Optimization and Control · Cross-listed from cs.CG
On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
We study the computational complexity of exact cardinality-constrained minimum Riesz $s$-energy subset selection in finite metric spaces: given $n$ points, select $k<n$ points of minimum Riesz $s$-energy. The objective sums inverse-power pair interactions and therefore promotes well-separated subsets; as $s$ becomes large, it increasingly approaches a bottleneck criterion governed by the closest selected pair, linking it to minimum pairwise distance (MPD). Building on the general-metric NP-hardness result of Pereverdieva et al. (2025), we prove that NP-hardness persists for point sets in the Euclidean plane when $s$ is part of the input. In contrast, finite ultrametric spaces form an exact tractable regime: on rooted binary ultrametric trees with $n$ leaves, an optimal size-$k$ subset can be computed by dynamic programming in $O(nk^2)$ time. We also discuss the ordered one-dimensional Euclidean case, where the classical MPD objective admits simple dynamic programming, but the additive Riesz energy does not appear to allow the same state compression. Finally, we explain why one natural route to fixed-$s$ Euclidean hardness does not close: Fowler-style 3SAT gadgets, together with zeta-function bounds for far-field interactions, show why this approach still requires an exponent depending on $k$. Together, these results provide a compact complexity landscape for a natural diversity or dispersion objective, distinguishing Euclidean hardness, ultrametric tractability, and the ordered one-dimensional case.
Read the full abstract
Logic
On n-distality, n-triviality and hypergraph regularity in NIP theories
We study Keisler measures in strongly n-distal NIP theories, generalizing some results of Simon and Chernikov-Starchenko for distal theories and addressing some questions of Walker. In particular, we establish a hypergraph version of the distal regularity lemma, compact domination for definable fsg groups, and demonstrate that the strong n-distality hierarchy is strict among stable theories using a connection to Poizat's total triviality of forking. We also show that infinite strongly n-distal NIP fields have characteristic 0 using a discrepancy result of Babai-Hayes-Kimmel from multiparty communication complexity.
Read the full abstract
Optimization and Control · Cross-listed from cs.AI
Budget-aware Auto Optimizer Configurator
Optimizer states occupy massive GPU memory in large-scale model training. However, gradients in different network blocks exhibit distinct behaviors, such as varying directional stability and scale anisotropy, implying that expensive optimizer states are not universally necessary and using a global optimizer is often memory-inefficient. We propose the Budget-Aware Optimizer Configurator (BAOC) to reduce memory cost by assigning suitable optimizer configurations to individual blocks under given budgets. Specifically, BAOC samples gradient streams to derive statistical metrics that quantify the potential performance risk of applying cheaper configurations (e.g., low precision or removing momentum). It then solves a constrained allocation problem to minimize total risk under memory and time budgets, selecting a budget-feasible configuration for each block. Experiments across vision, language, and diffusion workloads demonstrate that BAOC maintains training quality while significantly reducing the memory usage of optimizer states. The code is available at https://anonymous.4open.science/r/BAOC-45C6.
Read the full abstract
Combinatorics
Subcubic $K_4$-minor-free graphs without crumby colorings
Motivated by Wegner's conjecture on squares of planar graphs, Thomassen conjectured that every 3-connected cubic graph on at least eight vertices admits a red-blue vertex coloring in which the blue subgraph has maximum degree at most 1, while the red subgraph has minimum degree at least 1 and contains no $P_4$. Such colorings are now called crumby colorings. Although this conjecture was disproved in general by Bellitto, Klimošová, Merker, Witkowski and Yuditsky, positive results of Barát, Blázsik and Damásdi led them, in the same subcubic setting, to conjecture that every $K_4$-minor-free graph admits a crumby coloring. We disprove this conjecture with a connected subcubic partial 2-tree on 18 vertices. We also disprove its natural 2-connected version with a 2-connected subcubic partial 2-tree on 40 vertices with no crumby coloring. Consequently, the obstruction to crumby colorability already occurs within treewidth two, even under 2-connectivity.
Read the full abstract
Information Theory
Entropy and Distributed Source Coding of Connected Soft Random Geometric Graphs
We consider the distributed compression of Soft Random Geometric Graphs (SRGGs) above the connectivity threshold. We establish the Slepian-Wolf rate region for the SRGG in the setting where there are a finite number of encoders compressing sections of the graph independently. To do so, we prove novel limit theorems and asymptotic equipartition properties for the SRGG and its entropy, which allow us to use random binning techniques for distributed compression.
Read the full abstract
Algebraic Geometry
The McKay correspondence and local heights for wild-by-tame split metacyclic groups
We study the McKay correspondence for the representations of certain wild-by-tame split metacyclic groups whose order is divisible by the characteristic of the base field. We calculate the stringy motive of the quotient variety and find a formula for its stringy Euler number. As a consequence, we prove that a crepant resolution of the quotient variety (provided one exists) does not in general have Euler characteristic equal to the number of conjugacy classes in $G$, in contrast to the classical case. In particular, we show it depends on the choice of representation as well as the group. As part of this, we compute the v-function associated to a $G$-representation, corresponding to a stacky local height function.
Read the full abstract
Number Theory
$\mathbb{G}_m$-cohomology of $p$-adic Stein spaces
We compute the étale $\mathbb{G}_m$-cohomology of some $p$-adic rigid analytic Stein spaces. The computation is done by considering the filtration induced by the subgroup of principal units $U=1+ \mathfrak{m} \mathcal{O}^+$ of $\mathbb{G}_m$. We then determine the $U$-cohomology via methods from $p$-adic Hodge theory (passage to the pro-étale site, comparison theorems with $p$-adic cohomologies), while the $\mathbb{G}_m/U$-cohomology is obtained using Kummer exact sequences. In particular, our formula applies to the case of Drinfeld upper-half space.
Read the full abstract
Algebraic Geometry
On Waring rank jumps via critical rank-one approximations
We investigate whether eigenvectors, also known as critical rank-one approximations, of a symmetric tensor can be used to increase or decrease its Waring rank. First, we study the variety of degree-d rank-r forms which admit an eigenvector as part of a minimal Waring decomposition. In the case of binary forms, we show that this is of codimension-one in the r-th secant variety of the rational normal curve. On the other hand, we prove that for any binary form of rank less than (d+1)/2 (subgeneric), any eigenvector increases the rank. Additionally, when the degree is odd, the same holds for generic forms of generic rank. Our approach employs the strict relation between the apolar action and the Bombieri-Weyl product.
Read the full abstract
Number Theory
Small values of signed harmonic sums and logarithmic means of multiplicative functions
We construct sequences $\{a_n\}_{n\in\mathbb{N}}\in\{-1,1\}^{\mathbb{N}}$ with small values of signed harmonic sums \[ \sum_{n\in\mathcal{A}\cap[1,N]}\frac{a_n}{n}, \] for any reasonably dense subsets $\mathcal{A}\subset\mathbb{N}.$ We apply these methods to further construct completely multiplicative functions $f:\mathbb{N}\to\{-1,1\}$ with unusually small logarithmic partial sums, that is, \[ \sum_{n \leq N}\frac{f(n)}{n} \ll \exp\left(-c_0 \frac{N^{1/3}}{(\log N)^{1/3}} \right) \] holds for infinitely many $N\to\infty$. The proofs combine careful analysis of the small-scale distribution of random harmonic sums over subsets of $\mathbb{N}$, together with deterministic inductive arguments inspired by the “anatomy" of integers.
Read the full abstract
Optimization and Control
Uncertainty Quantification Methods for Optimal Excitation Design in Parameter Identification
Parameter identification is crucial in virtual engineering processes, yet determining appropriate system excitations for identifying specific parameters remains challenging. In practice, extensive experimental programs often fail to generate data with sufficient information content for reliable parameter estimation. This work presents a systematic approach for deriving optimal excitations by maximizing the global sensitivity of target parameters across the space of possible excitation functions. To address the computational challenge of sensitivity evaluation during optimization, we develop two complementary approaches based on uncertainty quantification (UQ) methods. For systems with known mathematical structure, we present an intrusive polynomial chaos expansion (PCE) method that constructs deterministic surrogate models, enabling rapid sensitivity computation. For black-box models where intrusive approaches are not feasible, we introduce a novel non-intrusive method based on optimal transport theory, specifically using Wasserstein distances to quantify sensitivity measures without requiring knowledge of internal system dynamics. Both methods significantly reduce computational costs, making optimal excitation design practical for complex engineering systems. We demonstrate the effectiveness of both approaches on vehicle dynamics models, showing substantial improvements in parameter identification capability. The benefit for parameter identification is further validated experimentally on a test vehicle and compared to the state of the art.
Read the full abstract
Logic
Continuations and Completeness in Proof-theoretic Semantics
This is a short paper about the relationship between logic and computation. More specifically, it is about a relationship between the completeness proof for intuitionistic propositional logic within the form of proof-theoretic semantics that is known as base-extension semantics and a fundamental idea from the theory of computation called continuation-passing semantics. The latter is explained herein both in terms of reduction in natural deduction and the lambda calculus and in terms of proof-search. The relationship between completeness and continuations is explored through an analysis of Sandqvist's proof of the completeness theorem as seen from the mathematical perspective of Kripke's and Heyting's semantics. Our analysis can be seen to reveal how syntactic representations of continuations embody intensional semantical intuitions about the relationship between their meaning and use. These intuitions are made precise using the tools of proof-theoretic semantics.
Read the full abstract
Numerical Analysis
Hamiltonian Interface Dynamics for Reduced-Order Optimization of Incompressible Mixing
We develop a reduced-order framework for optimizing mixing in two-dimensional incompressible flows. Instead of optimizing the full transport PDE, the method maximizes the length of advected material interfaces, leading to a Hamiltonian control problem with a finite spatial basis based on parametrized stream functions. We derive the continuous adjoint equations and reduced gradients, and discretize the forward and adjoint dynamics with the implicit midpoint rule. The resulting discrete adjoint is algebraically consistent with the derivative of the fully discrete objective when the implicit equations are solved exactly. The approach applies to bounded two-dimensional domains with sufficiently regular finite-dimensional stream-function parametrizations. Numerical experiments on cellular-flow and Doswell frontogenesis benchmarks show interface stretching and mix-norm decay over the simulated horizons. In four comparisons, the interface runs have lower recorded optimization times, whereas the Sobolev controls attain smaller terminal mix-norms. The different constraints, stopping rules and timing scopes preclude an equal-accuracy speedup claim.
Read the full abstract
Analysis of PDEs
A scalar field equation on hyperbolic space with indefinite sign nonlinearity
In this article, we study threshold phenomena for the semilinear double-power elliptic equation $$-\Delta_{\mathbb{B}^N} u - \lambda u = |u|^{p-1}u - |u|^{q-1}u, \quad u \in H^1(\mathbb{B}^N),$$ on the hyperbolic space $\mathbb{B}^N$ for $N \ge 3$. For parameters $1 < p \le 2^*-1$ (though we occasionally allow for supercritical exponents) and $q > 0$, we seek to identify the optimal spectral regimes for $\lambda \in \mathbb{R}$ that delineate the existence and non-existence of positive-energy solutions. We achieve a complete resolution of these thresholds across all exponent configurations: $p < q$, $0 < q < 1 < p$, and $1 < q < p$. Our results demonstrate that the boundary separating these regimes is governed by an explicit critical spectral parameter, which depends on $p$, $q$, and $N$ in the regime where $p < q$, but depends solely on $N$ in the remaining cases.
Read the full abstract
Probability
Ergodicity of stochastic functional differential equation with jumps and finite delay
This paper investigates the ergodicity of stochastic functional differential equations with jumps under the Wasserstein distance by the generalized coupling method. Two key conditions are verified. The first is verified by establishing an exponential decay bound for the coupled segment processes and applying the Girsanov theorem for Itô-Lévy processes. The second is verified through a support theorem developed for an auxiliary process and then extended to the underlying process. Combining these results yields the desired ergodicity.
Read the full abstract
Representation Theory
Classification of the irreducible ordinary modules for affine vertex operator superalgebras
Let $\mathfrak{g}$ be a basic classical Lie superalgebra, $\mathcal{k}=\frac{h^{\vee}}{u}-h^{\vee}$ a boundary admissible level of $\widehat{\mathfrak{g}}$, where $u$ is a positive integer and $h^{\vee}$ is the dual Coxeter number of $\mathfrak{g}$. In this paper, we classify the irreducible ordinary modules for the affine vertex operator superalgebra $L_{\widehat{\mathfrak{g}}}(\mathcal{k},0)$ associated to any basic classical Lie superalgebra $\mathfrak{g}$. More specifically, if $\mathfrak{g}$ is a basic classical Lie superalgebra of type I, we prove that $L_{\widehat{\mathfrak{g}}}(\mathcal{k},0)$ has exactly $u$ inequivalent irreducible ordinary modules. If $\mathfrak{g}$ is a finite dimensional simple Lie algebra or a basic classical Lie superalgebra of type II, we prove that $L_{\widehat{\mathfrak{g}}}(\mathcal{k},0)$ itself is the only irreducible ordinary $L_{\widehat{\mathfrak{g}}}(\mathcal{k},0)$-module.
Read the full abstract
Analysis of PDEs
Traveling-wave behavior for Fisher-KPP equations in the hyperbolic space
We study the Cauchy problem in the hyperbolic space for the heat equation with a Fisher-KPP type forcing term. Depending on the relative strength of diffusion, measured by the infimum of the spectrum of the Laplace-Beltrami operator, as compared to the growth due to the forcing term, solutions may propagate or vanish as time passes. We prove new results concerning this dichotomy that include the critical case where diffusion and reaction are of the same order. If the initial datum possesses some symmetry (invariance under a cohomogeneity one subgroup of the group of isometries of the hyperbolic space), the problem reduces to a unidimensional one. In the case of propagation, the solution to this unidimensional problem converges in shape to an Euclidean traveling wave of minimal speed in an appropriate moving frame. The choice of this frame depends on the subgroup of isometries (elliptic, hyperbolic or parabolic) under which the initial datum is invariant. In contrast with the Euclidean case, the asymptotic spreading speed (in due coordinates) depends on the dimension, while the coefficient of the logarithmic correction in the location of the front does not, no matter the underlying isometry.
Read the full abstract
Numerical Analysis
A third-order multi-moment cell-centered Lagrangian scheme for hydrodynamics with an accurate 2D nodal solver
This paper presents a novel high-order cell-centered Lagrangian scheme for 2D compressible hydrodynamics by bridging the multi-moment constrained finite volume method (MCV) [16, 51, 52] with a nodal Riemann solver. This scheme (denoted by LMCV) not only maintains high-order accuracy as MCV but also inherits the conservation and robust properties of the nodal Riemann solver. On the one hand, the MCV employs and evolves both the point-values (PV) at cell vertexes and the volume-integrated averages (VIA) on computational mesh, which ensures the rigorous numerical conservation and establishes an adequate foundation for the computation of Lagrangian fluxes with high accuracy. On the other hand, we developed a 2D Riemann solver based on EUCCLHYD [24], it takes fully advantage of numerical formulations from high-order scheme and accomplishes the compatibility between the mesh movement and numerical fluxes. The main new features of the solver are the introduction of a new set of jump and balance conditions. The jump condition provides a high-accurate formulation linking the surface pressure of each cell to its nodal velocity, while the balance condition ensures nodal conservation and stabilizes the velocity field without losing accuracy. More intriguing is that our nodal solver can be regarded as a natural high-order extension of the HLLC and the HLLC-2D [41] solvers. The comparison between these solvers better demonstrates our innovative approach in addressing the difficulties encountered in constructing 2D high-order Lagrangian schemes. A variety of numerical experiments are carried out to illustrate the accuracy and robustness of the algorithm.