Peer Revenue Returns subject to peer review

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 24 March

Optimization and Control

A variational geometric framework for multi-objective level set topology optimization

This paper proposes a variational framework for multi-objective level set topology optimization. The approach interprets the level set function as a generalized coordinate of a fictitious material and derives its equation of motion from Hamilton's principle, resulting in a damped wave equation governing the optimization process. The objective functionals are combined using a weighted sum formulation. An analysis of the underlying system structure reveals a geometric interpretation of the problem, shifting the perspective beyond conventional approaches based on purely discrete approximations of the Pareto frontier. Under suitable regularity assumptions, the set of stationary solutions forms a structured subset in objective space, in which the Pareto frontier is locally embedded and the weighting factors act as intrinsic coordinates. This perspective motivates the introduction of a dynamic evolution of the weights, leading to a coupled dynamical system for the level set function and the weighting parameters that enables adaptive exploration of the objective landscape. Numerical results demonstrate that the proposed framework provides a stable and uniform approximation of the Pareto frontier and scales to higher-dimensional objective spaces.
Read the full abstract

Analysis of PDEs · Cross-listed from cs.LG

Double Coupling Architecture and Training Method for Optimization Problems of Differential Algebraic Equations with Parameters

Simulation and modeling are essential in product development, integrated into the design and manufacturing process to enhance efficiency and quality. They are typically represented as complex nonlinear differential algebraic equations. The growing diversity of product requirements demands multi-task optimization, a key challenge in simulation modeling research. A dual physics-informed neural network architecture has been proposed to decouple constraints and objective functions in parametric differential algebraic equation optimization problems. Theoretical analysis shows that introducing a relaxation variable with a global error bound ensures solution equivalence between the network and optimization problem. A genetic algorithm-enhanced training framework for physics-informed neural networks improves training precision and efficiency, avoiding redundant solving of differential algebraic equations. This approach enables generalization for multi-task objectives with a single, training maintaining real-time responsiveness to product requirements.
Read the full abstract

All authors Wenqiang Yang, Wenyuan Wu, Yong Feng, Changbo Chen

Statistics Theory

Efficient partially replicated block designs with each replication number one or two

We investigate block designs, under the A- and MV-criteria, when each treatment can have only one or two replications due to resource constraints, as can happen, for example, in early generation varietal trials. While these are commonly known as partially replicated designs, a key new feature of the present work is that no restriction about a constant block size is imposed on the subdesign consisting of the twice replicated treatments. This makes the derivation more challenging but allows us to entertain a wider class of competing designs and hence increases the flexibility of the results. Considering all treatments as equally important, design-independent, sharp lower bounds on the A- and MV-criteria are derived, so as to find highly efficient designs over this wider class. The roles of (a) linked block designs, (b) designs in an online catalog designtheory.org, and (c) partially balanced incomplete block designs, or duals thereof, as adapted to our setup, are explored at length. Illustrative examples are presented.
Read the full abstract

Quantum Algebra

Cartier integration of infinitesimal 2-braidings via 2-holonomy of the CMKZ 2-connection, II: The pentagonator

This is a continuation of the previous paper (arXiv:2508.01944) in this series. We recontextualise Cirio and Martins' work to motivate our fundamental conjecture that the Drinfeld-Kohno (Lie) 2-algebra has trivial cohomology. It is then shown that this conjecture implies the following: given a coherent totally symmetric infinitesimal 2-braiding $t$, every modification endomorphic on the zero transformation vanishes if it is made up of the four-term relationators and whiskerings by $t$. The power of such an implication is that, in our context, one need only construct the data of a braided monoidal 2-category and it will automatically satisfy the axioms. We thus conclude by constructing the pentagonator via Cirio and Martins' Knizhnik-Zamolodchikov 2-connection over the configuration space of 4 distinguishable particles on the complex line, $Y_4$. In particular, we make use of Bordemann, Rivezzi and Weigel's pentagon in $Y_4$.
Read the full abstract

Combinatorics

The family of all local maximum independent sets is an augmentoid

