Related papers: A Complete Characterization of Determinantal Quadr…

It is known that a linear system with a system matrix A constitutes a Hamiltonian system with a quadratic Hamiltonian if and only if A is a Hamiltonian matrix. This provides a straightforward method to verify whether a linear system is…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

Let $A$ be a matrix of size $n \times n$ over an algebraically closed field $F$ and $q(t)$ a monic polynomial of degree $n$. In this article, we describe the necessary and sufficient conditions of $q(t)$ so that there exists a rank one…

We use a proper-time regularization to define the one-loop fermion determinant for the case in which explicit chiral symmetry breaking takes place. We show how to obtain the polynomial by which the standard definition of lndetD needs to be…

In this paper, we present a linear algebraic approach to the study of permutation polynomials that arise from linear maps over a finite field $\mathbb{F}_{q^2}$. We study a particular class of permutation polynomials over…

We characterize all monic polynomials $f(x) \in \mathbb{Z}[x]$ that have the property that \[f(p) \mid f(p^{p}),~\text{for all sufficiently large primes }p \geq N(f). \] We also give necessary conditions and a sufficient condition for monic…

We consider new polynomially solvable cases of the well-known Quadratic Assignment Problem involving coefficient matrices with a special diagonal structure. By combining the new special cases with polynomially solvable special cases known…

Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…

The numerical construction of polynomials in the product representation (as used for instance in variants of the multiboson technique) can become problematic if rounding errors induce an imprecise or even unstable evaluation of the…

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

We say that a symmetric noncommutative polynomial in the noncommutative free variables (x_1, x_2, ..., x_g) is noncommutative plurisubharmonic on a noncommutative open set if it has a noncommutative complex hessian that is positive…

We prove in a direct fashion that a multidimensional probability measure is determinate if the higher dimensional analogue of Carleman's condition is satisfied. In that case, the polynomials, as well as certain proper subspaces of the…

If a real symmetric matrix of linear forms is positive definite at some point, then its determinant is a hyperbolic hypersurface. In 2007, Helton and Vinnikov proved a converse in three variables, namely that every hyperbolic plane curve…

In this paper we study the density of polynomials in some $L^2(M)$ spaces. Two choices of the measure $M$ and polynomials are considered: 1) a $(N\times N)$ matrix non-negative Borel measure on $\mathbb{R}$ and vector-valued polynomials…

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

In this article, we consider the monomial complete intersection algebra $\mathbb{K}[x,y]/\langle x^d,y^q\rangle$ in two variables. For elements $l_1,\ldots,l_{d+q-2k}$ of degree $1$, we give a formula of the deteminant of linear map from…

We define the second discriminant $D_2$ of a univariate polynomial $f$ of degree greater than $2$ as the product of the linear forms $2\,r_k-r_i-r_j$ for all triples of roots $r_i, r_k, r_j$ of $f$ with $i<j$ and $j\neq k, k\neq i$. $D_2$…

Let $M$ be a representation of an acyclic quiver $Q$ over an infinite field $k$. We establish a deterministic algorithm for computing the Harder-Narasimhan filtration of $M$. The algorithm is polynomial in the dimensions of $M$, the weights…

Every symmetric polynomial p(x)=p(x_1,...,x_g) (with real coefficients) in g noncommuting variables x_1, ..., x_g can be written as a sum and difference of squares of noncommutative polynomials. Let s(p), the negative signature of p, denote…

A formula expressing the fermionic determinant as an infinite product of smaller determinants is derived and discussed. These smaller determinants are of a fixed size, independent of the size of the lattice and are indexed by loops of…