Group Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 16 February
Bass and Kulkarni proved that any pair of free uniform lattices in the automorphism group of a tree have conjugates that both lie inside a third uniform lattice (which is not necessarily free). We show that this does not generalise to trees with fins. The construction of our counter-example involves working with a certain generalisation of the universal groups of Burger and Mozes.
Analysis of PDEs
Kernel estimates and weak (1,1)-boundedness of pseudo-differential operators on compact Lie groups
Given a compact Lie group $G$ and its unitary dual $\widehat{G}$, we establish the weak (1,1) continuity for pseudo-differential operators in the global Hörmander classes of order $-n(1-\rho)/2$ on $G\times \widehat{G}$. Our approach consists of proving suitable estimates for the kernel of such operators. Furthermore, we use these kernel estimates to give an alternative proof for the $H^1(G)$-$L^1(G)$-continuity of these classes now allowing the full range $0\leq\delta\leq\rho\leq1, \;\rho\neq0,\;\delta\neq1$. The conditions for the operators are formulated using the Hörmander classes $S^m_{\rho,\delta}(G):=S^m_{\rho,\delta}(G\times \widehat{G})$ of symbols in the non-commutative phase space $G\times \widehat{G}$, which are extensions of the well-known $(\rho,\delta)$-classes in the Euclidean space. Our results are formulated in the complete range $0\leq \delta\leq \rho\leq 1,$ $\rho\neq0,\;$$\delta\neq 1$. As an application of this boundedness result we provide end-point a-priori $L^1$-estimates for the sub-Laplacian $\mathcal{L}_{sub}=X^2+Y^2,$ and for the heat type operator $T=Z-X^2-Y^2$ on $SU(2)\cong \mathbb{S}^3$ that cannot be obtained by application of the standard pseudo-differential calculus due to Hörmander. More precisely, we prove that if one considers the subelliptic problem, \begin{equation}\label{IVP:abstract} \begin{cases}Tu=f ,& \text{ } \\u,f\in \mathscr{D}'(SU(2)):=(C^\infty(SU(2)))', & \text{ } \end{cases} \end{equation} then, for $f\in W^{1,-\frac{1}{4}}(SU(2)),$ one has that $u\in L^{1,\infty}(SU(2)).$
Read the full abstract
Optimization and Control
Second-order conditions for bang-bang control of elliptic equations in arbitrary dimensions
We consider an optimal control problem governed by a semilinear PDE in cases where the optimal control is of bang-bang type. By utilizing the theory of Bessel potential space, we characterize quadratic growth of the objective via a second-order optimality condition. In contrast to previous contributions, our method of proof works in arbitrary spatial dimensions.
Read the full abstract
Optimization and Control
Interwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
We propose a novel methodology for solving a two-stage adjustable robust convex optimisation problem with a general (proximable) convex objective function and constraints defined by sum-of-squares (SOS) convex polynomials. These problems appear in many decision-making applications. However, they are challenging to solve and typically cannot be reformulated as numerically tractable convex optimisation models, such as conic linear programs, that can be solved directly using existing software. We show that the robust problem admits an equivalent representation as a convex composite unconstrained optimisation model that preserves the same objective values, under quadratic decision rules on the adjustable decision variables. Building on this reformulation, we develop a tailored first-order primal-dual proximal splitting method. By leveraging semidefinite programming (SDP) techniques as well as tools from convex analysis and real algebraic geometry, we establish its theoretical properties, including computable SDP-based formulas for projections onto closed convex sets, specified by SOS-convex polynomial inequalities. Numerical experiments on a two-stage lot-sizing model with both linear as well as SOS-convex polynomial storage costs under demand uncertainty demonstrate the effectiveness and applicability of the proposed approach. Our approach enables the incorporation of SDP techniques into a primal-dual proximal splitting framework, thereby broadening the class of problems to which these methods can be effectively applied.
Read the full abstract
Classical Analysis and ODEs
Kakeya conjecture and High-Rank Lattice von Neumann algebras
If the non-commutative L p space of SLn(Z) has the completely bounded approximation property for some non-trivial value of p, then some form of the Kakeya conjecture holds in dimension d, for all d $\le$ n+1 2 . The proof relies on a spherical analogue of the following question in Euclidean harmonic analysis, that we raise and investigate: does a radially symmetric Fourier multiplier that is bounded on Lp(R d ) for some p __ = 2 necessarily have a continuous symbol? We leave the question open, but we prove that the primitive of such function is smooth in the sense of Zygmund, give some necessary conditions for Lp-boundedness in terms of Besov spaces and Littlewood-Paley decomposition for the symbol, and observe that a negative answer implies some form of the Kakeya conjecture in dimension d. We then provide spherical forms of these results, which, when combined with a refinement of Lafforgue's rank 0 reduction, leads to the claimed result.
Read the full abstract
Optimization and Control
Extragradient methods for mean field games of controls and mean field type FBSDEs
In this paper we present a numerical scheme to solve coupled mean field forward-backward stochastic differential equations driven by monotone vector fields. This is based on an adaptation of so called extragradient methods by characterizing solutions as zeros of monotone variational inequalities in a Hilbert space. We first introduce the procedure in the context of mean field games of controls and highlight its connection to the fictitious play. Under sufficiently strong monotonicity assumptions, we demonstrate that the sequence of approximate solutions converges exponentially fast. Then we extend the method and main results to general forward backward systems of stochastic differential equations that do not necessarily stem from optimal control.
Read the full abstract
Complex Variables
Borel exceptional values in several complex variables and their applications to shared values of shifts and difference operators
In this paper, we investigate shared value problems for shifts and higher-order difference operators of meromorphic and entire functions in several complex variables. Using Nevanlinna theory in $\mathbb{C}^n$, we obtain new uniqueness theorems when functions share values counting or ignoring multiplicities, extending several classical one-variable results to higher dimensions. A key contribution of this work appears in Section 2, where we establish fundamental results on Borel exceptional values in several complex variables. These propositions provide the main tools for proving our principal theorems. As applications, we derive conditions ensuring that a transcendental entire function satisfies $\Delta_c^{k} \equiv d\hspace{.05cc} f$ and we study meromorphic solutions of certain partial differential-difference equations, obtaining growth estimates and structural descriptions of entire solutions. To the best of our knowledge, this is the first systematic study of such shared value problems for higher-order difference operators in several complex variables.
Read the full abstract
Probability
Finitary coding and Gaussian concentration for random fields
We study Gaussian concentration inequalities for random fields obtained as finitary codings of i.i.d.\ fields, linking concentration properties to coding structure. A finitary coding represents a dependent field as a shift-equivariant image of an i.i.d.\ process, where each output depends on a finite but configuration-dependent portion of the input. Gaussian concentration corresponds to uniform sub-Gaussian bounds for local observables. Our main abstract result shows that Gaussian concentration is preserved under finitary codings with finite second moment of the coding volume. The proof relies on a refinement of the bounded-differences inequality, due to Talagrand and Marton, handling configuration-dependent influences. Under an additional structural assumption, satisfied in particular by coupling-from-the-past codings, a finite first moment suffices. These moment conditions are sharp. We apply these results to Gibbs measures, Markov random fields on $\mathbb Z^d$, and a broad class of one-dimensional processes. Using recent constructions of finitary codings, notably by Spinka and collaborators, we obtain sharp necessary and sufficient conditions for Gaussian concentration in classical lattice models, including the Ising, Potts, and random-cluster models: it holds if and only if the model lies in the full uniqueness regime, extending previous results beyond strict subregimes. In one dimension, we treat processes with possibly unbounded memory. For countable-state Markov chains, we obtain equivalent characterizations in terms of geometric ergodicity, exponential return-time tails, and finitary i.i.d.\ codings with exponential tails.
Read the full abstract
Probability
Pathwise solutions of the stochastic Burgers equation driven by a multiplicative Hermite noise
We study the viscous Burgers equation on the real line perturbed by a multiplicative noise $\sigma(u)\dot{Z}_t$, where $Z$ is a Hermite process of order $q\ge1$ and Hurst index $H\in(1/2,1)$; the case $q=1$ is fractional Brownian motion and $q=2$ is the Rosenblatt process. The stochastic term is a Young integral and the equation is solved path by path. A transformation of Doss-Sussmann type reduces it to a parabolic equation with random coefficients and quadratic growth in the gradient, for which we prove a maximum principle and a gradient estimate of Bernstein type on short time windows. We obtain global existence and uniqueness, the pathwise bound $|u(t,x)|\le\|u_0\|_\infty+\|\sigma\|_\infty|Z_t|$, and a Wong-Zakai type result without correction term. All moments are finite and $\mathbb{E}\exp(\lambda\sup_x|u(t,x)|^{2/q})<\infty$ for small $\lambda$. For the Rosenblatt process with $\sigma\ge\sigma_0>0$, $\mathbb{E}\,e^{\lambda u(t,x)}$ is finite for small $\lambda$ and infinite for $\lambda\sigma_0t^H\ge\theta_H$, an explicit spectral constant, while the left tail is sub-Gaussian. We show that the temporal Hölder exponent $H$ is optimal, identify the limits of the power variations of $t\mapsto u(t,x)$, and deduce consistent estimators of $H$ and of the noise intensity from one path observed at one spatial point. For $q=2$ we relate the pathwise solution to a Skorokhod formulation through the forward/Skorokhod correction formula of Čoupek, Duncan and Pasik-Duncan.
Read the full abstract
Symplectic Geometry
Comments on Symplectic bipotentials arXiv:2410.23122
This is a reaction to the article Symplectic bipotentials, in published form [2] Harakeh M, Ban M, de Saxce G. Symplectic bipotentials. Mathematics and Mechanics of Solids. 2026;0(0) doi:10.1177/10812865251413554, and in preprint form [1] arXiv:2410.23122v1. We give evidence that most of the content of the article [2] is already covered in previous works, partially cited like [7] arXiv:0810.1419 [math.FA], or uncited, like [10] arXiv:1902.04598 [math-ph], [3] arXiv:2304.14158 [math-ph], which already introduced and studied symplectic bipotentials. These comments also apply to the conference paper version of [1] arXiv:2410.23122v1, namely to the article Harakeh, M., Ban, M., de Saxce, G. (2026). Symplectic Bipotentials for the Dynamics of Dissipative Systems with Non Associated Constitutive Laws. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2025. Lecture Notes in Computer Science, vol 16034. Springer, Cham. doi:10.1007/978-3-032-03921-7_31 .
Read the full abstract
Rings and Algebras
Weakly $\sqrt{J}U$ Rings
We introduce and study the so-called {\it weakly $\sqrt{J}U$ rings} (hereafter abbreviated as {\it $W\sqrt{J}U$ rings} for short), in which every unit is of the form $j+1$ or $j-1$ for some $j$ in $\sqrt{J(R)} : = \{x \in R : x^n \in J(R) \text{ for some } n\ge 1\}$. This class of rings non-trivially generalizes the classes of $\sqrt{J}U$, $UU$, $JU$, $WUU$ and $WJU$ rings, respectively. We investigate their basic properties showing that they are Dedekind-finite, that $M_n(R)$ is never $W\sqrt{J}U$ for $n\ge 2$, and that when $\operatorname{char}(R)>0$ it must be equal to $2^\alpha 3^\beta$ for some $\alpha, \beta \in \mathbb{N} \cup \left\{ 0 \right\}$. Moreover, for group rings $RG$, we prove that if $RG$ is $W\sqrt{J}U$, then $R$ is $W\sqrt{J}U$ and $G$ is a torsion group. In addition, when $R$ has positive characteristic and $G$ is a locally finite $p$-group, we give a complete characterization like this: $RG$ is a $W\sqrt{J}U$ ring if, and only if, either $R$ is a $\sqrt{J}U$ ring and $G$ is a $2$-group, or $R$ is a $W\sqrt{J}U$ ring with $3\in J(R)$ and $G$ is a $3$-group, or $R\cong R_1\times R_2$ with $R_1$ a $\sqrt{J}U$ ring, $R_2$ a $W\sqrt{J}U$ ring and $G$ a trivial group. Our results substantially improve on recent achievements due to Saini and Udar in Czech. Math. J. (2025).
Read the full abstract
Numerical Analysis
Advances on the recovery of (perturbed) Cauchy matrices
Given a (possibly approximate) Cauchy matrix, how can we efficiently compute its generators? Expanding on previous work by Liesen and Luce [Linear Algebra Appl. 493 (2016) 261–280], we present a general family of algorithms for Cauchy parameter recovery, together with new error estimates. We also introduce a displacement-based approximation, which leads to a new algorithm for Cauchy parameter recovery. Numerical experiments show that the algorithm based on the displacement approximation is generally more accurate than the other algorithms.
Read the full abstract
Numerical Analysis · Cross-listed from stat.ME
A Bayesian Approach to Low-Discrepancy Subset Selection
Low-discrepancy designs play a central role in quasi-Monte Carlo methods and are increasingly influential in other domains such as machine learning, robotics and computer graphics, to name a few. In recent years, one such low-discrepancy construction method called subset selection has received a lot of attention. Given a large population, one optimally selects a small low-discrepancy subset with respect to a discrepancy-based objective. Versions of this problem are known to be NP-hard. In this text, we establish, for the first time, that the subset selection problem with respect to kernel discrepancies is also NP-hard. Motivated by this intractability, we propose a Bayesian Optimization procedure for the subset selection problem utilizing the recent notion of deep embedding kernels. We demonstrate the performance of the BO algorithm to minimize discrepancy measures and note that the framework is broadly applicable any design criteria.
Read the full abstract
Combinatorics
Computations on the tautological basis of the cohomology ring of the Peterson variety
It is known that the set of square free monomials on the Chern classes of the tautological line bundles over the Peterson variety forms an additive basis of its cohomology ring. We study the expansion formula for their products. In particular, we give a square free expansion of the products multiplying degree 2 classes in terms of elementary symmetric polynomials and binomial coefficients.
Read the full abstract
Rings and Algebras
Rings whose Non-Units are a Unit Multiple of an Element from $\sqrt{\Delta(R)}$
This paper introduces and studies a new class of rings called {\it $U\sqrt{\Delta}$-rings}. A ring $R$ is $U\sqrt{\Delta}$ if every non-unit element can be written as the product of a unit and an element from $\sqrt{\Delta(R)}$, where $\sqrt{\Delta(R)}$ consists of elements some power of which lies in the special subring $\Delta(R)$. We establish certain basic properties of these rings and, concretely, prove that they are simultaneously indecomposable and Dedekind-finite. We also show that the polynomial ring $R[x]$ and the Laurent polynomial ring $R[x, x^{-1}]$ are never $U\sqrt{\Delta}$-rings, while the power series ring $R[[x]]$ inherits this property from $R$. Likewise, for left (right) Artinian rings, the conditions of being a $U\sqrt{\Delta}$-ring and a $UN$-ring are equivalent, as well as these two conditions are preserved for the full matrix ring $M_n(R)$ of size $n\geq 1$ over $R$. In addition, for a commutative ring $R$, $M_n(R)$ is a $U\sqrt{\Delta}$-ring exactly when $R$ is local. Furthermore, we characterize when a group ring $RG$ is a $U\sqrt{\Delta}$-ring showing that, for a locally solvable group $G$, this occurs precisely when $R$ is a $U\sqrt{\Delta}$-ring and $G$ is a locally finite $p$-group for some prime $p \in J(R)$.
Read the full abstract
Representation Theory
Quasi-reductive supergroups with small even parts
We describe all supergroups with the largest even supersubgroups being isomorphic to $\mathrm{GL}_2, \mathrm{SL}_2$ or $\mathrm{PSL}_2$. These results are applied to the description of centralizers of certain tori in the quasi-reductive supergroups.
Numerical Analysis
New a posteriori error estimates for full-space transmission problems
In the present work, we derive functional upper bounds for the potential error arising from finite-element boundary-element coupling formulations for a nonlinear Poisson-type transmission problem. The proposed a posteriori error estimates are independent of the precise discretization scheme and provide guaranteed upper bounds for the potential error. The computation of these upper bounds is based on the solutions of local auxiliary finite element problems on patches in the interior domain and in a strip domain along the coupling boundary. Numerical experiments illustrate the performance of the proposed error estimation strategy for a related adaptive mesh-refinement strategy.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Decoupled Continuous-Time Reinforcement Learning via Hamiltonian Flow
Many real-world control problems, ranging from finance to robotics, evolve in continuous time with non-uniform, event-driven decisions. Standard discrete-time reinforcement learning (RL), based on fixed-step Bellman updates, struggles in this setting: as time gaps shrink, the $Q$-function collapses to the value function $V$, eliminating action ranking. Existing continuous-time methods reintroduce action information via an advantage-rate function $q$. However, they enforce optimality through complicated martingale losses or orthogonality constraints, which are sensitive to the choice of test processes. These approaches entangle $V$ and $q$ into a large, complex optimization problem that is difficult to train reliably. To address these limitations, we propose a novel decoupled continuous-time actor-critic algorithm with alternating updates: $q$ is learned from diffusion generators on $V$, and $V$ is updated via a Hamiltonian-based value flow that remains informative under infinitesimal time steps, where standard max/softmax backups fail. Theoretically, we prove rigorous convergence via new probabilistic arguments, sidestepping the challenge that generator-based Hamiltonians lack Bellman-style contraction under the sup-norm. Empirically, our method outperforms prior continuous-time and leading discrete-time baselines across challenging continuous-control benchmarks and a real-world trading task, achieving 21% profit over a single quarter$-$nearly doubling the second-best method.
Read the full abstract
Number Theory
On Periods and $L$-functions for $\mathbf{GL}_4 \times \mathbf{GL}_2$
We give a new integral representation of the $\wedge^2 \otimes \mathrm{std}_2$ $L$-function of generic cusp forms on $\mathbf{GL}_4 \times \mathbf{GL}_2$ and $\mathbf{GU}_{2,2}\times \mathbf{GL}_2$. In the former case, we use it to prove a relation between its central $L$-value and the generalized Shalika period. Exploiting the theta correspondence for $(\mathbf{GL}_4,\mathbf{GL}_4)$, we further establish a relation between the central value of the $L$-function attached to the strongly tempered spherical pair $(\mathbf{GL}_4 \times \mathbf{GL}_2,\mathbf{GL}_2 \times \mathbf{GL}_2)$ and its corresponding period. In the case of cusp forms on $\mathbf{GL}_4 \times \mathbf{GL}_2$ that are unramified everywhere, our formulas give new evidence towards conjectures of Wan-Zhang and of Gan-Gross-Prasad for $\mathbf{GSpin}_6 \times \mathbf{GSpin}_3$.
Read the full abstract
Combinatorics
Touchard's identity and a detailed determination of the radius of convergence of the Catalan series
While the value of the radius of convergence of the generating series of the Catalan numbers is well-known, obtaining it solely from recurrence relations is less immediate. It is sometimes considered that no known proof establishes that the radius $R$ equals 1/4 without relying on the explicit closed formula for the Catalan numbers. In particular, it has been shown that one can obtain, at the cost of substantial technical effort and without resorting to the main Segner recursion relation or to the explicit formula for the Catalan number, the lower bound $R\geq 1/6$. In this work, we prove that Touchard's recurrence alone yields the optimal exponential upper bound $\limsup_{n\to\infty} C_n^{1/n} \le 4$, which implies $R \ge 1/4$. Combined with the classical lower estimate $\limsup_{n\to\infty} C_n^{1/n} \ge 4$, obtained from central binomial coefficients, this gives $R = 1/4$.
Read the full abstract
Analysis of PDEs
Feedback Stabilization and Tracking for Heat Equations Using Thermo-Plasmonic Nanoparticles as Actuators
We propose a feedback strategy to track prescribed heat profiles using plasmonic nanoparticles as actuators. Starting from a thermo–plasmonic Maxwell–heat model, we use a time-domain discrete effective description in which the generated heat is approximated by a superposition of heat kernels centered at particle locations with amplitudes governed by a coupled Volterra system. We recast this dynamics as a heat equation on a bounded domain with finitely many point actuators and design a tracking feedback based on pointwise evaluations of $\mathcal A^{-1}y$, where $\mathcal A=I-A_0$ and $A_0$ is the Neumann diffusion operator. Working in the natural $V'$ setting with $V=D(\mathcal A)$, we prove exponential stabilization of the tracking error via distribution-actuator theory. For non-equilibrium reference profiles, we add a constant feedforward term and a low-mode fixed-point pre-compensation on $X_N$, ensuring exact steady matching on $X_N$ and an explicit bound on the residual tail mismatch.
Read the full abstract
Algebraic Geometry
Brauer group of moduli stacks of parabolic principal bundles over a curve
We prove that the Brauer group of the moduli stack of parabolic stable principal $\text{PGL}(r,\mathbb{C})$-bundles on a curve $X$, for a generic system of weights along an arbitrary parabolic divisor, coincides with the Brauer group of the smooth locus of the corresponding coarse moduli space of parabolic stable principal $\text{PGL}(r,\mathbb{C})$-bundles. We also show that for any simple and simply connected complex linear algebraic group $G$, the analytic and algebraic Brauer groups of the moduli stack of quasi-parabolic principal $G$-bundles on $X$ vanish.
Read the full abstract
Information Theory · Cross-listed from q-fin.MF
Information-Theoretic Approach to Financial Market Modelling
The paper treats the financial market as a communication system, using four information-theoretic assumptions to derive an idealized model with only one parameter. State variables are scalar stationary diffusions. The model minimizes the surprisal of the market and the Kullback-Leibler divergence between the benchmark-neutral pricing measure and the real-world probability measure. The state variables, their sums, and the growth optimal portfolio of the stocks evolve as squared radial Ornstein-Uhlenbeck processes in respective activity times.
Read the full abstract
Algebraic Geometry
Poincaré duality in logarithmic motivic homotopy theory
By adapting arguments of Annala-Hoyois-Iwasa in the log setting, we prove Poincaré duality for smooth projective morphisms in logarithmic motivic homotopy theory. As an application, we show that the crystalline cohomology of a log compactification is independent of the choice.
Combinatorics
Multidimensional convolution matrices and perfect colorings of subspace hypergraphs applied for bent functions and related designs
The main aim of the present paper is to introduce new methods for the study of combinatorial designs related to bent functions. They are based on interpretations of convolution on finite abelian groups as multiplication by a multidimensional matrix and designs as perfect colorings of subspace hypergraphs of $\mathbb{F}_2^n$. We establish a correspondence between eigenfunctions of convolution matrices and perfect colorings of subspace hypergraphs, show that perfect colorings of subspace hypergraphs admit a characterization in terms of convolution and that two-valued eigenfunctions of subspace hypergraphs correspond to perfect colorings. As applications, we represent partial difference sets, bent and plateaued Boolean functions, spreads, and strong bent partitions of $\mathbb{F}_2^n$ as eigenfunctions of convolution matrices and as perfect colorings of subspace hypergraphs. We also find some eigenvalues of convolution matrices over $\mathbb{F}_2^n$ and $\mathbb{F}_3^n$.
Read the full abstract
Combinatorics
A combinatorial proof of Jacobi's elliptic identity via alternating permutations
We provide a unified combinatorial framework connecting Entringer numbers, Dumont-Viennot snakes, and elliptically weighted continued fractions, which gives a structural interpretation of the Jacobi elliptic identity \begin{equation} \mathrm{sn}'(u)=\mathrm{cn}(u)\,\mathrm{dn}(u), \end{equation} where $\mathrm{sn}$, $\mathrm{cn}$ and $\mathrm{dn}$ are the Jacobi elliptic functions. This framework allows the decomposition of weighted snakes corresponding to the derivative of $\mathrm{sn}$ into canonical $\mathrm{cn}$- and $\mathrm{dn}$-components, bridging classical combinatorics and elliptic function theory.
Read the full abstract
Probability
Infection models on dense dynamic random graphs
We consider Susceptible-Infected-Recovered (SIR) models on dense dynamic random graphs, in which the joint dynamics of vertices and edges are co-evolutionary, i.e., they influence each other bidirectionally. In particular, edges appear and disappear over time depending on the states of the two connected vertices, on how long they have been infected, and on the total density of susceptible and infected vertices. Our main results establish functional laws of large numbers for the densities of susceptible, infected, and recovered vertices, jointly with the underlying evolving random graphs in the graphon space. Our results are supported by simulations, which characterize the limiting size of the epidemics, i.e., the limiting density of susceptible vertices, and how the peak of the epidemics depends on the rate of the evolution of the underlying graph. The proofs of our main results rely on the careful construction of a mimicking process, obtained by approximating the two-way feedback interaction between vertex and edge dynamics with a mean-field type interaction, acting only as one-way feedback, that remains sufficiently close to the original co-evolutionary process. To treat the more general setting in which edge dynamics are affected by the proportions of susceptible and infected individuals, we introduce a methodological extension of existing techniques. We thus show that our model exhibits multiple epidemic peaks – a phenomenon observed in real-world epidemics – which can emerge in models that incorporate mutual feedback between vertex and edge dynamics.
Read the full abstract
Dynamical Systems
Propagation of regularity along unstable manifolds
Let $\varphi_t : M \to M$ be a flow on a smooth closed connected manifold $M$ that preserves and expands a foliation $F$. We establish a theorem of propagation of regularity along the leaves of $F$ for sections of vector bundles satisfying a transport equation involving the generator of a cocycle over $\varphi_t$. As a consequence, we prove a regularity result for Pollicott-Ruelle resonant states: if such state is smooth in restriction to a piece of an unstable leaf, then it is in fact smooth over the entire manifold. We also announce further applications related to joint integrability of extreme bundles of partially hyperbolic diffeomorphisms. The proofs rely on a leafwise semiclassical pseudodifferential calculus adapted to a foliated space, which may be of independent interest.
Read the full abstract
Analysis of PDEs
On the first eigenvalue of a nonlinear Schrödinger type equation
We consider an eigenvalue problem for the generalized nonlinear Schrödinger type operator with the Robin boundary condition as given below. \begin{equation*} \label{ab-Robin p-Laplace evp with potential term_intro} \left\{ \begin{split} -\Delta_p u+V(x)|u|^{p-2}u&=\lambda |u|^{p-2}u\quad &&\mathrm{in} ~\Omega,\\ |\nabla u|^{p-2}\frac{\partial u}{\partial\eta}+\beta|u|^{p-2}u&=0\quad &&\mathrm{on}~\partial\Omega, \end{split} \right. \end{equation*} where $\Delta_p u := \operatorname{div}(|\nabla u|^{p-2}\nabla u)$ is the $p$-Laplace operator, $\Omega $ is a bounded domain in $\mathbb{R}^n$ with smooth boundary, $V \in C^1(\mathbb{R}^n),$ $ \eta $ denotes the outward unit normal, and $ \beta $ is a positive real constant. We study the properties of its first eigenvalue with respect to the potential $V$, the boundary parameter $\beta$ as well as the domain. First, we establish some properties of the smallest eigenvalue $\lambda_1(V)$ with respect to the potential. We then prove the differentiability of $\lambda_1(V)$ with respect to the Robin boundary parameter $\beta$ and give an explicit formula for this derivative, which is then used to investigate some monotonicity properties of $\lambda_1(V).$ We also obtain a shape derivative formula for the smallest eigenvalue. Using these derivatives, we also study domain monotonicity properties of the first eigenvalue.
Read the full abstract
Combinatorics
Pollyanna and Polynomially ḩi}-Bounded Graph Classes
A hereditary graph class is called polynomially $\chi$-bounded if there exists a polynomial function $f$ such that $\chi(G) \le f(\omega(G))$ for every induced subgraph $G$. A class $\mathcal{C}$ is called Pollyanna if, for every $\chi$-bounded class $\mathcal{F}$, the class $\mathcal{C} \cap \mathcal{F}$ is polynomially $\chi$-bounded. In the paper by Chudnovsky et al., \emph{Reuniting $\chi$-boundedness with polynomial $\chi$-boundedness} (J.\ Combin.\ Theory Ser.\ B 176 (2026), 30–73), the authors posed twelve problems and one conjecture concerning the Pollyanna framework. In this work, we investigate several of these problems by studying the chromatic number of hereditary graph classes defined by forbidden induced subgraphs. We prove three new strong Pollyanna results. In particular, for every $t \ge 2$, every $\{\text{diamond}, \mathrm{hammer}(t)^+\}$-free graph is $t$-strongly Pollyanna. We also show that graph classes obtained by forbidding suitable combinations of bowties and dumbbells are $(2t-2)$-strongly Pollyanna. We show that the class of $\{(2,2)$-bowtie, $P_5$, $(3,3)$-dumbbell$\}$-free graphs is polynomially $\chi$-bounded. We also prove polynomial $\chi$-boundedness for diamond-free graphs in which every edge lies in at least two triangles, under additional forbidden configurations.