Related papers: Casimir elements and kernel of Weitzenb\"ok deriva…

Learning the kernel functions used in kernel methods has been a vastly explored area in machine learning. It is now widely accepted that to obtain 'good' performance, learning a kernel function is the key challenge. In this work we focus on…

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

This paper aims at studying how finitely many generalized polarization tensors of an algebraic domain can be used to determine its shape. Precisely, given a planar set with real algebraic boundary, it is shown that the minimal polynomial…

Let $K$ be a quasidisk on the complex plane. We construct a sequence of monic polynomials $p_n=p_n(\cdot,K)$ with zeros on $K$ such that $||p_n||_K \le O(1) \mathrm{cap}(K)^n$ as $n\to\infty.$

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

By the classical theorem of Weitzenboeck the algebra of constants (i.e., the kernel) of a nonzero locally nilpotent linear derivation of the polynomial algebra K[X] in d variables over a field K of characteristic 0 is finitely generated. As…

In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…

We recalculate the next-to-leading order Altarelli-Parisi kernel using a method which relates it to the splitting amplitudes describing the collinear factorization properties of scattering amplitudes. The method breaks up the calculation of…

In this note we generalize the definition of partial permutations of Ivanov and Kerov and we build a universal algebra which projects onto the m-centraliser algebra defined by Creedon. We use it to present a new proof for the polynomiality…

This paper deals with the kernel density estimator based on the so-called sinc (or Fourier integral) kernel $K(x)=(\pi x)^{-1}\sin x$. We study in detail both asymptotic and finite sample properties of this estimator. It is shown that,…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

We consider the eigenvalue problem of certain kind of non-compact linear operators given as the sum of a multiplication and a kernel operator. A degenerate kernel method is used to approximate isolated eigenvalues. It is shown that entries…

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that…

A nonparametric kernel density estimator for directional-linear data is introduced. The proposal is based on a product kernel accounting for the different nature of both (directional and linear) components of the random vector. Expressions…

H. Widom derived formulae expressing correlation functions of orthogonal and symplectic ensembles of random matrices in terms of orthogonal polynomials (H. Widom. J. Stat. Phys. 94, (1999) 347-363). We obtain similar results for discrete…

There have been increasing interests on the Volterra series identification with the kernel-based regularization method. The major difficulties are on the kernel design and efficiency of the corresponding implementation. In this paper, we…

We prove Bismut-type formulae for the first and second derivatives of a Feynman-Kac semigroup on a complete Riemannian manifold. We derive local estimates and give bounds on the logarithmic derivatives of the integral kernel. Stationary…

For a given ideal I in K[x_1,...,x_n,y_1,...,y_m] in a polynomial ring with n+m variables, we want to find all elements that can be written as f-g for some f in K[x_1,...,x_n] and some g in K[y_1,...,y_m], i.e., all elements of I that…

Let $V$ be the set of real common solutions to $F = (f_1, \ldots, f_s)$ in $\mathbb{R}[x_1, \ldots, x_n]$ and $D$ be the maximum total degree of the $f_i$'s. We design an algorithm which on input $F$ computes the dimension of $V$. Letting…

We study fast algorithms for computing fundamental properties of a positive semidefinite kernel matrix $K \in \mathbb{R}^{n \times n}$ corresponding to $n$ points $x_1,\ldots,x_n \in \mathbb{R}^d$. In particular, we consider estimating the…