Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 14 April

Probability

Shocks, instability, and the twenty networks of infinite geodesics in the Directed Landscape

For stochastic Hamilton-Jacobi (SHJ) equations, instability points are the space-time locations where two eternal solutions with the same asymptotic velocity differ. Another fundamental structure in such equations is shocks, which are the space-time locations where the velocity field is discontinuous. In this work, we study the KPZ fixed point, the central object of the KPZ universality class, which can be viewed as a prototype–albeit degenerate–of an inviscid SHJ equation in one spatial dimension. We describe the geometric structure of the instability region and give a detailed and precise analysis of its interplay with the shock structures of the two eternal solutions. We show that these shock structures allow one to reconstruct the instability region. Along the way, we obtain a complete classification of all possible configurations of semi-infinite geodesics emanating from arbitrary space-time points, in the directed landscape–the random environment in which the KPZ fixed point evolves.
Read the full abstract

Analysis of PDEs

On the flexibility of 2D Euler steady states

We consider steady states of the incompressible Euler equation on two-dimensional domains. For non-radial analytic steady states on bounded simply connected domains, it was shown previously that there must be a global functional relationship between the stream function and the vorticity. We show that this does not extend to smooth functions, even under further structural assumptions such as the Morse condition or Arnold's stability criterion. More precisely, we show that a broad class of steady states with multiple critical points can be perturbed to smooth steady states for which the vorticity is not a single-valued function of the stream function. We also establish an analogous flexibility result near the cellular flow on the flat torus, which is a degenerate case. As a consequence of our constructions, there are "branches" of smooth steady states that are isolated from analytic ones. In some cases, the resulting isolated branches can even consist entirely of linearly stable steady states.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Symmetry Is Almost All You Need: Robust Stability with Uncertainty Induced by Symmetric SRG Regions

This paper investigates the robust stability problem of a feedback system in the presence of uncertainties induced by graphical regions in the plane where the scaled relative graphs (SRGs) reside. Our main results are developed using a novel and intuitive concept, the Davis-Wielandt shell, together with its connection to SRGs and related variants. We first study a matrix robust nonsingularity (MRN) problem for two types of graphically induced uncertainty sets: one with prior information on $\theta$ and one without. In the former case, we show that, whenever the uncertainty-inducing region is mirror symmetric about the $\theta$-axis, the separation between a specific variant of the SRG and the region provides a necessary and sufficient condition for MRN. When the region is asymmetric, the necessity generally fails. This recovers the necessity of the small gain condition, and reveals the necessity of small angle conditions and sectored-disc conditions at the matrix level. In the latter case, we show that an additional $\theta$-circular connectivity property is required to obtain necessary and sufficient conditions. Building on these MRN results, we then derive sufficient conditions for robust stability of multi-input multi-output (MIMO) linear time-invariant (LTI) systems under frequencywise symmetric uncertainties. In addition, connections with existing system characteristics such as disc-boundedness are discussed and exploited to obtain state-space characterisations for angle-bounded and mixed gain-angle-bounded systems. Based on these results, we construct a $\theta$-angle-gain profile of a system that provides an intuitive visualisation of its feedback robustness against conic and sectorial uncertainties.
Read the full abstract

All authors Ding Zhang, Di Zhao, Philipp Braun, Jianqi Chen

Information Theory · Cross-listed from cs.CR

Distinguishers for Skew and Linearized Reed-Solomon Codes

