Logic
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Saturday 25 April
This paper is a contribution to the investigation of closed partition relations for pairs of countable ordinals. As our main result, we prove that \[\omega^4 \cdot (n-2)+1 < R^{cl}(\omega \cdot n+1,3)<\omega^5\] for every integer $n \geq 3$. This result significantly improves the existing upper and lower bounds for these closed Ramsey numbers. In addition, we prove that \[\omega^{\theta}\nrightarrow_{cl} (\omega^{\alpha},3)^2\] whenever $1 \leq \alpha \leq \theta<\omega_1$ satisfy $\theta < R(\alpha,3)$. This result asymptotically improves the existing lower bounds for $R^{cl}(\omega^n,3)$ and slightly strengthens the existing necessary condition for being a topological partition ordinal.
Commutative Algebra
Associated primes of powers of closed neighborhood ideals and diameters of graphs
Let $G$ be a simple connected graph and $t \ge 2$ an integer. We prove that if the maximal homogeneous ideal is an associated prime of the $t$th power of the closed neighborhood ideal of $G$, then the diameter of $G$ is at most $7t - 8$. We further show that this bound is sharp for all $t \ge 2$.
Read the full abstract
Number Theory
On (not) learning the Möbius function
We prove lower bounds on learning the Möbius or Liouville function with a variety of standard learning techniques, including kernel methods, noisy gradient methods, and correlational statistical query algorithms. These results follow from quantitative bounds on the correlation of Möbius with digital characters of various finite abelian groups, where the group is dictated by the type of input data the algorithm is given. Using residues mod $p$ for many different primes corresponds to a cyclic group, and using the base $p$ expansion for a fixed prime corresponds to an elementary abelian $p$-group. We also note that lower bounds of this form are closely related to certain types of digital prime number theorems.
Read the full abstract
Rings and Algebras
Rings with finitely many zero divisors
We give an elementary proof of a result which is not as well known as it should be: a ring with a specified finite number of zero divisors is finite, with a precise bound on its order.
Analysis of PDEs
Gradient regularity for viscosity solutions to quasilinear parabolic equations with mixed singular-degenerate structure
We establish regularity results for viscosity solutions to a class of quasilinear parabolic equations exhibiting nonhomogeneous degeneracy or singularity (a double phase regime) of the form \[ u_t - \big(|Du|^{\mathfrak{p}} + \mathfrak{a}(x,t)|Du|^{\mathfrak{q}}\big)\Delta_p^{\mathrm N} u = f(x,t) \quad \text{in } Q_1, \] where $-1 < \mathfrak{p} < 0$, $\mathfrak{p} \leq \mathfrak{q}$, and $\mathfrak{a}, f : Q_1 \to \mathbb{R}$ are prescribed functions. Using the Jensen–Ishii method, we prove Lipschitz regularity for appropriately translated solutions. Moreover, combining this approach with intrinsic scaling techniques, we establish interior Hölder continuity estimates for the gradient. Our results extend recent work of Fang and Zhang on the homogeneous case via a different approach.
Read the full abstract
Optimization and Control
Vertical Control Systems on Tangent Bundles and Fiberwise Controllability
We study control systems on the tangent bundle of a smooth manifold induced by vertical lifts of vector fields. The Vertical dynamics acts exclusively along the fibers, leaving the base point unchanged and reducing the system to a linear control problem on each tangent space, for which we obtain explicit solutions and characterize reachable sets, showing that fiberwise controllability is equivalent to a rank condition on the original vector fields. We then consider lifted systems combining complete drift and vertical controls, where the base trajectory is fixed by the drift and the control acts on tangent directions. For these systems, we derive explicit solutions and a complete characterization of reachable sets via a transport operator, yielding a necessary and sufficient condition for fiberwise controllability in terms of transported vector fields, together with a Lie-algebraic sufficient criterion.
Read the full abstract
Differential Geometry
An analytical characterization of Eguchi-Hanson space and its higher-dimensional analogs
Let $(M,g)$ be a complete 4-dimensional Ricci-flat ALE orbifold with finitely many orbifold points and group at infinity $\mathbb{Z}_2$. We prove that if the $L^2$ kernel of its Lichnerowicz Laplacian has dimension at most 3, then $(M,g)$ is either the Eguchi-Hanson space or the flat orbifold $\mathbb{R}^4/\mathbb{Z}_2$. A similar uniqueness result is proved for Calabi's higher-dimensional analogs of the Eguchi-Hanson space among Ricci-flat Kähler ALE orbifolds with group at infinity $\mathbb{Z}_m$.
Read the full abstract
Number Theory
Differences of squares of upper-triangular $2\times 2$ integer matrices
We consider the problem of characterizing upper-triangular matrices $M=\begin{pmatrix}p&r\\0&q\end{pmatrix}\in M_2(\mathbb Z)$ which can be represented in the form $A^2-B^2$ with upper-triangular integer matrices $A$ and $B$ and give a complete criterion in terms of representations of $p$ and $q$ as differences of two squares and an additional divisibility condition on $r$. Also, we give a complete classification of representable matrices in terms of congruence conditions on $p$, $q$, and $r$.
Read the full abstract
Functional Analysis
T Extended Weakly Contractive, Kannan, and Geraghty Mappings Fixed Points, Equivalences,
We develop a unified T-extended framework for weakly contractive, weakly Kannan, and Geraghty classes of self-maps S on a metric space (X, d), where distances are measured on the auxiliary image via d(Tx, Ty), and the dynamics is governed by the composition of T and S. Under standard assumptions on the auxiliary map T (continuity, injectivity, subsequential convergence), fixed point theorems and Picard convergence are established for each class. The main contribution is twofold. First, it is shown that the T-extended weakly contractive class coincides with the T-extended Geraghty class, and that the T-extended weakly Kannan class coincides with the T-extended Kannan-Geraghty class. Second, the mechanism behind these equivalences is clarified by transporting the problem to an induced map F from T(X) to T(X), defined by F(Tx) = T(Sx), where the extended properties reduce exactly to the classical ones with the same control functions. A Delta-type ratio criterion on T(X) and quantitative Picard convergence rates are also provided. Examples, including Volterra smoothing operators, are presented to highlight the role of the auxiliary map. All results extend naturally to rectangular (Branciari) metric spaces.
Read the full abstract
Algebraic Topology
Rational relative sectional category
We develop an algebraic model for the relative sectional category of a continuous map in rational homotopy theory using commutative differential graded algebras (CDGAs). Our main result establishes that for formal maps, the rational relative sectional category can be computed purely from cohomology, using ideal nilpotency. We also show that this equality may fail in general topological settings. Applying this framework, we obtain purely algebraic characterizations for the rational Lusternik-Schnirelmann category and the rational higher topological complexity of a map. Finally, we provide an algebraic description of the rational homotopic distance between formal maps.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Asymptotic theory of rerandomization for survival analysis
Rerandomization systematically reduces chance imbalance and can improve the efficiency of the average treatment effect estimator in randomized experiments. While the asymptotic properties of finite-dimensional M-estimators under rerandomization have been established, existing theory does not directly address survival outcomes under censoring, where the target estimand involves infinite-dimensional functional parameters. This article establishes the uniform weak convergence of treatment-specific survival function estimators under rerandomization and stratified rerandomization. We prove that the Kaplan-Meier and inverse probability of censoring weighted Kaplan-Meier estimators converge to tight limiting processes with reduced pointwise asymptotic variances. Furthermore, we prove that the pointwise asymptotic variance of the debiased machine learning survival function estimator remains invariant under rerandomization, a consequence of the Neyman orthogonality. Simulations and a real data example are used to illustrate the theoretical results. Our results characterize the geometric interplay between restricted randomization designs and analysis-stage covariate adjustment for functional target estimands in survival analysis.
Read the full abstract
Optimization and Control
Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
Two-stage stochastic integer programs provide a powerful framework for modeling decision-making under uncertainty, but they are notoriously difficult to solve at scale due to their high dimensionality and intrinsic nonconvexity. Decomposition-based algorithms such as Benders methods and Branch-and-Price (related dual decomposition methods) have become standard computational approaches for such problems and demonstrate excellent empirical performance in practice. Despite their widespread use, however, existing theoretical guarantees are almost exclusively based on worst-case analyses, which predict exponential convergence behavior in the problem dimension and fail to explain the strong performance observed in practice. In this paper, we present the first average-case analysis of Branch-and-Price for a broad class of two-stage stochastic binary integer programs. We study a stochastic-input model in which objective coefficients and constraint matrices are drawn at random and right-hand-side vectors scale with the decision dimension, while the number of constraints per scenario is fixed. Under this model, we prove that, with high probability, Branch-and-Price explores at most n^O(log s)nodes, yielding a quasi-polynomial bound on the size of the search tree in typical instances, where n denotes the decision dimension and s the number of scenarios. A key ingredient of our analysis is an average-case bound on the integrality gap of the natural linear programming (LP) relaxation. We show that this gap shrinks at rate O((logs log^2 n)/n)with high probability. This result is of independent interest, as it implies that the integrality gap grows only logarithmically with the number of scenarios on average.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Non-unitary extension of Grover's search algorithm
We have developed a non-unitary extension of Grover's search algorithm by changing the hidden geometry of Hilbert space carried by diffusion operator. Our algorithm finds the solution for search problem by performing a unique bigger rotation rather than small rotations in order polynomial times in the size $N$ of search space. We analyze the complexity of implementing the non-unitary operation and we observed that the price paid by performing this rotation is due the normalization. In Kraus operator approach we need $O(N)$ repetition of the algorithm to have a chance of measuring a solution in a post-selection, this is no better than the classical solution. However, the quantum singular value transform in addition with block encoding and Chebyshev polynomial approximation, we got complexity $O(\sqrt{N})$ and reach the Grover's bound with an extra resource of one single qubit, compared with the standard Grover's algorithm.
Read the full abstract
Combinatorics
Average Steps until Absorption on Random Walks on Sea Dragon Trees
For a graph $G$ and vertices $u,v$, we define the ASUA of $v$, $t(G,v,u)$, to be the average steps until absorption along a random walk terminating at $u$. We define a sea dragon to be a tree with a unique path $P$ such that if $d(u) \geq 3$ for some vertex $u$, then $u \in V(P)$. We use Markov chains to determine $t(G,v,u)$ for all vertices of several classes of sea dragons, a broad subclass of trees. Additionally, we give several results on equations related to ASUAs on general graphs.
Read the full abstract
Number Theory
Hybrid Conjecture in a Mixed Shimura variety
The authors previously formulated the hybrid conjecture, unifying André-Pink-Zannier and André-Oort conjectures, and proved it in Shimura varieties of abelian type. We study its analogue for mixed Shimura varieties, and consider the prime example, the universal abelian scheme $\mathcal{A}_g\to \mathbb{A}_g$. In a radical departure from the Pila-Zannier strategy, typically applied to such questions, we employ instead a combination of equidistribution and o-minimality Our main result strictly includes the following: the Hybrid Conjecture, in particular the André-Pink-Zannier and André-Oort conjectures, for $\mathbb{A}_g$; the mixed André-Oort conjecture for $\mathcal{A}_g$; and Manin-Mumford conjecture for arbitrary abelian varieties. It also yields an analogue of the “Manin-Mumford in arithmetic pencil", a result of Baldi-Richard-Ullmo, for abelian schemes over a variety. The mixed hybrid conjecture in $\mathcal{A}_g$ also encompasses the Mordell-Lang conjecture. We actually reduce the mixed hybrid conjecture for $\mathbb{A}_g$ to its "mordellic" part. We also prove, Galois-theoretic results: uniform variants on the Ribet's Kummer theory of Abelian varieties, and Serre's theorem on Lang's conjecture.
Read the full abstract
Dynamical Systems · Cross-listed from physics.flu-dyn
Physics-Informed Temporal U-Net for High-Fidelity Fluid Interpolation
Reconstructing high-fidelity fluid dynamics from sparse temporal observations is quite challenging, mainly due to the chaotic and non-linear nature of fluid transport. Standard deep learning-based interpolation methods often tend to regress to the mean, which results in spatial blurring and temporal strobing, especially noticeable around the observed anchor frames where transitions become discontinuous. In this work, we propose a novel Temporal U-Net architecture that integrates a VGG-based perceptual loss along with a Physics-Informed Bridge to overcome these issues. By introducing time-weighted feature blending and enforcing a parabolic boundary condition defined by t(1 - t), the model ensures smooth transitions while also maintaining perfect consistency at the endpoints. Experimental results on multi-channel RGB fluid data show that our method clearly outperforms standard models, both in terms of structural fidelity and texture preservation. In particular, the model achieves a Mean Absolute Error of 0.015, compared to 0.085 for a standard L1 baseline. Further Spatial Power Spectral Density (PSD) analysis reveals that the model is able to retain high-frequency turbulent details that are usually lost in deterministic reconstructions.
Read the full abstract
Optimization and Control
Nonlinear Non-Gaussian Density Steering with Input and Noise Channel Mismatch: Sinkhorn with Memory for Solving the Control-affine Schrödinger Bridge Problem
Solutions to the Schrödinger bridge problem and its generalizations yield feedback control policies for optimal density steering over a controlled diffusion. To numerically compute the same, the dynamic Sinkhorn recursion has become a standard approach. The mathematical engine behind this approach is the Hopf-Cole transform that recasts the conditions for optimality into a system of boundary-coupled linear PDEs. Recent works pointed out that for the control-affine Schrödinger bridge problem, this exact linearity via Hopf-Cole transform, and thus the standard Sinkhorn recursion, apply only if the control and noise channels are proportional. When the channels do not match, the Hopf-Cole-transformed PDEs remain nonlinear, and no algorithm is available to solve the same. We advance the state-of-the-art by designing a Sinkhorn recursion with memory that leverages the structure of these nonlinear PDEs, and demonstrate how it solves the control-affine Schrödinger bridge problem with input and noise channel mismatch. We prove the local stability of the proposed algorithm.
Read the full abstract
Statistics Theory
Conway–Maxwell multivariate Bernoulli distribution
We investigate the Conway–Maxwell multivariate Bernoulli distributions, a family of multivariate Bernoulli distributions derived from the Conway–Maxwell-binomial distribution. We show that it is possible to set the parametrization such that the Bernoulli marginals remain intact, allowing us to study dependence properties within this family. In particular, we demonstrate that this family spans the full spectrum of dependence. Moreover, for specific ranges of the parameters, these distributions satisfy the strongly Rayleigh property, a negative dependence notion stronger than negative association.
Read the full abstract
Combinatorics
Eigenvalues of Hypergraph Products and Reciprocal Eigenvalue Property
Spectral hypergraph theory has recently attracted considerable interest as it provides a natural framework for modeling higher-order relationships beyond classical graphs. In this setting, eigenvalues of adjacency, Laplacian, and signless-Laplacian hypermatrices play an important role in understanding the underlying structure of hypergraphs. In this work, we study the adjacency, Laplacian, and signless-Laplacian eigenvalues of the join, Kronecker, and corona products of hypergraphs, and examine how these spectra behave under such operations. These investigations help in better understanding the interplay between hypergraph structure and spectral properties. The reciprocal eigenvalue property is of particular interest due to the spectral symmetries it reflects. Motivated by this, we extend the notion of reciprocal eigenvalue property to hypergraphs and show that power hypertrees do not satisfy this property.
Read the full abstract
Complex Variables
Selecting the optimal Parameters Results in Double Interpolation: Double AFD
Let $f$ belong to the Hardy space $H^2(\mathbb{D})$ of the unit disc, and $e_a$ the normalized Szegö (reproducing) kernel of $H^2(\mathbb{D}).$ It is well known that, due to the reproducing kernel property, for any distinct $n$ points $a_1,\cdots,a_n$ in $\mathbb{D}$ the orthogonal projection of $f$ into ${\rm span}\{e_{a_1},\cdots,e_{a_n}\},$ denoted as $P_{{\rm span}\{e_{a_1},\cdots,e_{a_n}\}}(f),$ interpolates $f$ at the points $a_k$'s. The present study further proves that if the $a_k$'s are optimally selected according to certain energy matching pursuit principle, then $P_{{\rm span}\{e_{a_1},\cdots,e_{a_n}\}}(f)$ double interpolates $f$ at the points $a_k$'s, or order $m=2$ interpolation, that is, \[ P_{{\rm span}\{e_{a_1},\cdots,e_{a_n}\}}(f)(a_k)=f(a_k), \quad {\rm and}\quad P_{{\rm span}\{e_{a_1},\cdots,e_{a_n}\}}'(f)(a_k)=f'(a_k),\quad k=1,\cdots,n.\] With the accordingly newly defined double Takenaka-Malmquist system, the norm convergence for $n\to \infty,$ the $n$-best approximation for $n$ being fixed, and the related boundary function interpolation are studied. The such generated new sparse representation, named as double AFD, is shown to outperform the classical AFD. Pointwise interpolations for orders $m>2,$ meaning to simultaneously interpolates all functions $f,f',\cdots,f^{(m-1)}$ at a set of $a_k$'s are, additionally, discussed. For the Hardy space of the upper-half complex plane there exists a counterpart theory.
Read the full abstract
Representation Theory
Chains of model structures arising from cotorsion pairs on extriangulated categories
The main aim of this paper is to study chains of model structures arising from cotorsion pairs in extriangulated categories. Starting with a hereditary Hovey triple, we construct further hereditary Hovey triples whose homotopy categories are equivalent under suitable completeness assumptions, thereby refining results due to El Maaouy and Shao-Wang-Zhang. As an application, we consider objects of finite Gorenstein injective dimension with respect to a proper class of $\mathbb{E}$-triangles. Under mild set-theoretic assumptions, we obtain a chain of model structures whose homotopy categories are all triangulated equivalent to a common stable category. This recovers known results for Gorenstein injective modules and yields new examples in the derived category of a ring when the proper class is given by cohomological ghost triangles.
Read the full abstract
Numerical Analysis
GeoFunFlow-3D: A Physics-Guided Generative Flow Matching Framework for High-Fidelity 3D Aerodynamic Inference over Complex Geometries
Deep generative models and neural operators have demonstrated significant potential for 3D aerodynamic inference. However, they often face inherent challenges in maintaining physical consistency and preserving high-frequency features, primarily due to spectral bias and gradient conflicts within the governing equations. To address these issues, we propose GeoFunFlow-3D, a physics-guided generative flow matching framework. Temporally, we utilize optimal transport theory to build the generation path, ensuring stable training dynamics. Spectrally, we introduce a high-order discrete engine without automatic differentiation (No-AD) to reduce gradient stiffness. Spatially, a topology-aware super-resolution module (SATO) is employed to rigorously enforce physical laws in localized regions such as shock waves. We evaluated our framework on complex industrial datasets. On the BlendedNet dataset, the model successfully avoids mode collapse even under sparse data conditions. For the NASA Rotor37 test, it accurately captures 3D detached shock structures. Compared to conventional operators, GeoFunFlow-3D significantly improves accuracy, reducing the pressure field error (RRMSE) to 0.0215 while maintaining competitive inference efficiency. Ultimately, this work provides a reliable, geometry-driven approach for generating high-dimensional fluid fields.
Read the full abstract
Analysis of PDEs
Interior $C^{2}$ estimate for semi-convex solutions to a class of Hessian quotient equations in arbitrary dimensions
In this paper, we study the interior $C^{2}$ estimates for Hessian quotient equations $\frac{\sigma_{3}(D^{2}u)}{\sigma_{l}(D^{2}u)}=1$ for $l=1, 2$, in arbitrary dimensions, under the natural ellipticity and semi-convexity conditions. We further derive analogous results for the corresponding sum Hessian equations. In addition, we establish several rigidity results.
Read the full abstract
Analysis of PDEs
Blowing-up Solutions with Residual Mass in a Slightly Subcritical Dirichlet Problem
In this paper, we study the Dirichlet elliptic problem $(\mathcal{P}_\varepsilon)$: $-\Delta u +V\,u = u^{p-\varepsilon}$, $u>0$ in $\Omega$, $u=0$ on $\partial\Omega$, where $\Omega\subset \R^n$ ( $n\geq 3$) is a bounded domain, $V$ is a smooth positive function on $\overline{\Omega}$, $p+1= 2n/(n-2)$ is the critical Sobolev exponent, and $\varepsilon >0$ is a small parameter. First, we show that, unlike the case of weak convergence to zero, interior bubbling solutions with a nonzero weak limit cannot occur in low dimensions. We then treat the general setting by removing the restriction that blow-up points are confined to the interior. Using delicate asymptotic expansions of the gradient of the associated functional, we prove that in dimensions $n=4$ and $n=5$, single blow-up point cannot coexist with residual mass.\\ We further elucidate the role of the sign of the normal derivative of the potential $V$ on the boundary: if it is positive, any single blow-up solution with residual mass must occur in the interior; if it is negative at some boundary point, boundary blow-up solutions with residual mass can be constructed. Finally, we construct both simple and non-simple interior blow-up solutions exhibiting residual mass, without any assumption on the sign of the normal derivative of $V$. These results provide new insights into the interaction between the potential, the geometry of the domain, and the critical nonlinearity.
Read the full abstract
General Topology
Topological and differentiable aspects of Clifford semigroups
This paper investigates the interplay between algebraic structure, topology, and differentiability in Clifford semigroups. The study is developed along three main themes. First, in the compact Hausdorff setting, we provide an explicit construction of a compatible metric for the Bowman topology. Second, we address Hilbert-fifth-type questions by establishing criteria under which the maximal subgroups are forced to be Lie groups. Finally, we prove a structural rigidity theorem: $C^1$-regularity at the idempotents implies that the idempotent semilattice is discrete.
Read the full abstract
Rings and Algebras
On the minimal dimension of maximal commutative subalgebras of $M_6(k)$
We study the minimal dimension of maximal commutative subalgebras of the matrix algebra $M_n(k)$ over an algebraically closed field. While examples with dimension strictly smaller than n are known for $n \geq 14$, no such examples are known in smaller dimensions. In this paper, we show that for n = 6 every maximal commutative subalgebra $A\subset M_6(k)$ satisfies $\dim A \geq 6$. The proof is based on a detailed analysis of local algebras and their module structure, combined with explicit estimates of the dimension of the centralizer.
Read the full abstract
Optimization and Control
Risk-sensitive linear-quadratic-Gaussian graphon mean-field games
This paper investigates a class of linear-quadratic-Gaussian risk-sensitive graphon mean-field games, involving an asymptotically infinite population of heterogeneous agents distributed across an asymptotically infinite network, where each agent aims to minimize an exponential cost functional reflecting its risk sensitivity. Following the Nash certainty equivalence methodology, an auxiliary risk-sensitive optimal control problem is constructed and further combined with a consistency condition to determine decentralized strategies of the agents. The well-posedness of the resulting graphon mean-field game equation system, consisting of a family of fully coupled forward-backward differential equations, is established by a fixed point approach under a contraction condition, and by the method of continuity under an operator monotonicity condition, respectively. To prove the epsilon-Nash equilibrium property of the obtained decentralized strategies, one faces significant challenge since the usual L^2 error estimates on mean-field approximations are no longer adequate due to unboundedness of the integrand in the exponentiated cost. The proof will be accomplished by establishing certain exponentiated error estimates instead of L^2 error estimates. Finally, a numerical example is provided to illustrate our results.
Read the full abstract
Number Theory
Core abaci and Diophantine equations I: fundamental weight
In the light of a series of papers on moving vectors, we define and study core abaci of classical affine types for arbitrary charge. This greatly extends the concept of cores with charge zero, and make us being able to parameterize the affine Grassmannian $W^j$ by core abaci of charge $j$ for arbitrary classical affine types. By associating a core abacus $(\lam, j)$ to a weight $\Lambda_j-\beta$ and an affine Weyl group element $w_{\lam, j}$, we prove that the height of $\beta$ is equal to the atomic length of $w_{\lam, j}$. This solves a generalized version of the open problem raised by Brunat, Chapelier-Laget and Gerber. Moreover, Diophantine equations of classical affine types are established by using the height formula that given by Uglov vector. The solutions of certain classes of these Diophantine equations are proved to be completely parameterised by core abaci. As another application, closed formulae for computing the number of certain kinds of core abaci are given.
Read the full abstract
Numerical Analysis
Summation-by-parts operators for general function spaces: optimal nodes
Gauss-Lobatto quadrature nodes and weights are optimal for closed summation-by-parts (SBP) formulations based on polynomial approximation spaces in the sense that for a prescribed function space they yield an SBP operator of minimal dimension. We show that the same principle extends to general (possibly non-polynomial) function spaces: an associated generalised Gauss-Lobatto quadrature provides the optimal nodes and weights for the SBP formulation. We present an algorithm for computing these quadrature rules, demonstrate their accuracy and efficiency across a range of function spaces, and illustrate their use in solving initial boundary value problems.
Read the full abstract
Combinatorics
Weighted discrete tori and weighted trigonometric sums
In this paper, we obtain a weighted trigonometric summation formula which is an extension of the trigonometric summation formula by Grigor'yan, Lin and Yau \cite{GLY}.