Related papers: Hadamard Powers and Kernel Perceptrons
This paper is devoted to the study of vector valued reproducing kernel Hilbert spaces. We focus on reproducing kernels in vector-valued reproducing kernel Hilbert spaces. In particular we extend reproducing kernels to relative reproducing…
We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…
Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized Hadamard matrices are cocyclic. As a consequence, a new class of codes that we call generalized Hadamard full…
We study the tensor rank of the tensor corresponding to the algebra of n-variate complex polynomials modulo the dth power of each variable. As a result we find a sequence of tensors with a large gap between rank and border rank, and thus a…
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…
We introduce the notion of the power quandle of a group, an algebraic structure that forgets the multiplication but keeps the conjugation and the power maps. Compared with plain quandles, power quandles are much better invariants of groups.…
An overview of the basic results on Macdonald(-Koornwinder) polynomials and double affine Hecke algebras is given. We develop the theory in such a way that it naturally encompasses all known cases. Among the basic properties of the…
Linear mixed models (LMMs) are used extensively to model dependecies of observations in linear regression and are used extensively in many application areas. Parameter estimation for LMMs can be computationally prohibitive on big data.…
Positivity properties of the Hadamard powers of the matrix $\begin{bmatrix}1+x_ix_j\end{bmatrix}$ for distinct positive real numbers $x_1,\ldots,x_n$ and the matrix $\begin{bmatrix}|\cos((i-j)\pi/n)|\end{bmatrix}$ are studied. In…
We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.
In these lecture notes we present some connections between random matrices, the asymmetric exclusion process, random tilings. These three apparently unrelated objects have (sometimes) a similar mathematical structure, an interlacing…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
We are at the verge of a new impact from hypernuclear experiments planned or already operative at various laboratories all over the world. The complementary of these different experimental approaches to hypernuclei provides a wide basis for…
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…
The paper explores the concept of the rank of a bicomplex matrix, delving into four distinct types of ranks and investigating conditions under which these ranks are equivalent. It also defines and analyzes the concept of idempotent row…
We consider the set of the power non-negative polynomials of several variables and its subset that consists of polynomials which can be represented as a sum of squares. It is shown in the classic work by D.Hilbert that it is a proper…
This paper is about two related decision theoretic problems, nonparametric two-sample testing and independence testing. There is a belief that two recently proposed solutions, based on kernels and distances between pairs of points, behave…
Mathematical definitions of polyhedrons and perceptron networks are discussed. The formalization of polyhedrons is done in a rather traditional way. For networks, previously proposed systems are developed. Perceptron networks in disjunctive…
We solve direct and inverse problems for two-dimensional (quasi) canonical systems related to exponential polynomials of a specific but sufficiently general type. The approach to the inverse problem in this paper provides an interpretation…
We compute explicitly the Bergman kernels of all two dimensional monomial polyhedra, a class of domains including the Hartogs triangle and some of its generalizations. The kernel is computed from the representation of such domains as…