Generalized Reed-Solomon (GRS) and Gabidulin codes have been proposed for various code-based cryptosystems, though most such schemes without elaborate disguising techniques have been successfully attacked. Both code classes are prominent examples of the isometric families of (generalized) skew and linearized Reed-Solomon ((G)SRS and (G)LRS) codes which are obtained as evaluation codes from skew polynomials. Both GSRS and GLRS codes share the advantage of achieving the maximum possible error-decoding radius and thus promise smaller key sizes than e.g. Classic McEliece. We investigate whether these generalizations can avoid the known structural attacks on GRS and Gabidulin codes. In particular, we prove that both GSRS and GLRS codes decompose into GRS subcodes and are thus efficiently distinguishable from random codes with a square code method. This applies to all parameters for which the code length $n$ and its dimension $k$ over the field $\mathbb{F}_{q^m}$ satisfy $m + 1 < k < n - \tfrac{1}{2} (m^2 + 3m)$. The distinguishability extends to GSRS and GLRS codes with Hamming-isometric disguising. We further relate these findings to existing distinguishers for GRS, Gabidulin, and LRS codes, and extend known results on duals of SRS and LRS codes to the generalized setting allowing nonzero column multipliers. Finally, we provide explicit transformations between GSRS and GLRS codes, clarifying the algebraic relationship between the skew and linearized frameworks.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Fundamental Limits of 1-bit ISAC Systems: Capacity Region and Optimal Power Control

This paper investigates the fundamental limits of integrated sensing and communication (ISAC) systems with 1-bit receiver quantization. We analyze a Gaussian fading ISAC channel with separate communication and monostatic sensing links, where both communication and sensing receivers are equipped with 1-bit quantizers. When the communication channel state information (CSI) is available at the receiver, we characterize the communication-sensing capacity region of 1-bit ISAC channel and show that no trade-off exists between communication and sensing performance. In particular, both communication and sensing capacities can be simultaneously achieved by a constant-amplitude input distribution with a specific rotational symmetry. For the scenario where communication CSI is also available at the transmitter, we formulate a weighted optimization problem that balances communication and sensing rates in 1-bit ISAC channel under an average power constraint and then derive the corresponding optimal power control policy. The results demonstrate how the optimal power control policy evolves with the weighting parameter, transitioning from a communication-centric, opportunistic transmission to a more uniform allocation as sensing becomes increasingly prioritized.
Read the full abstract

Combinatorics · Cross-listed from cs.LG

An Optimal Sauer Lemma Over $k$-ary Alphabets

The Sauer-Shelah-Perles Lemma is a cornerstone of combinatorics and learning theory, bounding the size of a binary hypothesis class in terms of its Vapnik-Chervonenkis (VC) dimension. For classes of functions over a $k$-ary alphabet, namely the multiclass setting, the Natarajan dimension has long served as an analogue of VC dimension, yet the corresponding Sauer-type bounds are suboptimal for alphabet sizes $k>2$. In this work, we establish a sharp Sauer inequality for multiclass and list prediction. Our bound is expressed in terms of the Daniely–Shalev-Shwartz (DS) dimension, and more generally with its extension, the list-DS dimension – the combinatorial parameters that characterize multiclass and list PAC learnability. Our bound is tight for every alphabet size $k$, list size $\ell$, and dimension value, replacing the exponential dependence on $\ell$ in the Natarajan-based bound by the optimal polynomial dependence, and improving the dependence on $k$ as well. Our proof uses the polynomial method. In contrast to the classical VC case, where several direct combinatorial proofs are known, we are not aware of any purely combinatorial proof in the DS setting. This motivates several directions for future research, which are discussed in the paper. As consequences, we obtain improved sample complexity upper bounds for list PAC learning and for uniform convergence of list predictors, sharpening the recent results of Charikar et al.~(STOC~2023), Hanneke et al.~(COLT~2024), and Brukhim et al.~(NeurIPS~2024).
Read the full abstract

All authors Steve Hanneke, Qinglin Meng, Shay Moran, Amirreza Shaeiri

Statistics Theory

Distributional Convergence of Empirical Entropic Optimal Transport and Statistical Applications

Recently, the statistical properties of empirical Entropic Optimal Transport (EOT) have attracted great interest, as this quantity has been shown to be useful for complex data analysis, among other reasons due to its computational efficiency. In several applications, it has been observed that the EOT plan provides valuable information beyond just the optimal value. For example, in cell biology, colocalization analysis based on the EOT plan has been introduced as a measure for quantification of spatial proximity of different protein assemblies. Despite recent progress in the analysis of its risk properties, a precise understanding of its statistical fluctuations to make it accessible for inference remains elusive to a large extent. In this paper, we derive asymptotic weak convergence result for a large class of functionals of the EOT plan, in which the colocalization process is included. The proof is based on Hadamard differentiability and the extended delta method. As an application, we obtain uniform confidence bands for colocalization curves and bootstrap consistency. Our theory is supported by simulation studies and is illustrated by real world data analysis from mitochondrial protein colocalization.
Read the full abstract