It was proved in (Levit and Mandrescu, 2022) that both $(V(G), Crown(G))$ and $(V(G), CritIndep(G))$ are augmentoids, established partial augmentation phenomena for the family $\Psi(G)$ of local maximum independent sets, and asked in Problem~5.5 to characterize the graphs whose family $\Psi(G)$ is an augmentoid. We prove that the answer is positive in full generality: for every finite simple graph $G$, the set system $(V(G),\Psi(G))$ is an augmentoid. The proof is constructive. If $S,T\in\Psi(G)$, then the explicit choice \[ A=S \setminus N[T],\qquad B=T \setminus N[S] \] satisfies \[ T\cup A\in\Psi(G),\qquad S\cup B\in\Psi(G),\qquad |T\cup A|=|S\cup B|. \] As a structural consequence, for every fixed $S\in\Psi(G)$ the map $T\mapsto S\cup T$ induces a canonical bijection from $\Psi(G-N[S])$ onto the members of $\Psi(G)$ containing $S$, and \[ \alpha(G)=|S|+\alpha(G-N[S]). \] This decomposition also yields explicit formulas for the intersection and the union of all the maximum independent sets extending $S$, together with counting formulas for the local maximum and maximum independent sets containing $S$. We also add a short visual guide to the framework $CritIndep(G) \subseteq Crown(G)\subseteq Psi(G)$ and end with several natural follow-up problems suggested by the theorem.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CG

Simple but not Simpler: A Surface-Sliding Method for Finding the Minimum Distance between Two Ellipsoids

We propose a novel iterative process to establish the minimum separation between two ellipsoids. The method maintains one point on each surface and updates their locations in the theta-phi parametric space. The tension along the connecting segment between the two surface points serves as the guidance for the sliding direction, and the distance between them decreases gradually. The minimum distance is established when the connecting segment becomes perpendicular to the ellipsoid surfaces, at which point the net effect of the segment tension disappears and the surface points no longer move. Demonstration examples are carefully designed, and excellent numerical performance is observed, including accuracy, consistency, stability, and robustness. Furthermore, compared to other existing techniques, this surface-sliding approach has several attractive features, such as clear geometric representation, concise formulation, a simple algorithm, and the potential to be extended straightforwardly to other situations. This method is expected to be useful for future studies in computer graphics, engineering design, material modeling, and scientific simulations.
Read the full abstract

General Mathematics

Limit Values of Character Sums in Frobenius Formula of Three Permutations

We study the asymptotic behaviour of the character summation part of the Frobenius formula for three conjugacy classes of the symmetric groups. When two conjugacy classes contain fixed points of order $\sim H_i\sqrt{n}$ for $i=1,2$ and all other cycles are long, the summation converges uniformly to $2e^{-H_1H_2}$; the exponential factor coincides with the non-collision probability of the birthday paradox. When short cycles are rare in all three classes, character sum tends to $2$.
Read the full abstract

Algebraic Geometry

Picard rank jumps for families of K3 surfaces in positive characteristic

Let X/C be a non iso-trivial family of K3 surfaces over a curve C defined over characteristic p > 2 field. We show that if X avoids a necessary and structural obstruction coming from Frobenius, and satisfies a big monodromy condition, then there are infinitely may geometric fibers that have larger Picard rank than the geometric generic fiber.
Read the full abstract

Probability

Random perturbations of systems with periodic impulse effects

The principal aim of the present work is to explore limit theorems for small random perturbations of periodically kicked dynamical systems, in the limit of vanishing noise intensity. Recasting our system, which is described heuristically by an ordinary differential equation forced by a periodic train of delta spikes, in terms of an impulsive system with resetting, we consider small state-dependent Brownian perturbations of this system and explore the zero noise limit on finite, but arbitrary, time horizons. For the resulting nonlinear stochastic system with impulse effects, we prove convergence to the underlying deterministic nonlinear impulsive system as the noise goes to zero. More importantly, we prove convergence of the rescaled fluctuation process about the deterministic limit, in a strong pathwise sense on finite time intervals, to a limiting fluctuation process governed by a linear time-dependent stochastic differential equation in between impulses and a linear time-dependent resetting map at impulses. In each of these cases, we are able to obtain rigorous estimates on the remainders. Our results thus provide quantitative tools to accurately and efficiently approximate small random fluctuations of the original nonlinear stochastic impulsive system about the deterministic limit in terms of linear, albeit time-inhomogeneous, surrogates. The results are illustrated numerically for two different examples: a periodically kicked nonlinear pendulum with state-dependent kick sizes and a FitzHugh-Nagumo system subject to periodic kicks.
Read the full abstract

Statistics Theory

Fixed-level calibration of the Cauchy combination test

The Cauchy combination test (CCT) is widely used because it yields a closed-form combined $p$-value and is known to be asymptotically valid as the nominal level $\alpha\downarrow0$ under broad dependence structures. We study a different asymptotic question: whether the usual Cauchy cutoff remains accurate at an ordinary fixed level when the number $K$ of combined $p$-values grows under dependence. Under a canonical one-factor equicorrelated Gaussian copula model, we show that the raw CCT is generally not asymptotically exact at fixed $\alpha$. With fixed positive correlation, the statistic converges to a random latent-factor limit, so there is no universal fixed-level reference law. When the common correlation $\rho_K$ weakens with $K$, fixed-level behaviour is governed by the boundary-layer scale $s_K=\sqrt{\rho_K}(\log K)^{3/2}$, and the raw CCT is asymptotically exact if and only if $\rho_K(\log K)^3\to0$. Because the size distortion arises entirely from the reference law and not from the statistic, it can be corrected without modifying the test statistic itself. We propose the boundary-layer calibrated CCT (BL-CCT), which replaces the standard Cauchy reference by a one-parameter Gaussian-smoothed Cauchy family. Unlike recent variants that modify the test statistic, BL-CCT leaves the statistic unchanged and corrects only the reference law. BL-CCT is asymptotically exact under the weaker condition $\rho_K\log K\to0$ and provides a useful finite-$K$ approximation on bounded boundary layers. We also conduct several power analyses: although BL-CCT only raises the cutoff, it incurs no first-order power loss relative to the raw CCT on the exactness scale, under local dense, sparse, and dense Gaussian alternatives. Numerical experiments support the calibration theory.
Read the full abstract

Probability

Anti-concentration of polynomials: $L^{p}$ balls and symmetric measures

We begin with the observation, based on previous results, that dimension-free lower bounds on the variance of a polynomial under a log-concave measure yield dimension-free small-ball and Fourier decay estimates. Motivated by this, we establish variance bounds for polynomials on log-concave random vectors beyond the classical setting of product measures. First, we consider the family of uniform measures on the $n$-dimensional isotropic $L^{p}$ balls. We show that for a degree-$d$ homogeneous polynomial $f=\sum_{I}a_{I}x^{I}$, with $\sum_{I}a_{I}^{2}=1$, the only obstruction to a dimension-free lower bound on its variance occurs when $p=d$ is an even integer and the coefficients of $f$ are close to those of $\frac{1}{\sqrt{n}}\left\Vert x\right\Vert _{p}^{p}$. Second, we consider general isotropic log-concave measures that are invariant under coordinate permutations and reflections, and determine the minimal variance for quadratic and cubic polynomials. These variance bounds lead to new dimension-free anti-concentration results in both settings, addressing a natural extension of a question posed by Carbery and Wright.
Read the full abstract

Information Theory

Energy Detection for Cognitive Radio with Distributional Uncertainty and Signal Variety under Nonlinear Expectation Theory

Classical energy detection (ED) methods for cognitive radio (CR) have addressed noise uncertainty as deviations in noise power and signal uncertainty as variability in signal characteristics, which use probabilistic methods and assume fixed probability distributions for both. In practical scenarios, due to the uncertainty in probability models and the significant variation of primary signals encountered by receivers across different radio technologies, wireless environments exhibit not only distributional uncertainty but also substantial signal variety. In this paper, we develop a generalized formulation of energy detection based on nonlinear expectation theory, where both the signal and noise distributions are uncertain. We utilize the $G$-normal distribution to characterize channel noise. Moreover, to capture practical signal variety, the absolute values of transmitted signal random variables are assumed to lie within a bounded range $[\underline{\sigma}_X,\overline{\sigma}_X]$. The worst-case detection performance is then characterized by a double supremum, meaning over all admissible distributions and all possible signal realizations. We derive estimations for the minimum and the maximum detection error probabilities, and demonstrate the validity of the results through numerical simulations. The proposed model generalizes the classical theoretical analysis of energy detection and offers a potential theoretical foundation for robust detection and information-theoretic analysis under distributional uncertainty.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Universal Formula Families for Safe Stabilization of Single-Input Nonlinear Systems

