Related papers: Explicit Determinants of Homogeneous Polynomial Ev…

We consider symmetric polynomials, p, in the noncommutative free variables (x_1, x_2, ..., x_g). We define the noncommutative complex hessian of p and we call a noncommutative symmetric polynomial noncommutative plurisubharmonic if it has a…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

We give a criterion which characterizes a homogeneous real multi-variate polynomial to have the property that all sufficiently large powers of the polynomial (as well as their products with any given positive homogeneous polynomial) have…

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

In this paper we study higher-order difference equations which can be written as follows: $$ \mathbf{J} (y_0,y_1,...)^T = \lambda^N (y_0,y_1,...)^T, $$ where $\mathbf{J}$ is a $(2N+1)$-diagonal bounded banded matrix…

In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…

In this note, we show that the space associated with sub-Hankel determinant is a non-reductive, regular prehomogeneous vector space, and we give the multiplicative Legendre transforms of sub-Hankel determinants. Moreover we observe certain…

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

Let $\mathbb F$ be a field and $P \in \mathbb F [x_1,\ldots, x_n]$ be a homogeneous polynomial such that $|\mathbb F| > \deg(P)$ and $\phi, \psi\colon \mathbb F^n \to \mathbb F^n$ be two maps such that $P(\mathbf{x} + \lambda\mathbf{y}) =…

In this work we deduce explicit formulae for the elements of the matrices that represent the action of integro-differential operators over the coefficients of generalized Fourier series. Our formulae are obtained by performing operations on…

We apply the bi-moment determinant method to compute a representation of the matrix product algebra -- a quadratic algebra satisfied by the operators $\mathbf{d}$ and $\mathbf{e}$ -- for the five parameter ($\alpha$, $\beta$, $\gamma$,…

Several determinants with gamma functions as elements are evaluated. This kind of determinants are encountered in the computation of the probability density of the determinant of random matrices. The s-shifted factorial is defined as a…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.

Let $p$ be a prime and $n$ a positive integer. As the first main result, we present a deterministic algorithm for deciding whether the matrix algebra $\mathbb{F}_p[A_1,\dots,A_t]$ with $A_1,\dots,A_t \in \mathrm{GL}(n,\mathbb{F}_p)$ is a…

In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…

Celebrated work of Jerrum, Sinclair, and Vigoda has established that the permanent of a {0,1} matrix can be approximated in randomized polynomial time by using a rapidly mixing Markov chain. A separate strand of the literature has pursued…

Let $H$ and $K$ be groups. In this paper we introduce a concept of determinant for automorphisms of $H\times K$ and some concepts of incompatibility for group pairs as a measure of how much $H$ and $K$ are fare from being isomorphic. With…

Let $k[X] = k[x_{i,j}: i = 1,..., m; j = 1,..., n]$ be the polynomial ring in $m n$ variables $x_{i,j}$ over a field $k$ of arbitrary characteristic. Denote by $I_2(X)$ the ideal generated by the $2 \times 2$ minors of the generic $m \times…