I What can be deduced about the roots of this polynomial?

  • I
  • Thread starter Thread starter Dowland
  • Start date Start date
  • Tags Tags
    Polynomials Roots
Dowland
Messages
51
Reaction score
0
Hello everyone,

I'm currently doing some research about feedback systems in engineering and right now I'm playing around with special types of feedback matrices. In the process, I stumbled upon a potentially interesting polynomial, which is actually the characteristic polynomial of the system. It looks as follows:

$$\begin{align*} P(z) &= z^{m_1+m_2+m_3+m_4}
- z^{m_2+m_3+m_4} + z^{m_1+m_3+m_4} + z^{m_1+m_2+m_4} - z^{m_1+m_2+m_3} \\
&\quad - z^{m_3+m_4} - z^{m_2+m_4} - z^{m_1+m_3} - z^{m_1+m_2}
- z^{m_4} + z^{m_3} + z^{m_2} - z^{m_1} + 2\end{align*}$$

Where the m_i's are positive integers. Since my background in algebra is a little weak, I'm basically curious if anyone with more insight can see something interesting about this polynomial? Maybe someone could even give a hint about some theorem or similar that could be helpful? I would like to be able to say something about its roots over the complex numbers but so far I have not find any useful theorem in my basic abstract algebra textbook. It almost looks symmetric, except for the annoying switching of signs in front of the different terms, and unfortunately, it's not skew-symmetric either. The only thing I can say is that I've been trying different values for the m_i's in Matlab (like more or less random positive integers) and all the roots always end up on the unit circle, which is one of the reasons I think the issue is interesting.
 
Last edited:
Physics news on Phys.org
This is not my field, but ##x_k=z^{m_k}## might work better.
 
  • Like
Likes anuttarasammyak
Hi. I observe:

P(1)=1 so P(1)-1 has factor (z-1).

P(z)-2 has factor z^n where n=min{m1,m2,m3,m4}.

m1 and m4 are exchangeable. m2 and m3 are exchangeable. To show it explicitly
P(z)=abcd+ad(b+c)-bc(a+d)-(a+d-1)(b+c+1)+3
=(1-a)(1-d)(1+b)(1+c)+3-ad-bc
=(1-a)(1-d)(1+b)(1+c)-(1-a)(1-d)-(1+b)(1+c)+(1-a)+(1-d)+(1+b)+(1+c)+1
=[1-(1-a)(1-d)][1-(1+b)(1+c)]+(1-a)+(1-d)+(1+b)+(1+c)
where ##a=z^{m_1}## and so on. This shows (a and -b) and (d and -c) are exchangeable and so on.
 
Last edited:
  • Informative
Likes Keith_McClary
I find your question interesting; and especially, your empirical observation that all the roots are on the unit circle. I have not tried to think about your question. I wrote to you because of your question itself, and about your other post about G Chrystal's Textbook of Algebra. I have been browsing the book for a while now. I am looking for a mathematics friend with whom I can discuss it.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top