We develop an optimization-free framework for safe stabilization of single-input control-affine nonlinear systems with a given control Lyapunov function (CLF) and a given control barrier function (CBF), where the desired equilibrium lies in the interior of the safe set. An explicit compatibility condition is derived that is necessary and sufficient for the pointwise simultaneous satisfaction of the CLF and CBF inequalities. When this condition holds, two closed-form continuous state-feedback laws are constructed from the Lie-derivative data of the CLF and CBF via standard universal stabilizer formulas, yielding asymptotic stabilization of the origin and forward invariance of the interior of the safe set, without online quadratic programming. The two laws belong to broader families parametrized by a free nondecreasing function, providing additional design flexibility. When the compatibility condition fails, a safety-prioritizing modification preserves forward invariance and drives the state toward the safe-set boundary until a compatible region is reached, whereupon continuity at the origin and asymptotic stabilization are recovered. The framework produces families of explicit constructive alternatives to CLF-CBF quadratic programming for scalar-input nonlinear systems.
Read the full abstract

Probability

A cohesive account on the ergodic behaviours and scaling limits of Random Walks in Cooling Random Environments

Transport in disordered media is a central theme in probability and statistical physics, where randomness in the underlying medium produces phenomena such as localization, anomalous scaling, and slow relaxation. A paradigmatic model for transport in disordered media is that of Random Walks in Random Environments (RWRE), which has been extensively studied since the 1970's and is by now well understood in one dimension. More recently, several works have explored perturbations of models of transport in disordered media aimed at interpolating between static disorder and fully homogenized dynamics. Random walks in cooling random environments (RWCRE), introduced in this context, constitute a key example: the environment is dynamically resampled at prescribed times and kept fixed in between, giving rise to a delicate “quasi-ergodic” structure in time allowing to interpolate between homogeneous random walks and classical RWRE. The purpose of this paper is twofold. A first goal is to offer an original survey on the main results for RWCRE in 1d: recurrence criteria, law of large numbers, large deviations, and fluctuation phenomena across different resampling regimes. Those results have been derived in a series of recent works and are complemented here with a number of new statements aiming at presenting a unified phenomenological picture. As a second goal, we try to extract a coherent conceptual picture that highlights structural mechanisms – such as ergodic limits, persistence under perturbations and replacement principles – that extend beyond the specific setting of RWCRE and are relevant for a broader class of disordered systems that can be perturbed by introducing independent resetting in the same fashion.
Read the full abstract

Monday 23 March

General Mathematics

Solution of variable order fractional differential equations using Homotopy Analysis Method

In the present article an endeavor is made to solve the variable order fractional diffusion equations using a powerful method viz., Homotopy Analysis method. It is demonstrated how the method can be used while solving approximately two types of variable order fractional diffusion equations having physical importance. Numerical simulation results show that the method is reliable and effective for solving fractional order diffusion equations even when the order of the derivative is varying with respect to space or time or both or it is dependent upon some other parameters.
Read the full abstract

Analysis of PDEs

Inverse Obstacle Scattering from Multi-Frequency Near-Field Backscattering Data

This paper addresses the inverse obstacle scattering problem of simultaneously reconstructing the obstacle geometry and boundary conditions from multi-frequency near-field backscattering data. We first establish rigorous high-frequency asymptotic expansions for the scattered near-field, leveraging pseudo-differential operators (PDOs) to characterize the interaction between wavefront propagation and obstacle boundaries, where the principal symbol of the PDO governs the leading-order behavior of the scattering field. Based on these asymptotic results, we prove a global uniqueness theorem for the simultaneous recovery of the obstacle shape and impedance boundary condition under convexity assumptions. Furthermore, we develop a three-stage numerical reconstruction framework: (1) qualitative shape reconstruction via the direct sampling method; (2) quantitative boundary refinement via shape optimization; and (3) decoupled reconstruction of the boundary condition. A highlight of this algorithm is that all the three steps avoid computing the direct problem. Numerical experiments are presented to verify the robustness and efficiency of the proposed algorithm.
Read the full abstract

Numerical Analysis · Cross-listed from physics.geo-ph

2.5-D Electrical Resistivity Forward Modelling with Undulating Topography using a Modified Half-Space Analytical Solution