Quantum Algebra

The Huang Algebra Ideal and the Diagonal Shift Property

Let $V$ be a grading-restricted vertex algebra and let $A^\infty(V )=U^\infty(V)/Q^\infty(V)$ be the associative algebra constructed by Huang, where $U^\infty(V)$ is the space of column-finite infinite matrices with entries in $V$ and $Q^\infty(V)$ is an ideal of a (nonassociative) algebra structure on $U^\infty(V)$ defined by Huang. Huang introduced families of elements in $Q^\infty(V)$ and conjectured that these elements generate $Q^\infty(V)$. We introduce the “diagonal shift property" and prove that the elements that Huang conjectured as a generating set for $Q^\infty(V)$ satisfy this property. On the other hand, in the case that $V$ is the rank one Heisenberg vertex operator algebra, we construct infinitely many linearly independent elements in $Q^\infty(V)$ that do not satisfy the diagonal shift property. As a corollary, we disprove Huang's conjecture.
Read the full abstract

Optimization and Control

From quantum to quantum-inspired: the LogQ algorithm as a non-linear continuous relaxation of variables method

The LogQ algorithm encodes Quadratic Unconstrained Binary Optimization (QUBO) problems, which are often encountered in the industry (portfolio optimization, fleet optimization, charging stations, etc.). It was developed within the framework of quantum computing, designed as a pragmatic approach to quantum combinatorial optimization that drastically reduces the number of required qubits and quantum circuit depth. While LogQ has recently been made compliant with gradient-inspired methods, greatly improving parameter optimization efficiency, it still faced hurdles regarding Pauli decomposition and measurement overhead. We here demonstrate that LogQ can be fully reformulated within a classical framework, which effectively eliminates the need for Pauli decomposition and bypasses the measurement challenges altogether. This finally leads to a classical heuristic based on a non-linear continuous relaxation of variables and is, to the best of our knowledge, novel. The LogQ story illustrates how quantum computing can inspire classical algorithms, leading to so-called "quantum-inspired" methods.
Read the full abstract

Functional Analysis

A Le Page–Kaplansky theorem characterizing commutative JB*-triples

We prove that a Le Page-type inequality is also valid for metrically characterizing those JB$^*$-triples that are commutative. More precisely, we establish that the following statements are equivalent for any JB$^*$-triple $E$: $(a)$ $E$ is commutative. $(b)$ There exists $\gamma>0$ satisfying $$\big\|\{a,b,\{x,y,z\}\}\big\|\leq \gamma \ \! \big\|\{x,y,\{a,b,z\}\}\big\|, \hbox{ for all } a,b,x,y,z\in E.$$
Read the full abstract

Numerical Analysis

Convergence analysis and proof of acceleration for NGMRES applied to the Picard iteration for Navier-Stokes equations

We consider nonlinear GMRES (NGMRES) as an acceleration technique for the Navier-Stokes Picard iteration, a direction that has not previously been explored. We identify the optimal norm for the least squares optimization problem arising in the NGMRES algorithm, and establish a convergence analysis for NGMRES with general depth that proves NGMRES scales the Picard Lipschitz constant by the gain of the optimization problem. To our knowledge, this is the first convergence proof for NGMRES that identifies the mechanism responsible for convergence acceleration. Numerical experiments demonstrate that the convergence estimates are remarkably sharp. In addition, NGMRES greatly improves the performance of the Picard iteration, even in cases where the unaccelerated iteration diverges.
Read the full abstract

Dynamical Systems

Multipliers and Disjointness from Mixing

