Information Theory · Cross-listed from cs.LG
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 13 April
Conformal selection (CS) uses calibration data to identify test inputs whose unobserved outcomes are likely to satisfy a pre-specified minimal quality requirement, while controlling the false discovery rate (FDR). Existing methods fix the target FDR level before observing data, which prevents the user from adapting the balance between number of selected test inputs and FDR to downstream needs and constraints based on the available data. For example, in genomics or neuroimaging, researchers often inspect the distribution of test statistics, and decide how aggressively to pursue candidates based on observed evidence strength and available follow-up resources. To address this limitation, we introduce post-hoc CS (PH-CS), which generates a path of candidate selection sets, each paired with a data-driven false discovery proportion (FDP) estimate. PH-CS lets the user select any operating point on this path by maximizing a user-specified utility, arbitrarily balancing selection size and FDR. Building on conformal e-variables and the e-Benjamini-Hochberg (e-BH) procedure, PH-CS is proved to provide a finite-sample post-hoc reliability guarantee whereby the ratio between estimated FDP level and true FDP is, on average, upper bounded by 1, so that the average estimated FDP is, to first order, a valid upper bound on the true FDR. PH-CS is extended to control quality defined in terms of a general risk. Experiments on synthetic and real-world datasets demonstrate that, unlike CS, PH-CS can consistently satisfy user-imposed utility constraints while producing reliable FDP estimates and maintaining competitive FDR control.
Number Theory
Branched covers of $\mathbb{P}^1$ and divisibility in class group
We start with $n$-torsions in the Jacobian of an $m$-gonal curve and produce $n$-torsions in the class group of certain number field $K$.
Statistics Theory
Detection and Mode-Identification of Multiple Change Points in Tensor Factor Models
We study the problem of modeling high-dimensional tensor-valued time series under a Tucker decomposition-based factor model while permitting the presence of multiple structural change points. Such data call for a method that (i) handles high dimensionality and complex dependence while achieving consistency in multiple change points and further, (ii) addresses a unique challenge posed by the multi-dimensional array setting, of identifying the modes associated with each change while the shifts in different modes interact with one another. To this end, we propose a change point detection procedure utilizing the low-rank structure of the data for statistical and computational efficiency. In addition, we formalize the $\textit{mode-identifiability}$ of each change and propose an algorithm for detecting the modes at which the data undergo a mode-identifiable shift. We establish the consistency of both change point detection and mode-identification methods under a weak moment condition, and demonstrate their good performance on simulated datasets where, in particular, it is shown that the mode-identification step can improve the post-segmentation estimation of the mode-wise loading space. We also analyze the datasets on New York City taxi usage and Fama–French portfolio returns using the proposed suite of methods.
Read the full abstract
Number Theory
A Fixed-Prime Criterion for Reciprocals in Missing-Digit Sets
We prove a structural upper bound on the $p$-adic valuation of denominators of rationals belonging to a missing-digit set $K_{m,D}$, generalizing a key step in recent work of Lin, Wu, and Yang [arXiv:2603.24614] on reciprocals of factorials. For a rational $\frac{r}{Q}$ with $\gcd(Q,m)=1$ and a fixed prime $p_0\nmid m$, membership in $K_{m,D}$ forces $\nu_{p_0}(Q)$ to be controlled by the $p_0$-adic valuation of the multiplicative order of $m$ modulo the radical of $Q$, with explicit overhead depending only on $m$ and $D$. Because the obstruction is stated at the level of a single denominator, a pair of sequence-specific valuation estimates converts it into an effective finiteness criterion for $\left\{\frac{1}{a_n}:n\in\mathbb{N}\right\}\cap K_{m,D}$. Specializing to the case in which $Q$ is the part of $n!$ coprime to $m$ recovers the fixed-prime step in the Lin–Wu–Yang argument. As applications, we treat reciprocals of superfactorials, products of polynomial values, and products of Fibonacci numbers. We also exhibit an exponential family – products of $(m^k-1)$ – for which the full structural criterion applies but a coarser largest-prime-factor formulation does not.
Read the full abstract
Functional Analysis
A twosided linear estimate and a dyadic reduction of the UMD Conjecture
We define a time faithful dyadic shift operator of complexity one, that is an antisymmetric antiinvolution. We show that the Hilbert transform with values in a Banach space is $L^p$ bounded if and only if the dyadic shift is – with a linear two sided norm dependence. The results reduce the famous UMD conjecture to a pair of simple dyadic operators.
Read the full abstract
Optimization and Control
Data-driven balanced truncation of K-power bilinear systems
As a special type of bilinear systems, K-power bilinear systems possess a special coupled structure along with nice properties in practice. In this paper, we investigate the data-driven counterpart of balanced truncation for K-power systems. As the standard balanced truncation is performed based on the subsystems of K-power systems, the main idea is to approximate the quantities of each reduced subsystem with the evaluations of transfer functions. We exploit the nice properties of Gramians for K-power systems, and establish the explicit relationship between the main quantities of balanced truncation and the evaluation of transfer functions. As a result, reduced models produced via balanced truncation can be assembled approximately by the sample data of transfer functions, leading to a data-driven balancing truncation method for K-power systems. An advanced procedure is also provided to avoid the complex arithmetic completely and produce real-valued reduced models. Two numerical examples confirm the feasibility and effectiveness of the proposed method.
Read the full abstract
Combinatorics · Cross-listed from cs.DM
Analyzing Network Robustness via Residual Closeness
Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a particular focus on the middle graph representations of certain special graph classes, which provide a richer structural framework for analysis. We derive exact expressions for the closeness values of these middle graphs and determine their residual closeness under vertex failures. By utilizing results obtained from specific graph families, we establish several general bounds for broader graph classes. Furthermore, by exploiting the relationship between the closeness of a graph, its line graphs and middle graphs, we obtain new results that relate these three structures. In addition, we present a computational procedure for evaluating closeness and vertex residual closeness in middle graphs, together with numerical verification of selected theoretical results and an analysis of its computational complexity.
Read the full abstract
Analysis of PDEs
Long-time behavior of a nonlocal and non-monotone SPDE-ODE system arising in electrophysiology
This paper concerns a coupled semilinear SPDE-ODE system modelling the electropermeabilization phenomenon, which designates a transient increase in cell membrane permeability induced by short, high-voltage electric pulses. We present a stochastically perturbed electroporation model that couples electrostatic equations for the electric potential in the extra- and intracellular domains and a nonlinear evolution law for the transmembrane potential jump with an ordinary differential equation describing the porosity degree of the membrane. We prove the existence and uniqueness of a variational solution of the resulting coupled stochastic PDE-ODE system. Its long-time behavior is governed by the corresponding invariant measure for which we establish the regularity of its support. The ergodicity of this invariant measure is further established for a truncated nonlinear reaction term, corresponding to the case of a bounded electric potential. The main technical challenge arises from the nonlinear reaction term, which is neither Lipschitz continuous nor locally monotone. We also present a numerical example, computing the solution and its time averages for both additive and multiplicative noise, that provides an indication for the existence of an invariant measure.
Read the full abstract
Differential Geometry
Sub-Riemannian Snakes on the Projective Line Bundle with Applications to Segmentation of SEM Images
Geodesic tracking on the projective line bundle $\R^2 \times P^1 $ has many uses, including the segmentation of objects in images. However, global tracking requires expensive distance map computations. We provide a practical solution to this problem by introducing a snake model on $\R^2 \times P^1$, where we only compute the distance map where needed. Our method introduces a geometric criterion for switching between fast spatial snakes and computing minimizing geodesics of a new projective line bundle model. The new pseudo-distance underlying our geometric model is both symmetric and cusp-free, in contrast to previous geodesic sub-Riemannian models on $\R^2 \times P^1$. Our pseudo-distance satisfies the triangle inequality on a large set that we characterize, and includes a connected-component-informed cost function, which is highly advantageous in applications. Experiments on Scanning Electron Microscopy (SEM) images demonstrate our method's robust, automatic segmentation of overlapping electronic structures.
Read the full abstract
Rings and Algebras
Homological properties of simple modules over Leavitt path algebras
Let $K$ be any field, and let $E$ be any graph. We explicitly construct the projective resolution of simple left modules over the Leavitt path algebra $L_K(E)$ associated to cycles and irreducible polynomials. Then we study the dimension of the $K$-vector space of the extensions between two such simple modules.
Read the full abstract
Representation Theory
Pro-$p$ Iwahori-Hecke modules in semisimple rank one and singularity categories
Let $\mathfrak{F}$ be a non-archimedean local field of residue characteristic $p$ and $G$ be one of the groups $\mathrm{GL}_2(\mathfrak{F})$, $\mathrm{SL}_2(\mathfrak{F})$ or $\mathrm{PGL}_2(\mathfrak{F})$. Let $\mathcal{H}_G$ denote the pro-$p$ Iwahori-Hecke algebra of $G$ over $\overline{\mathbb{F}}_p$. We study the homotopy category $\mathrm{Ho}(\mathcal{H}_G)$ of Hovey's Gorenstein projective model structure on the category of $\mathcal{H}_G$-modules and relate it to the singularity category $\mathrm{Sing}(X_{q,\mathbf{G}})$ of an explicit scheme. When $G=\mathrm{GL}_2(\mathfrak{F})$, this scheme was first introduced by Dotto-Emerton-Gee \cite{DEG22}. We obtain in that case an equivalence $\mathrm{Ho}(\mathcal{H}_{\mathrm{GL}_2})\simeq \mathrm{Sing}(X_{q,\mathrm{GL}_2})$ and recover from this Grosse-Klönne's mod-$p$ Langlands correspondence for Hecke modules \cite{GK20}, building on work of Pépin-Schmidt \cite{PeSch25_2}. We furthermore describe $\mathrm{Ho}(\mathcal{H}_G)$ completely explicitly when $G=\mathrm{SL}_2(\mathfrak{F})$ or $\mathrm{PGL}_2(\mathfrak{F})$, and make additional computations in the $\mathrm{GL}_2$ case.
Read the full abstract
Functional Analysis
A Fixed Point Theorem for Random Asymptotically Pointwise Contractions
This paper combines the decomposition technique ($\sigma$-stability) in random functional analysis with the deterministic theory of asymptotically pointwise contractions to provide a complete self-contained derivation of a fixed point theorem for random asymptotically pointwise contractions. We assume the contraction function is linear $\psi(t)=\lambda t$ ($\lambda<1$) and focus on the linear case under the assumption that $G$ is bounded. By choosing $p$ sufficiently large so that $5^{1/p}\lambda<1$, we apply the deterministic theorem in $L^p(E)$. The paper gives detailed explanations of concepts such as random normed modules, the $(\epsilon,\lambda)$-topology, and $\sigma$-stability, and reviews the historical development of fixed point theory in the introduction.
Read the full abstract
Information Theory
Prior-Guided Movable Antenna Control for Agile Multi-Path Sensing (extended version)
Multi-path sensing, which aims to extract the geometric attributes of multiple propagation paths, is expected to be a key functionality of 6G. A movable antenna (MA) can enable this functionality by creating a synthetic aperture through sequential mechanical motion. However, existing MA-based sensing methods typically rely on exhaustive scanning over the entire movable plate, resulting in significant control overhead and sensing latency, which limits their practicality for agile sensing. To address this challenge, this paper develops a prior-guided agile multi-path sensing framework that leverages weak prior angle-of-arrival (AoA) statistics as side information. The proposed framework comprises two steps. First, the movable plate's three-dimensional orientation is optimized only once to maximize path visibility while preserving path discriminability, both induced from Fisher information analysis. Second, only two predetermined linear MA scans are made on the tilted plate to estimate the elevation and azimuth AoAs from the resulting sequence of received signals. By incorporating the prior AoA statistics, a maximum a posteriori (MAP)-based AoA estimation algorithm is developed. With only one orientation control and two linear scans, the proposed framework enables agile multi-path sensing with significantly reduced control overhead and latency, while achieving AoA estimation accuracy approaching that of the single-path benchmark.
Read the full abstract
Complex Variables
Bounds for the Zeros of Quaternionic Polynomials via Matrix Methods
In this paper, we derive new bounds for the zeros of quaternionic polynomials by applying localization theorems, which includes Gershgorin-type theorems for the left eigenvalues of matrices of left monic quaternionic polynomials. These results yield sharper estimates compared to existing bounds, including improvements upon Cauchy, Fujiwara and Opfer's classical bounds. Second, we develop a matrix norm approach utilizing block matrix techniques and spectral norm estimates for a specially constructed auxiliary poly nomial. This method provides additional upper bounds for polynomial zeros through careful analysis of the companion matrix's spectral radius. The comparison between the new bounds and some existing bounds have been illustrated with several examples. At the end of the paper we have given an algorithm. We have also given a Python code that predicts, for a given input which theorem will yield the sharpest upper bound. The combination of these approaches enhances the theoretical toolkit for analyzing quaternionic polynomials and offers potential applications in numerical methods, signal processing, and quaternionic quantum mechanics where zero location problems naturally arise.
Read the full abstract
Differential Geometry
Uniformisation of complete Kähler surfaces with positive sectional curvature
We prove that any complete non-compact Kähler surface with positive sectional curvature is biholomorphic to $\mathbb{C}^2$, establishing the two dimensional case of the weaker form of Yau's uniformisation conjecture. In contrast to all previous results, no assumptions are made on the geometry at infinity. The proof introduces a new approach towards Yau-type uniformisation problems, based on uniformly Lipschitz plurisubharmonic weight functions with finite Monge-Ampère mass, and weighted $L^p$ holomorphic functions. A central difficulty is that these weights are neither smooth nor proper. As a consequence of the method, we also obtain Bézout-type intersection and multiplicity estimates in considerable generality. In a different direction, we also prove a new obstruction to the existence of complete Kähler metrics with non-negative bisectional curvature on non-compact Kähler manifolds, and use it to construct new examples admitting no such metrics. We conclude by discussing possible extensions of our methods to higher dimensions and related open problems.
Read the full abstract
Complex Variables
Bounds for the Zeros of Polynomials over Quaternion Division Algebra
Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more complex than the classical complex case. In this paper, we develop new bounds for the zeros of polynomials with quaternionic coefficients. We establish spectral norm inequalities for quaternionic matrices, particularly those of a partitioned form. These inequalities are applied to specialized quaternionic companion matrices to derive novel upper bounds for the zeros of the original polynomial. By establishing novel spectral norm inequalities for partitioned quaternionic matrices and utilizing the structural properties of companion matrices and their higher powers, we derive unexplored upper bounds for the zeros of quaternionic polynomials. Our bounds are systematically sharper than existing results and provide a unified framework for zero localization in the quaternionic setting.
Read the full abstract
Optimization and Control
Gradient extremals, talwegs, valleys, and directional alignment for generic gradient descent
Gradient extremals are loci along which the gradient is an eigenvector of the Hessian. These objects provide a natural geometric framework connecting several notions, notably valleys and talwegs, which we analyze from a variational viewpoint in the generic case. We then show that trajectories of the gradient flow and of its discrete counterpart exhibit directional alignment with the tangent spaces to gradient extremals, and generically to the talweg. Under non-resonance assumptions, and in contrast with the quadratic case, alignment rates are governed either by the first spectral gap or by the smallest eigenvalue of the Hessian at the limit point. Nonlinearities and the step length may both distort these rates in a complex manner. We further prove a volume concentration phenomenon emphasizing the structuring role of gradient extremals: for large times, the images of sets of initial conditions concentrate inside valleys and asymptotically around talwegs.
Read the full abstract
Probability
Sofic measures
Sofic measures, also known as hidden Markov measures, have been extensively studied. In this paper, we survey some equivalent definitions of this notion and improve a bound for deciding whether a sofic measure is~$k$-step Markov. We prove that if an invariant sofic measure with a linear representation of dimension~$n$ is a~$k$-step Markov chain, then~$k$ can be chosen at most equal to~$\binom{n}{2}$ and that this bound is tight for sofic measures over an alphabet of size $3$.
Read the full abstract
Dynamical Systems
Smooth Pseudo-Rotations Measure-Theoretically Isomorphic to Circle Rotations of Rationally Independent Angle
Let M be a smooth compact connected manifold, on which there exists an effective smooth circle action preserving a positive smooth volume. We show that on M, the smooth closure of the smooth volume-preserving conjugation class of some Liouville rotations of angle alpha contains a smooth volume-preserving diffeomorphism T that is metrically isomorphic to an irrational rotation of angle beta on the circle, with alpha different of beta, and with alpha and beta chosen either rationally dependent or rationally independent. In particular, if M is the closed annulus, M admits a smooth ergodic pseudo-rotation T of angle alpha that is metrically isomorphic to the rotation of angle beta. Moreover, T is smoothly tangent to the rotation of angle alpha on the boundary of M.
Read the full abstract
Number Theory
Local square mean in the hyperbolic circle problem and sums of Salié sums
Let $\Gamma\subseteq PSL(2, \mathbb R)$ be a finite volume Fuchsian group. The hyperbolic circle problem is the estimation of the number of elements of the $\Gamma$-orbit of $z$ in a hyperbolic circle around $w$ of radius $R$, where $z$ and $w$ are given points of the upper half plane and $R$ is a large number. An estimate with error term $e^{\frac 23R}$ is known, and this has not been improved for any group. Recently, taking $ z=w$ and considering $\Gamma = PSL(2, \mathbb Z)$, we have shown the estimate $ e^{\left(\frac 9{14}+\epsilon\right)R}$ for the local $L^2$-norm of the error term, which is better than the pointwise bound. Here we improve the exponent $\frac 9{14}$, conditionally on a twisted Linnik-Selberg-type conjecture for sums of Salié sums.
Read the full abstract
Information Theory
Semantic Rate-Distortion Theory: Deductive Compression and Closure Fidelity
Shannon's rate-distortion theory treats source symbols as unstructured labels. When the source is a knowledge base equipped with a logical proof system, a natural fidelity criterion is closure fidelity: a reconstruction is acceptable if it preserves the deductive closure of the original. This paper develops a rate-distortion theory under this criterion. Central to the theory is the irredundant core-a canonical generating set extracted by a fixed-order deletion procedure, from which the full deductive closure can be rederived. We prove that the zero-distortion semantic rate equals a quantity that is strictly below the classical entropy rate whenever the knowledge base contains redundant states. More generally, the full semantic rate-distortion function depends only on the core; redundant states are invisible to both rate and distortion. We derive a semantic source-channel separation theorem showing a semantic leverage phenomenon: under closure fidelity, the required source rate is reduced by an asymptotic leverage factor greater than one, allowing the same knowledge base to be communicated with proportionally fewer channel uses-not by violating Shannon capacity, but because redundant states become free. We also prove a strengthened Fano inequality that exploits core structure. For heterogeneous multi-agent communication, an overlap decomposition gives necessary and sufficient conditions for closure-reliable transmission and identifies a semantic bottleneck in broadcast settings that persists even over noiseless channels. All results are verified on Datalog instances with up to 24,000 base facts.
Read the full abstract
Probability · Cross-listed from stat.CO
Extended One-Liners for the Beta, Gamma, and Dirichlet Distributions with Shape Parameters Below One
We present an explicit deterministic transformation of a fixed number of i.i.d. uniform random variables with exact Beta$(a,1-a)$ law for $0<a<1$, using only elementary operations (an “extended one-liner”, see \cite{devroye1996oneline}). As corollaries, the families Beta$(a,b)$ with $\min(a,b)<1$, Gamma$(c)$ with $c<1$, and Dirichlet$(\alpha_1,\dots,\alpha_d)$ with $0<\alpha_i<1$, for fixed $d$, also have extended one-\liners.
Read the full abstract
Differential Geometry
On Spherically Symmetric Sprays
This paper studies spherically symmetric sprays, i.e., sprays that are invariant under orthogonal transformations. We first establish a canonical form for such sprays, showing that their geodesic coefficients can be expressed as \(G^i = |y|\alpha(r,s) y^i + |y|^2\beta(r,s) x^i\), where \(r = |x|^2\) and \(s = \langle x,y\rangle/|y|\). For projectively flat spherically symmetric sprays – which are directly related to Hilbert's fourth problem on characterizing metrics whose geodesics are straight lines – we derive a complete classification of those with isotropic curvature, and in particular, we obtain the explicit form of those with zero curvature. Furthermore, we characterize sprays of weakly isotropic curvature in this class by a system of partial differential equations. These results may provide a unified framework for understanding symmetry and curvature in spray geometry and may offer new insights into the metrizability problem in Finsler geometry.
Read the full abstract
Optimization and Control
Robust Neural Policy Distillation of Long-Horizon FCS-MPC for Flying-Capacitor Three-Level Boost Converters
Long-horizon finite-control-set model predictive control (FCS-MPC) can improve transient regulation and flying-capacitor balancing in flying-capacitor three-level boost converters (FC-TLBCs). However, searching over switching sequences becomes computationally expensive at high switching frequencies. We train a feedforward neural network to imitate an $N$-step FCS-MPC expert computed with beam search. To improve robustness, expert trajectories are generated under randomized input voltage, load resistance, and component parameters, and a disagreement-based DAgger variant is used to relabel on-policy states where the student and expert disagree. In simulation, the learned policy maintains stable voltage regulation and capacitor balancing under nominal conditions, operating-point changes, and perturbations of several physical parameters. We demonstrate the effectiveness of our approach by reducing the computational burden. We also demonstrate transfer to an NPC-type three-level buck converter, where initializing from the FC-TLBC network improves sample efficiency compared with training from scratch.
Read the full abstract
Classical Analysis and ODEs
Isotropic Positive Definite Functions on Spheres
In this paper, we investigate the relationship between positive definite functions on the unit sphere $\sph$ and on the Euclidean space $\RR^d$. For the dimension $d$ to be odd, a new technique is developed to establish the inheritance of positive (semi-)definite property from $\RR^d$ to $\sph$ and the converse. For $d=2$, it is proved that a function defined by $$f_{\t,\delta}(t)=(\t-t)_+^\delta, \quad \delta\geq \f{d+1}2 $$ is positive definite on the unit sphere $\mathbb{S}^2$ by restricting $\t$ in an absolute range. Our results can verify a conjecture proposed by R.K. Beatson, W. zu Castell, Y. Xu and a sharp Pólya type criterion for positive definite functions on spheres.
Read the full abstract
Optimization and Control
Closed-loop analysis of linear stochastic MPC with risk-averse constraints
Chance constraints are widely used in stochastic model predictive control (MPC) to enforce probabilistic state and input constraints in the presence of unbounded disturbances. However, they only restrict violation probabilities and do not account for the magnitude of rare but severe constraint violations. In this paper, we extend the indirect feedback approach for linear stochastic MPC from chance constraints to risk-averse constraints like the conditional value-at-risk. For the resulting risk-averse MPC scheme, we establish recursive feasibility and closed-loop constraint satisfaction. Furthermore, based on a stochastic dissipativity notion and suitable conditions on the terminal ingredients we show that (near)-optimality of the averaged closed-loop performance can be ensured.
Read the full abstract
Algebraic Geometry
Asymptotic Behavior of Tropical Rank Functions
We show that the asymptotic behavior of the two main competing notions of rank of a linear series on a tropical curve is governed by asymptotic invariants, closely paralleling the theory of volumes in algebraic geometry. We introduce and study tropical notions of volume associated to both divisors and tropical modules. We prove optimal asymptotic results for each case. In addition, we show that the tropical volume is compatible with the tropicalization of curves.
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
Cost-optimal Sequential Testing via Doubly Robust Q-learning
Clinical decision-making often involves selecting tests that are costly, invasive, or time-consuming, motivating individualized, sequential strategies for what to measure and when to stop ascertaining. We study the problem of learning cost-optimal sequential decision policies from retrospective data, where test availability depends on prior results, inducing informative missingness. Under a sequential missing-at-random mechanism, we develop a doubly robust Q-learning framework for estimating optimal policies. The method introduces path-specific inverse probability weights that account for heterogeneous test trajectories and satisfy a normalization property conditional on the observed history. By combining these weights with auxiliary contrast models, we construct orthogonal pseudo-outcomes that enable unbiased policy learning when either the acquisition model or the contrast model is correctly specified. We establish oracle inequalities for the stage-wise contrast estimators, along with convergence rates, regret bounds, and misclassification rates for the learned policy. Simulations demonstrate improved cost-adjusted performance over weighted and complete-case baselines, and an application to a prostate cancer cohort study illustrates how the method reduces testing cost without compromising predictive accuracy.
Read the full abstract
Numerical Analysis
From Exact Space-Time Symmetry Conservation to Automatic Mesh Refinement in Discrete Initial Boundary Value Problems
In this contribution we present recent developments in the formulation and solution of Initial Boundary Value Problems (IBVPs). Building upon a modern variational action formulation of classical dynamics, we treat Initial Boundary Value Problems directly on the action level, bypassing governing equations. We show that by including coordinate maps as dynamical degrees of freedom together with propagating fields two key results emerge. Space-time symmetries remain protected even after discretization, leading to an exact conservation of Noether charges even for discrete IBVPs. The dynamical nature of the coordinate maps leads to an adjustment of space-time resolution, guided by Noether charge conservation, realizing a form of automatic adaptive mesh refinement. We stress that as long as SBP operators are used for the discretization, our results are independent of whether the dynamics are solved on the action or governing equation level and hold in particular also at high order. As proof-of-principle for our approach we present its application to scalar wave-propagation in 1+1 dimensions.
Read the full abstract
Analysis of PDEs
Inverse source problem for the parabolic equation with sparse moving observations
This paper considers the inverse problem of identifying the source term of parabolic equations from sparse boundary measurements. We used data from moving sensors to locate the unknown source term. This work first proves the uniqueness of the inverse problem under such measurements. Then the movement strategy of the sensor is given, from which the authors build the reconstruction algorithm. Finally, some numerical experiments are performed and the corresponding results are generated, which indicate the effectiveness of the algorithms.