相关论文: Kernels of Brauer characters and Isaacs' partial c…

Using a quantum like algebraic formulation we give proof of Kochen-Specker theorem. We introduce new criteria in order to account for the contextual nature of measurements in quantum mechanics.

The aim of the present work is a comparative study of different persistence kernels applied to various classification problems. After some necessary preliminaries on homology and persistence diagrams, we introduce five different kernels…

We determine the blocks of the periplectic Brauer algebra over any field of odd characteristic.

We consider real versions of Brauer's k(B) conjecture, Olsson's conjecture and Eaton's conjecture. We prove the real version of Eaton's conjecture for 2-blocks of groups with cyclic defect group and for the principal 2-blocks of groups with…

We prove a formula that relates the Euler-Poincar\'e characteristic of a closed semi-algebraic set to its Lipschitz-Killing curvatures

In this paper, we prove a conjecture of Wei Zhang on comparison of certain local spherical characters from which we draw some consequences for the Ichino-Ikeda conjecture for unitary groups.

We study mapping properties of operators with kernels defined via a combination of continuous and discrete orthogonal polynomials, which provide an abstract formulation of quantum (q-) Fourier type systems. We prove Ismail conjecture…

Herein, the theory of Bergman kernel is developed to the weighted case. A general form of weighted Bergman reproducing kernel is obtained, by which we can calculate concrete Bergman kernel functions for specific weights and domains.

We determine the smallest irreducible Brauer characters for finite quasi-simple orthogonal type groups in non-defining characteristic. Under some restrictions on the characteristic we also prove a gap result showing that the next larger…

In this paper, we discuss O-basis of symmetry classes of polynomials associated with the Brauer character of the Semi-Dihedral groups and Dihedral groups. Also, necessary and sufficient conditions are given for the existence of an…

Kernel theorems, in general, provide a convenient representation of bounded linear operators. For the operator acting on a concrete function space, this means that its action on any element of the space can be expressed as a generalised…

The signature kernel is a positive definite kernel for sequential data. It inherits theoretical guarantees from stochastic analysis, has efficient algorithms for computation, and shows strong empirical performance. In this short survey…

We obtain the octonionic Bergman kernel for half space in the octonionic analysis setting by two different methods. As a consequence, we unify the kernel forms in both complex analysis and hyper-complex analysis.

We determine the blocks of the walled Brauer algebra in characteristic zero. These can be described in terms of orbits of the action of a Weyl group of type $A$ on a certain set of weights. In positive characteristic we give a linkage…

We will present an algebra related to the Coxeter group of type I2n which can be taken as a twisted subalgebra in Brauer algebra of type A_{n-1}. Also we will describe some properties of this algebra.

We give a simple proof of the so called reproducing kernel thesis for Hankel operators

We investigate a recently proposed family of positive-definite kernels that mimic the computation in large neural networks. We examine the properties of these kernels using tools from differential geometry; specifically, we analyze the…

The real and imaginari parts of the Cauchy kernel in the plane are scalar Riesz kernels of homogeneity -1. One can associate with each of them a natural notion of capacity related to bounded potentials. The main result of the paper asserts…

We describe the Bergman kernel of any bounded homogeneous domain in a minimal realization relating to the Bergman kernels of the Siegel disks. Taking advantage of this expression, we obtain substantial estimates of the Bergman kernel of the…

We develop an approach for feature elimination in statistical learning with kernel machines, based on recursive elimination of features.We present theoretical properties of this method and show that it is uniformly consistent in finding the…