Field measurements for direct current (DC) resistivity imaging, used for subsurface profiling, are frequently conducted over undulating terrain. Accurately incorporating such topographic variations in its forward modelling is essential for reliable inversion and interpretation. Singularity removal techniques provide a computationally efficient framework by analytically representing the singular component of the electric potential. Existing secondary potential formulations use the analytical solution for a flat homogeneous half space, but this assumption is realistic only when the source lies on a locally smooth, flat planar surface. In practice, natural topography often contains sharp corners or regions of high curvature, and additional slope discontinuities arise from linear finite element discretization. These conditions invalidate the flat-surface analytical primary field and lead to substantial modelling errors. These errors originate from a fundamental geometric mismatch between the flat half-space analytical primary field and the true solid angle subtended by the topography at the source. This study presents an improved singularity removal strategy for 2.5-D forward modelling by deriving a new analytical primary potential for a V-shaped wedge. The formulation remains valid for sharply varying surfaces and accurately captures the singular behaviour without requiring geometric smoothing or excessive mesh refinement. By embedding the correct geometric singularity into the primary field, the proposed formulation remains consistent with both the discretized surface geometry and the physical boundary conditions. Numerical experiments on flat, V-shaped trench, and sinusoidal hill-valley models reveal that the proposed method consistently achieves errors below 0.1 per cent, even when using coarse linear finite element meshes.
Read the full abstract

All authors Naveen K., Michael C. Koch, Kazunori Fujisawa, Arindam Dey, Sreedeep S

Mathematical Physics

Borel Summability of the Spatial Gradient Expansion in Linear Kinetic Theory

The passage from kinetic theory to hydrodynamics proceeds through gradient expansions whose large-order behavior depends on the model and on whether the gradients are temporal or spatial. Known examples of divergent temporal gradient expansions include those arising in Bjorken flow in Müller-Israel-Stewart theory, where positive-axis Borel singularities obstruct ordinary Borel summation and require a transseries completion. By contrast, some spatial gradient expansions in holographic theories and relativistic kinetic theory converge within a finite radius. We show that the spatial Chapman-Enskog expansion of the linear one-dimensional BGK equation realizes a third possibility: its coefficients can be obtained in closed form at all orders, and the resulting series is factorially divergent yet Borel summable along the positive axis. The unambiguous Borel sum reconstructs the hydrodynamic dispersion branch up to its merger with the essential spectrum and provides its analytic continuation beyond that point. We trace the divergence of the spatial expansion to the unbounded velocity support of the Maxwellian equilibrium: replacing it with a compactly supported equilibrium removes the factorial growth and gives the series a nonzero radius of convergence.
Read the full abstract

Numerical Analysis

Photoacoustic tomography with time-dependent damping: Theoretical and a convolutional neural network-guided numerical inversion procedure

In photoacoustic tomography (PAT), a hybrid imaging modality that is based on the acoustic detection of optical absorption from biological tissue exposed to a pulsed laser, a short pulse laser generates an initial pressure proportional to the absorbed optical energy, which then propagates acoustically and is measured on the boundary. To account for the significant signal distortion caused by acoustic attenuation in biological tissue, we model PAT in heterogeneous media using a damped wave equation featuring spatially varying sound speed and a time-dependent damping term. Under natural assumptions, we show that the initial pressure is uniquely determined by the boundary measurements using a harmonic extension of the boundary data with energy decay. For constant damping, an expansion in Dirichlet eigenfunctions of $-c^2(\xx)\Delta$ leads to an explicit series reconstruction formula for the initial pressure. Finally, we develop a gradient free numerical method based on the Pontryagin's maximum principle to provide a robust and computationally viable approach to image reconstruction in attenuating PAT.
Read the full abstract

Group Theory

On the trivial units property and the unique product property

We report on some computational experiments related to the trivial units property and unique product property for group rings of torsion-free groups. These properties are related to Kaplansky's unit and zero-divisor conjectures. Our investigations include a classification of certain symmetric non-trivial units in the binary group ring of the Hantzsche-Wendt group; this group was used in Gardam's refutal of Kaplansky's unit conjecture. We also exhibit and investigate a new candidate group that fails the unique units property but may satisfy the trivial unit property. No examples of groups with these properties are known to date.
Read the full abstract

All authors Heiko Dietrich, Melissa Lee, Andre Nies, Marc Vinyals

Group Theory

The probability that two elements with large $1$-eigenspaces generate a classical group