In 2005, Parreau proved that if a measure preserving system is not strongly mixing then it contains a non-trivial factor that is disjoint from every strongly mixing system. Taking this construction as the starting point, we develop the complementary notions of $\mathcal U$-generated and $\mathcal U$-mixing systems, for a set $\mathcal U$ of ultrafilters, and use them to recover several classical results in ergodic theory as special cases of a unified framework. We prove that a system is $\mathcal U$-mixing if and only if it is disjoint from all $\mathcal U$-generated systems. In fact, we show that if $\mathcal Y$ is a $\mathcal U$-generated system and $\mathcal Z$ is disjoint from every $\mathcal U$-mixing system, then any joining of $\mathcal Y$ and $\mathcal Z$ remains disjoint from all $\mathcal U$-mixing systems. We also show that every partially rigid system is a finite extension of some $\mathcal{U}$-generated system.
Read the full abstract

Differential Geometry

The doubling conjecture for positive scalar curvature

The doubling conjecture predicts that a manifold admits positive scalar curvature with mean convex boundary if and only if its double admits positive scalar curvature. We show that it holds true for manifolds where the inclusion of the boundary satisfies a certain split-condition on fundamental groups. Our proof is based on surgery-techniques for positive scalar and mean curvature. If the boundary is non-connected, we use existence of area-minimizing hypersurfaces and the monotonicity-formula. Furthermore, we investigate if a psc-metric on a closed manifold can be adjusted so that a given embedded hypersurface is minimal, stable minimal or totally geodesic. While not true in general, such an adjustment is possible in many cases.
Read the full abstract

Combinatorics · Cross-listed from cs.AI

BEAM: Bi-level Memory-adaptive Algorithmic Evolution for LLM-Powered Heuristic Design

Large Language Model-based Hyper Heuristic (LHH) has recently emerged as an efficient way for automatic heuristic design. However, most existing LHHs just perform well in optimizing a single function within a pre-defined solver. Their single-layer evolution makes them not effective enough to write a competent complete solver. While some variants incorporate hyperparameter tuning or attempt to generate complex code through iterative local modifications, they still lack a high-level algorithmic modeling, leading to limited exploration efficiency. To address this, we reformulate heuristic design as a Bi-level Optimization problem and propose BEAM (Bi-level Memory-adaptive Algorithmic Evolution). BEAM's exterior layer evolves high-level algorithmic structures with function placeholders through genetic algorithm (GA), while the interior layer realizes these placeholders via Monte Carlo Tree Search (MCTS). We further introduce an Adaptive Memory module to facilitate complex code generation. To support the evaluation for complex code generation, we point out the limitations of starting LHHs from scratch or from code templates and introduce a Knowledge Augmentation (KA) Pipeline. Experimental results on several optimization problems demonstrate that BEAM significantly outperforms existing LHHs, notably reducing the optimality gap by 37.84% on aggregate in CVRP hybrid algorithm design. BEAM also designs a heuristic that outperforms SOTA Maximum Independent Set (MIS) solver KaMIS.
Read the full abstract

All authors Chuyang Xiang, Yichen Wei, Jiale Ma, Handing Wang, Junchi Yan

Dynamical Systems

Picard Iteration for Parameter Estimation in Nonlinear Dynamic Models of Aircraft and Spacecraft

The attitude dynamics of aircraft and spacecraft exhibit significantly nonlinear behaviour. In spacecraft, torque is generated through reaction wheels and control moment gyros. In aircraft, torque is generated using lift on control surfaces. In both cases, complex geometries, unique configurations, and internal/environmental changes imply that models must be identified, verified, and updated using in-flight experimental data. However, this data is often noisy, sparsely sampled, and partial in that modeled states may not be directly measurable. In this paper, we propose a method for estimating key parameters in realistic Ordinary Differential Equation (ODE) models of both spacecraft and aircraft dynamics. This method avoids the need to directly measure state derivatives by coupling sampled outputs using the Picard mapping – an integral constraint on the solution of the parameterized ODE. This constraint is then enforced, and optimal parameter estimates are found using a gradient contraction algorithm. This algorithm is applied to well-studied models of spacecraft and aircraft motion. First, the algorithm is used to estimate the inertia tensor in a 4 control-moment gyro (CMG) model of spacecraft motion. Second, we estimate the 28 higher-order control surface coefficients in a model of the F/A-18 aircraft.
Read the full abstract

