Dynamical Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Saturday 28 February
We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a Morse decomposition given by its strongly connected components. As the threshold varies, these multivector fields form a monotone refinement family. We define the Morse persistence diagram by recording the birth and death of Morse sets along this filtration. The construction is purely combinatorial and does not rely on simplicial homology or persistence modules. We prove that the resulting persistence diagram is stable with respect to perturbations of the relation matrix in the sup norm. Each Morse set furthermore carries a combinatorial Conley index, yielding a topologically enriched invariant for multiscale graph structure.
Logic
Infima and cardinal characteristics of critical ideals for countable compact spaces
For each countable ordinal $\alpha \ge 2$, the ideals $\mathsf{conv}_\alpha$ were introduced in “Critical ideals for countable compact spaces” (to appear in Fund. Math., see also arXiv:2503.12571) to characterize compact countable spaces homeomorphic to $\omega^\alpha \cdot n+1$ with the order topology. We study the structure of these ideals in the Katětov order, namely for limit ordinals $\alpha$, we show that $\mathsf{conv}_{\alpha}$ do not serve as greatest lower bounds of the $\mathsf{conv}_\beta$ for $\beta<\alpha$. We therefore define the ideals $\mathsf{conv}_{<\alpha}$ with this property and show that together, the ideals $\mathsf{conv}_\alpha$ and $\mathsf{conv}_{<\alpha}$ form intertwined decreasing hierarchies of $\Sigma^0_4$- and $\Pi^0_5$-complete ideals. Furthermore, we examine several cardinal invariants of $\mathsf{conv}_\alpha$, computing invariants that have recently appeared in the literature in various contexts.
Read the full abstract
Number Theory
Another proofs of Zagier's formula for multiple zeta values and Murakami's formula for multiple $t$-values
Let $l\ge 1$ be an integer. For any multiple index $\mathbf{s}=(s_1,s_2,\cdots,s_l)\in\mathbb{Z}_{\geq 1}^l$ with $s_l>1$, the multiple zeta value (MZV for short) is defined by \begin{align*} \zeta(s_1,s_2,\cdots,s_l):=\sum_{1\leq k_1<k_2<\cdots<k_l} \frac{1}{k_1^{s_1}k_2^{s_2}\cdots k_l^{s_l}} \end{align*} and the multiple $t$-value is defined by \begin{align*} t(s_1,s_2,...,s_l):=\sum_{1\leq k_1<k_2<...<k_l} \frac{1}{(2k_1-1)^{s_1}(2k_2-1)^{s_2}...(2k_l-1)^{s_l}}, \end{align*} where if the index is empty, then we define the value $t(\emptyset):=1$. We denote by $\{a_1,\cdots,a_k\}^d$ the sequence formed by repeating the sequence $\{a_1,\cdots,a_k\}$ exactly $d$ times. Let $H(r,s)=\zeta(\{2\}^r,3,\{2\}^s)$ and $T(r,s):=t(\{2\}^r,3,\{2\}^s)$. Zagier's formula for the multiple zeta values $H(r,s)$ was an important and key ingredient in the proof of Hoffman's conjecture. In this paper, with the help of the Lei-Yu-Hong expressions for $H(r,s)$ and $T(r,s)$ as well as Lupu's identity about rational zeta series involving Riemann zeta values $\zeta(2n)$ and by establishing some identities about binomial coefficients and a result about Kronecker symbol and arithmetic functions, we present another proofs of Zagier's formula stating that for any nonnegative integers $r$ and $s$, \begin{align*} H(r,s)=2\sum_{k=1}^{r+s+1}(-1)^k\Big[\binom{2k}{2r+2}-\Big(1-\frac{1}{2^{2k}}\Big) \binom{2k}{2s+1}\Big]\zeta(2k+1)\zeta(\{2\}^{r+s+1-k}), \end{align*} and Murakami's formula for the multiple $t$-values $T(r,s)$ asserting that \begin{align*} T(r,s)=\sum_{k=1}^{r+s+1}(-1)^{k-1} \Big[\binom{2k}{2r+1}+\binom{2k}{2s+1}\Big(1-\frac{1}{2^{2k}}\Big)\Big] \frac{1}{2^{2k}}\zeta(2k+1) t(\{2\}^{r+s+1-k}). \end{align*}
Read the full abstract
Algebraic Geometry
Fast computation of Riemann-Roch spaces for singular curves
Let C be a projective curve defined over a field k and let D be a divisor of C. The Riemann-Roch space L(D) is the set of rational functions on C for which certain zeros are imposed and certain poles are allowed, with some multiplicities determined by D. Riemann-Roch spaces play a fundamental role in algebraic geometry due to the central place of the Riemann-Roch theorem. They have also important applications, such as coding theory or arithmetic of Jacobians of curves. In this article, we present what we believe is the fastest algorithm to date that computes a basis of a Riemann-Roch space for a curve with arbitrary singularities. Our algorithm is deterministic, works over any perfect field k, and works with no assumptions on the support of D.
Read the full abstract
Analysis of PDEs
Global strong solutions to a one-dimensional full non-Newtonian fluid with far field vacuum
In this paper, the Cauchy problem for a one-dimensional heat conducting compressible non-Newtonian fluid is considered. The constitute equation of the non-Newtonian fluid is determined by two nonlinear terms $(|u_x|^{q-2}u_x)_x$ and $(|\theta_x|^{p-2}\theta_x)_x$ with $1<p,q<2.$ When the vacuum occurs at the far field, the local and global existence of strong solutions are established for the Cauchy problem. The results indicate that the non-Newtonian fluid possesses time-dependence boundedness of the energy if the vacuum occurs at the far field and the density decays slowly at the far field as time goes to infinity. This is the key difference from the well-known result developed by Li and Xin (Advances in Mathematics 361(2020), 106923) for the one-dimensional heat conductive compressible Navier-Stokes system.
Read the full abstract
Combinatorics
On the Transversal Coalition in r-Uniform Hypergraphs
A transversal coalition in a hypergraph $H$ is a partition of the vertex set $U$ into two subsets $U_1$ and $U_2$ such that neither $U_1$ nor $U_2$ alone intersects every hyperedge of $H$, but their union, $U_1 \cup U_2$, intersects every hyperedge in $H$. In this work, we investigate transversal coalition partitions in \( r \)-uniform hypergraphs. Specifically, we determine the transversal coalition number of complete $r$-uniform hypergraphs, complete bipartite $r$-uniform hypergraphs, $r$-uniform stars, and complete $r$-partite $r$-uniform hypergraphs. We also investigate the transversal coalition number of $r$-uniform linear paths and cycles.
Read the full abstract
Statistics Theory
Martingale Posterior Predictive Coherence: Hausdorff Moment Hierarchy
For an exchangeable Bernoulli sequence with de Finetti mixing measure Pi, the k-step predictive probability P(X_{n+1}=...=X_{n+k}=0 | F_n) equals the posterior expectation E[(1-theta)^k | F_n]. By binomial expansion, this depends on all posterior moments up to order k. We show that the first moment alone is not sufficient to uniquely identify these quantities: for k >= 2, the mapping from posterior mean to k-step predictive is set-valued. The martingale posterior framework of Fong, Holmes, and Walker (which constrains only the first conditional moment of the terminal value) does not, in general, uniquely identify multi-step predictive distributions. Under any strictly proper scoring rule, the plug-in predictive is strictly dominated by the Bayes predictive whenever the posterior is non-degenerate. A closure theorem establishes that a martingale posterior determines all k-step predictives if and only if the conditional law of the terminal value is uniquely specified. Hill's A_{(n)} rule under the Jeffreys Beta(1/2,1/2) prior is a positive example. The discrepancy is O(Var(theta | F_n)) and vanishes as the posterior concentrates. These results clarify the structural requirements for predictive completeness under exchangeability.
Read the full abstract
Number Theory
On the quadratic Waring-Goldbach problem with primes in Piatetski-Shapiro sets
In this paper, it is proved that, for any $\gamma_1,\gamma_2,\gamma_3,\gamma_4,\gamma_5\in(\frac{28}{29},1)$, every sufficiently large integer $n$ subject to $n\equiv5\pmod{24}$ can be represented as the sum of five squares of primes, i.e., \begin{equation*} n=p_1^2+p_2^2+p_3^2+p_4^2+p_5^2, \end{equation*} such that $p_i=\lfloor m_i^{1/\gamma_i}\rfloor$ for some $m_i\in\mathbb{N}^+$ for each $1\leqslant i\leqslant 5$. This result constitutes an improvement upon the previous result of Zhang and Zhai [29].
Read the full abstract
Functional Analysis
The Hölder regularity of harmonic function on bounded and unbounded p.c.f self-similar sets
In this paper, we prove a generalized reverse Hölder inequality of harmonic functions on cable systems induced by post-critically finite (p.c.f.) self-similar sets. Furthermore, we also establish the Hölder regularity of harmonic functions on both bounded and unbounded p.c.f. self-similar sets, which does not involve heat kernel estimates and resistance estimates.
Read the full abstract
General Mathematics
A Deterministic Fractal Set Derived from the Sequence of Prime Numbers
We introduce a novel deterministic fractal set PF in the unit interval whose construction is driven by the sequence of prime numbers modulo 16. At each step of the recursive construction, two subintervals are retained based on the residues of consecutive primes, yielding a Cantor-like set with a uniform contraction ratio of 1/16 and a branching number of 2. We prove that PF is a non-empty, compact, nowhere dense set of Lebesgue measure zero. Its Hausdorff dimension and box-counting dimension are both equal to 1 4 . The dimension is universal in the sense that it does not depend on the specific choice of the residue sequence, but only on the branching number and the contraction ratio. A generalization to arbitrary bases and branching numbers is also provided. This construction establishes a rigorous link between number theory and fractal geometry, offering a deterministic fractal whose structure is entirely encoded by the distribution of primes.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Exact Semiclassical Dynamics in a Multidimensional Quartic Potential: Multi-Flavor Instantons and Pre-Factor Dominance at Strong Coupling
We present an exact semi-classical analysis of a coupled multi-degree-of-freedom quantum system governed by a symmetric quartic potential with four degenerate minima. Starting from the Euclidean path integral, we identify distinct paths that are longitudinal, transverse, and diagonal, each corresponding to distinct instanton configurations that mediate tunneling between vacua. The continuous translational zero mode for each coupled trajectory is extracted rigorously by transforming the fluctuation operator into a comoving rotating frame, explicitly incorporating curvature-induced fictitious forces. By evaluating the exact functional determinants via the Gelfand-Yaglom method and mapping the multi-flavor dilute instanton gas onto a weighted $K_4$ adjacency matrix, we analytically derive the transition amplitudes and ground-state energy splittings. Crucially, our exact continuum treatment reveals that for strong coupling, the usual exponential can be overpowered in certain parameter ranges by the "pre-factor". This quantity, which arises from quadratic level fluctuations in the direction transverse to the free direction, turns out to have an essential singularity that would be hard to spot in standard discretized instanton approximations.
Read the full abstract
Functional Analysis
Nonlocal convolution type functionals and related Orlicz spaces
In the paper we introduce Orlicz type functional spaces defined in terms of nonlocal convolution type integral functionals and study the main properties of these spaces. We show in particular that, under natural convexity and growth conditions on the integrand, the corresponding spaces are Banach and separable. We also characterize the dual spaces and provide a number of examples.
Read the full abstract
Optimization and Control
Adaptive primal dual hybrid gradient algorithms based on average spectrum for saddle point problems
The primal dual hybrid gradient algorithm (PDHG), which is also known as the Arrow-Hurwicz method, is a fundamental algorithm for saddle point problems especially in imaging. It also inspires a great number of influential algorithms such as the stochastic PDHG and the Chambolle-Pock's primal dual algorithm. In the literature, convergence theory of the PDHG is established only when some more restrictive conditions are additionally assumed, and it is proved that the PDHG with any constant step sizes could diverge for generic setting of convex saddle point problems. The Chambolle-Pock's primal dual algorithm, as an influential variant of the PDHG, is thus widely used due to its provable convergence theory and competitive numerical performance. However, step sizes of the Chambolle-Pock's primal dual algorithm are inherently bounded by its associated matrix spectrum, and this restriction could limit its computational capacity structurally. To address these limitations both in theory and practice, we propose a class of adaptive primal dual hybrid gradient algorithms for generic convex saddle point problems in this paper. By exploiting the prediction-correction algorithmic framework, the global convergence theory of the proposed schemes can be determined only by the average spectrum of the underlying matrix, and it thus leads to a potential acceleration. The numerical experiment on the assignment problem illustrates the superior numerical performance of the proposed method.
Read the full abstract
Logic
Speedups for Presburger Arithmetic and Real Closed Fields
In the present paper, we consider Presburger arithmetic PrA and the theory of real closed fields RCF. Due to quantifier elimination in these theories, there are two kinds of natural ways to axiomatize them. Namely, on one hand, PrA can be axiomatized with the full schema of first-order induction, and RCF with the full schema of the first-order least upper bound principle. At the same time, there are natural axiomatizations of these theories that avoid the use of formulas of unbounded quantifier depth. In the present paper, we compare these two groups of axiomatizations from the perspective of proof lengths. We show that the first group of axiomatizations enjoys at least a double exponential speedup.
Read the full abstract
Optimization and Control
On semimonotone matrices of exact order two
In this paper, we introduce the notion of (strictly) semimonotone matrices of exact order $k$, where $0\leq k\leq n$, and explore their properties. We fully characterize the $3 \times 3$ (strictly) semimonotone matrices of exact order $2$, and show that the class of $3 \times 3$ semimonotone matrices of exact order $2$ forms a subclass of inverse $\mathbf{Z}$-matrices. We further investigate $ n\times n$ (strictly) semimonotone matrices of exact order $2$, with emphasis on their identification and construction, and establish that every $n\times n$ semimonotone $\mathbf{Z}$-matrix of exact order $2$ is invertible. Additionally, we show that when $n-k=1$, the class of (strictly) semimonotone matrices of exact order $k$ is a subclass of $\mathbf{Z}$-matrices.
Read the full abstract
Optimization and Control · Cross-listed from eess.SP
Joint Sampling Frequency Offset Estimation and Compensation Algorithms Based on the Farrow Structure
This paper presents joint sampling frequency offset (SFO) estimation and compensation algorithms based on the Farrow structure. Unlike conventional approaches that treat estimation and compensation separately, the proposed framework exploits the interpolator structure to enable a low-complexity, fully time-domain solution applicable to arbitrary bandlimited signals, without imposing constraints on the waveform or requiring Fourier transform based processing. The estimation stage can operate on a real-valued component of a complex signal and supports the simultaneous estimation of SFO and sampling time offset, while being inherently robust to other synchronization impairments such as carrier frequency offset. The proposed estimation algorithms rely on two complementary methods, specifically, Newton's method and iterative least-squares formulation. The implementations of the estimators are presented and the overall computational complexity is analyzed, showing that the complexity scales only linearly with the number of samples employed. Numerical results for real and complex multisine and bandpass-filtered white noise signals demonstrate accurate estimation and effective compensation over a wide range of operating conditions, confirming the flexibility and efficiency of the proposed approach. Moreover, the influence of the Farrow structure approximation error on the SFO estimation accuracy is investigated.
Read the full abstract
Combinatorics
$A_{\alpha}$-Spectra of $Q$- and $T$-Join Graphs with Applications to Cospectral Constructions
For $\alpha \in [0,1]$, the $A_{\alpha}$-matrix of a graph $G$ is defined by $A_{\alpha}(G) = \alpha D(G) + (1- \alpha) A(G)$, where $A(G)$ and $D(G)$ denote the adjacency matrix and the diagonal degree matrix of $G$, respectively. In this paper, we study the $A_{\alpha}$-characteristic polynomials and $A_{\alpha}$-spectra of graphs obtained via four recently introduced join operations, namely the $Q$-vertex join, $Q$-edge join, $T$-vertex join, and $T$-edge join, applied to two graphs $G_1$ and $G_2$. We derive explicit expressions for the $A_{\alpha}$-characteristic polynomials of these constructions when the first factor graph is regular. Furthermore, we determine the complete $A_{\alpha}$-spectra of these graphs in terms of the $A_{\alpha}$-spectra of the factor graphs, particularly when the second factor graph is regular or complete bipartite. The significance of these results lies in the fact that they enable efficient computation of the $A_{\alpha}$-spectra of large complex graphs arising from these joins, directly from the $A_{\alpha}$-spectra of the smaller constituent graphs, without explicitly constructing and handling the complex $A_{\alpha}$-matrices of those large graphs. Finally, as an application, we demonstrate how to construct infinitely many families of non-isomorphic graphs that are $A_{\alpha}$-cospectral.
Read the full abstract
Representation Theory
Mirabolic Hecke algebras, Schur-Weyl duality and Frobenius character formulas
We first introduce a new presentation for the mirabolic Hecke algebra $\mathscr{H}_{n,R}(q)$ over an arbitrary commutative ring $R$ and derive a new basis. Based on this presentation, specializing to the case of $\mathscr{H}_n(q)$ over the field $\mathbb{C}(q)$, we construct a basis for the cocenter of $\mathscr{H}_n(q)$, which facilitates the definition of its character table. We further establish a Schur–Weyl duality between $\mathscr{H}_n(q)$ and the quantum group $U_q(\mathfrak{gl}_r)$. As an application, we obtain Frobenius character formulas for the irreducible characters of $\mathscr{H}_n(q)$ within the ring of symmetric functions. Finally, we derive a recursive Murnaghan–Nakayama rule for the computation of the character table.
Read the full abstract
Numerical Analysis
An adaptive integrating factor midpoint method for second order evolution equations
In this paper, we consider the integrating factor midpoint method for wave-type equations and derive optimal order a posteriori error estimates. We first introduce an integrating factor midpoint approximation defined by the piecewise linear approximate solutions, and derive suboptimal order residual-based error estimates using the energy technique. Hence the key is introducing a continuous, piecewise quadratic time reconstruction to establish optimal order error bounds. Based on the reliable a posteriori error control, we develop an adaptive time-stepping strategy. Numerical examples are implemented to verify the convergence rate of an error estimator and the high efficiency of the adaptive algorithm.
Read the full abstract
Combinatorics
Edge partitions into induced-$2K_2$-free bipartite graphs
We study edge partitions of a bipartite graph into induced-$2K_2$-free bipartite graphs, i.e.\ into Ferrers (chain) graphs. We define $\fp(G)$ as the minimum number of parts in such a partition. We prove general lower and upper bounds in terms of induced matchings and Dilworth widths of neighborhood posets. We compute the parameter exactly for paths and even cycles, and we exhibit separations showing that the induced-matching lower bound and the width upper bound can both be far from tight. We also record a simple host-induced conflict-graph lower bound, present a $0$–$1$ matrix viewpoint, and add some complexity remarks.
Read the full abstract
Functional Analysis
On phase-isometries between the unit spheres of the Banach space of continuous real-valued functions
For a locally compact Hausdorff space $L$, we denote by $C_0(L,\mathbb{R})$ the Banach space of all continuous real-valued functions on $L$ vanishing at infinity, endowed with the supremum norm. In this paper, we prove that every surjective phase-isometry $T\colon S(C_0(X,\mathbb{R}))\to S(C_0(Y,\mathbb{R}))$ between the unit spheres of $C_0(X,\mathbb{R})$ and $C_0(Y,\mathbb{R})$ is a variant of a weighted composition operator in the following sense: there exist a function $\varepsilon\colon S(C_0(X,\mathbb{R}))\to\{-1,1\}$,a continuous function $\alpha\colon Y\to \{-1,1\}$ and a homeomorphism $\sigma\colon Y\to X$ such that $T(f)(q)=\varepsilon(f)\alpha(q)f(\sigma(q))$ for every $f\in S(C_0(X,\mathbb{R}))$ and $q\in Y$.
Read the full abstract
Algebraic Geometry
The Wirtinger-type integral for a genus two curve
The Wirtinger integral is one of the integral representations of the Gauss hypergeometric function. Its integrand can be regarded as a multivalued function on an elliptic curve. In this paper, we study an analogue of the Wirtinger integral on a hyperelliptic curve of genus two, introduced by Mizutani and Watanabe. We investigate the associated twisted homology and cohomology groups using the hyperelliptic involution and intersection forms.
Read the full abstract
Number Theory
The Bombieri–van der Poorten Formula for Partial Quotients of Higher Degree Algebraic Irrationals
The fundamental relationship between the partial quotients $b_{n+1}$ of an algebraic irrational $\alpha = \sqrt[m]{k}$ and its corresponding algebraic form $d_n = |p_n^m - k q_n^m|$ was elegantly proposed by Bombieri and van der Poorten. In this paper, we work out the explicit analytical details of the framework for any degree $m \geq 3$. We provide a closed-form derivation of the error term and prove for the cubic case that the remainder $|R_n|$ is strictly bounded by 1 for all convergents with $q_n \geq 2$.
Read the full abstract
Algebraic Geometry
Riemann-Wirtinger integrals on the product of two one-dimensional complex tori
The Riemann-Wirtinger integral is an analogue of the hypergeometric integral defined on a one-dimensional complex torus. As a generalization, we define the Riemann-Wirtinger integral on the product of two one-dimensional complex tori. We study the structure of the twisted cohomology group associated with the Riemann-Wirtinger integral and derive a system of differential equations satisfied by this integral.
Read the full abstract
Analysis of PDEs
Second-order estimates for degenerate complex $k$-Hessian and Christoffel-Minkowski equations
It is known that the complex $k$-Hessian equation admits almost $C^{1,1}$ regularity (i.e., $\sup\Delta u<\infty$) and the Christoffel-Minkowski equation admits $C^{1,1}$ regularity under the sharp degenerate condition $f^{1/(k-1)}\in C^{1,1}$ for a nonnegative right-hand side $f$. Assuming instead the alternative sharp degenerate condition $f^{3/(2k-2)}\in C^{2,1}$, we prove almost $C^{1,1}$ regularity for the complex $k$-Hessian equation when $k\geq5$ and $C^{1,1}$ regularity for the Christoffel-Minkowski equation. The argument deeply exploits various concavity properties of the operators under the stronger regularity assumption on $f$.
Read the full abstract
Number Theory
On log crystalline higher direct image
We define the big crystalline site for a log scheme and prove the basic properties. In particular, we show the boundedness, base change, and perfectness theorems for the crystalline higher direct image of quasi-coherent crystals between fine log schemes. We also introduce the big absolute crystalline sites and discuss the Frobenius isogeny property of the crystalline higher direct image of $F$-isocrystals.
Read the full abstract
Optimization and Control
Distributed Computing for Huge-Scale Aggregative Convex Programming
Concerning huge-scale aggregative convex programming of a linear objective subject to the affine constraints of equality and inequality and the quadratic constraints of inequality, convex and aggregatively computable, an algorithm is developed for its distributed computing. The consensus with single common variable is used to partition the constraints into multi-consensus blocks, and the subblocks of each consensus block are employed to partition the primal variables into multiple sets of disjoint subvectors. The global consensus constraints of equality and the original constraints are converted into the extended constraints of equality via slack variables to help initialize the algorithm. The augmented Lagrangian, the proximal point method with double proximal terms or single, the block-coordinate Gauss-Seidel method, and ADMM are used to update the primal and slack variable sequences; the descent models with built-in bounds are used to update the dual, motivated by the mathematical structures of the first-order characteristics of the update rules for the primal and slack. The feasibility conditions for the algorithm to produce optimal solutions are described and their realizations through precondition and parameter and initial values are outlined or specified. Under the feasibility conditions supposed, convergence of the algorithm to optimal solutions is argued and the rate of convergence, $O(1/k^{1/2})$ is estimated roughly. Issues requiring further explorations are listed.
Read the full abstract
Functional Analysis
Phase-Space Analysis of generalised Fractional Anharmonic and Ornstein-Uhlenbeck Semigroups on Weighted Modulation Spaces
We develop a phase-space framework for fractional generalised anharmonic oscillators and their heat semigroups on weighted modulation spaces. We consider operators of the form \[ \mathcal{H}_{k,l}=(-\Delta)^{l}+V(x), \] where $V$ is a strictly positive homogeneous potential of polynomial growth of order $2k$. By studying a Hörmander metric adapted to the quasi-homogeneous symbol $|\xi|^{2l}+V(x)$, as in \cite{MR4299820, MR4944933} we place $\mathcal{H}_{k,l}$ and its fractional powers within the Weyl-Hörmander calculus. In this setting, we show that the fractional operators $\mathcal{H}_{k,l}^{\beta}$, $\beta>0$, are globally hypoelliptic pseudodifferential operators and derive refined symbol estimates for the heat semigroup $e^{-t\mathcal{H}_{k,l}^{\beta}}$. These estimates yield boundedness and smoothing properties of the fractional anharmonic heat semigroup on weighted modulation spaces $\mathcal{M}^{p,q}_{s}$, for the full range $0<p,q\leq\infty$ and suitable range of $s$. As applications, we establish global well-posedness of nonlinear heat equations associated with $\mathcal{H}_{k,l}^{\beta}$, including both homogenous power and spatially inhomogenous nonlinearities. Finally, we introduce Gaussian modulation spaces adapted to the Ornstein-Uhlenbeck operator and prove continuity of the corresponding semigroup, providing a phase-space perspective complementary to classical Gaussian harmonic analysis.
Read the full abstract
Statistics Theory
Minimax Simple Bayes Estimators of a Normal Variance
This paper is a follow-up to Maruyama and Strawderman (2006, Journal of Statistical Planning and Inference), which identified a new class of generalized Bayes estimators with a particularly simple form for estimating a normal variance under entropy loss. Although their previous work established the Bayesianity of these estimators, it did not provide a closed-form result for their minimaxity. In this paper, we revisit the problem and establish a definitive closed-form minimaxity result for this class of simple Bayes estimators.
Read the full abstract
Numerical Analysis · Cross-listed from cs.CE
A Stochastic Conservative Field Transfer Method for Black-box Multiscale and Multiphysics Coupling
This paper introduces a new method for performing field transfer operations in black-box coupling, when source discretization information is not available. This approach uses a stochastic approximation of the Galerkin projection which leads to a method that asymptotically provides conservation. Error in the accuracy and conservation has been compared to the mesh intersection method and radial basis functions on a simple domain, as well as on meshes of the LTX fusion reactor. For all cases tested, our new method provides higher accuracy and less conservation error than radial basis functions and can be used for black-box coupling, unlike the mesh-intersection method. Additionally, we demonstrate the implementation and performance of our method on an NVIDIA GeForce RTX 4060 GPU, showing that the cost is competitive with the mesh intersection method.