With high probability, among $O(\log n)$ independent randomly selected elements from a finite $n$-dimensional classical group, some pair of elements power to a $2$-element generating set for a naturally embedded classical subgroup of dimension $O(\log n)$. The $2$-element generating set produced consists of certain elements with large $1$-eigenspaces, called stingray elements. Underpinning this result is a new theorem on the generation of a finite classical group by a pair of stingray elements. In particular we show that, for classical groups not containing ${\rm SL}_n(q)$, the probability of generation is at least $0.975$. The explicit probability bounds we obtain will be applied to justify complexity analyses for new constructive recognition algorithms for finite classical groups.
Read the full abstract

Functional Analysis

A Lower Bound for Grothendieck's Constant

We show that Grothendieck's real constant $K_{G}$ satisfies $K_G\geq c+10^{-26}$, improving on the lower bound of $c=1.676956674215576\ldots$ of Davie and Reeds from 1984 and 1991, respectively.

Algebraic Geometry

Shifting local exponents of Picard-Fuchs operators

We investigate the operation of shifting local exponents and study its effects on the monodromy representation of a one-parameter family of Calabi-Yau threefolds. The main result is a characterization of shifts of geometric operators which are also geometric. We use this description to construct some Picard-Fuchs operators with interesting properties.
Read the full abstract

Statistics Theory

A Martingale Approach To Fluctuations of Rank Estimators in Sensitivity Analysis

Given a bivariate random pair $(X,Y)$, a natural problem is to estimate, from a single sample $(X_i,Y_i)_{1\le i\le n}$, quantities such as $\mathbb{E}\left[ \mathbb{E}[ Y\mid X ]^2 \right]$. More broadly, sensitivity indices are designed to quantify the possibly nonlinear influence of an input variable $X$ on an output variable $Y$. A classical example is the Sobol' index $$ \frac{\mathrm{Var}(\mathbb{E}[Y\mid X])}{\mathrm{Var}(Y)} \in [0,1] \ . $$ Another important example is the Cramér–von Mises (CvM) index. Following the pioneering work of Chatterjee \cite{chatterjee2021new}, consistent rank-based estimators are now available for such quantities. In this paper, we prove sharp fluctuation results using martingale methods. Our framework yields a unified treatment of the univariate Sobol' index, a multivariate extension involving several functions of the same scalar input, and the CvM index. As a consequence, we recover, unify, and simplify results from Gamboa et al. \cite{gamboa2022global, gamboa2023erratum}, Lin–Han \cite{lin2022limit}, and Kroll \cite{kroll2024asymptotic}. In particular, we work under minimal regularity assumptions. Furthermore, while the Gaussian fluctuation phenomenon itself was already known, the novelty lies in the structure of the asymptotic variance: for the CvM index, we obtain, to the best of our knowledge, the first explicit formula, while for the Sobol' index, we derive a new expression with a more structured form.
Read the full abstract

Number Theory

Admissible pairs and $p$-adic Hodge structures III: Variation and unlikely intersection

We extend the relative theory of admissible pairs and $p$-adic Hodge structures introduced in Part II to allow variation in the underlying local systems of $\mathbb{Q}_p$-vector spaces and isocrystals. This extension accommodates, in particular, the families of $p$-adic Hodge structures that arise from the cohomology of certain smooth proper families. Such a variation gives rise to a cover with a global Hodge period map, and we study this cover and its period map from a differential perspective both classically and via the theory of inscription. This study is motivated by our transcendence results in Parts I and II and analogies with complex bi-algebraic geometry, and we also extend these ideas in other directions: First, we study the locus of special points on local Shimura varieties. We establish a refined version of a prediction of Rapoport-Viehmann on the density of special points, but give a robust counter-example to the local analog of the André-Oort conjecture in this setting. This shuts down a broader theory of unlikely intersection but leaves open the possibility of stronger geometric transcendence results than the bi-analytic Ax–Lindemann theorem of Part II. Using the Banach-Colmez Tangent Bundles for infinite level local Shimura varieties that arise from the theory of inscription, we define precise notions of generic and exceptional intersections and then formulate an Ax–Schanuel conjecture that we expect to refine our Ax–Lindemann theorem.
Read the full abstract

Combinatorics

On the combinatorial structure of graphs with a spectral idempotent of small dual diameter

