We apply support vector learning to attributed graphs where the kernel matrices are based on approximations of the Schur-Hadamard inner product. The evaluation of the Schur-Hadamard inner product for a pair of graphs requires the determination of an optimal match between their nodes and edges. It is therefore efficiently approximated by means of recurrent neural networks. The optimal mapping in...

In this paper, assuming p/n → 0 as n → ∞, we will prove the weak and strong convergence to the semicircle law of the empirical spectral distribution of the Hadamard product of a normalized sample covariance matrix and a sparsing matrix, which is of the form Ap = 1 √ np (Xm,nX ∗ m,n − σnIm) ◦ Dm, where the matrices Xm,n and Dm are independent and the entries of Xm,n (m × n) are independent, the ...

The Hadamard product features prominently in tensor-based algorithms in scientific computing and data analysis. Due to its tendency to significantly increase ranks, the Hadamard product can represent a major computational obstacle in algorithms based on low-rank tensor representations. It is therefore of interest to develop recompression techniques that mitigate the effects of this rank increas...

It is conjectured that binary cocyclic matrices are a uniform source of Hadamard matrices. In testing this conjecture, it is useful to have a general method of calculating cocyclic matrices. We present such a method in this paper. The method draws on standard cohomology theory of finite groups. In particular we employ the Universal Coefficient Theorem, which expresses the second cohomology grou...

Louis W. Shapiro gave a combinatorial proof of a bilinear generating function for Chebyshev polynomials equivalent to the formula 1 1− ax − x2 ∗ 1 1− bx − x2 = 1− x2 1− abx − (2 + a2 + b2)x2 − abx3 + x4 , where ∗ denotes the Hadamard product. In a similar way, by considering tilings of a 2× n rectangle with 1× 1 and 1× 2 bricks in the top row, and 1× 1 and 1× n bricks in the bottom row, we find...

This article introduces a new approach to studying difference sets via their additive properties. We introduce the concept of special subsets, which are interesting combinatorial objects in their own right, but also provide a mechanism for measuring additive regularity. Skew Hadamard difference sets are given special attention, and the structure of their special subsets leads to several results...

Hadamard matrices with a subjacent algebraic structure have been deeply studied as well as the links with other topics in algebraic combinatorics [1]. An important and pioneering paper about this subject is [5], where it is introduced the concept of Hadamard group. In addition, we find beautiful equivalences between Hadamard groups, 2-cocyclic matrices and relative difference sets [4], [7]. Fro...

[This document is http://www.math.umn.edu/ ̃garrett/m/complex/notes 2014-15/09c Riemann and zeta.pdf] 1. Riemann’s explicit formula 2. Analytic continuation and functional equation of ζ(s) 3. Appendix: Perron identity [Riemann 1859] exhibited a precise relationship between primes and zeros of ζ(s). A similar idea applies to any zeta or L-function with analytic continuation, functional equation, ...

The Hadamard and SJT product of matrices are two types of special matrix product. The latter was ®rst de®ned by Chen. In this study, they are applied to the di€erential quadrature (DQ) solution of geometrically nonlinear bending of isotropic and orthotropic rectangular plates. By using the Hadamard product, the nonlinear formulations are greatly simpli®ed, while the SJT product approach minimiz...