Related papers: Computing nonsymmetric and interpolation Macdonald…
In this paper we propose a new efficient interpolation tool, extremely suitable for large scattered data sets. The partition of unity method is used and performed by blending Radial Basis Functions (RBFs) as local approximants and using…
The authors have been using a largely algebraic form of ``computational discovery'' in various undergraduate classes at their respective institutions for some decades now to teach pure mathematics, applied mathematics, and computational…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
We present a new, explicit sum formula for symmetric Macdonald polynomials $P_\lambda$ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov--Faddeev (ZF)…
We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…
We establish a connection between (degenerate) nonsymmetric Macdonald polynomials and standard bases and dual standard bases of maximal parabolic modules of affine Hecke algebras. Along the way we prove a (weak) polynomiality result for…
The problems of computational data processing involving regression, interpolation, reconstruction and imputation for multidimensional big datasets are becoming more important these days, because of the availability of data and their widely…
We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
In mesh-based numerical simulations, the interpolation of mesh-defined functions across different meshes is a critical task, and achieving high-precision interpolation is of great significance for improving the computational efficiency and…
The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…
We construct new algorithms from scratch, which use the fourth order cumulant of stochastic variables for the cost function. The multiplicative updating rule here constructed is natural from the homogeneous nature of the Lie group and has…
We give an explicit, nonnegative formula for the expansion of nonsymmetric Macdonald polynomials specialized at $t=0$ in terms of Demazure characters. Our formula results from constructing Demazure crystals whose characters are the…
We consider the interpolation problem with the inverse multiquadric radial basis function. The problem usually produces a large dense linear system that has to be solved by iterative methods. The efficiency of such methods is strictly…
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time complexity of its algorithm. Among all definitions of determinant of rectangular matrices, used definition has special features which make…
As it stands, density matrix purification is a powerful tool for linear scaling electronic structure calculations. The convergence is rapid and depends only weakly on the band gap. However, as will be shown in this paper, there is room for…
Interpolation of jointly infeasible predicates plays important roles in various program verification techniques such as invariant synthesis and CEGAR. Intrigued by the recent result by Dai et al.\ that combines real algebraic geometry and…