Let $\Gamma$ be a connected regular graph with an eigenvalue $\lambda$ and corresponding idempotent $E_{\lambda}$. Let ${\cal E}_{\lambda}=\langle J,E_{\lambda}\rangle^\circ$ be the algebra generated by $J$ and $E_\lambda$ with respect to the entrywise-Hadamard product, where $J$ is the all-$1$ matrix. We study the combinatorial structure of a graph $\Gamma$ for which ${\cal E}_{\lambda}$ has dimension $2$, giving a combinatorial characterization of such graphs in terms of equitable partitions. We present many examples and classify the distance-regular graphs with this property, as well as graphs that generate a $3$-class association scheme. We also study the graphs that have two eigenvalues $\lambda$ for which ${\rm dim}({\cal E}_{\lambda})=2$ and determine all such graphs with four distinct eigenvalues.
Read the full abstract

Analysis of PDEs

On a nonlocal non-linear inverse scattering problem

In this article, we study the inverse scattering problem for the nonlinear fractional Helmholtz equation with cubic nonlinearity in three dimensions, where we recover a compactly supported potential from scattering amplitude.

Logic

The strength of Ramsey's theorem for $\alpha$-large sets

We calibrate the reverse mathematical strength of a family of extensions of Ramsey's theorem to finite colorings of certain subsets of the natural numbers of unbounded finite dimension. Specifically, we analyze the principles $\mathsf{RT}^{!\alpha}_k$ asserting that every $k$-coloring of the exactly $\alpha$-large subsets of an infinite $X \subseteq \mathbb{N}$ admits an infinite homogeneous set, where $\alpha$-largeness is defined via systems of fundamental sequences in the style of Ketonen and Solovay. For each countable ordinal $\alpha < \Gamma_0$ and each $k \geq 2$, we prove over $\mathsf{RCA}_0$ that the hierarchy of theorems $\mathsf{RT}^{!\a}_k$ corresponds exactly to the hierarchy of systems axiomatized by closure under transfinite Turing jumps, yielding a fine-grained classification between $\mathsf{ACA}_0$ and $\mathsf{ATR}_0$. Our results extend previous work on the case $\alpha=\omega$ and provide a uniform correspondence between countable indecomposable ordinals below $\Gamma_0$ and natural Ramsey-like theorems.
Read the full abstract

Combinatorics

How to bounce your canon permutation

We study a new class of palindromic descent polynomials. Given a Dyck path $d$ of semilength $n$ and a permutation $\sigma$ of size $n$, one can label the up-steps and down-steps of $d$ with the elements of $\sigma$. The labeled Dyck path determines a multiset permutation called a canon (or nonnesting) permutation. Such permutations arise as linear extensions of posets and as regions of hyperplane arrangements. Elizalde showed that the descent polynomial for all canon permutations of fixed length factors as a product of an Eulerian and a Narayana polynomial. We refine these polynomials by associating to $d$ a descent polynomial $C_d$ over the canon permutations obtained from $d$. We prove that $C_d$ is palindromic and free of internal zeros, though not unimodal in general. Its degree is determined by the number of peaks in the bounce path of $d$. We establish a correspondence between canon permutations attaining the maximum number of descents and Dyck paths below $d$ in the Dyck lattice satisfying a valley condition. Each such path contributes a number of maximizers equal to the number of linear extensions of an associated poset, yielding a combinatorial interpretation of the leading coefficient of $C_d$.
Read the full abstract

Probability

Moment bounds and exclusion processes on random Delaunay triangulations with conductances

We consider the Voronoi tessellation associated to a stationary simple point process on $\mathbb{R}^d$ with finite and positive intensity. We introduce the Delaunay triangulation as its dual graph, i.e.~the graph with vertex set given by the point process and with edges between vertices whose Voronoi cells share a $(d-1)$-dimensional face. We also attach to each edge a random weight, called conductance. We provide sufficient conditions ensuring the integrability w.r.t. the Palm distribution of several quantities as weighted degrees and associated moments. These integrability properties are crucial in applications, as they allow to apply existing results on random walks, resistor networks and the symmetric simple exclusion processes with random conductances (cf. [1,11,12,13,14,15]). For the latter, while the moment bounds ensure its well definiteness and several properties, the same does not hold when the jump rates are not symmetric, i.e. for a generic simple exclusion process. In this case, by using a criterion from [13], we recover construction and properties of the simple exclusion process whenever the simple point process has finite range of dependence and the conductances are uniformly upper bounded. This last result relies on a suitable analysis of Bernoulli bond percolation on the Delaunay triangulation inspired by [2,3]. All the above results remain valid if the simple point process is stationary with respect to integer translations.
Read the full abstract