Dynamical Systems

Limit-Cycle Replication via Chebyshev Pullbacks and a Quadratic Ceiling for Separable Schemes

Let \(H(n)\) denote the Hilbert number, i.e.\ the maximal number of limit cycles of planar polynomial vector fields of degree \(\le n\). A classical lower-bound mechanism for \(H(n)\) is replication: one pulls back a vector field by a polynomial map and lifts each existing limit cycle to several disjoint copies while controlling the resulting degree. In this paper we give a fully self-contained replication theorem based on the separable Chebyshev covering \[ \Phi(u,v)=(T_m(u),T_m(v)). \] Using the \(m\) monotone full branches of \(T_m\) on \((-1,1)\), we prove that every degree-\(\le n\) polynomial vector field with \(k\) limit cycles gives rise to a degree-\(\le nm+m-1\) polynomial vector field with at least \(m^2k\) limit cycles. Consequently, \[ H(nm+m-1)\ge m^2H(n)\qquad (m\ge 2). \] We then extend the construction to general separable pullbacks \((u,v)\mapsto (p(u),p(v))\), show that Chebyshev attains the maximal possible branch count among degree-\(m\) separable pullbacks, and prove a quadratic ceiling for replication-only schemes: if one iterates separable pullbacks and no additional limit cycles are created beyond those forced by lifting, then the number of resulting limit cycles is at most quadratic in the final degree. This shows that superquadratic lower bounds, such as the known \(n^2\log n\)-type bounds, necessarily require mechanisms beyond pure separable replication. Finally, combining our replication theorem with the strongest currently published seed bounds, we obtain new explicit lower estimates in several degrees, including \begin{gather*} H(14)\ge 252,\qquad H(29)\ge 1080,\\ H(31)\ge 1380,\qquad H(39)\ge 2012. \end{gather*}
Read the full abstract

Algebraic Geometry

On the large genus of Hurwitz numbers

Hurwitz theory provides a large variety of enumerative problems related to algebraic geometry, mathematical physics, and combinatorics. We give a general framework to approach the large genus asymptotics of Hurwitz theory using only elementary methods and apply it to several types of Hurwitz numbers: single, double, or with an arbitrary numbers of fixed ramifications; simple and / or including completed cycles type of ramification and / or finitely many blocks of weakly monotone and / or strictly monotone types of ramifications. These, to the best of our knowledge, cover most of the Hurwitz numbers studied, and include for instance correlators of the HCIZ matrix model, Grothendieck dessins d'enfant, weighted Hurwitz numbers, and Gromov-Witten invariants of the Riemann sphere. We also apply our method to b-content Hurwitz numbers. As a specialisation, we recover some previously known about the large genus asymptotics of Hurwitz theory, namely classical results by Hurwitz and recent results of Do-He-Robertson, C. Yang, and results connected to recent work of X. Li.
Read the full abstract

Complex Variables

Fueter trees for Dunkl-regular functions over alternative *-algebras

We prove a general Fueter Theorem over real alternative *-algebras. We show that a suitable power of the Laplacian maps Dunkl-regular functions to Dunkl monogenic functions with axial symmetries. Using the embedding of hypercomplex function theories in the class of Dunkl monogenic functions, we subsume several Fueter-type results known in the literature and obtain the most general form for the action of the Laplacian on function spaces over hypercomplex subspaces. We show that Fueter Theorems are in a one-to-one correspondence with a class of graphs, the Fueter trees, that describe the interactions between Dunkl-regular function spaces and the relation with the iterated Laplacian. We obtain that the number of distinct Fueter trees on a hypercomplex space of dimension $n+1$ is equal to the number of partitions in odd parts of the integer $n$.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

The Hidden Symmetries of Yang-Mills Theory in (1+1)-dimensions

