Related papers: Integral Function Bases
Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of $\mathbb{P}^n$ of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings…
We revisit the concept of a minimal basis through the lens of the theory of modules over a commutative ring $R$. We first review the conditions for the existence of a basis for submodules of $R^n$ where $R$ is a B\'{e}zout domain. Then, we…
An expansion upon Donald Kunth's quarter-imaginary base system is introduced to handle any imaginary number base where its real part is zero and the absolute value of its imaginary part is greater than one. A brief overview on number bases…
We consider infinite parametric families of high degree number fields composed of quadratic fields with pure cubic, pure quartic, pure sextic fields and with the so called simplest cubic, simplest quartic fields. We explicitly describe an…
In this paper, we propose compactly supported radial basis functions for solving some well- known classes of astrophysics problems categorized as non-linear singular initial ordinary dif- ferential equations on a semi-infinite domain. To…
We discuss completeness, minimality, and basisness, in $L^2[0, \pi]$ and $L^p[0, \pi]$, $p \neq 2$, of dilated systems $u_n(x) = S(nx)$, $n \in \mathbb{N}$, where $S$ is a trigonometric polynomial $S(x) = \sum_{k = 0}^m a_k \sin(kx), \quad…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
A new technique for approximating the entire solution set for a nonlinear system of relations (nonlinear equations, inequalities, etc. involving algebraic, smooth, or even continuous functions) is presented. The technique is to first plot…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
This manuscript presents a generalization of the structure of the null space of the Bezout matrix in the monomial basis, see [G. Heinig and K. Rost, Algebraic methods for toeplitz-like matrices and operators, 1984], to an arbitrary basis.…
Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.
In this note we extend the Differential Transfer Matrix Method (DTMM) for a second-order linear ordinary differential equation to the complex plane. This is achieved by separation of real and imaginary parts, and then forming a system of…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…
In this work, we prove the existence of integrable solutions for the following generalized mixed-type nonlinear functional integral equation $$x(t)=g\left(t,(Tx)(t)\right)+f\left(t,\int_0^t…
This paper discusses a new method to solve definite integrals using artificial neural networks. The objective is to build a neural network that would be a novel alternative to pre-established numerical methods and with the help of a…
Let F(x_1,...,x_m) = u_1 x_1 + ... + u_m x_m be a linear form with nonzero, relatively prime integer coefficients u_1,..., u_m. For any set A of integers, let F(A) = {F(a_1,...,a_m) : a_i in A for i=1,...,m}. The representation function…
In this paper, using Euler's function, we give a formula of all integral solutions to linear indeterminate equation with $s$-variables $a_1x_1+a_2x_2+...+a_sx_s=n$. It is a explicit formula of the coefficients $a_1$, $a_2$,..., $a_s$ and…
Unitary error bases generalize the Pauli matrices to higher dimensional systems. Two basic constructions of unitary error bases are known: An algebraic construction by Knill, which yields nice error bases, and a combinatorial construction…
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…