相关论文: Why the characteristic polynomial factors
We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…
Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph…
In finite group theory, chief factors play an important and well-understood role in the structure theory. We here develop a theory of chief factors for Polish groups. In the development of this theory, we prove a version of the Schreier…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
The typical definition of the characteristic polynomial seems totally ad hoc to me. This note gives a canonical construction of the characteristic polynomial as the minimal polynomial of a "generic" matrix. This approach works not just for…
We characterize when a size-2 positive semidefinite (psd) factorization of a positive matrix of rank 3 and psd rank 2 is unique. The characterization is obtained using tools from rigidity theory. In the first step, we define…
We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…
We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…
We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
E. Bayer-Fluckiger gave a necessary and sufficient condition for a polynomial to be realized as the characteristic polynomial of a semisimple isometry of an even unimodular lattice, by describing the local-global obstruction, and the author…
We consider the problem of extending the classical S-lemma from commutative case to noncommutative cases. We show that a symmetric quadratic homogeneous matrix-valued polynomial is positive semidefinite if and only if its coefficient matrix…
Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\chi_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side…
We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…
In this article, some factorization properties of polynomials over discrete valuation domains are elucidated. These properties along with the notion of Newton index of a polynomial leads to a generalization of the main result proved by…
This note is a response to one of problems posed by A.K. Kwasniewski in one of his recent papers. Namely for the sequence of finite cobweb subposets, the looked for explicit formulas for corresponding sequence of characteristic polynomials…
In this work, we discuss some properties of the eigenvalues of some classes of signed complete graphs. We also obtain the form of characteristic polynomial for these graphs.
We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…