Related papers: Casimir elements and kernel of Weitzenb\"ok deriva…
We show how the knowledge of the Fourier coefficients of the Cherednik kernel leads to combinatorial formulas for generalized exponents. We recover known formulas for generalized exponents of irreducible representations parameterized by…
Let $f$ be the $\mathbb{F}_q$-linear map over $\mathbb{F}_{q^{2n}}$ defined by $x\mapsto x+ax^{q^s}+bx^{q^{n+s}}$ with $\gcd(n,s)=1$. It is known that the kernel of $f$ has dimension at most $2$, as proved by Csajb\'ok et al. in "A new…
The Lie-algebraic method approximates differential operators that are formal polynomials of {1,x,d/dx} by linear operators acting on a finite dimensional space of polynomials. In this paper we prove that the rank of the n-dimensional…
We consider the Szeg\"o kernel for non-pseudoconvex domains in C^2 given by \Omega = {(z,w): Im w > b(Re z)} for b a non-convex even-degree polynomial with positive leading coefficient. This is an extension of results previously obtained by…
This paper studies the use of kernel density estimation (KDE) for linear algebraic tasks involving the kernel matrix of a collection of $n$ data points in $\mathbb R^d$. In particular, we improve upon existing algorithms for computing the…
We obtain the octonionic Bergman kernel for half space in the octonionic analysis setting by two different methods. As a consequence, we unify the kernel forms in both complex analysis and hyper-complex analysis.
We offer a Maple package SL\_2\_Inv\_Ker for calculating of minimal generating sets for the algebras of joint invariants/semi-invariants of binary forms and for calculations of the kernels of Weitzenb\"ock derivations.
In this paper, we provide a reduction formula for the Dunkl kernel for the root systems of type $A$. The Dunkl kernel for the root system $A_n$ is expressed as an integral involving the Dunkl kernel for the root system $A_{n-1}$. The…
Ordinary differential equation (ODE) is widely used in modeling biological and physical processes in science. In this article, we propose a new reproducing kernel-based approach for estimation and inference of ODE given noisy observations.…
Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…
Let $K$ be an {\em arbitrary} field of characteristic $p>0$, let $A$ be one of the following algebras: $P_n:= K[x_1, ..., x_n]$ is a polynomial algebra, $\CD (P_n)$ is the ring of differential operators on $P_n$, $\CD (P_n)\t P_m$, the…
Let $I \subset R = \mathbb{F}[x_1,x_2]$ be a height two ideal minimally generated by three homogeneous polynomials of the same degree $d$, where $\mathbb{F}$ is a field of characteristic zero. We use the theory of $D$-modules to deduce…
Let a given finite dimensional simple Lie superalgebra g possess an even invariant non-degenerate supersymmetric bilinear form. We show how to recover the quadratic Casimir element for the Kac-Moody superalgebra related to the loop…
The kernel method is a potential approach to analyzing structured data such as sequences, trees, and graphs; however, unordered trees have not been investigated extensively. Kimura et al. (2011) proposed a kernel function for unordered…
We give an easy diagrammatical description of the parabolic Kazhdan-Lusztig polynomials for the Weyl group $W_n$ of type $D_n$ with parabolic subgroup of type $A_n$ and consequently an explicit counting formula for the dimension of the…
An Ore extension over a polynomial algebra F[x] is either a quantum plane, a quantum Weyl algebra, or an infinite-dimensional unital associative algebra A_h generated by elements x,y, which satisfy yx-xy = h, where h is in F[x]. When h is…
We show that the kernel of the monodromy representation for hypersurfaces of degree d and dimension n is large for d at least three with the exception of the cases (d,n) = (3,0) and (3,1). For these the kernel is finite. By "large" we mean…
Kernel methods are fundamental tools in machine learning that allow detection of non-linear dependencies between data without explicitly constructing feature vectors in high dimensional spaces. A major disadvantage of kernel methods is…
In this paper we study modified kernel polynomials: $u_n(x) = \sum_{k=0}^n c_k g_k(x)$, depending on parameters $c_k>0$, where $\{ g_k \}_0^\infty$ are orthonormal polynomials on the real line. Besides kernel polynomials with $c_k =…
Let $K$ be an algebraically closed field of characteristic zero, $P_n=K[x_1, ..., x_n]$ the polynomial ring, and $W_n(K)$ the Lie algebra of all $K$-derivations on $P_n$. One of the most important subalgebras of $W_n(K)$ is the triangular…