Complex Variables
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 27 March
In this paper, we establish the weak*-convergence of a sequence of the complex Hessian measures $H_m(u_j)$ to the complex Hessian measure $H_m(u)$ in the class $\mathcal{E}(X,\omega,m)$ under hypotheses that $u_j$ is convergent to $u$ in $(\omega,m)$-capacity.
Algebraic Geometry
Motivic local density of isolated surface singularities
The goal of this paper is to compute the motivic local density of an isolated algebraic surface singularity, in order to explain its link with algebraic multiplicity. In this context, we can use an additional data: the inner rate related to the bilipschitz geoemtry of the singularity, as studied by A. Belotto da Silva, L. Fantini and A. Pichon.
Read the full abstract
Mathematical Physics
Orthogonal pairs of Euler elements II: Geometric Bisognano–Wichmann and Spin–Statistics Theorems
Models in Algebraic Quantum Field Theory (AQFT) may be generalized including Lie groups of symmetries whose Lie algebras admit an Euler element $h$, characterized by the property that $ad h$ is diagonalizable with eigenvalues in $\{-1, 0, 1\}$. These elements becomes fundamental to the formal description of wedge localization. In this paper, we extend the geometric analysis of Euler wedges and investigate their applications within the AQFT framework. We call a pair of Euler elements $(h, k)$ orthogonal if $e^{i \pi \operatorname{ad} h}(k) = -k.$ Using the geometric framework established in our previous work, we derive both a Bisognano–Wichmann Theorem and a Spin–Statistics Theorem for nets of standard subspaces and von Neumann algebras. Our results {show} how this generalized approach recovers classical results in the AQFT literature while providing a deeper structural understanding of the underlying geometry in established models.
Read the full abstract
Information Theory
Rotatable Antenna Enhanced Multicast Communication System
Rotatable antenna (RA) provides additional spatial degrees of freedom (DoFs) for communication systems by enabling per-antenna dynamic boresight adjustment, which is attractive for fairness-oriented multicast transmission. This letter investigates an RA-enhanced downlink multi-group multicast system. Specifically, we aim to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among all users by jointly optimizing the multicast beamforming vectors and the RA boresight directions under transmit power and rotation constraints. To solve this non-convex problem, we first reformulate the max-min SINR objective via quadratic transform. Then, we develop an alternating optimization (AO) algorithm that iteratively updates the multicast beamforming and RA boresight directions. The beamforming vectors are obtained from a convex subproblem, while the boresight directions are refined using a successive convex approximation (SCA) procedure. Simulation results verify that the proposed RA-based scheme substantially enhances the fairness performance compared with fixed antenna-based and random-orientation benchmarks.
Read the full abstract
Numerical Analysis
Average block nonlinear Kaczmarz methods with adaptive momentum for nonlinear systems of equations
The Kaczmarz method is widely recognized as an efficient iterative algorithm for solving large-scale linear systems, owing to its simplicity and low memory requirements. However, the development of its nonlinear extensions for solving large-scale nonlinear systems has seen limited progress. In this work, we introduce a new family of momentum-accelerated averaging block nonlinear Kaczmarz methods tailored for large-scale nonlinear systems and ill-posed problems. Our contributions are twofold: (1) We develop an adaptive strategy for selecting step sizes and momentum coefficients, leading to a new average block nonlinear Kaczmarz method with adaptive momentum (ABNKAm). This algorithm achieves high computational efficiency by requiring only minimal inner-product computations per iteration, which significantly reduces both arithmetic complexity and memory usage. (2) We establish rigorous convergence of the ABNKAm under mild assumptions, proving that the method converges exponentially to the unique solution nearest to the initial point. Moreover, under suitable conditions, we provide a theoretical justification of acceleration of the proposed ABNKAm with momentum. Extensive numerical experiments demonstrate that ABNKAm outperforms existing nonlinear Kaczmarz variants in terms of both iteration count and computational time, with particularly notable gains in large-scale problems.
Read the full abstract
Combinatorics
The Bollobás–Nikiforov Conjecture for Complete Multipartite Graphs and Dense $K_4$-Free Graphs
The Bollobás–Nikiforov conjecture asserts that for any graph $G \neq K_n$ with $m$ edges and clique number $\omega(G)$, \[ \lambda_1^2(G) + \lambda_2^2(G) \;\leq\; 2\!\left(1 - \frac{1}{\omega(G)}\right)m, \] where $\lambda_1(G) \geq \lambda_2(G) \geq \cdots \geq \lambda_n(G)$ are the adjacency eigenvalues of $G$. We prove the conjecture for all complete multipartite graphs $K_{n_1,\ldots,n_r}$ with $n_1 + \cdots + n_r > r$. The proof computes the full spectrum via a secular equation, establishes that $\lambda_2 = 0$ whenever the graph has more vertices than parts, and then applies Nikiforov's spectral Turán theorem; equality holds if and only if all parts have equal size. We also prove a stability result for $K_4$-free graphs whose spectral radius is near the Turán maximum: such graphs are structurally close to the balanced complete tripartite graph, and as a consequence the conjecture holds for all $K_4$-free graphs with $m = \Omega(n^2)$ when $n$ is sufficiently large. Finally, we identify the precise obstruction preventing a Hoffman-bound approach from settling the conjecture for $K_4$-free graphs with independence number $\alpha(G) \geq n/3$.
Read the full abstract
Dynamical Systems
Invertibility, Often
By using a similar pattern of arguments, we show that in four categories the collection of isomorphisms forms a residual subset of the space of morphisms. We first consider surjective continuous mappings on Cantor spaces. Next, we look at measure preserving maps on Polish measure spaces. We then consider the $L^1$ representations of nonsingular maps on Polish measure spaces. Finally, we examine continuous, measure preserving maps on Cantor spaces equipped with so-called good measures.
Read the full abstract
Analysis of PDEs
Dynamics of focusing nonlinear Schrödinger equation with partial harmonic confinement in higher dimensions
We study the following focusing intercritical nonlinear Schrödinger equation with partial harmonic confinement: \begin{equation*} \begin{cases} i\partial_t u+\Delta_{z}u-y^2 u =- |u|^{\alpha}u,\quad t\in \mathbb{R},\newline u(0,z)= u_0(z), \ z=(x,y)\in \mathbb{R}^d\times \mathbb{R}, \end{cases} \end{equation*} where $d \geq 1 $ is an integer and the exponent $\alpha$ satisfies \begin{equation}\label{assumption} \frac{4}{d}< \alpha<\begin{cases} \frac{4}{d-1}, \,\,\, \text{if} ~~ d\geq 2; \newline + \infty,\,\,\, \text{if} ~~ d=1. \end{cases} \end{equation} For this model, A. Ardia and R. Carles [Comm. Math. Sci. 19 (2021), 993-1032] established a sharp scattering result below the ground state threshold in dimensions $d \leq 4$ via the concentration-compactness and rigidity argument. However, their approach breaks down in higher dimensions due to the lack of smoothness in the nonlinearity. In this paper, we introduce a new strategy that removes this dimensional restriction and extend their results to higher dimensions by circumventing the concentration-compactness principle. The main ingredients of our work are the interaction Morawetz-Dodson-Murphy estimates and an alternative variational characterization of the ground state threshold.
Read the full abstract
Representation Theory
Associated varieties of integral minimal highest weight modules
Let $\mathfrak{g}$ be a complex simple Lie algebra and $L(\lambda)$ be a simple highest weight module of $\mathfrak{g}$ with highest weight $\lambda-\rho$, where $\rho$ is half the sum of positive roots. A simple $\mathfrak{g}$-module $L_w:=L(-w\rho)$ is called integral minimal if the associated variety of its annihilator ideal equals the closure of the unique minimal special nilpotent orbit. In this paper, we find that the associated variety of any integral minimal module $L_w$ is irreducible and equal to the orbital variety corresponding to a minimal-length element in the Kazhdan–Lusztig right cell containing $w$.
Read the full abstract
Dynamical Systems · Cross-listed from q-bio.QM
Multi-scale Metabolic Modeling and Simulation
Biological systems are governed by coupled interactions between intracellular metabolism and bioreactor operation that span multiple time scales. Constraint-based metabolic models are widely used to describe intracellular metabolism, but repeatedly solving the optimization problem at each time step in dynamic models introduces numerical challenges related to infeasibility and computational efficiency. This work presents a multi-scale modeling framework that integrates genome-scale, constraint-based metabolic models with dynamic bioreactor simulations. Intracellular metabolism is described using positive flux variables in a parsimonious flux balance analysis, and the resulting embedded optimization problem is replaced by a neural network surrogate. The surrogate provides a smooth approximation of the embedded optimization mapping and eliminates repeated linear program solves during simulation. The approach is demonstrated for fed-batch fermentation of Escherichia coli, in which the surrogate model yields intracellular fluxes under substrate-limited conditions, whereas the underlying linear program would otherwise be infeasible. The framework provides a continuous representation of intracellular metabolism suitable for dynamic simulation of genome-scale models in bioreactor configurations.
Read the full abstract
Statistics Theory
Validating spatial-temporal separability for stationary processes
A crucial assumption to reduce computational complexity in spatial-temporal data analysis is separability, which factors the covariance structure into a purely spatial and a purely temporal component. In this paper, we develop statistical inference tools for validating this assumption for a second-order stationary process under both domain-expanding-infill asymptotics and domain-expanding asymptotics. In contrast to previous work on this subject, the methodology neither requires the assumption of normally distributed data, nor uses spectral methods. Our approach is based on nonparametric estimates of measures for the deviation between the covariance matrix and separable approximations, which vanish if and only if the assumption of separability is satisfied. We derive the asymptotic distributions of appropriate estimators for these measures with non-standard limiting distributions and use these results to develop inference tools for validating the assumption of separability. More specifically, we derive confidence intervals for the deviation measures, tests for the hypothesis of exact separability, and for the hypothesis that the deviation from separability is smaller than a prespecified threshold.
Read the full abstract
Representation Theory
The Image of Functor Morphing
Functor morphing provides a method to translate complex representations of automorphism groups of finite modules over finite rings to representations of automorphism groups of functors in some abelian category. In this paper we give an explicit criterion for a representation to be in the image of functor morphing using the action of parabolic subgroups. We then demonstrate this criterion on Borel groups of finite fields.
Read the full abstract
Geometric Topology
Combinatorial link concordance using cut-diagrams
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an equivalence relation called cut-concordance, which encompasses the topological notion of concordance for classical links. Our main result is that the nilpotent peripheral system of 1-dimensional cut-diagrams is an invariant of cut-concordance, giving along the way a combinatorial version of a theorem of Stallings. We also investigate the relationship with several other equivalence relations in diagrammatic knot theory, in particular in connection with link-homotopy.
Read the full abstract
Number Theory
Gcd-closed sets and divisibility among power GCD matrices and power LCM matrices
Let $a, b$ and $n$ be positive integers and let $S=\{x_1, \cdots, x_n\}$ be a set of $n$ distinct positive integers. We denote by $(S^a)$ (resp. $[S^a]$) the $n\times n$ matrix having the $a$th power of the greatest common divisor (resp. the least common multiple) of $x_i$ and $x_j$ as its $(i,j)$-entry. For any $x\in S$, let $G_{S}(x) :=\{d\in S: d<x, d|x \ {\rm and} \ (d|y|x, y\in S)\Rightarrow y\in \{d,x\}\}$. In this paper, we first establish some interesting and important arithmetic properties of gcd-closed sets satisfying the condition $\mathcal{G}$ (i.e., for any element $x\in S$, either $G_S(x)$ contains at most one element, or $G_S(x)$ contains at least two elements and satisfies that $[y_1,y_2]=x$ and $(y_1,y_2)\in G_S(y_1)\cap G_S(y_2)$ for any $\{y_1,y_2\}\subseteq G_S(x)$), and then make use of these results to show that $(S^a)|(S^b)$ and $(S^a)|[S^b]$ when $a|b$ and $S$ is a gcd-closed set satisfying the condition $\mathcal{G}$. This confirms a conjecture of Hong proposed in [S.F. Hong, Divisibility among power GCD matrices and power LCM matrices, Bull. Aust. Math. Soc. 113 (2026), 231-243].
Read the full abstract
Algebraic Geometry
Coble surfaces: projective models and automorphisms with related topics
In this work, we want to show several properties of an unnodal, complex Coble surface $X$ with irreducible boundary curve $C \in |-2 K_X|$. Namely, we show that every isotropic sequence ${\cal E}_1, \ldots, {\cal E}_r$ with $r \le 8$ and ${\cal E}_i {\cal E}_j = 1 - \delta_{i, j}$ can be extended to a sequence of length $10$. Moreover, such a surface admits a birational quintic model $\overline X \subset \mathbb{P}^3$, with equation $\alpha X_0 X_1^2 X_2^2 + \beta X_0 X_1^2 X_3^2 + \gamma X_0 X_2^2 X_3^2 + X_1 X_2 X_3 q = 0$, where $q$ is a quadric form. Finally, we use this birational model to show that every biregular involution $i : X \to X$ on such a Coble surface is the lift of a Bertini involution.
Read the full abstract
Functional Analysis
On a minimal Andô dilation for a pair of strict contractions
The isometric dilation of a pair of commuting contractions due to Andô is not minimal. We modify Andô's dilation and construct a minimal isometric dilation on $\mathcal H \oplus_2 \ell_2(\mathcal H \oplus_2 \mathcal H)$ for a commuting pair of strict contractions on a Hilbert space $\mathcal H$. In the same spirit, we construct under certain conditions a minimal Andô dilation for a commuting pair of strict Banach space contractions. Further, we show that an Andô dilation is possible even for a more general pair of commuting contractions $(T_1,T_2)$ on a normed space $\mathbb X$ provided that the function $A_{T_i}: \mathbb X \rightarrow \mathbb R$ given by $A_{T_i}(x)=(\|x\|^2-\|T_ix\|^2)^{\frac{1}{2}}$ defines a norm on $\mathbb X$ for $i=1,2$.
Read the full abstract
Probability
Regularity of Gibbs measures for unbounded spin systems on general graphs
We consider a general class of spin systems with potentially unbounded real-valued spins, defined via a single-site potential with super-Gaussian tails on general graphs, allowing for both short- and long-range interactions. This class includes all $P(\varphi)$ models, in particular the well-studied $\varphi^4$ model. We construct an infinite-volume extremal measure called the plus measure as the limit of finite-volume Gibbs measures with weakly growing boundary conditions and show that it is regular, in the sense that it admits a bounded Radon-Nikodym derivative with respect to a product measure of single-site distributions with super-Gaussian tails. Moreover, we provide an alternative construction of the plus measure as the limit of finite-volume Gibbs measures that are regular up to the boundary. As a key intermediate step, we establish regularity and tightness of finite-volume Gibbs measures for a large class of growing boundary conditions $\xi$. Our regularity estimates are encoded in terms of a function $A(\xi)$, which provides precise control on the change of measure induced by boundary perturbations, and can thus be viewed as an analogue of the Cameron-Martin theorem for non-Gaussian fields. In the nearest-neighbour case, this class includes boundary conditions that grow at most double-exponentially in the distance to the boundary when the single-site measure has tails of the form $e^{-a|u|^n}$ for some $n>2$.Our results apply to arbitrary graphs and improve upon earlier results of Lebowitz and Presutti, and Ruelle, which apply in the context of $\mathbb{Z}^d$ and allow only logarithmically growing boundary conditions, as well as subsequent extensions to vertex-transitive graphs of polynomial growth.
Read the full abstract
Rings and Algebras
The structure of $\mathbb{Z}_nG$ and its unit group
This article determines the structure of the group ring $\mathbb{Z}_nG$, where $G$ is a finite group and $\mathbb{Z}_n$ is the ring of integers modulo $n$, such that $n$ is relatively prime to the order of $G$. The decomposition of $\mathbb{Z}_nG$ is given as a direct sum of matrix rings over Galois rings, thereby extending the structural theory of group rings beyond the classical field setting. We also provide a method to compute a generating set of the unit group $\mathcal{U}(\mathbb{Z}_nG)$, in terms of elementary matrices, using Shoda pair theory. The results are illustrated with examples.
Read the full abstract
Functional Analysis
Rigidity of the structured singular value and applications
The structured singular value $\mu_E$ for a linear subspace $E$ of $M_n(\mathbb C)$ is defined by \[ \mu_E(A)=1 / \inf\{\|X\| \ : \ X \in E, \ \det(I_n-AX)=0 \} \quad (A \in M_n(\mathbb{C})), \] and $\mu_E(A)=0$ if there is no $X \in E$ with $\det(I_n-AX)=0$. It is well-known that $\mu_E(A)$ coincides with the spectral radius $r(A)$ when $E=\{cI_n: c \in \mathbb C \}$ and $\mu_E(A)=\|A\|$ when $E=M_n(\mathbb C)$, for all $A\in M_n(\mathbb C)$. Also, for any linear subspace $E$ satisfying $\{cI_n: c \in \mathbb C \} \subseteq E \subseteq M_n(\mathbb C)$, we have $r(A)\leq \mu_E(A) \leq \|A\|$. We prove that if $E=\{cI_n: c \in \mathbb C \}$ and $F$ is any linear subspace of $M_n(\mathbb C)$ containing $E$, then $\mu_E=\mu_F$ if and only if $E=F$. We prove the exact same rigidity theorem for the linear subspace consisting of the diagonal matrices of order $n$. On the contrary, when $E=M_n(\mathbb C)$, we show that there is a proper subspace $F$ of $M_n(\mathbb C)$, viz. the space of symmetric matrices such that $\mu_E=\mu_F=$ operator norm. Further, we characterize all linear subspaces $F\subseteq M_n(\mathbb C)$ such that $\mu_F$ coincides with the operator norm. Next, we show that in general there is no subspace $E$ of $M_n(\mathbb C)$ such that $\mu_E=$ the numerical radius, not even for $M_2(\mathbb C)$. We establish the rigidity of the structured singular value for each of the subspaces $E$ of $M_2(\mathbb C)$ such that the corresponding $\mu_E$-unit ball induces the domains – symmetrized bidisc, tetrablock, pentablock, hexablock.
Read the full abstract
Probability
The Incompressible Navier–Stokes–Fourier System with Thermal Noise
We establish a solution theory for the incompressible Navier–Stokes–Fourier system with thermal noise, posed on the three-dimensional torus. While in the incompressible deterministic setting the equation for the velocity can be solved independently of the temperature, the inclusion of the effects of thermal fluctuations by means of the GENERIC framework leads to a nonlinear gradient noise term, which couples the dynamics of both variables. Therefore, the analysis poses new challenges, which are absent in the deterministic incompressible Navier–Stokes–Fourier equations. In particular, the a priori estimates used in the deterministic setting are not readily generalizable, the noise introduces strongly nonlinear gradient terms and the total energy lacks convexity. These challenges are overcome in the present work by a novel variable transformation, and novel entropy dissipation estimates. Thereby, the existence of global-in-time weak solutions for $L_x^2$ initial data, the existence of local-in-time strong solutions for regular initial data, and weak-strong uniqueness are obtained.
Read the full abstract
Optimization and Control
A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
This work addresses arbitrary convex vector optimization problems, which constitute a general framework for multi-criteria decision-making in diverse real-world applications. Due to their complexity, such problems are typically tackled using polyhedral approximation. Existing solution concepts rely on additional assumptions, such as boundedness, polyhedrality of the ordering cone, or existence of interior points in the ordering cone, and typically focus on absolute error measures. We introduce a solution concept based on the homogenization of the upper image that employs relative error measures and avoids additional structural assumptions. Although minimality is not explicitly required, a form of approximate minimality is implicitly ensured. The concept is straightforward, requiring only a single precision parameter and, owing to relative errors, remains robust under scaling of the target functions. Homogenization also eliminates the need for the binary distinction between points far from the origin and directions which can lead to numerical difficulties. Furthermore, in practice decision-makers often identify a region where preferred solutions are expected. Our concept supports both a global overview of the upper image and a refined local perspective within such a user-defined region of interest (RoI).We present a decision-making procedure enabling iterative refinement of this region and the associated preferences.
Read the full abstract
Probability
Spectral gap of biased adjacent-transposition chains
We establish a sharp lower bound on the spectral gap of the biased adjacent-transposition Markov chain on the symmetric group. As a consequence, we resolve a longstanding conjecture of Fill, proving that among all regular probability vectors, the minimum spectral gap of the transition matrix is attained by the uniform probability vector. We also characterise the regular probability vectors attaining the minimum spectral gap and determine the exact multiplicity of the corresponding second-largest eigenvalue. Our proof relies on a novel algebraic decomposition of the transition matrix into elementary orthogonal projections.
Read the full abstract
Functional Analysis
Special N-extremal solutions to indeterminate moment problems
For an N-extremal solution $\mu$ to an indeterminate moment problem it is known by a theorem of M. Riesz that the measure $(1+x^2)^{-1}d\mu(x)$ is determinate. For $0<\alpha<1$ we show by contradiction that there exist indeterminate N-extremal solutions $\mu$ such that $(1+x^2)^{-\alpha}d\mu(x)$ is determinate, and there exist also indeterminate N-extremal solutions $\mu$ such that $(1+x^2)^{-\alpha}d\mu(x)$ is indeterminate. Explicit examples of such measures are so far only known when $\alpha=1/2$. For indeterminate Stieltjes moment problems and for N-extremal solutions $\mu$, we show that $(1+x^2)^{-1/2}d\mu(x)$ is indeterminate except when $\mu=\mu_F$ is the Friedrichs solution in case of which $(1+x^2)^{-1/2}d\mu_F(x)$ is determinate. We identify the Friedrichs and Krein solutions for some indeterminate Stieltjes moment problems.
Read the full abstract
Combinatorics · Cross-listed from stat.ME
Complete Causal Identification from Ancestral Graphs under Selection Bias
Many causal discovery algorithms, including the celebrated FCI algorithm, output a Partial Ancestral Graph (PAG). PAGs serve as an abstract graphical representation of the underlying causal structure, modeled by directed acyclic graphs with latent and selection variables. This paper develops a characterization of the set of extended-type conditional independence relations that are invariant across all causal models represented by a PAG. This theory allows us to formulate a general measure-theoretic version of Pearl's causal calculus and a sound and complete identification algorithm for PAGs under selection bias. Our results also apply when PAGs are learned by certain algorithms that integrate observational data with experimental data and incorporate background knowledge.
Read the full abstract
Numerical Analysis
Improving Sketching Algorithms for Low-Rank Matrix Approximation via Sketch-Power Iterations
Power iteration can improve the accuracy of randomized SVD, but requires multiple data passes, making it impractical in streaming or memory-constrained settings. We introduce a lightweight yet effective sketch-power iteration, allowing power-like iterations with only a single pass of the data, which can be incorporated into one-pass algorithms for low-rank approximation. As an example, we integrate the sketch-power iteration into a one-pass algorithm proposed by Tropp et al., and introduce strategies to reduce its storage cost. We establish meaningful error bounds: given a fixed storage budget, the sketch sizes derived from the bounds closely match the optimal ones observed in reality. This allows one to preselect reasonable parameters. Numerical experiments on both synthetic and real-world datasets indicate that, under the same storage constraints, applying one or two sketch-power iterations can substantially improve the approximation accuracy of the considered one-pass algorithms. In particular, experiments on real data with flat spectrum show that the method can approximate the dominant singular vectors well.
Read the full abstract
Optimization and Control
Monotone 2D Integration Scheme for Mean-CVaR Optimization via Fourier-Trained Transition Kernels
We present a strictly monotone, provably convergent two-dimensional (2D) integration method for multi-period mean-conditional value-at-risk (mean-CVaR) reward-risk stochastic control in models whose one-step increment law is specified via a closed-form characteristic function (CF). When the transition density is unavailable in closed form, we learn a nonnegative, normalized 2D transition kernel in Fourier space using a simplex-constrained Gaussian-mixture parameterization, and discretize the resulting convolution integrals with composite quadrature rules with nonnegative weights to guarantee monotonicity. The scheme is implemented efficiently using 2D fast Fourier transforms. Under mild Fourier-tail decay assumptions on the CF, we derive Fourier-domain $L_2$ kernel-approximation and truncation error estimates and translate them into real-space bounds that are used to establish $\ell_\infty$-stability, consistency, and pointwise convergence as the discretization and kernel-approximation parameters vanish. Numerical experiments for a fully coupled 2D jump–diffusion model in a multi-period portfolio optimization setting illustrate robustness and accuracy.
Read the full abstract
Commutative Algebra
On triviality of $\mathbb{A}^2$-forms admitting a nontrivial $\mathbb{G}_a$-action
T. Kambayashi had shown that $\mathbb{A}^2$-forms over separable field extensions are necessarily polynomial rings. However, there exist inseparable $\mathbb{A}^2$-forms which are not necessarily polynomial rings. In this paper, we give a structure theorem for $\mathbb{A}^2$-forms over arbitrary field extensions admitting a nontrivial $\mathbb{G}_a$-action. From this structure theorem we derive some conditions under which an $\mathbb{A}^2$-form becomes trivial. In particular, we prove that over a field $k$, a factorial $\mathbb{A}^2$-form having a $k$-rational point and a non-trivial $\mathbb{G}_a$-action is trivial and we also give examples demonstrating that none of these hypotheses can be discarded. As a consequence of the structure theorem, we obtain a generalization of the Zariski Cancellation Theorem for the affine plane over an arbitrary field.
Read the full abstract
Numerical Analysis
A Galerkin Finite Element Method for the Fractional Calderón Problem
We study a numerical reconstruction strategy for the potential in the fractional Calderón problem from a single partial exterior measurement. The forward model is the fractional Schrödinger equation in a bounded domain, with prescribed exterior Dirichlet datum and corresponding measurement of the exterior flux in an open observation set. Motivated by single-measurement uniqueness results based on unique continuation \cite{ghosh2020uniqueness}, we propose a decomposition strategy and a Galerkin–Tikhonov method to recover the potential by a stabilized least-squares quotient in a dedicated coefficient space. We prove the existence and uniqueness of the discrete reconstructor and establish conditional convergence under natural consistency and parameter choice assumptions. We further derive a priori error estimates for the reconstructed state and for the coefficient reconstruction, and combine the latter with logarithmic stability for the continuous inverse problem to obtain a total coefficient error bound. The framework cleanly separates the forward solver from the inverse reconstruction step and is compatible with practical truncation and quadrature schemes for the integral fractional Laplacian. Numerical experiments in one and two space dimensions illustrate stability with respect to noise and demonstrate reconstructions of both smooth and discontinuous potentials.
Read the full abstract
Mathematical Physics
Asymptotic correlation functions of Coulomb gases on an annulus
Two-dimensional Coulomb gases on an annulus at a special inverse temperature $\beta = 2$ are studied by using the orthogonal polynomial method borrowed from the theory of random matrices. The correlation functions among the Coulomb gas molecules are written in determinant forms and their asymptotic forms in the thermodynamic limit are evaluated. When the Coulomb gas system has a continuous rotational symmetry, the corresponding orthogonal polynomials are monomials, and one can see a universal behavior of the correlation functions in a thin annulus limit. In a system with a discrete rotational symmetry, the corresponding orthogonal polynomials are not in general monomials, and a breakdown of the universality is observed.
Read the full abstract
Spectral Theory
On Courant-like bound for Neumann domain count
In this work we show that in general there is no Courant-like bound for Neumann domain count. In order to do that we construct a sequence of domains $\Omega^n$ such that the first Dirichlet eigenfunction for $\Omega^n$ has at least $n$ Neumann domains. Also a special case of convex domains is considered and sufficient conditions for existence of Courant-like bound for small eigenvalues are found.