We present an integral formulation of classical Yang-Mills theory coupled to fermionic and scalar matter fields in (1+1)-dimensional Minkowski spacetime. By reformulating the local dynamics in terms of loop-space holonomies, we demonstrate that the path independence of the holonomy eigenvalues constitutes a conservation law, yielding an infinite hierarchy of gauge-invariant, dynamically conserved charges. While a zero-curvature equation is associated with a necessary condition for this path invariance, we note that it is not strictly sufficient on its own. Employing a first-order symplectic formalism, we show that these non-abelian charges generate global symmetry transformations on the fundamental phase-space variables. We rigorously prove that these transformations preserve the physical dynamics, leaving the total Hamiltonian invariant up to first-class constraints. Furthermore, an analysis of the Poisson algebra reveals that these conserved charges are in involution, provided the boundary integration constant lies within the center of the gauge group. This exact, lower-dimensional framework provides a highly tractable setting to investigate the algebraic structures of these hidden symmetries and the meaning of the conserved charges as physical observables, establishing a classical foundation for exploring their role in the quantum regime, such as in strongly coupled lattice gauge theories.
Read the full abstract

Numerical Analysis

Manifold Data Imputation

We consider the problem of reconstructing missing data on a smooth manifold from incomplete and nonuniform samples. While classical methods for manifold approximation typically assume quasi-uniform data, their performance deteriorates significantly in the presence of large gaps or holes. We propose a unified framework for manifold data imputation that reduces the problem to function reconstruction on locally defined tangent spaces. The approach combines two complementary strategies. The first is a Fourier-based method that determines missing values by prescribing a decay rate of the discrete Fourier coefficients, thereby enforcing high-order smoothness through a global spectral criterion. The second is a local variational method based on minimizing high-order central differences, leading to sparse least-squares systems with favorable stability and conditioning properties. We establish a discrete inverse estimate linking decay of Fourier coefficients to uniform bounds on high-order divided differences, providing a theoretical foundation for the spectral approach. For the variational method, we analyze existence, uniqueness, and scaling behavior, showing that conditioning depends primarily on the geometry of the missing region. These functional reconstruction techniques are integrated with a moving least-squares projection framework to yield a practical algorithm for manifold completion. Numerical experiments, including reconstruction on surfaces with significant missing regions, demonstrate accurate and stable recovery without requiring a global parameterization. The proposed framework provides a flexible and effective approach to manifold data imputation in challenging settings with incomplete data.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.CD

Precursors of extreme events and critical transitions

We propose a theory based on dynamical systems to explain and predict the occurrence of extreme events, of which critical transitions form a subset. In fast-slow nonlinear systems, we identify a cascade of events preceding extreme events: (i) a slow regime, in which the fast covariant Lyapunov vectors (CLVs) are both tangent to the fast eigenvectors and remain transversal to the slow subspace; (ii) a transition regime, in which the fast eigenvalues become neutrally stable while the fast CLVs are no longer tangent to the fast eigenvectors; and (iii) a critical regime, in which a strong spectral gap in the eigenvalues causes both fast and slow CLVs to become tangent along the dominant fast direction, breaking the transversality between fast and slow subspaces. Building on this cascade, we propose two precursors to forewarn the occurrence of extreme events. We numerically test the theory and precursors on low- and higher-dimensional systems. The proposed precursors predict extreme events and critical transitions with 100% precision and recall. This work opens opportunities for time-forecasting extreme events using theoretically grounded precursors.
Read the full abstract

Number Theory

An inverse theorem for sumsets of sets of positive density in the integers

Let $d(\cdot)$ denote the natural density on the positive integers. We characterize all sets $A,B$ with positive density satisfying $d(A+B)=d(A)+d(B)$, under the assumption that the two sets are not both contained in a proper finite union of residue classes. This gives a new inverse theorem for Kneser's sumset inequality in the integers, and provides a partial answer to a long-standing open question of Erdős and Graham.
Read the full abstract

Optimization and Control

From Interpolation to $\mathcal{H}_2$ Optimality: Model Reduction for Infinite-Dimensional Linear Control Systems

