Search arXivSearch

arXiv · 2009.01345

A magic determinant formula for symmetric polynomials of eigenvalues

Abstract

Symmetric polynomials of the roots of a polynomial can be written as polynomials of the coefficients, and by applying this to the characteristic polynomial we can write a symmetric polynomial of the eigenvalues $a_{i}$ of an $n\times n$ matrix $A$ as a polynomial of the entries of the matrix. We give a magic formula for this: symbolically substitute $a\mapsto A$ in the symmetric polynomial and replace multiplication by $\det$. For instance, for a $2\times2$ matrix $A$ with eigenvalues $a_{1},a_{2}$, \begin{align*} a_1 a_2^2 +a_1^2 a_2 & =\det(A_1, A_2^2)+ \det(A_1^2, A_2) \end{align*} where $A_i^k$ is the $i$-th column of $A^k$. One may also take negative powers, allowing us to calculate: \begin{align*} a_1a_2^{-1}+a_1^{-1}a_{2} & =\det(A_{1},A_{2}^{-1})+\det(A_1^{-1},A_{2}) \end{align*} The magic method also works for multivariate symmetric polynomials of the eigenvalues of a set of commuting matrices, e.g. for $2\times2$ matrices $A$ and $B$ with eigenvalues $a_1,a_2$ and $b_{1},b_{2}$, \begin{align*} a_1 b_1 a_2^2 + a_1^2a_2b_2 & = \det(AB_{1},A_2^2) + \det(A_1^2,AB_2) \end{align*}

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jules Jacobs. 2020-09-19. A magic determinant formula for symmetric polynomials of eigenvalues. https://arxiv.org/abs/2009.01345

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO