Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 17 March
We consider the eigenvalue problem to find the modes of an electromagnetic coaxial step index fiber. More specific, we consider a closed (meaning PEC boundary conditions) cylindrical waveguide with circular cross section $\Gamma$, wave propagation modeled by the time-harmonic Maxwell's equations with frequency $\omega$, the permeability $\mu$ and the permittivity $\epsilon$ being scalar, uniformly positive, piece-wise constant and depending only on the radial variable of the cross section. We prove that if the deviation from the homogeneous case is small, i.e., $\delta_{\epsilon,\mu}:=\|\epsilon-\epsilon_0\|_{L^\infty}+\|\mu-\mu_0\|_{L^\infty}<<1$, then the (appropriately scaled) tangential electric (magnetic) fields of the modes form Riesz bases in $\mathbf{H}_{0}(\operatorname{curl}_{\Gamma};\Gamma)$ ($\mathbf{H}(\operatorname{curl}_{\Gamma};\Gamma)$) and the natural trace space $\mathbf{H}_{0}^{-1/2}(\operatorname{curl}_{\Gamma};\Gamma)$ ($\mathbf{H}^{-1/2}(\operatorname{curl}_{\Gamma};\Gamma)$). These results hold also for complex frequencies $\omega$. In addition, if $\omega\in\mathbb{R}$, then for small enough $\delta_{\epsilon,\mu}$ all wavenumbers are located on the axes and there exist no backward modes. Key tools in the analysis are a particular reformulation of the eigenvalue problem, the perturbation theory for selfadjoint operators under a local subordinate condition and uniform properties of Bessel functions.
Statistics Theory
High-dimensional estimation with missing data: Statistical and computational limits
We consider computationally-efficient estimation of population parameters when observations are subject to missing data. In particular, we consider estimation under the realizable contamination model of missing data in which an $\epsilon$ fraction of the observations are subject to an arbitrary (and unknown) missing not at random (MNAR) mechanism. When the true data is Gaussian, we provide evidence towards statistical-computational gaps in several problems. For mean estimation in $\ell_2$ norm, we show that in order to obtain error at most $\rho$, for any constant contamination $\epsilon \in (0, 1)$, (roughly) $n \gtrsim d e^{1/\rho^2}$ samples are necessary and that there is a computationally-inefficient algorithm which achieves this error. On the other hand, we show that any computationally-efficient method within certain popular families of algorithms requires a much larger sample complexity of (roughly) $n \gtrsim d^{1/\rho^2}$ and that there exists a polynomial time algorithm based on sum-of-squares which (nearly) achieves this lower bound. For covariance estimation in relative operator norm, we show that a parallel development holds. Finally, we turn to linear regression with missing observations and show that such a gap does not persist. Indeed, in this setting we show that minimizing a simple, strongly convex empirical risk nearly achieves the information-theoretic lower bound in polynomial time.
Read the full abstract
Optimization and Control
Design of Transit Networks: Global Optimization of Continuous Approximation Models via Geometric Programming
Continuous approximation (CA) models have been widely adopted in transit network design studies due to their strong analytical tractability and high computational efficiency. However, such models are typically formulated as nonconvex optimization problems, and existing solution approaches mainly rely on iterative algorithms that exploit first-order optimality information or nonlinear programming solvers, whose solution quality lacks stability guarantees under complex demand conditions. This paper proposes a geometric programming (GP)-based CA method for transit network design, which can be efficiently solved to global optimality. Numerical experiments are conducted on both homogeneous and heterogeneous network settings to evaluate the effectiveness of the proposed approach. Comprehensive tests are performed under the combinations of six heterogeneous demand distributions, four levels of total passenger demand, and three value-of-time parameters. The results indicate that the GP approach consistently outperforms the coordinate descent method across all test cases, achieving cost reductions of approximately 1%-4%, even when the latter converges to identical solutions under different initializations. In comparison, nonlinear programming solvers, with fmincon as a representative example, are able to obtain globally optimal solutions comparable to those of the GP approach in low-demand heterogeneous networks; however, their performance becomes unstable under high-demand conditions. These findings demonstrate that GP provides an efficient and robust optimization framework for solving CA-based transit network design problems, especially in high-demand and highly heterogeneous network environments.
Read the full abstract
Differential Geometry
Curvature inequalities and rigidity for constant mean curvature and spacetime constant mean curvature surfaces
We establish curvature inequalities and rigidity results for surfaces satisfying constant mean curvature type conditions in both Riemannian and Lorentzian geometry. In the Riemannian setting, we study constant mean curvature (CMC) surfaces. Building on the Christodoulou-Yau inequality $H^2\leq 16\pi / |\Sigma|$ (with $H$ the mean curvature and $|\Sigma |$ the area) for CMC surfaces on three-dimensional manifolds with nonnegative scalar curvature, we show that the inequality holds under a weaker stability condition controlling only the constant mode of the second variation. Combined with an extrinsic curvature sign condition, equality forces the region enclosed by the surface to be Euclidean. These results extend to higher dimensions and to the hyperbolic and spherical settings. In the Lorentzian setting, we introduce a stability theory for spacetime constant mean curvature (STCMC) surfaces and prove the sharp inequality $|\vec{H}|^2\leq 16\pi / |\Sigma|$ under the dominant energy condition. We also obtain rigidity for the equality case: under suitable geometric assumptions, the maximal globally hyperbolic development of the enclosed spacelike region is isometric to a causal diamond in Minkowski spacetime. In particular, this implies positivity and rigidity for the Hawking quasi-local energy in the general spacetime setting when evaluated on stable STCMC surfaces. Finally, we analyze the known STCMC foliations in the spacelike and null settings. We show that asymptotic leaves are stable under positive mass conditions, whereas the local matter density and shear govern the instability of local foliations.
Read the full abstract
Operator Algebras
On free actions of discrete quantum groups
R. Ellis showed in 1960 that every discrete group acts freely on its Stone-Cech compactification. We extend this result to discrete quantum groups with low duals. The method of proof is different from the earlier proofs in the classical case, using the definition of freeness given by D. A. Ellwood in the setting of noncommutative geometry.
Read the full abstract
Information Theory
Nonlinear Information Theory: Characterizing Distributional Uncertainty in Communication Models with Sublinear Expectation
A mathematical framework for information-theoretic analysis is established, with a new viewpoint of describing transmitted messages and communication channels by the nonlinear expectation theory, beyond classical probability framework. Based on nonlinear expectation theory, in this paper we define several fundamental concepts, such as nonlinear information entropy, nonlinear joint entropy, and nonlinear mutual information, and establish their basic properties. By using strong law of large numbers under sublinear expectations, we propose a nonlinear source coding theorem, which shows that nonlinear entropy is a sufficient achievability threshold for the achievable coding rate of uncertain-distribution sources under the maximum error probability criterion, and determines a cluster point of the achievable coding rate under the minimum error probability criterion. We also propose a nonlinear channel coding theorem, providing explicit expressions of the upper bound and a cluster point under the maximum and minimum error probability criterion, respectively, for the achievable coding rate of uncertain-distribution channels. Additionally, we propose a nonlinear rate-distortion source coding theorem, proving that the rate-distortion function based on nonlinear mutual information is a cluster point of the lossy compression performance of uncertain-distribution sources under the minimum expected distortion criterion. Finally, we show some examples and simulations to consolidate our theoretic study.
Read the full abstract
Combinatorics
The recording tableaux in the quantum Littlewood-Richardson map, the orthogonal transpose symmetry map, and the computation of $\mathfrak{k}$-highest weight tableaux
Recently Watanabe has given an algorithm to compute a bijection, that he calls (quantum) Littlewood-Richardson (LR) map of type AII, between semi-standard Young tableaux of shape a partition with at most $2n$ parts and pairs of tableaux consisting of a symplectic tableau with shape a partition with at most $n$ parts, and a recording tableau of skew-shape given by the two previous shapes. The recording tableaux in that algorithm are shown to be equinumerous to LR-Sundaram tableaux whose injectivity is shown combinatorially while the surjectivity is concluded via representation theory of a quantum symmetric pair of type AII$_{2n-1}$. The algorithm to compute the quantum LR map provides a new branching model for the branching multiplicities from $GL_{2n}(\C)$ to $Sp_{2n}(\C)$. Here, as morally suggested by Watanabe, one provides a combinatorial proof for the surjectivity of the quantum LR map which in turn exhibits the restriction of the LR orthogonal transpose symmetry map to LR-Sundaram tableaux. The surjectivity is exhibited via the iteration of the reverse Schensted column insertion, initialized on a symplectic tableau, ruled by the slack data of a quantum recording tableau, and followed with the inverse reduction map on the bumped symplectic column in each iteration. The explicit inverse reduction map has been recently computed by the author in arXiv:2606.24840v2 for any symplectic column. The inverse of the quantum LR map is used to compute and characterize a family of $\k$- highest weight semi-standard tableaux in the recent proof of the Naito-Sagaki conjecture using the Watanabe's branching rule based on the crystal basis theory for $\imath$quantum groups of type AII$_{2n-1}$. That family of tableaux is generated by quantum recording tableaux with $1$-$0$-slack sequence and shape length $2n$ or $2n-1$ is characterized by certain linear inequalities.
Read the full abstract
Mathematical Physics
A dense focusing Ablowitz-Ladik soliton gas and its asymptotics
In this paper, we propose a soliton gas solution for the focusing Ablowitz-Ladik system. This solution is defined as the large N limit of the N-soliton solution, and arises from a continuous spectrum of poles that accumulate within two disjoint intervals on the imaginary axis. We show that this gas solution admits a Fredholm determinant representation. By further exploring its Riemann-Hilbert characterization, we are able to establish the large-space asymptotics at t = 0 and large-time asymptotics of the gas solution.
Read the full abstract
Combinatorics
Independence polynomials of graphs
In this paper, we study the independence polynomial $P_G(x)$ of a finite simple graph $G$, with emphasis on the evaluation at $x=-1$, symmetry, and its connection with the $h$-polynomial of the edge ideal of $G$. For big star graphs, we determine exactly when $P_G(-1)$ is $0, 1$, or $-1$, characterize the pseudo-Gorenstein$^*$ members, and show that there is a unique big star with symmetric independence polynomial. We also study graphs obtained from a graph $H$ by attaching leaves to selected vertices. We derive an explicit formula for the resulting independence polynomial, determine the corresponding value at $-1$, and prove that if every vertex of $H$ receives at least one leaf, then the independence polynomial is symmetric if and only if each vertex receives exactly two leaves. As an application, we obtain exact criteria for the values of $P_G(-1)$ and for the pseudo-Gorenstein$^*$ members of caterpillar graphs. For cochordal graphs, we classify all symmetric independence polynomials. Finally, for connected graphs on $n$ vertices with small independence numbers, we determine the exact range of possible values of $P_G(-1)$.
Read the full abstract
Algebraic Geometry
The cohomology of Hyperquot schemes on curves via shifted Yangians in type A
Let $V$ be a vector bundle of rank $r$ on a smooth projective complex curve $C$. The Hyperquot scheme $\text{F}^{n}\text{Quot}\,(V)$ is the moduli space of length $n$ flags of rank $r$ sub-sheaves of $V$. This article has two main results: First, we show that a certain shifted Yangian of $\mathfrak{sl}_{n+1}$ acts on $H^{*}\left(\text{F}^{n}\text{Quot}\,(V)\right)$ by correspondences. Then, we define a family of $rn$ commuting Yangian operators which yields a natural basis for $H^{*}\left(\text{F}^{n}\text{Quot}\,(V)\right)$. This generalises the work arXiv:2307.13671 of Marian and Negut, who proved the above results in the case $n=1$. The new feature, which makes this generalisation possible, is the use of so called skew-nested Quot schemes. The rank $1$ versions of these spaces, skew-nested Hilbert schemes, have been recently introduced by Sergej Monavari in the context of refined DT theory of local curves arXiv:2506.14359. In the present article, skew-nested Quot schemes appear as correspondences associated with iterated commutators of Yangian elements.
Read the full abstract
Operator Algebras
Quadratic & additive mappings on operator commuting elements in JBW*-algebras
Let $\mathfrak{A}$ and $\mathfrak{B}$ be JBW$^*$-algebras whose sets of unitaries are denoted by $\mathcal{U}(\mathfrak{A})$ and $\mathcal{U}(\mathfrak{B})$, respectively. We show that $\mathcal{U}(\mathfrak{A})$ is closed for Jordan products of operator commuting pairs inside itself. Assuming that $\mathfrak{A}$ and $\mathfrak{B}$ are JBW$^*$-algebras without direct summands of type $I_1$ or $I_2$, we prove that for each bicontinuous bijection $\Phi : \mathcal{U}(\mathfrak{A}) \rightarrow \mathcal{U}(\mathfrak{B})$ satisfying $\Phi (u \circ v) = \Phi (u)\circ \Phi (v),$ whenever $u$ and $v$ are operator commuting unitaries in $\mathfrak{A}$, there exist a linear Jordan $^*$-isomorphism $\theta: \mathfrak{A} \rightarrow \mathfrak{B}$, a real linear mapping $\beta: \mathfrak{A_{sa}}\rightarrow Z(\mathfrak{B}_{sa})$, and an invertible central element $c \in \mathfrak{B}_{sa}$ such that $$ \Phi(e^{i a}) = e^{i \beta (a)}\circ e^{i c\circ\theta(a)} = e^{i \beta(a)} \circ \theta \left( e^{i \theta^{-1}( c )\circ a}\right),$$ for all $a\in \mathfrak{A}_{sa}$. The conclusion improves when $\mathfrak{A}$ is a JBW$^*$-algebra factor not of type $I_2$.
Read the full abstract
Analysis of PDEs · Cross-listed from eess.SY
Robust multi-scale leader-follower control of large multi-agent systems
In many multi-agent systems of practical interest, such as traffic networks or crowd evacuation, control actions cannot be exerted on all agents. Instead, controllable leaders must indirectly steer uncontrolled followers through local interactions. Existing results address either leader-follower density control of simple, unperturbed multi-agent systems or robust density control of a single directly actuated population, but not their combination. We bridge this gap by deriving a coupled continuum description for leaders and followers subject to unknown bounded perturbations, and designing a macroscopic feedback law that guarantees global asymptotic convergence of the followers' density to a desired distribution. The coupled stability of the leader-follower system is analyzed via singular perturbation theory, and an explicit lower bound on the leader-to-follower mass ratio required for feasibility is derived. Numerical simulations on heterogeneous biased random walkers validate our theoretical findings.
Read the full abstract
Probability
Sharp Threshold for the Convergence of Nonstationary Averaging
We study non-stationary averaging processes, where each term of a sequence is a weighted average of previous terms, namely $a_{n+1} = \sum_{j=1}^n p_n(j) a_j$. Our results extend classical theory in two distinct regimes. First, we prove a sharp threshold for convergence in the regime where the weights are bounded between two envelopes $(\log n)^{-\alpha} \le np_n(\cdot) \leq (\log n)^{\beta}$. We show that the sequence necessarily converges when $\alpha + \beta / 2 \leq 1$, while $\alpha + \beta / 2 > 1$ the convergence can fail. Second, we study complementary fixed shape regime, when $p_n$ is obtained by a fixed limiting density on $(0,1)$. We show that under mild regularity assumptions, the sequence converges.
Read the full abstract
Complex Variables
On Fuchs's additive intersection problem for the hyperbolic metric
For hyperbolic domains $D_1,D_2\subset \{z\in\mathbb C:|z|<R\}$ and $z\in D_1\cap D_2$, we consider the ratio $$ \frac{\lambda_{D_1\cap D_2}(z)} {\lambda_{D_1}(z)+\lambda_{D_2}(z)}. $$ We solve a problem of W. H. J. Fuchs by proving that the supremum of this ratio is $+\infty$ when $D_1$ and $D_2$ range over all hyperbolic domains. If $D_1$ and $D_2$ are further assumed to be simply connected, then the supremum is $1$. We also show that the infimum of this ratio is $\frac12$ in both settings, and that the value $\frac12$ is attained if and only if $D_1=D_2$.
Read the full abstract
Probability
Relation between Hitting Times and Probabilities for Imprecise Markov Chains
In this paper, we investigate the relation between hitting times and hitting probabilities in discrete-time imprecise Markov chains (IMCs). We define lower and upper hitting times and probabilities for IMCs whose set of transition matrices $\T$ is compact, convex, and has separately specified rows. Building on reachability-based partitions of the state space, we prove two key implications: (i) finiteness of the upper expected hitting time entails the lower hitting probability equals one, and (ii) finiteness of the lower expected hitting time entails the upper hitting probability equals one. We further show an equivalence: the upper expected hitting time is finite if and only if the lower hitting probability is one. Finally, by presenting a counterexample, we show that the converse of the second implication can fail.
Read the full abstract
Group Theory
Profinite detection of free products and free factors
Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits non-trivially as a free product if and only if its profinite completion $\widehat{G}$ splits non-trivially as a free profinite product. Moreover, we are able to detect one-ended free factors of $G$ from $\widehat{G}$. As an application, we deduce that any profinitely rigid word in a finitely generated free group is universally profinitely rigid.
Read the full abstract
Combinatorics
On the Borodin–Kostochka conjecture for graphs with large maximum degree
The Borodin–Kostochka conjecture states that every graph $G$ with maximum degree $\Delta(G)\ge 9$ satisfies $\chi(G)\le \max\{\omega(G),\Delta(G)-1\}$. In this paper, we verify this conjecture for graphs with sufficiently large maximum degree. More precisely, we prove that every graph $G$ with maximum degree $\Delta \ge 5.3\times 10^6$ and clique number $\omega(G)<\Delta$ satisfies $\chi(G)\le \Delta-1$. This improves a longstanding result of Reed.
Read the full abstract
Probability
Lower and Upper Expected Hitting Times for Weighted Imprecise Markov Chains
In this paper, we extend hitting times for imprecise Markov chains to the framework of weighted imprecise Markov chains (WIMCs), in which each transition is associated with a strictly positive weight encoded by a matrix $W$. Given a convex set $\mathcal{T}$ of admissible transition matrices, we define lower and upper expected hitting times for WIMCs as the infimum and supremum of the (weighted) expected hitting times over $\mathcal{T}$, and we characterise these quantities as the unique solutions of nonlinear fixed-point equations. We show that any weighted hitting time problem can be transformed into an unweighted hitting time problem on an augmented state space, enabling the reuse of existing IMC theory and algorithms. In particular, we are able to adapt known iterative methods for the numerical computation of lower and upper hitting times for WIMCs.
Read the full abstract
Analysis of PDEs
On Stationary Gevrey Solutions to the Gravitational Boussinesq System and Applications to Uniqueness
The stationary version of the Boussinesq system with a general gravitational acceleration term is considered. Under suitable assumptions on this term, as well as on the external forces acting on each equation of this coupled system, we first establish the existence of weak solutions in the natural energy space $\dot{H}^1(\mathbb{R}^3)$. The uniqueness of these solutions is a challenging open problem. Within this framework, our first main contribution is to show that any weak $\dot{H}^1$-solution exhibits an analytic smoothing effect in the Gevrey class. Our second main contribution is to show that the Gevrey class regularity can also be used to study the uniqueness problem, provided that these solutions satisfy a suitable low-frequency control. As a by-product, we also obtain new regularity results and a new Liouville-type result for weak $\dot{H}^1$-solutions of the classical Navier–Stokes equations.
Read the full abstract
Combinatorics
A characterization of terminal planar networks by forbidden structures
The class of terminal planar networks was recently introduced from a biological perspective in relation to the visualization of phylogenetic networks, and its connection to upward planar networks has been established. We provide a Kuratowski-type theorem that characterizes terminal planar networks by a finite set of forbidden structures, defined via six families of 0/1-labeled graphs. Another characterization based on planarity of supergraphs yields linear-time algorithms for testing terminal planarity and for computing such planar drawings. We describe an application that is potentially relevant in broader, non-phylogenetic settings. We also discuss a connection of our main result to an open problem on the forbidden structures of single-source upward planar networks.
Read the full abstract
Numerical Analysis
Perturbation Analysis for Preconditioned Normal Equations in Mixed Precision
For real matrices of full column-rank, we analyze the conditioning of several types of normal equations that are preconditioned by a randomized preconditioner computed in lower precision. These include symmetrically preconditioned normal equations, half-preconditioned normal equations, seminormal equations and not-normal equations. Our perturbation bounds are realistic and informative, and suggest that the conditioning depends only mildly on the quality of the preconditioner; however, it does depend on the size of the least squares residual – even if the normal equations do not originate from a least squares problem. We illustrate that a randomized preconditioner can deliver a solution accuracy comparable to that of Matlab's mldivide command, is efficient in practice, and well-suited to GPU implementations. For the computation of the preconditioner, we propose an automatic selection of the precision, based on a fast condition number estimation in lower precision.
Read the full abstract
Algebraic Geometry · Cross-listed from hep-th
Relating Hodge Atoms, Spectral Triples, and BPS Flows
We compare algebraic and analytic pictures relevant to the study of birational invariants. Motivated by recent advances in the development of non-commutative Hodge structures, we examine their implication for quiver gauge field theory on the cubic fourfold. By interpreting the semiorthogonal property as a dynamical selection rule, we conjecture that the K3 Hodge atom of the cubic fourfold represents a protected quantum phase whose spectra remain invariant under non-perturbative tunneling processes.
Read the full abstract
Analysis of PDEs
Multiplicity and asymptotics of positive solutions for critical-concave Kirchhoff equation
This paper focuses on the critical Kirchhoff equation with concave perturbation \begin{align*} \begin{cases} \displaystyle -\Big(a+b\int_\Omega|\nabla u|^2dx\Big)\Delta u=|u|^4u+\lambda|u|^{q-2}u\ \ &\mbox{in}\ \Omega, \displaystyle u=0\ \ &\mbox{on}\ \partial\Omega, \end{cases} \end{align*} where $\Omega$ is a smooth bounded domain in $\mathbb{R}^3$, $a,b,\lambda>0$ and $1<q<2$. By the constrained minimization methods, the mountain pass theorem and the concentration-compactness principle, we verify the multiplicity of positive solutions for $\lambda>0$ small enough. Moreover, we analyse the asymptotic behaviour of positive solutions as $b\rightarrow0$ and $\lambda\rightarrow0$, respectively. This work is a counterpart of [A. Ambrosetti et al., J.~Funct.~Anal. 1994] for the Kirchhoff equation. It is noteworthy that we don't require that $b>0$ is small enough here, which is imposed in the existing literatures to make refined estimates for the mountain pass level.
Read the full abstract
Information Theory · Cross-listed from eess.SP
Optimal Radio Resource Management for ISAC Under Imperfect Information: A Resource Economy-Driven Perspective
This work investigates the radio resource management (RRM) design for downlink integrated sensing and communications (ISAC) systems, jointly optimizing timeslot allocation, beam adaptation, functionality selection, and user-target pairing, with the goal of economizing resource consumption under imperfect information. Timeslot allocation assigns a number of discrete channel uses to targets and users, while beam adaptation selects transmit and receive beams with suitable directions, power levels, and beamwidths. Functionality selection determines whether each timeslot is used for sensing, communication, or their simultaneous operation, while user-target pairing specifies which users and targets are jointly served within the same timeslot. To ensure reliable operation, information imperfections arising from motion, quantization, feedback delays, and hardware limitations are considered. Resource economization is achieved by minimizing energy and time consumption through a multi-objective function, with strict prioritization of time savings. The resulting RRM problem is formulated as a semi-infinite, nonconvex mixed-integer nonlinear program (MINLP). Given the lack of generic methods for solving such problems, we propose a tailor-made approach that exploits the underlying structure of the problem to uncover hidden convexities. This enables an exact reformulation as a mixed-integer semidefinite program (MISDP), which can be solved to global optimality. Simulations reveal important interdependencies among the considered RRM components and show that the proposed approach achieves substantial performance improvements over baseline schemes, with gains up to 88%.
Read the full abstract
Dynamical Systems
A Jacobi Field Approach to Splitting Detection in Schrödinger Bridge
We study the problem of detecting the onset of path splitting in stochastic interpolation between probability distributions. This question is especially subtle when the target distribution is nonconvex or supported on disconnected components, where interpolating trajectories may separate into distinct branches. Motivated by the stochastic control and Schrödinger bridge viewpoint, we propose a Jacobi field based indicator for identifying candidate splitting times and locations. Our approach is based on the Jacobi field associated with the linearization of an induced interpolating flow. Starting from a stochastic interpolation ansatz, we construct an Eulerian velocity field by conditional averaging and derive its spatial Jacobian in terms of the local posterior geometry of the target sample cloud. This allows us to interpret the symmetric part of the Jacobian as a local strain tensor and to use its spectral structure to quantify the amplification of infinitesimal perturbations along reference trajectories. Numerical experiments on non-convex and disconnected target distributions show that the proposed indicator consistently localizes the emergence of branching regions and captures the temporal development of splitting. These results suggest that Jacobi field analysis provides a natural mathematical framework for studying local instability and splitting phenomena in stochastic interpolation.
Read the full abstract
Combinatorics
Blow-up structure of graphs excluding a tree or an apex-tree as a minor
We prove blow-up structure theorems for graphs excluding a tree or an apex-tree as a minor. First, we show that for every $t$-vertex tree $T$ with $t\geq 3$ and radius $h$, and every graph $G$ excluding $T$ as a minor, there exists a graph $H$ with pathwidth at most $2h-1$ such that $G$ is contained in $H\boxtimes K_{t-2}$ as a subgraph. This improves on a recent theorem of Dujmović, Hickingbotham, Joret, Micek, Morin, and Wood (2024), who proved the same result but with a larger bound on the order of the complete graph in the product. Second, we show that for every $t$-vertex tree $T$ with $t\geq 2$, radius $h$ and maximum degree $d$, and every graph $G$ excluding the apex-tree $T^+$ as a minor, where $T^+$ is the tree obtained by adding a universal vertex to $T$, there exists a graph $H$ with treewidth at most $4h-1$ such that $G$ is contained in $H\boxtimes K_{2(t-1)d}$. The bound on the treewidth of $H$ is best possible up to a factor $2$, and improves on a $2^{h+2}-4$ bound that follows from a recent result of Dujmović, Hickingbotham, Hodor, Joret, La, Micek, Morin, Rambaud, and Wood (2024).
Read the full abstract
Combinatorics
Connectivity notions on compatible digraphs in equational classes
A digraph $\mathbb G$ is called weakly connected, strongly connected, and extremely connected if any two vertices of $\mathbb G$ are connected respectively by an oriented, a directed, and a symmetric path in $\mathbb G$. We investigate the algebraic properties of digraphs that force some of these connectivity notions to coincide. We prove that for digraphs with a Hobby-McKenzie polymorphism, the strong and the extreme components coincide. Conversely, if the strong and the extreme components of any compatible digraph in an equational class of algebras coincide, then the class must have a Hobby-McKenzie term. As a consequence, we obtain that an equational class $\mathcal V$ is $n$-permutable for some $n$ if and only if the weak components of any compatible reflexive digraph in $\mathcal V$ are extremely connected.
Read the full abstract
Number Theory
An involutive perspective on Eisenstein's proof of quadratic reciprocity
We revisit Eisenstein's geometric proof of quadratic reciprocity and make explicit the involutive symmetry underlying Eisenstein's lattice-point argument. Building on Gauss's lemma, we interpret the Legendre symbols as counts of lattice points in a finite rectangle and construct a simple fixed-point-free involution corresponding to the central symmetry of the rectangle, which exchanges points above and below the line $qx=py$. This reformulation highlights the involutive symmetry and places the classical proof in the spirit of Zagier-type involutive arguments. The approach shows how the reciprocity law emerges from an elementary combinatorial pairing principle.
Read the full abstract
Combinatorics
Super Major Index Cyclic Sieving
Recently, Armon and Swanson introduced signed standard tableaux and a corresponding super major index that refines the classical major index. In this paper, we prove that signed standard tableaux of rectangular shape exhibit a cyclic sieving phenomenon (CSP) under the combined action of Schützenberger promotion and cyclic shift of the signs, with the sieving polynomial given by the super major index generating function. This extends Rhoades's celebrated CSP for standard Young tableaux. Furthermore, by considering Cartesian products of tableaux, we generalize this result to arbitrary non-rectangular shapes.
Read the full abstract
Dynamical Systems
Periodic points and residual finiteness of automorphism groups of subshifts
If totally periodic points are dense in a subshift $X$, its automorphism group is residually finite. We show a weak converse: if periodic points are not dense in a subshift $X$, then the automorphism group of $X \times Y$ is not residually finite for full shifts $Y$ (and sufficiently full-shift-like subshifts). On the other hand, we show that the automorphism group of a block gluing $\Z^2$-subshift is always locally embeddable in finite groups (thus sofic). Hochman recently constructed a strongly irreducible $\Z^2$-subshift with no periodic points. Combining our result with this example gives a strongly irreducible $\Z^2$-subshift whose automorphism group is not residually finite, which solves a question of Coornaert and Ceccherini-Silberstein.