Related papers: Casimir elements and kernel of Weitzenb\"ok deriva…
Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use…
Kernel methods are fundamental in machine learning, and faster algorithms for kernel approximation provide direct speedups for many core tasks in machine learning. The polynomial kernel is especially important as other kernels can often be…
Many scientific problems involve data exhibiting both temporal and cross-sectional dependencies. While linear dependencies have been extensively studied, the theoretical analysis of regression estimators under nonlinear dependencies remains…
In this note we study the number of quantum queries required to identify an unknown multilinear polynomial of degree d in n variables over a finite field F_q. Any bounded-error classical algorithm for this task requires Omega(n^d) queries…
We consider an inverse problem for the Boltzmann equation with nonlinear collision operator in dimensions $n\geq 2$. We show that the kinetic collision kernel can be uniquely determined from the incoming-to-outgoing mappings on the boundary…
The kernel method is an essential tool for the study of generating series of walks in the quarter plane. This method involves equating to zero a certain polynomial, the kernel polynomial, and using properties of the curve, the kernel curve,…
We consider the problem of simultaneously learning to linearly combine a very large number of kernels and learn a good predictor based on the learnt kernel. When the number of kernels $d$ to be combined is very large, multiple kernel…
In the Block Graph Deletion problem, we are given a graph $G$ on $n$ vertices and a positive integer $k$, and the objective is to check whether it is possible to delete at most $k$ vertices from $G$ to make it a block graph, i.e., a graph…
In the first part of the paper kernels are constructed which meromorphically extend the Macdonald-Koornwinder polynomials in their degrees. In the second part of the paper the kernels associated with rank one root systems are used to define…
We investigate the nonlinear algebra $W_3$ generated by the 9 functionally independent permutation-symmetric operators in the three-particle rational quantum Calogero model. Decoupling the center of mass, we pass to a smaller algebra $W'_3$…
Given an undirected graph $G=(V,E)$, vertices $s,t\in V$, and an integer $k$, Tracking Shortest Paths requires deciding whether there exists a set of $k$ vertices $T\subseteq V$ such that for any two distinct shortest paths between $s$ and…
We introduce a novel kernel-based framework for learning differential equations and their solution maps that is efficient in data requirements, in terms of solution examples and amount of measurements from each example, and computational…
Let $G$ be a simple complex Lie group with Weyl group $W$. We give a formula for the character of $W$ on the zero weight space of any finite dimensional representation of $G$. The formula involves partition functions, generalizing Kostant's…
We determine fundamental systems of invariants for complex solvable rigid Lie algebras having nonsplit nilradicals of characteristic sequence $(3,1,..,1)$, these algebras being the natural followers of solvable algebras having Heisenberg…
We study singular integral operators with kernels that are more singular than standard Calder\'on-Zygmund kernels, but less singular than bi-parameter product Calder\'on-Zygmund kernels. These kernels arise as restrictions to two dimensions…
We consider Casimir elements for the orthogonal and symplectic Lie algebras constructed with the use of the Brauer algebra. We calculate the images of these elements under the Harish-Chandra isomorphism and thus show that they (together…
Given an ordinary differential field $K$ of characteristic zero, it is known that if $y$ and $1/y$ satisfy linear differential equations with coefficients in $K$, then $y'/y$ is algebraic over $K$. We present a new short proof of this fact…
We introduce kernel density machines (KDM), an agnostic kernel-based framework for learning the Radon-Nikodym derivative (density) between probability measures under minimal assumptions. KDM applies to general measurable spaces and avoids…
Machine-learning models based on a point-cloud representation of a physical object are ubiquitous in scientific applications and particularly well-suited to the atomic-scale description of molecules and materials. Among the many different…
In this letter we present a procedure for the calculation of the Casimir functions of finite-dimensional Poisson systems which avoids the burden of solving a set of partial differential equations, as it is usually suggested in the…