We develop the interpolatory $\mathcal{H}_2$ optimal model reduction framework for linear control systems posed on infinite dimensional state, input and output spaces. Specifically, we consider linear systems formulated as controlled abstract Cauchy problems on a Banach space and approximate them via Petrov-Galerkin projection onto finite dimensional trial and test subspaces. We show that the resulting reduced order transfer function interpolates the original at prescribed points, and we characterize precisely how the projection subspaces must be constructed to enforce this interpolation. Building on this, we develop a data-driven realization framework – an infinite dimensional analogue of the Loewner approach – that recovers the system behavior directly from input-output data without requiring access to the underlying operators. Finally, we derive $\mathcal{H}_2$ optimality conditions for the reduced model and show that the classical interpolatory characterization persists in this infinite dimensional setting: first-order optimality requires Hermite interpolation of the transfer function at the mirror images of the reduced model's poles. Taken together, these results establish that the interpolatory $\mathcal{H}_2$ optimal model reduction theory extends naturally and completely to infinite dimensional linear control systems with infinite dimensional input and output spaces.
Read the full abstract

Mathematical Physics

Scattering and inverse scattering for multipoint potentials at high energies

We consider the Schrödinger equation with a multipoint potential of Bethe-Peierls-Thomas-Fermi type. For this singular potential, we develop scattering and inverse scattering at high energies. In particular, in this framework, our results include analogs of the "regular" Born-Faddeev formula for the scattering amplitude and analogs of related "regular" inverse scattering reconstructions at high energies. Related results for scattering solutions at high energies are also presented.
Read the full abstract

Probability

Coupling Markov chains with a common image chain

