Dynamical Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 14 May
We prove a Mostow rigidity theorem for foliated bundles over closed hyperbolic manifolds of dimension $n \geq 3$ endowed with a completely invariant measure of full support. These include solenoidal manifolds obtained as inverse limits of directed systems of finite coverings of closed hyperbolic manifolds. This theorem then extends to skew solenoidal manifolds for which the action of the holonomy group is twisted by means of a cocycle.
Functional Analysis
Invertible positive maps that are not automorphism
Let $X$ be a real normed vector space with a cone $K\subseteq X$ satisfying either (i) $K$ is closed with non-empty interior or (ii) $K$ has non-zero extremals or (iii) $K$ is closed and $X$ is a Banach space. In this short note, we provide a method to construct an invertible linear map $T\colon X\to X$ such that $T[K]\subseteq K$ but $T^{-1}[K]\not\subseteq~K$. In particular, we show that, for every cone automorphism $S\colon X\to X$, there exists a rank one perturbation of $S$ which is positive and invertible, but does not have a positive inverse. We provide examples from four diverse situations.
Read the full abstract
Classical Analysis and ODEs
Compact Embedding Theorem Associated with Classical Weight Functions in Two Variables
For a classical weight function $\rho$ defined on a simply connected open subset $\Omega$ of $\mathbb{R}^2$ (either bounded or unbounded) with piecewise $C^1$ boundary, we prove density of the space of bivariate polynomials and compact embedding of the matrix-weighted Sobolev space $W^{1,2}(\Omega,\rho,\rho\Phi)$ in the weighted Lebesgue space $L^2(\Omega,\, \rho)$. As an application, we investigate via a variational method, eigenvalue problem for a degenerate Helmholtz operator on triangle.
Read the full abstract
Combinatorics · Cross-listed from cs.DS
Hardness of Burning Number Problem on Regular Graphs
The Burning Number Problem (BNP) models the spread of information or contagion in a network through a discrete-time process on a graph. At each step, one new vertex is selected as a burning source, while fire simultaneously spreads from previously burned vertices to their neighbors. The burning number of a graph is the minimum number of steps required to burn all vertices. The decision version asks whether the burning number is at most a given integer $k$. BNP is known to be NP-complete even on restricted graph classes such as path forests. We study BNP on connected regular graphs, a natural and previously unexplored graph class. We prove that BNP is NP-complete on connected cubic graphs, and moreover APX-hard under this restriction. We further show that BNP remains APX-hard on connected $d$-regular graphs for every fixed $d \geq 4$.
Read the full abstract
Combinatorics
On equidistribution theorem for plane partitions
We prove equidistribution of two pairs of statistics on boxed plane partitions: (volume, trace) and (corner-hook volume, number of corners). The proof relies on different 3d visualizations of the corresponding non-intersecting path systems. In particular, we obtain a new visual proof for a volume generating function of plane partitions. We also introduce a new statistic called the cohook area on ordinary partitions, and prove that it is equidistributed with the area of partitions.
Read the full abstract
Mathematical Physics
Weakly nonlinear dynamics of follower-force-induced oscillations in Cosserat rods
We investigate the weakly nonlinear dynamics of the flutter instability of a planar Cosserat rod in a viscous fluid driven by a terminal follower force. Building on our previous linear stability analysis, we derive Stuart-Landau amplitude equations governing the emergence and saturation of oscillations near the Hopf bifurcation. The Landau coefficients are expressed in terms of the critical eigenmode, its adjoint, and quadratic correction fields arising from the asymptotic expansion. The reduced theory predicts the criticality of the Hopf bifurcations, the saturated oscillation amplitude, and the nonlinear frequency correction, in quantitative agreement with direct numerical simulations for representative material parameter regimes. Applying the theory to both stability boundaries of the finite oscillatory window, we find that the lower Hopf bifurcations are supercritical, whereas the upper restabilization threshold is subcritical. These results provide a normal-form description of follower-force-driven oscillations in geometrically exact Cosserat rods and a reduced framework for studying nonconservative elastohydrodynamic instabilities in soft robotic structures and active filaments.
Read the full abstract
Logic
Nonembeddings of Combinatory Algebras
In the theory of combinatorial algebras, there is a sequence of embeddings between Kleene's second model, van Oosten's model, and Scott's graph model. We prove that none of these embeddings can be reversed. We also prove nonembedding results for the effective versions of these models, and in addition we discuss relativized embeddings. This answers several questions from the literature.
Read the full abstract
Analysis of PDEs
Bilinear embedding for divergence-form operators with first-order terms and negative potentials
This article establishes a bilinear embedding for second-order divergence-form operators with complex coefficients, characterized by the simultaneous presence of first-order terms and negative potentials. This work provides a further development of the theory initiated by Carbonaro and Dragičević for the homogeneous case, and recently extended by the second author in two papers where first-order terms and negative potentials were treated separately. We work in the general setting of arbitrary open subsets of $\mathbb{R}^d$ under Dirichlet, Neumann, or mixed boundary conditions. Our main contribution is the introduction of a unified notion of generalized $p$-ellipticity that extends all its predecessors and serves as the natural condition for the bilinear inequality. Methodologically, we overcome the rigidity of the Bellman-heat method on arbitrary open subsets by introducing a novel sequence-based approach that unifies and simplifies the previous techniques. As fundamental applications, we prove the boundedness of the $H^\infty$-calculus on $L^p$ and establish $L^p$-maximal regularity. Moreover, we show that this generalized $p$-ellipticity provides a sufficient condition for the $L^p$-contractivity and $L^p$-analyticity of the generated semigroup. Finally, we apply our theory to magnetic Schrödinger operators, characterizing the range of exponents $p$ for which the associated coefficient tuple satisfies the generalized $p$-ellipticity condition introduced here.
Read the full abstract
Statistics Theory
Asymptotic Anytime-Valid Inference for U-statistics
We study asymptotic anytime-valid confidence sequences for degree-two U-statistics under continuous monitoring. In the nondegenerate case, Hoeffding's projection reduces the problem to a time-uniform central limit theory for the partial sums of the first-order projection, while the canonical remainder is shown to be negligible under mild moment assumptions. A leave-one-out jackknife estimator then yields a fully data-driven procedure, leading to confidence sequences with asymptotic coverage guarantee for the parameter of interest. In the degenerate case, we show that the U-statistic is approximated by a centered quadratic Gaussian-chaos rather than by a simple Gaussian, which poses significant challenges for sequential inference. To address this issue, we novelly develop the Spectrally Allocated Gaussian-chaos Excursion (SAGE) boundary, and then provide plug-in implementations based on truncated spectrum estimation with consistency guarantees. The resulting widths can attain the expected time-uniform optimal rates: $\sqrt{\log\log n/n}$ in the nondegenerate regime and $\log\log n/n$ in the degenerate regime. Several widely used U-statistics are discussed within the proposed framework, and numerical experiments further support the validity of the derived theory.
Read the full abstract
Combinatorics
Combinatorial study of the q-Catalan triangle and its generalizations
We announce a series of results on the combinatorial study of the q-Catalan triangle (C_{n,k}(q)), defined by C_{n,0}(q)=q^{n(n-1)/2} and C_{n,k}(q)=C_{n,k-1}(q)+q^{n-k-1}C_{n-1,k}(q). We establish combinatorial interpretations via a universal combinatorial family of seven components: four families of pattern-avoiding permutations weighted by inversion or co-inversion statistics, Dyck paths, binary words and triangulations. We introduce the mirror polynomial C-tilde_{n,k}(q)=q^{n(n-1)/2}C_{n,k}(q^{-1}), prove its dual recurrence and co-inversion interpretation. The q,p-Catalan triangle and a multivariate generalization opening the way to cyclotomic q-analogues are introduced. Theorems on the q-Catalan triangle via 312-avoiding permutations and the mirror recurrence are proved completely here. This is the first paper of series W0-W5 on classical and q-deformed interpretations of the Catalan triangle.
Read the full abstract
Probability
Lower bound on the mixing time of $p$-spin glasses
We show that Glauber dynamics for $ p$-spin glass mixes exponentially slowly at inverse temperatures larger than a constant times $ \ln (p)/p $ for large enough $ p $. This is done by analyzing the energy landscape using Gaussian decompositions and establishing a bottleneck bound.
Read the full abstract
Classical Analysis and ODEs
Darboux-type formula for Jacobi biorthogonal polynomials
In this paper, we study the asymptotic behavior of Jacobi biorthogonal polynomials. A Darboux-type formula is established using the method of steepest descent. In the proof, we construct an appropriate contour to apply the Rodrigues formula. Our result reduces to the classical Darboux formula in the orthogonal case.
Read the full abstract
Optimization and Control
Optimal Asymptotic Rates for (Stochastic) Gradient Descent under the Local PL-Condition: A Geometric Approach
Stochastic gradient descent (SGD) has been studied extensively over the past decades due to its simplicity and broad applicability in machine learning. In this work, we analyze the local behavior of gradient descent and stochastic gradient descent for minimizing $C^2$-functions that satisfy the Polyak-Lojasiewicz (PL) inequality and under a multiplicative gradient noise model motivated by overparameterized neural networks. Using a geometric interpretation of the PL-condition, we prove a simple yet surprising fact: in this possibly non-convex setting, the asymptotic convergence rate of (S)GD matches the rate obtained for strongly convex quadratics.
Read the full abstract
Optimization and Control
Scalable Solution of the Stochastic Multi-path Traveling Salesman Problem via Neural Networks
The multi-path Traveling Salesman Problem with stochastic travel costs arises in hybrid vehicle routing applications designed for Smart City and City Logistics, where multiple paths exist between each pair of locations. Travel times along these paths are typically affected by real-time traffic conditions and therefore modeled as stochastic. The objective of the problem is to determine a Hamiltonian tour that minimizes the expected total travel cost under uncertainty. In this work, we adopt a two-stage stochastic programming formulation. In the first stage, a predefined route specifying the sequence of locations to be visited is determined, while taking into consideration a second-stage recourse problem that selects the optimal path from the feasible set of alternative paths for each pair of locations, once real-time traffic conditions are realized. To reduce the computational burden imposed by the large number of scenarios required to capture travel time uncertainty, the innovation of this work is the integration of neural network-based surrogate models to approximate the expected value of the second-stage recourse problem. Different architectures and training strategies for the neural networks are proposed and analyzed, with performance evaluated in terms of computation time, solution quality, and generalization capability. Preliminary findings demonstrate the enhanced scalability and practical applicability of the approach for complex vehicle routing problems under uncertainty.
Read the full abstract
Information Theory
LLM-Enabled Automated Algorithm Design for Multiuser Fluid Antenna Communications
Fluid antenna is a new reconfigurable antenna technology that can dynamically adjust the positions or ports of radiating elements and therefore provides a new degree of freedom for wireless communications. However, the associated port selection is a challenging large-scale combinatorial optimization problem and difficult to solve. Existing manually designed heuristic algorithms are not only labor-intensive, but cannot achieve satisfactory performance. In this paper, we propose a novel paradigm that leverages large language models (LLMs) for automated design of optimization algorithms for fluid antenna systems without manual hyperheuristic tuning. Specifically, we study the problem of maximizing the minimum signal-to-interference-plus-noise ratio (SINR) in the downlink to ensure fairness among users by optimizing port selection and beamforming. We investigate two LLM-enabled algorithm optimization strategies. The first is to optimize the crossover and mutation operations to enhance the performance of the well-known genetic algorithm and the second is to design AutoPort, a new heuristic from scratch by LLM, to solve the optimization problem. Simulation results verify that the proposed method can achieve near-optimal performance and significant improvement over the conventional genetic algorithm and the deep learning approach.
Read the full abstract
Numerical Analysis · Cross-listed from cs.LG
Unbiased and Second-Order-Free Training for High-Dimensional PDEs
Deep learning methods based on backward stochastic differential equations (BSDEs) have emerged as competitive alternatives to physics-informed neural networks (PINNs) for solving high-dimensional partial differential equations (PDEs). By leveraging probabilistic representations, BSDE approaches can avoid the curse of dimensionality and often admit second-order-free training objectives that do not require explicit Hessian evaluations. It has recently been established that the commonly used Euler-Maruyama (EM) time discretization induces an intrinsic bias in BSDE training losses. While high-order schemes such as Heun can fully eliminate this bias, such schemes re-introduce second-order spatial derivatives and incur substantial computational overhead. In this work, we provide a principled analysis of EM-induced loss bias and propose an unbiased, second-order-free training framework that preserves the computational advantages of BSDE methods. Our code is available at https://github.com/seojaemin22/Un-EM-BSDE.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Distributionally Robust Model Predictive Control for Virtual Power Plants
This paper presents a distributionally robust model predictive control (DRMPC) framework for the optimal Virtual Power Plant (VPP) operation under electricity price uncertainty. A unified VPP model is formulated that captures the interaction between buildings, battery storage, and renewable generation, all influenced by exogenous weather and market signals. The proposed approach integrates data-driven forecasting with quantile-based uncertainty quantification to construct time-varying Wasserstein ambiguity sets that adapt to forecast dispersion and distributional shifts. This yields a tractable DR-MPC formulation that incorporates predictive distribution information directly into real-time decision making. The method is evaluated using real weather and market data from a Nordic case study across two seasonal scenarios. The results show that DR-MPC improves economic performance relative to standard forecast-based MPC when the ambiguity radius is chosen appropriately, with consistent gains of up to 0.8% for small radii across both seasonal scenarios. Larger radii become overly conservative and reduce revenue, underscoring the importance of proper radius selection. These findings demonstrate the practical value of distributionally robust optimization for uncertainty-aware VPP operation.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Perfect transmission and parallel composition for quantum walks on graphs with two leads
We study scattering for continuous-time quantum walks on finite graphs with two attached leads. We derive explicit formulae for the two-terminal scattering matrix in terms of characteristic polynomials of the finite graph and its vertex-deleted subgraphs. For real-weighted two-terminal graphs, we then introduce three real quantities, $\mu_1$, $\mu_2$, and $\nu$, which are each additive under parallel composition of graphs. In these variables, perfect transmission at fixed momentum is characterized by the condition $\mu_1=\mu_2$ together with a hyperbola in the corresponding $(\mu,\nu)$-plane, whose points determine the transmission phase. This turns the search for graphs with prescribed transmission properties into a geometric vector-sum problem for smaller building blocks.
Read the full abstract
Probability
Topics in Gaussian Wiener chaos expansion
These notes have been written for a series of lectures to be given at the 44th Finnish Summer School on Probability and Statistics in Lammi, Finland, from 25th to 29th May, 2026. They contain an introduction to Wiener chaos decomposition in finite dimension, a construction of Gaussian fields on the torus, including white noise and the Gaussian free field, and applications to the $\Phi^4$ model. They do not cover other important aspects of the topic, such as stochastic integration, stochastic PDEs and Malliavin calculus.
Read the full abstract
Combinatorics
Spectral extremal results for triangle-free graphs with chromatic number at least four
A graph is called $F$-free if it does not contain a copy of $F$. Let $G(r,s)$ denote a $K_{r+1}$-free graph of order $n$ with chromatic number at least $s$ that maximizes the spectral radius. Nikiforov [Linear Algebra Appl., 2007] proved the spectral Turán theorem, which implies that $G(r,s)$ is the $r$-partite Turán graph $T_{n,r}$ for $s\leq r$. Lin, Ning, and Wu [Combin. Probab. Comput., 2021] characterized the unique spectral extremal graph $G(2,3)$. This result was later extended by Li and Peng [SIAM J. Discrete Math., 2023] to all $s=r+1\geq 3$. In this paper, we push the characterization further by determining the unique extremal graph $G(2,4)$ for all sufficiently large $n$. Specifically, we show that $G(2,4)$ is precisely a blow-up of the Grötzsch graph. Interestingly, under the same conditions, $G(2,4)$ also coincides with the unique edge-extremal graph identified by Ren, Wang, Wang, and Yang [arXiv:2404.07486v2].
Read the full abstract
Information Theory
Digital Twin Synchronization Over Mobile Embodied AI Network With Agentic Intelligence
Efficient digital twin (DT) synchronization relies on maintaining high-fidelity virtual representations with minimal age of information (AoI). However, the synergistic potential of cooperative sensing and autonomous mobility of the sensing agent remains underexplored in existing DT synchronization frameworks. In this paper, we propose an agentic AI-empowered mobile embodied AI network (MEAN) framework for DT synchronization. In the proposed hybrid architecture, the base station (BS) conducts global orchestration, while the agents autonomously execute a five-stage closed-loop workflow: move-to-sense, cooperative sensing, onboard semantic processing, channel-aware mobility, and uplink transmission. To optimize synchronization performance, we formulate a joint topology dispatching and multidimensional resource allocation problem aimed at minimizing the maximum twin deviation across regions, subject to heterogeneous sensing fidelity and energy budget constraints. To tackle this, we develop a hierarchical two-layer optimization algorithm, where the outer-layer refines multi-agent assignment via a dynamic matching game, and the inner-layer iteratively optimizes the continuous resources. Extensive simulation results verify the convergence of the proposed algorithm and demonstrate its substantial superiority over multiple baseline schemes in reducing synchronization deviation. Furthermore, the results reveal that semantic compression serves as a vital substitute for channel resources in latency reduction under constrained bandwidth, while autonomous velocity adaptation provides an essential degree of freedom for the system to navigate the fundamental energy-time trade-off.
Read the full abstract
Analysis of PDEs
Optimal Weighted Smoothing and Asymptotics of Ancient Solutions for Fast Diffusion Equations
The Cauchy–Dirichlet problem for the fast diffusion equation on a smooth bounded domain admits a natural bound in the weighted space $L^p_{\Phi_1}$, where $\Phi_1$ is the first Dirichlet eigenfunction. A key regularization question is whether this implies the stronger $L^\infty$ bound. We provide a complete resolution, showing that the critical exponent coincides with the classical Brezis–Turner exponent from semilinear elliptic theory. As a primary application, we derive improved global Harnack inequalities and describe asymptotic behavior of positive ancient solutions.
Read the full abstract
Probability
A tree-free approach to 3D Yang-Mills Langevin dynamic. Analytic estimates and the existence of a model for a regularity structure
Using the multi-index approach to regularity structures due to F. Otto et al., we construct a regularity structure and a model for it associated to the stochastic Langevin equation for the 3D Euclidean Yang-Mills functional. For the model we also obtain global stochastic and global pointwise weighted Besov type estimates which hold almost surely. The model is defined as a limit of a sequence of smooth models introduced with the help of a mollified noise. When the mollification is removed the sequence converges in a certain topology defined with the help of the stochastic estimates. To obtain these results we develop the multi-index approach for systems of equations with vector-valued white noises. This project is motivated by the problem for constructing 3D Euclidean Yang-Mills measure and by the earlier results of the author on the related problem of canonical quantization of the Yang-Mills field on the Minkowski space.
Read the full abstract
Combinatorics
Munarini graphs: a generalization of Fibonacci cubes and Pell graphs. Part I
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive $1$s. Munarini introduced Pell graphs, a variation of Fibonacci cubes defined on ternary strings. A generalization of Pell graphs to $(k+1)$-ary strings has recently been proposed. In this paper we introduce Munarini graphs, which constitute an alternative generalization of Fibonacci cubes and Pell graphs. One of the main advantages of Munarini graphs is that, unlike previously proposed generalization, they are daisy cubes, as are Fibonacci cubes and Pell graphs. In this first article, we study some of their fundamental properties including the size, the recursive structure, the cube and maximal cube polynomials.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Parametrically Adaptive Transition Polynomial: a Signed-Parity Continuous-alpha Extension of Kunchenko Stochastic Polynomials
Kunchenko's method of polynomial maximization provides a semiparametric apparatus for parameter estimation under non-Gaussian errors, but its classical power basis relies on finite higher-order integer moments. This paper introduces the Parametrically Adaptive Transition Polynomial (PATP), a signed-parity fractional-power family controlled by a continuous parameter alpha in [0,1]. The quadratic exponent map p_i(alpha) connects the fractal regime p_i(0)=1/i, the degenerate linear point p_i(1/2)=1, and the signed-parity integer-power regime p_i(1)=i. For the degree-S=2 case we derive a closed-form variance-reduction coefficient g_2(alpha) in terms of signed and absolute fractional moments, identify the singular behavior at alpha=1/2, and state the moment and regularity conditions under which the formula is meaningful. The construction should be read as a Form-B PATP analogue within Kunchenko's generalized apparatus, not as an exact recovery of the canonical even-power PMM basis at alpha=1. Numerical illustrations on canonical distributions are used to examine the finite-sample behavior of the signed-parity estimator and to mark the boundary of applicability for extremely heavy-tailed cases such as Cauchy.
Read the full abstract
Information Theory
New Quaternary codes with small Plotkin-defects from two-generator simplicial complexes
A recent characterization of all lengths of Plotkin-optimal quaternary (that is, over the ring $\mathbb{Z}_4$) codes of arbitrary type \cite{tang2025plotkin} also pins down the parameters for which no Plotkin-optimal code exists. In this article, we determine the best achievable parameters in several of these cases, obtaining codes whose minimum Lee distance is one less than the Plotkin bound, namely the codes with Plotkin-defect 1. To the best of our knowledge, this is the first attempt to study quaternary codes with Plotkin-defects. Precisely, we construct infinite families of quaternary $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee weight distributions. As a result, we find two quaternary linear code families with Plotkin-defect 1 and report at least 23 new or improved parameters having small (upto 4) Plotkin-defects, including 13 projective and 7 optimal parameters. We additionally report 4 quaternary linear codes with best-known parameters that are also projective. Further, their linear Gray images give two infinite families of distance-optimal, one infinite family of at least almost dimension-optimal binary linear codes and five infinite families of minimal binary linear codes.
Read the full abstract
Optimization and Control
Uncovering latent consensus in heterogeneous populations: The Mixture Linear Ordering Problem
The classical linear ordering problem seeks a single ranking representing a given preference matrix. While suitable for homogeneous populations, it fails when observed preferences arise from several latent groups with distinct ranking patterns. To address this limitation, we introduce an extension partitioning the population into latent groups, each characterized by its own linear order, relative size, and preference structure. The observed matrix is then explained as the aggregate outcome of these group-specific preferences. We develop mixed-integer programming formulations, including a compact reformulation yielding a geometric interpretation within the linear ordering polytope. Because exact solutions become computationally demanding for larger instances, we propose a multi-start alternating-direction matheuristic iteratively updating group rankings and weights. Computational experiments on synthetically generated instances, matching sizes typical in preference aggregation scenarios, demonstrate the effectiveness of the exact approach in successfully recovering the underlying groups. Furthermore, the proposed heuristic delivers high-quality solutions in substantially shorter times, occasionally improving upon the exact method's best incumbent in difficult instances within the imposed time limit.
Read the full abstract
Geometric Topology
Quandle presentations of surface knots in 4-manifolds and bridge numbers
The fundamental quandle is an invariant for distinguishing surface knots, yet computable presentations have traditionally been limited to surfaces embedded in the $4$-sphere. Building on the framework of banded unlink diagrams introduced by Hughes, Kim, and Miller, we give a Wirtinger type presentation of the fundamental quandle of surface links in arbitrary $4$-manifolds. As applications, we extend the work of Sato and Tanaka to show that for any $b \geq 4$ and $m \geq 0$, there exist infinitely many pairwise non-local surface knots with bridge number $b$ in $\mathbb{C}P^2 \#m\overline{\mathbb{C}P^2}$, and we distinguish infinite families of surface knots with isomorphic knot groups, extending results of Tanaka and Taniguchi.
Read the full abstract
Algebraic Geometry
Weierstrass semigroups at totally ramified places of degree one on generalized Kummer extensions
We explicitly describe the set of gaps and the Weierstrass semigroup at a totally ramified place of degree one on a generalized Kummer extension defined by the affine equation $y^m = f(x)$ over $K$, an algebraic extension of $\mathbb{F}_q$, where $f(x)\in K(x)$ and $K$ is not required to contain a primitive $m$-th root of unity. For the different totally ramified places of degree one, our description takes a unified form. Then we provide a necessary and sufficient condition for the Weierstrass semigroup at a totally ramified place of degree one to be symmetric. Furthermore, we investigate the minimal generating set of the Weierstrass semigroups at many totally ramified places of degree one. We not only explicitly describe the minimal generating set, but also provide functions whose coefficients of pole divisors lie in the minimal generating set. Finally, we apply our results to generalized Kummer extensions with the same multiplicities, as well as function fields of GGS curves and subcovers of the BM curve.
Read the full abstract
Numerical Analysis
Dimension Calculation for Spline Spaces over Rectilinear Partitions via Smoothing Cofactor Method
This paper presents a general framework for calculating the dimension of spline spaces over arbitrary rectilinear partitions using the smoothing cofactor method. The approach extends existing dimension theory for polynomial splines over T-meshes by introducing the concept of TE-connected components, reducing the problem to the rank computation of explicitly constructible conformality matrices. Furthermore, a new class of rectilinear partitions, termed partitions with disjoint truncated l-edges, is introduced. It is proven that under specific conditions, the dimension of the corresponding spline space attains Schumaker's lower bound. This shows that the lower bound is attainable for arbitrary degree d and smoothness order mu in certain partition configurations. Numerical examples, including the Morgan-Scott and Yuan-Stillman partitions, validate the effectiveness and generality of the framework for both triangular and non-triangular rectilinear partitions.