Related papers: Multivariate Difference-Differential Dimension Pol…
We first present an intersection theory of partial differential varieties with quasi-generic differential hypersurfaces. Then based on the generic intersection theory, we define the partial differential Chow form for an irreducible partial…
Let $X$ be a $2$-dimensional subshift of finite type generated by a finite set of forbidden blocks (of finite size). We give an algorithm for generating the elements of the shift space using sequence of finite matrices (of increasing size).…
In this paper we obtain a set of polynomials which are orthogonal with respect to the classical discrete weight function of the Charlier polynomials at which an extra point mass at x=0 is added. We construct a difference operator of…
We classify Artin-Schreier extensions of valued fields with non-trivial defect according to whether they are connected with purely inseparable extensions with non-trivial defect, or not. We use this classification to show that in positive…
In [4] Sturmfels linked the Hilbert Nullstellensatz to Gr\"obner bases through final polynomials. In (loc. cit.) it was claimed that final polynomials always appear in a lexicographic Gr\"obner basis of a certain ideal. In this paper, we…
Many equations of mathematical physics are described by differential polynomials, that is by polynomials in the derivatives of a certain number of functions. However, up to the knowledge of the author, differential algebra in a modern…
We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…
A general formula is presented for any order derivative of Chebyshev polynomials instead of the existing recursive relationship. Hence, the Chebyshev finite difference method is made applicable not only to second order problems but also to…
Stochastic diffusion equations are crucial for modeling a range of physical phenomena influenced by uncertainties. We introduce the generalized finite difference method for solving these equations. Then, we examine its consistency,…
We represent an algorithm allowing one to construct new classes of partially integrable multidimensional nonlinear partial differential equations (PDEs) starting with the special type of solutions to the (1+1)-dimensional hierarchy of…
We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…
We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…
Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…
We connect shift-invariant characteristic kernels to infinitely divisible distributions on $\mathbb{R}^{d}$. Characteristic kernels play an important role in machine learning applications with their kernel means to distinguish any two…
The purpose of this paper is to study some new concrete approximation processes for continuous vector-valued mappings defined on the infinite dimensional cube or on a subset of a real Hilbert space. In both cases these operators are…
Two sets of infinitely many exceptional orthogonal polynomials related to the Wilson and Askey-Wilson polynomials are presented. They are derived as the eigenfunctions of shape invariant and thus exactly solvable quantum mechanical…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
We give a new construction of linear codes over finite fields on higher dimensional varieties using Grothendieck's theory of residues. This generalizes the construction of differential codes over curves to varieties of higher dimensions.