Related papers: Permanents, Determinants, Weighted Isobaric Polyno…

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…

We provide a characterization for the continuous positive definite kernels on $\mathbb R^d$ that are invariant to linear isometries, i.e. invariant under the orthogonal group $O(d)$. Furthermore, we provide necessary and sufficient…

If $A$ is an integer valued, strictly expansive matrix, then there exists an orthonormal $A$-wavelet whose Fourier transform is compactly supported and smooth. We show that strongly connected diagonally dominant integer matrices are…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

We characterize those sequences of weighted isobaric polynomials as defined in math.CO/0106213 which belong to the kernel of the linear operator $D_{11} - \sum_{j=1}^k a_j t_j D_{2j} - mD_2$, and we characterize those linear operators of…

The characters of irreducible finite dimensional representations of compact simple Lie group G are invariant with respect to the action of the Weyl group W(G) of G. The defining property of the new character-like functions ("hybrid…

In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…

Let $Hilb ^{p(t)}(P^n)$ be the Hilbert scheme of closed subschemes of $P^n$ with Hilbert polynomial $p(t) \in Q[t]$, and let $W:= \overline{W(\underline{b};\underline{a};r)}$ be the closure of the locus in $Hilb ^{p(t)}(P^n)$ of…

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…

We derive several identities for arbitrary homogeneous second order recurrence sequences with constant coefficients. The results are then applied to present a unified study of six well known integer sequences, namely the Fibonacci sequence,…

Let $G$ be a simple linear algebraic group over an algebraically closed field $K$ of characteristic two. Any non-trivial self-dual irreducible $K[G]$-module $W$ admits a non-degenerate $G$-invariant alternating bilinear form, thus giving a…

We study finite-dimensional representations of hyper loop algebras, i.e., the hyperalgebras over an algebraically closed field of positive characteristic associated to the loop algebra over a complex finite-dimensional simple Lie algebra.…

We study hyperbolic polynomials with nice symmetry and express them as the determinant of a Hermitian matrix with special structure. The goal of this paper is to answer a question posed by Chien and Nakazato in 2015. By properly modifying a…

We explore some properties of a recent representation of permanental vectors which expresses them as sums of independent vectors with components that are independent gamma random variables.

In this work, the determinants of matrices constructed by evaluating homogeneous bivariate polynomials at pairs of vectors are investigated. For a polynomial $p(x,y)=\sum\limits_{i=0}^k \alpha_i x^{k-i}y^i$, an explicit factorization of the…

In this paper, we study the computational complexity of the commutative determinant polynomial computed by a class of set-multilinear circuits which we call regular set-multilinear circuits. Regular set-multilinear circuits are commutative…

The classical Selberg integral contains a power of the Vandermonde determinant. When that power is a square, it is easy to prove Selberg's identity by interpreting it as a determinant of one-variable integrals. We give similar proofs of…

We investigate the recurrence coefficients of discrete orthogonal polynomials on the non-negative integers with hypergeometric weights and show that they satisfy a system of non-linear difference equations and a non-linear second order…