Related papers: Fast algorithm for border bases of Artinian Gorens…
A good way of parametrizing 0-dimensional schemes in an affine space $\mathbb{A}_K^n$ has been developed in the last 20 years using border basis schemes. Given a multiplicity $\mu$, they provide an open covering of the Hilbert scheme ${\rm…
An SI-sequence is a finite sequence of positive integers which is symmetric, unimodal and satisfies a certain growth condition. These are known to correspond precisely to the possible Hilbert functions of Artinian Gorenstein algebras with…
The Hilbert-space Gaussian Process (HGP) approach offers a hyperparameter-independent basis function approximation for speeding up Gaussian Process (GP) inference by projecting the GP onto M basis functions. These properties result in a…
Let $I_G$ be the binomial edge ideal on the generic 2 x n - Hankel matrix associated with a closed graph $G$ on the vertex set [n]. We characterize the graphs $G$ for which $I_G$ has maximal regularity and is Gorenstein.
We analyze the decomposition problem of multivariate polynomial-exponential functions from truncated series and present new algorithms to compute their decomposition. Using the duality between polynomials and formal power series, we first…
We suggest a programming realization of an algorithm for verifying a given set of algebraic relations in the form of a supercommutator multiplication table for the Verma module, which is constructed according to a generalized Cartan…
In this article, the reproducing kernel Hilbert space [0, 1] is employed for solving a class of third-order periodic boundary value problem by using fitted reproducing kernel algorithm. The reproducing kernel function is built to get fast…
Let $A$ be a normal operator in a Hilbert space $\mathcal{H}$, and let $\mathcal{G} \subset \mathcal{H}$ be a countable set of vectors. We investigate the relations between $A$, $\mathcal{G}$ , and $L$ that makes the system of iterations…
We consider the exactly solvable quantum mechanical systems whose eigenfunctions are described by the multi-indexed orthogonal polynomials of Laguerre, Jacobi, Wilson and Askey-Wilson types. Corresponding to the recurrence relations with…
In this paper we combine the theory of reproducing kernel Hilbert spaces with the field of collocation methods to solve boundary value problems with special emphasis on reproducing property of kernels. From the reproducing property of…
Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer formulated the so called Border Basis Algorithm, an algorithm…
As a generalization of Hermite interpolation problem, Birkhoff interpolation is an important subject in numerical approximation. This paper generalizes the existing Generalized Recursive Polynomial Interpolation Algorithm (GRPIA) that is…
We introduce a new type of Hessian matrix, that we call Mixed Hessian. The mixed Hessian is used to compute the rank of a multiplication map by a power of a linear form in a standard graded Artinian Gorenstein algebra. In particular we…
We study border varieties of sums of powers ($\underline{\mathrm{VSP}}$'s for short), recently introduced by Buczy\'nska and Buczy\'nski, parameterizing border rank decompositions of a point (e.g. of a tensor or a homogeneous polynomial)…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…
In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…
The Hankel determinant representations for the partition function and boundary correlation functions of the six-vertex model with domain wall boundary conditions are investigated by the methods of orthogonal polynomial theory. For specific…
Solving systems of polynomial equations, particularly those with finitely many solutions, is a crucial challenge across many scientific fields. Traditional methods like Gr\"obner and Border bases are fundamental but suffer from high…
In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…