Abstract In this paper, we collect the basic theory and most important applications of a novel technique that has shown to be suitable for scattered data interpolation, quadrature, bio-imaging reconstruction. The method relies on polynomial mapped bases allowing, instance, incorporate or function discontinuities in mapping function. new substantially mitigates Runge’s Gibbs effects.

We establish a method of Gröbner–Shirshov bases for trialgebras and show that there is unique reduced basis every ideal free trialgebra. As applications, we give the construction normal forms elements an arbitrary trisemigroup, in particular, A.V. Zhuchok’s (2019) commutative trisemigroups are rediscovered some abelian first constructed. Moreover, Gelfand–Kirillov dimension finitely generated t...

in this paper, we investigate duality of modular g-riesz bases and g-riesz basesin hilbert c*-modules. first we give some characterization of g-riesz bases in hilbert c*-modules, by using properties of operator theory. next, we characterize the duals of a giveng-riesz basis in hilbert c*-module. in addition, we obtain sucient and necessary conditionfor a dual of a g-riesz basis to be again a g...

We prove an automorphic analogue of Deligne's conjecture for symmetric fourth L-functions Hilbert modular forms. extend the result Morimoto [41] based on generalization and refinement results Grobner Lin [18] to cohomological irreducible essentially conjugate self-dual cuspidal representations GL2 GL3 over CM-fields.

The first Gröbner basis algorithm was constructed by Buchberger in 1965; thus it bears his name to this day – Buchberger’s algorithm.[9] Though Buchberger’s algorithm looks relatively simple, it can take a very large amount of time. The step that creates 0 h via a normal form calculation is computationally very difficult. This is particularly frustrating (and wasteful) if the normal form calcul...

Let M (f) denote the midpoint rule and T (f) the trapezoidal rule for estimating ∫ b a f(x) dx. Then Simpson’s rule = M (f) + (1 − )T (f), where = 3 . We generalize Simpson’s rule to multiple integrals as follows. Let Dn be some polygonal region in R; let P0; : : : ; Pm denote the vertices of Dn, and let Pm+1 equal the center of mass of Dn. De4ne the linear functionals M (f) =Vol(Dn)f(Pn+1), wh...

This paper presents an explicit bound on the number of primitive elements that are linear combinations of generators for field extensions. It is well known that every finite separable extension of an arbitrary field has a primitive element; that is, there exists a single element in the extension field which generates that field over the ground field. This is a fundamental theorem in algebra whi...

For a class of cubic differential systems, Kukles established necessary and sufficient conditions for the existence of a centre. This paper presents a particular system that shows that either Kukles' conditions are incomplete, or the multiplicity of the origin as a focus is greater than or equal to 9. The second author described in [6] a mechanical procedure based on Poincare's classic method, ...

Coding theory plays an important role in efficient transmission of data over noisy communication channels. It consists of two steps; the first step is to encode the data to reduce its sensitivity to noise during transmission, and the second step is to decode the received data by detecting and correcting the noise induced errors. In this thesis an algebraic approach is used to develop efficient ...

In this paper we establish a connection between the \bases" in