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

We consider the Szeg\"o kernel for domains \Omega in C^2 given by \Omega = {(z,w): Im w > b(Re z)} where b is a non-convex quartic polynomial with positive leading coefficient. Such domains are not pseudoconvex. We describe the subset of…

In this article we give a unified treatment of the construction of all possible Weitzenb\"ock formulas for all irreducible, non--symmetric holonomy groups. The resulting classification is two--fold, we construct explicitly a basis of the…

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

We introduce a three-dimensional random point field using the concept of the quaternion determinant. Orthogonal polynomials on the space of pure quaternions are defined, and used to construct a kernel function similar to the Ginibre kernel.…

We answer the following long-standing question of Kolchin: given a system of algebraic-differential equations $\Sigma(x_1,\dots,x_n)=0$ in $m$ derivatives over a differential field of characteristic zero, is there a computable bound, that…

Let $F$ be a field of characteristic zero and $W$ be an associative affine $F$-algebra satisfying a polynomial identity (PI). The codimension sequence associated to $W$, $c_n(W)$, is known to be of the form $\Theta (c n^t d^n)$, where $d$…

Let t be any integer and fix an odd prime ell. Let Phi(x) = T_ell^n(x)-t denote the n-fold composition of the Chebyshev polynomial of degree ell shifted by t. If this polynomial is irreducible, let K = bbq(theta), where theta is a root of…

This paper focuses on kernelization algorithms for the fundamental Knapsack problem. A kernelization algorithm (or kernel) is a polynomial-time reduction from a problem onto itself, where the output size is bounded by a function of some…

A kernel of a directed graph is a subset of vertices that is both independent and absorbing (every vertex not in the kernel has an out-neighbour in the kernel). Not all directed graphs contain kernels, and computing a kernel or deciding…

An algebraic algorithm is developed for computation of invariants ('generalized Casimir operators') of general Lie algebras over the real or complex number field. Its main tools are the Cartan's method of moving frames and the knowledge of…

We show that quantum Casimir W-algebras truncate at degenerate values of the central charge c to a smaller algebra if the rank is high enough: Choosing a suitable parametrization of the central charge in terms of the rank of the underlying…

Let $\mathcal X$ be a regular scheme, flat and proper over the ring of integers of a $p$-adic field, with generic fiber $X$ and special fiber $\mathcal X_s$. We study the left kernel $Br(\mathcal X)$ of the Brauer-Manin pairing $Br(X)\times…

Model inference for dynamical systems aims to estimate the future behaviour of a system from observations. Purely model-free statistical methods, such as Artificial Neural Networks, tend to perform poorly for such tasks. They are therefore…

We consider a skew-symmetric $n$-ary bracket on the polynomial algebra $K[x_1,\ldots,x_n,x_{n+1}]$ ($n\geq 2$) over a field $K$ of characteristic zero defined by $\{a_1,\ldots,a_n\}=J(a_1,\ldots,a_n,C)$, where $C$ is a fixed element of…

A simple algorithm to compute all the zeros of a generic polynomial is proposed.

The class of graph deletion problems has been extensively studied in theoretical computer science, particularly in the field of parameterized complexity. Recently, a new notion of graph deletion problems was introduced, called deletion to…

We present a unified ring theoretic approach, based on properties of the Casimir element of a symmetric algebra, to a variety of known divisibility results for the degrees of irreducible representations of semisimple Hopf algebras in…

The geometric kernel (or simply the kernel) of a polyhedron is the set of points from which the whole polyhedron is visible. Whilst the computation of the kernel for a polygon has been largely addressed in the literature, fewer methods have…

Let $R$ be a commutative ring, $\mathcal A$ an $R$-algebra (not necessarily commutative) and $V$ an $R$-subspace or $R$-submodule of $\mathcal A$. By the radical of $V$ we mean the set of all elements $a\in \mathcal A$ such that $a^m\in V$…

Our main goal is to describe the integral kernel of the dbar-Neumann operator on certain non-smooth domains, the so-called Henkin-Leiterer domains. We do so by explicitly constructing an integral kernel which accounts for the main mapping…