Related papers: The L1 norm of the generalized de la Vallee Poussi…

We study fusion kernel for non-degenerate conformal blocks in Liouville theory as a solution to the difference equations originating from the pentagon identity. We suggest an approach to these equations based on 'non-perturbative' series…

In this work, we study the $k$-median clustering problem with an additional equal-size constraint on the clusters, from the perspective of parameterized preprocessing. Our main result is the first lossy ($2$-approximate) polynomial kernel…

We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…

Szalai et al. (SIAM J. on Sci. Comp. 28(4), 2006) gave a general construction for characteristic matrices for systems of linear delay-differential equations with periodic coefficients. First, we show that matrices constructed in this way…

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…

We study prior distributions for Poisson parameter estimation under $L^1$ loss. Specifically, we construct a new family of prior distributions whose optimal Bayesian estimators (the conditional medians) can be any prescribed increasing…

The so-called tuned-correlated kernel (sometimes also called the first-order stable spline kernel) is one of the most widely used kernels for the regularized impulse response estimation. This kernel can be derived by applying an exponential…

In his thesis ([L1]), which is published in an expended and revised version ([L2]), Franck Lesieur had introduced a notion of measured quantum groupoid, in the setting of von Neumann algebras, using intensively the notion of…

We give non-symmetric versions of the Cauchy kernel and Littlewood's kernels, corresponding to the types $A_n$, $B_n$, $C_n$ and $D_n$, of the classical groups. We show that these new kernels are diagonal in the basis of two families of key…

This article studies sufficient conditions on families of approximating kernels which provide $N$--term approximation errors from an associated nonlinear approximation space which match the best known orders of $N$--term wavelet expansion.…

We study the persistence probabilities of a moving average process of order one with innovations that follow a Laplace distribution. The persistence probabilities can be computed fully explicitly in terms of classical combinatorial…

Let $E\subset\mathbb{F}_q^d$ and $\lVert \cdot \rVert:\mathbb{F}_q^d\to \mathbb{F}_q$ defined as $\lVert \alpha\rVert:= \alpha_1^2+\dots+\alpha_d^2$ if $\alpha=(\alpha_1,\dots,\alpha_d)\in \mathbb{F}_q^d$, where $\mathbb{F}_q^d$ is the…

The kernel of a pair of linear systems is studied in the framework of commutative ring theory with applications to behavioral perspective of linear systems

For this work, we studied a finite system of discreet-size aggregating particles for two types of kernels with arbitrary parameters, a condensation (or branched-chain polymerization) kernel, $K(i,j)=(A+i)(A+j)$, and a linear combination of…

We consider a distributed system with persistent memory of a type which is often encountered in viscoelasticity or in the study of diffusion processes with memory. The relaxation kernel, i.e. the kernel of the memory term, is scarcely known…

A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…

In many applications one is interested to detect certain (known) patterns in the mean of a process with smallest delay. Using an asymptotic framework which allows to capture that feature, we study a class of appropriate sequential…

We apply the discrepancy method and a chaining approach to give improved bounds on the coreset complexity of a wide class of kernel functions. Our results give randomized polynomial time algorithms to produce coresets of size…

Enumerative kernelization is a recent promising at the intersection of parameterized complexity and enumeration algorithms, with two proposed models. The first, known as enum-kernels and due to Creignou et al., was too permissive, leading…

This paper provides theoretical consistency results for compressed modes. We prove that as L1 regularization term in certain non-convex variational optimization problems vanishes, the solutions of the optimization problem and the…