Related papers: Symmetric Determinantal Representations in Charact…
Let $\{C_1, C_2, \ldots, C_m\},~m\ge2$ be a collection of $n\times n$ real symmetric matrices. The objective of the paper is to offer an algorithm that finds a common congruence matrix $R$ such that $R^TC_iR$ is real diagonal for every…
This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…
Sufficient dimension reduction (SDR) methods, which often rely on class precision matrices, are widely used in supervised statistical classification problems. However, when class-specific sample sizes are small relative to the original…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
For every constant $d$, we design a subexponential time deterministic algorithm that takes as input a multivariate polynomial $f$ given as a constant depth algebraic circuit over the field of rational numbers, and outputs all irreducible…
Given a non-hermitean matrix M, the structure of its minimal polynomial encodes whether M is diagonalizable or not. This note will explain how to determine the minimal polynomial of a matrix without going through its characteristic…
For a non-commutative ring R, we consider factorizations of polynomials in R[t] where t is a central variable. A pseudo-root of a polynomial p(t) is an element x in R, for which there exist polynomials q(t) and s(t) such that…
In this paper, we obtain a general formula for the characteristic polynomial of a finitely dimensional representation of Lie algebra $\mathfrak{sl}(2, \C )$ and the form for these characteristic polynomials, and prove there is one to one…
It is known that any symmetric matrix $M$ with entries in $\R[x]$ and which is positive semi-definite for any substitution of $x\in\R$, has a Smith normal form whose diagonal coefficients are constant sign polynomials in $\R[x]$. We…
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…
The equivalence of multidimensional systems is closely related to the reduction of multivariate polynomial matrices, with the Smith normal form of matrices playing a key role. So far, the problem of reducing multivariate polynomial matrices…
Let K,S,D be a division ring, an endomorphism and a S-derivation of K, respectively. In this setting we introduce generalized noncommutative symmetric functions and obtain Vieta formula and decompositions of differential operators.…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
A social decision rule (SDR) is any non-empty set-valued map that associates any profile of individual preferences with the set of (winning) alternatives. An SDR is Condorcet-consistent if it selects the set of Condorcet winners whenever…
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in $\Sigma_2^p$. In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is…
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…
We introduce a general framework for the construction of polynomial frames in $L^2(\mathbb{S}^{d-1})$, $d \geq 3$, where the frame functions are obtained as rotated versions of an initial sequence of polynomials $\Psi^j$, $j\in…
This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…
The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…