Consider time-homogeneous discrete-time Markov chains $X$, $Y$, and $Z$ on countable state spaces, considered as stochastic processes with specified initial distributions. Suppose for maps $f$ and $g$ that $(f(X_t))_{t \ge 0}$ and $(g(Y_t))_{t \ge 0}$ are both equal in law to $Z$. We prove that $X$ and $Y$ can be coupled so that $(X_t, Y_t)_{t \ge 0}$ is a homogeneous Markov chain with $f(X_t) = g(Y_t)$ for all $t \ge 0$. Without the assumption that $Z$ is Markov, no such Markov coupling exists in general, even an inhomogeneous one. Moreover, we give an explicit construction of such a coupling, with the additional property that $X$ and $Y$ are conditionally independent given the entire trajectory $(f(X_t))_{t \ge 0}$. Under the further assumption that $X$ and $Y$ are stationary, we construct a coupling having the above properties that is also stationary. In this case, conditional independence holds for the corresponding two-sided chains indexed by $\mathbb{Z}$ (but not necessarily for the one-sided versions). We prove further properties of our couplings in special cases where $f$ or $g$ satisfies the strong lumping condition (also known as Dynkin's condition) or the exact lumping condition (also known as the Pitman-Rogers condition). When $f$ is a strong lumping and $g$ is an exact lumping, we show that our coupling coincides with an intertwining of Markov chains as constructed by Diaconis and Fill.
Read the full abstract

Differential Geometry

Gray-Hervella classes on product twistor spaces

Motivated by generalized geometry (in the sense of Hitchin), the product bundle ${\mathcal Z}\times_{M} {\mathcal Z}$ of the twistor space ${\mathcal Z}$ of a Riemannian manifold $(M,g)$ is considered. The product twistor space admits a natural family of Riemannian metrics and four compatible almost complex structures, analogs of the Atiyah-Hitchin-Singer and Eells-Salamon almost complex structures on the twistor space. The Gray-Hervellal classes of these almost Hermitian structures are determined in the case when the dimension of the base manifold $M$ is four.
Read the full abstract

Numerical Analysis

Deflation-based preconditioning for immersed finite element methods and immersogeometric analysis

Trimming is a ubiquitous operation in computer-aided-design whereby parts of a geometry are merged, intersected, or simply discarded. While it grants virtually unlimited flexibility in geometric design, it introduces a plethora of other difficulties when such geometries are used within immersed finite element methods. In particular, small cut elements lead to severely ill-conditioned system matrices requiring dedicated penalization, stabilization, or preconditioning techniques. In this work, we highlight the limitations of existing preconditioning strategies by first carefully examining the condition number of the diagonally scaled matrix and later providing realistic counter-examples for some well-established preconditioning strategies. Building on those insights, we propose a robust deflation-based preconditioning technique tailored to immersed finite element methods.
Read the full abstract

All authors Yannis Voet, Matthias Möller, Pablo Antolin, Cornelis Vuik

Dynamical Systems · Cross-listed from nlin.PS

Wave number dynamics in the real and complex Ginzburg-Landau equations

We investigate the large-scale dynamics of the one-dimensional real and complex Ginzburg-Landau equations using a scalar equation for the local wave number derived by a Wentzel-Kramers-Brillouin (WKB) expansion. For the real equation, the reduction has a conserved gradient structure. With higher-order regularization, we obtain families of exact stationary solutions and show that all nonuniform steady states are linearly unstable. These include localized holes distinct from the classical Langer-Ambegaokar hole. In the Eckhaus-unstable regime, the reduced equation develops finite-time singularities associated with phase slips. We derive a universal self-similar description of this process, with parameter-independent scaling exponents in good agreement with direct numerical simulations. The similarity profile satisfies a nonlinear fourth-order boundary-value problem admitting multiple numerically identified solutions. For the complex equation with nearly real coefficients, an additional Burgers-type nonlinearity produces wave steepening and traveling shocks connecting plane waves of different wave numbers. We derive the shock profile exactly and show numerically that the full complex Ginzburg-Landau equation converges to this prediction in the appropriate asymptotic limit. Outside this regime, the wave number profile becomes nonmonotonic, as explained in terms of spatial dynamics. These shocks differ qualitatively from classical Nozaki-Bekki solutions. The reduced equation thus unifies stationary holes, self-similar collapse toward phase slips, and propagating shocks within a common description of pattern-forming systems.
Read the full abstract

Differential Geometry

Weyl structures for path geometries

Path geometries provide a geometric encoding of systems of second order ODE, which serves as a model for the geometric theory of more general systems of ODE and for cone structures. They are an instance of the family of parabolic geometries, thus they are second order structures that are difficult to study using the usual tools of differential geometry. The general theory of parabolic geometries provides several efficient tools for the study of path geometries, but these use Cartan geometry methods and hence are not easily accessible. In this article, we build a bridge between these general methods and an elementary approach to path geometries. Motivated by the general theory of Weyl structures (but not using it), we first define a family of distinguished connections that is analogous to Webster-Tanaka connections in CR geometry. These are parametrized by (local) non-vanishing sections of a line bundle naturally associated to the geometry, and the dependence of this choice is described explicitly. We also discuss the Schouten tensor associated to such a choice and its dependence on the choice. We explain how these ingredients can be used to obtain an elementary approach to tractor calculus for path geometries and give examples of applications to the construction of invariant operators. A second major result that we prove is that in the case of path geometries, there is a smaller subclass of distinguished Weyl structures which does not seem to have an analog for any other type of parabolic geometries. This has interesting relations to the refinement of the de Rham complex induced by a path geometry via the machinery of BGG sequences. Again, all this is proved using elementary methods without reference to the general theory.
Read the full abstract

Analysis of PDEs

Periodic and stochastic homogenization of general nonlocal operators with oscillating coefficients

This paper investigates homogenization problems for the nonlocal operators with rapidly oscillating coefficients in the cases of periodic and random statistically homogeneous micro-structures. These operators involve the fractional Laplacian and some operators compared to it. Based on the $\Gamma$-convergence method and compactness arguments, we prove the homogenization theorems for these nonlocal operators with product-type and symmetric coefficient-structured kernels respectively. Furthermore, these results are extended to general nonlinear nonlocal equations.
Read the full abstract

All authors Xiaofeng Jin, Wentao Huo, Lingwei Ma, Zhenqiu Zhang