相关论文: Casimir elements and kernel of Weitzenb\"ok deriva…

In this paper our main theorem states the following, Main Theorem : Let B denote the polynomial ring D[x1,.... ,xn] , in the commuting indeterminates x i over a division ring D . Let M be a finitely generated B-module . Let B m denote the…

For the unitary ensembles of $N\times N$ Hermitian matrices associated with a weight function $w$ there is a kernel, expressible in terms of the polynomials orthogonal with respect to the weight function, which plays an important role. For…

It is well-known that the reproducing kernel of the space of spherical harmonics of fixed homogeneity is given by a Gegenbauer polynomial. By going over to complex variables and restricting to suitable bihomogeneous subspaces, one obtains a…

We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…

Given a set of points $P\subset \mathbb{R}^{d}$ and a kernel $k$, the Kernel Density Estimate at a point $x\in\mathbb{R}^{d}$ is defined as $\mathrm{KDE}_{P}(x)=\frac{1}{|P|}\sum_{y\in P} k(x,y)$. We study the problem of designing a data…

Let $K$ be an algebraically closed field of characteristic zero and ${P_n=K[x_1,\ldots,x_n]}$ the polynomial ring. Any $K$-derivation $D$ on $P_n$ is of the form ${ D=\sum_{i=1}^n f_i(x_1,\ldots,x_n)\frac{\partial}{\partial x_i} },$ where…

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

Let $n$ be the size of a parameterized problem and $k$ the parameter. We present kernels for Feedback Vertex Set, Path Contraction and Cluster Editing/Deletion whose sizes are all polynomial in $k$ and that are computable in polynomial time…

Low-rank approximation of kernels is a fundamental mathematical problem with widespread algorithmic applications. Often the kernel is restricted to an algebraic variety, e.g., in problems involving sparse or low-rank data. We show that…

We study non-linear data-dimension reduction. We are motivated by the classical linear framework of Principal Component Analysis. In nonlinear case, we introduce instead a new kernel-Principal Component Analysis, manifold and feature space…

In previous work, we introduced an algorithm that utilises differential operator realisations to find polynomial Casimir operators of Lie algebras. In this article we build on this work by applying the algorithm to several classes of finite…

Kjolstad et. al. proposed a tensor algebra compiler. It takes expressions that define a tensor element-wise, such as $f_{ij}(a,b,c,d) = \exp\left[-\sum_{k=0}^4 \left((a_{ik}+b_{jk})^2\, c_{ii} + d_{i+k}^3 \right) \right]$, and generates the…

The orthogonal derivative is defined as a limit of an integral whose kernel contains an orthogonal polynomial with its measure. When in practice no limit is taken, it means that the accuracy of the derivative depends on the second…

We investigate a series of learning kernel problems with polynomial combinations of base kernels, which will help us solve regression and classification problems. We also perform some numerical experiments of polynomial kernels with…

We study the low-energy approximation for calculation of the heat kernel which is determined by the strong slowly varying background fields in strongly curved quasi-homogeneous manifolds. A new covariant algebraic approach, based on taking…

We explicitly construct a finite set of separating invariants for the basic $\Ga$-actions. These are the finite dimensional indecomposable rational linear representations of the additive group $\Ga$ of a field of characteristic zero, and…

Let $\mathbb K$ be an algebraically closed field of characteristic zero, $A = \mathbb K[x_1,\dots,x_n]$ the polynomial ring, and let $W_n(\mathbb K)$ denote the Lie algebra of all $\mathbb K$-derivations on $A$. The Lie algebra $W_n :=…

In the $K_t$-free edge deletion problem, the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of at most $k$ edges of $G$ whose removal results a graph with no clique of size $t$. In this paper we…

Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…

We compute explicitly the Bergman kernels of all two dimensional monomial polyhedra, a class of domains including the Hartogs triangle and some of its generalizations. The kernel is computed from the representation of such domains as…