Related papers: On modified kernel polynomials and classical type …
Eulerian polynomials are fundamental in combinatorics and algebra. In this paper we study the linear transformation $\mathcal{A} : \mathbb{R}[t] \to \mathbb{R}[t]$ defined by $\mathcal{A}(t^n) = A_n(t)$, where $A_n(t)$ denotes the $n$-th…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
For certain negative rational numbers k, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter equals k. It was shown by…
The Bochner Classification Theorem (1929) characterizes the polynomial sequences $\p_{n}\}_{n=0}^{\infty}$, with $\text{deg}\,p_{n}=n$ that simultaneously form a complete set of eigenstates for a second-order differential operator and are…
The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…
We develop a theory of Sobolev orthogonal polynomials on the Sierpi\'nski gasket ($SG$). These orthogonal polynomials arise through the Gram-Schmidt orthogonalisation process applied on the set of monomials on $SG$ using several notions of…
We study the statistical-computational trade-offs for learning with exact invariances (or symmetries) using kernel regression. Traditional methods, such as data augmentation, group averaging, canonicalization, and frame-averaging, either…
For a convex set (K) of the (n)-dimensional Euclidean space, the Steiner-Minkowski polynomial (M_K(t)) is defined as the (n)-dimensional Euclidean volume of the neighborhood of the radius (t). Being defined for positive (t), the…
We consider two important families of BC_n-symmetric polynomials, namely Okounkov's interpolation polynomials and Koornwinder's orthogonal polynomials. We give a family of difference equations satisfied by the former, as well as…
We study a sequence of polynomials orthogonal with respect to a one parameter family of weights $$ w(x):=w(x,t)=\rex^{-t/x}\:x^{\al}(1-x)^{\bt},\quad t\geq 0, $$ defined for $x\in[0,1].$ If $t=0,$ this reduces to a shifted Jacobi weight.…
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…
The present paper proposes generalized Gaussian kernel adaptive filtering, where the kernel parameters are adaptive and data-driven. The Gaussian kernel is parametrized by a center vector and a symmetric positive definite (SPD) precision…
We study multiple orthogonal polynomials of type I and type II which have orthogonality conditions with respect to r measures. These polynomials are connected by their recurrence relation of order r+1. First we show a relation with the…
We characterize those sequences of weighted isobaric polynomials as defined in math.CO/0106213 which belong to the kernel of the linear operator $D_{11} - \sum_{j=1}^k a_j t_j D_{2j} - mD_2$, and we characterize those linear operators of…
Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let $q$ be a prime power, $n$ be a positive integer and $\sigma$ be a generator of…
The Knop-Sahi interpolation Macdonald polynomials are inhomogeneous and nonsymmetric generalisations of the well-known Macdonald polynomials. In this paper we apply the interpolation Macdonald polynomials to study a new type of basic…
Motivated by the discrete logarithmic Minkowski problem we study for a given matrix $U\in\mathbb{R}^{n\times m}$ its cone-volume set $C_{\tt cv}(U)$ consisting of all the cone-volume vectors of polytopes $P(U,b)=\{ x\in\mathbb{R}^n :…
In this contribution we consider sequences of monic polynomials orthogonal with respect to the standard Freud-like inner product involving a quartic potential $\left\langle…
Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been asked many times whether there are deterministic polynomial…
In this paper, we study the degenerate version of the new type Euler polynomials, namely degenerate cosine-Euler polynomials and sime-Euler polynomials and also corresponding ones for Bernoulli polynomials, namely degenerate cosine…