- #1

burritoloco

- 83

- 0

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

In summary, cyclotomic polynomials are the only polynomials with a characteristic above 2. However, they have odd degree except for Phi_1(x) and Phi_2(x). Even if we include 1 in the set of roots of a cyclotomic polynomial, it's not a proper subgroup.

- #1

burritoloco

- 83

- 0

Physics news on Phys.org

- #2

burritoloco

- 83

- 0

- #3

- 22,183

- 3,322

Do you mean that the roots must form a cyclic group, or that the roots must generate a cyclic group? Judging from your talk about the cyclotomic polynomials, I guess the latter.

Well, when working over a finite field, then every polynomial [itex]P(X)\in \mathbb{F}_p(X)[/itex] with [itex]P(X)\notin (X)[/itex] will generate a cyclic group!

Also, in every field with characteristic p, the Artin-Schreier polynomial

[tex]X^p-X+a[/tex]

with a nonzero, will generate a cyclic group.

- #4

burritoloco

- 83

- 0

I initially meant "form" but I now realize that 1 is not a root of cyclotomic polynomials except for Phi_1(x), so its roots cannot form a group! Thus "generate" seems to be the right word. So let me rephrase. Let's say we make a set with all the roots of a polynomial, and 1. For what polynomials will this set be a cyclic group?

- #5

- 22,183

- 3,322

Well, then I guess the only polynomials that satisfy this are some divisors of [itex]X^n-1[/itex]...

- #6

burritoloco

- 83

- 0

- #7

burritoloco

- 83

- 0

By the above I meant my previous post...

- #8

burritoloco

- 83

- 0

- #9

burritoloco

- 83

- 0

Hmm, I'm afraid not. The only way this subset is a proper subgroup of the cyclic group generated by an nth primitive root of unity, is if it's generated by a non-nth primitive root, say an mth primitive root of unity. So the corresponding polynomial would still be the mth-cyclotomic polynomial not necessarily irreducible over the finite field. Moreover, this polynomial would still have even degree (if it's not Phi_1(x), Phi_2(x)). So no luck!

Last edited:

A cyclic group is a mathematical concept that describes a set of elements that can be generated by repeatedly applying a single operation to a starting element, called a generator. In the context of polynomials, a cyclic group is a set of polynomials whose roots can be generated by repeatedly applying a single operation, such as addition or multiplication, to a starting polynomial.

A polynomial can have a cyclic group of roots if it meets certain criteria. First, the polynomial must have a finite number of distinct roots. Second, these roots must be related in a specific way, such as being evenly spaced around a circle or forming a regular polygon. Finally, the polynomial must be irreducible, meaning it cannot be factored into polynomials of lower degree with rational coefficients.

One example is the class of cyclotomic polynomials, which have roots that form a regular polygon on the complex plane. Another example is the class of Chebyshev polynomials, which have roots that form a regular polygon on the real number line. Additionally, certain families of generalized cyclotomic polynomials and Lucas polynomials also have roots that form cyclic groups.

The study of polynomials with cyclic group roots is important in many areas of mathematics, including number theory, algebra, and geometry. These polynomials have connections to topics such as prime numbers, group theory, and geometric constructions. Furthermore, understanding the properties of these polynomials can provide insight into the structure and behavior of more complex mathematical objects.

Yes, there are several real-world applications of polynomials with cyclic group roots. One example is in coding theory, where certain cyclic codes are constructed using polynomials with cyclic group roots. These codes are used in error-correcting systems for data transmission and storage. Additionally, the properties of these polynomials have been used in cryptography, specifically in the design of secure hash functions.

- Replies
- 2

- Views
- 2K

- Replies
- 3

- Views
- 2K

- Replies
- 13

- Views
- 10K

- Replies
- 1

- Views
- 1K

- Replies
- 9

- Views
- 5K

- Replies
- 2

- Views
- 2K

- Replies
- 4

- Views
- 2K

- Replies
- 4

- Views
- 3K

- Replies
- 6

- Views
- 4K

Share: