Abstract
A tuple a = (a1,…,an) of positive real numbers is said to be equiangular if there is an equiangular polygon with consecutive side lengths a1,…,an. It is well known that a is equiangular if and only if the polynomial a(x) = a1 + a2x + … + an-1xn-2 + anxn-1 vanishes at . Here we dispense with complex numbers and borrow an idea from the theory of cyclic codes to prove that a is equiangular if and only if a(x) is divisible by .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
