相关论文: The kernel of the adjacency matrix of a rectangula…

This note deals with the question: If T is a linear mapping between Banach spaces X and Y, and x belongs to X and has small norm, is x close to the kernel of T? It draws on notions of Z-stability and provides an affirmative constructive…

In many applications data is naturally presented in terms of orderings of some basic elements or symbols. Reasoning about such data requires a notion of similarity capable of handling sequences of different lengths. In this paper we…

The string, MSSM GUT, weak and QCD scales, and the Rydberg constant, correspond to the positions of AdS domain wall intersections in a two-dimensional extra space of infinite extent. The domain walls lie along and parallel to the sides of…

For a digraph $D$ of order $n$ and an integer $1 \leq k \leq n-1$, the $k$-token digraph of $D$ is the graph whose vertices are all $k$-subsets of vertices of $D$ and, given two such $k$-subsets $A$ and $B$, $(A,B)$ is an arc in the…

A universal kernel is constructed whose sections approximate any causal and time-invariant filter in the fading memory category with inputs and outputs in a finite-dimensional Euclidean space. This kernel is built using the reservoir…

Approximation of non-linear kernels using random feature maps has become a powerful technique for scaling kernel methods to large datasets. We propose $\textit{Tensor Sketch}$, an efficient random feature map for approximating polynomial…

Kernel interpolation is a fundamental technique for approximating functions from scattered data, with a well-understood convergence theory when interpolating elements of a reproducing kernel Hilbert space. Beyond this classical setting,…

The orthogonality dimension of a graph over $\mathbb{R}$ is the smallest integer $d$ for which one can assign to every vertex a nonzero vector in $\mathbb{R}^d$ such that every two adjacent vertices receive orthogonal vectors. For an…

Given an n by n matrix A over the complex numbers and an invariant subspace L, this paper gives a straightforward formula to construct an n by n matrix N that commutes with A and has L equal to the kernel of N. For Q a matrix putting A into…

Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called…

We present in this work a new methodology to design kernels on data which is structured with smaller components, such as text, images or sequences. This methodology is a template procedure which can be applied on most kernels on measures…

Kernel mean embeddings are a popular tool that consists in representing probability measures by their infinite-dimensional mean embeddings in a reproducing kernel Hilbert space. When the kernel is characteristic, mean embeddings can be used…

Reproducing kernel Hilbert spaces are elucidated without assuming prior familiarity with Hilbert spaces. Compared with extant pedagogic material, greater care is placed on motivating the definition of reproducing kernel Hilbert spaces and…

Reproducing kernel Hilbert spaces are uniquely characterized by their kernel, but reproducing kernel Banach spaces (RKBS) are not. However, a characterization of which RKBS admit a given kernel as reproducing kernel is lacking. This work…

To help understand various reproducing kernels used in applied sciences, we investigate the inclusion relation of two reproducing kernel Hilbert spaces. Characterizations in terms of feature maps of the corresponding reproducing kernels are…

Support vector machines and kernel methods have recently gained considerable attention in chemoinformatics. They offer generally good performance for problems of supervised classification or regression, and provide a flexible and…

Given a graph and two integers $k$ and $\ell$, Partial Vertex Cover asks for a set of at most $k$ vertices whose deletion results in a graph with at most $\ell$ edges. Based on the expansion lemma, we provide a problem kernel with $(\ell +…

In this paper, we study when the kernel of a complete hereditary cotorsion pair is the additive closure of a tilting module. Applications go in three directions. The first is to characterize when the little finitistic dimension is finite.…

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…

The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…