938:
called a positive integer n a "Dickson number" if every degree-n polynomial in Z which induces a permutation of Z/pZ for infinitely many primes p is a composition of
Dickson polynomials and linears. He proved that prime numbers are Dickson numbers. He also asserted that he would prove in a subsequent paper that a positive integer n is a Dickson number if it has the property that for each (positive) composite divisor d of n, every permutation group on d symbols which contains a d-cycle is either doubly transitive or imprimitive. Unfortunately, Schur never published this proof, nor did he mention Dickson numbers again in his papers. Further, Schur made no conjecture about which positive integers n have the stated group-theoretic property. He did, however, prove some years later that *every* positive integer n has this property: for every composite d, every permutation group on d symbols which contains a d-cycle is either doubly transitive or imprimitive. This group-theoretic result is now known as "Schur's theorem", and it plays a crucial role in all known proofs of the so-called "Schur conjecture".
84:
74:
53:
942:
Davenport. A few years later, Don's student Mike Fried wrote a paper on the so-called "Schur conjecture", and in the years that followed this terminology became commonplace. However, it is not accurate: Schur did not make any such conjecture. (Someone new to the topic might be confused by the fact that Mike Fried cites a specific page of Schur's paper in his article; however, there is no conjecture to be found on that or any other page of Schur's paper.) ==Mike Zieve
217:
polynomial is T_3(x)=4x^3-3x, and if you compose on both sides with ix then you get i * (4(ix)^3-3(ix)) = 4x^3+3x. The resulting polynomial 4x^3+3x has rational coefficients, but cannot be written as the composition of 4x^3-3x with linears in Q. It is thus a "twist" of 4x^3-3x, and
Dickson polynomials exist to capture such twists: indeed, 4x^3+3x=D_3(2x,-1)/2 is the composition of D_3(x,-1) with linears in Q. ==Mike Zieve
194:. Are these really just the same polynomials? If so, it seems weird to have separate articles, and if not it seems the reference doesn't support the claim. The material in this article seems interesting, the article on Chebyshev polynomials is already long, and there is a book with the title Dickson Polynomials, so it would be good to keep the articles split, but I'm not sure the relationship is totally clear yet.
22:
213:
Turnwald's paper "On a problem concerning permutation polynomials" (Transactions of the
American Mathematical Society 302, number 1, 1987), Fried uses three pairwise inequivalent definitions of Chebyshev polynomials. A correct statement and proof of the so-called "Schur conjecture" can be found in the cited book on Dickson polynomials, among other places.
162:
197:
More technical detail: so the Schur thingy only requires that one look at infinitely many primes, so it should be no issue to divide by 2, and I think we can assume alpha is a square mod infinitely many of the primes, but I am not sure about whether we can over the rationals. So I am not sure they
941:
The term "Schur conjecture" entered the literature in two
Mathematical Reviews written by Don Lewis in 1966. I have spoken with Don about this, and he says that he had no special knowledge of Schur making this conjecture, but instead that he (Don) must have misremembered something he was told by
937:
The name "Schur conjecture" is inappropriate. Schur did not make this conjecture, and in fact he took pains to avoid making any such conjecture. Specifically, in his 1923 paper "Ueber den
Zusammenhang zwischen einem Problem der Zahlentheorie und einem Satz ueber algebraische Funktionen", Schur
216:
More generally, the whole point of
Dickson polynomials is that you can take a Chebyshev polynomial over a given field, compose it on both sides with linear polynomials defined over an extension field, and wind up with a polynomial over the original field. For instance, the degree-3 Chebyshev
212:
In response to JackSchmidt's question: the reason Fried's article only talks about
Chebyshev polynomials is that this is one of several errors in that article. The theorem that Fried stated is false, and to salvage it one must use Dickson polynomials. For instance, as noted on pp.259-260 of
198:
are the same, just that
Chebyshev polynomials are roughly speaking a subset of the Dickson polynomials. Why does the article only talk about Chebyshev polynomials then? Do they prove a stronger result than the one claimed in this wikipedia article?
665:
791:
909:
440:
347:
140:
991:
is a prime you get the simplest examples of the finite fields, which are the integers modulo that prime. The other finite fields can be viewed as field extensions of these basic examples.--
482:
671:
1020:
130:
1015:
106:
972:
97:
58:
827:
225:
I suggest refreshing the section :Links to other polynomials as follows (demonstration available), is there any objection?
33:
353:
260:
176:
814:
Nonsense. As I pointed out, those
Dickson polynomials are essentially Chebychev polynominals, with the relation:
968:
21:
923:
458:
447:
203:
172:
39:
83:
960:
804:
233:
191:
964:
105:
on
Knowledge. If you would like to participate, please visit the project page, where you can join
996:
89:
952:
Dn is a permutation polynomial for the field with q elements if and only if n is coprime to q²−1
73:
52:
660:{\displaystyle B_{n+1}(x)B_{n+j}(x)-B_{n+j+1}(x)B_{n}(x)=(3x^{2}+4)D_{n+1}(x,{\frac {1}{4}})\,}
920:
451:
168:
199:
800:
786:{\displaystyle B_{n}\left(x\right)=D_{n}(2x,{\frac {1}{4}})+4D_{n-1}(2x,{\frac {1}{4}})\,}
1009:
992:
102:
190:
Howdy, I read through the Schur conjecture reference, and it only mentions the
79:
1000:
976:
926:
808:
207:
156:
15:
469:
are linked to the Dickson polynomials by the relations :
957:
Isn't there the extra condition that q must be prime ?
904:{\displaystyle D_{n}(x,{\frac {1}{4}})=2^{1-n}T_{n}(x)}
446:
The Dickson polynomials with parameter α = -1 give the
830:
674:
485:
356:
263:
101:, a collaborative effort to improve the coverage of
903:
785:
659:
434:
341:
435:{\displaystyle E_{n}(2xa,a^{2})=a^{n}U_{n}(x).\,}
342:{\displaystyle D_{n}(2xa,a^{2})=2a^{n}T_{n}(x)\,}
8:
19:
958:
47:
886:
870:
850:
835:
829:
768:
744:
721:
703:
679:
673:
642:
621:
602:
574:
543:
515:
490:
484:
412:
402:
386:
361:
355:
322:
312:
293:
268:
262:
781:
655:
430:
337:
49:
175:on September 21, 2011. The result of
7:
95:This article is within the scope of
232:Dickson polynomials are related to
38:It is of interest to the following
14:
1021:Low-priority mathematics articles
983:No, finite fields exist whenever
115:Knowledge:WikiProject Mathematics
1016:Start-Class mathematics articles
160:
118:Template:WikiProject Mathematics
82:
72:
51:
20:
229:==Links to other polynomials==
167:This article was nominated for
135:This article has been rated as
898:
892:
860:
841:
778:
756:
731:
709:
652:
633:
614:
592:
586:
580:
567:
561:
533:
527:
508:
502:
424:
418:
392:
367:
334:
328:
299:
274:
1:
927:10:33, 15 February 2009 (UTC)
809:01:39, 15 February 2009 (UTC)
109:and see a list of open tasks.
987:is a power of a prime. When
208:19:35, 8 February 2008 (UTC)
1037:
1001:15:53, 16 April 2017 (UTC)
221:Links to other polynomials
186:Schur conjecture reference
977:06:18, 4 April 2017 (UTC)
134:
67:
46:
141:project's priority scale
946:Permutation polynomials
98:WikiProject Mathematics
905:
787:
661:
436:
343:
28:This article is rated
933:Schur conjecture name
906:
788:
662:
437:
344:
234:Chebyshev polynomials
192:Chebyshev polynomials
173:Chebyshev polynomials
828:
672:
483:
459:Boubaker polynomials
354:
261:
121:mathematics articles
901:
783:
782:
657:
656:
432:
431:
339:
338:
90:Mathematics portal
34:content assessment
979:
963:comment added by
858:
776:
729:
650:
452:Lucas polynomials
183:
182:
179:was no consensus.
155:
154:
151:
150:
147:
146:
1028:
993:Bill Cherowitzo
910:
908:
907:
902:
891:
890:
881:
880:
859:
851:
840:
839:
792:
790:
789:
784:
777:
769:
755:
754:
730:
722:
708:
707:
695:
684:
683:
666:
664:
663:
658:
651:
643:
632:
631:
607:
606:
579:
578:
560:
559:
526:
525:
501:
500:
441:
439:
438:
433:
417:
416:
407:
406:
391:
390:
366:
365:
348:
346:
345:
340:
327:
326:
317:
316:
298:
297:
273:
272:
164:
163:
157:
123:
122:
119:
116:
113:
92:
87:
86:
76:
69:
68:
63:
55:
48:
31:
25:
24:
16:
1036:
1035:
1031:
1030:
1029:
1027:
1026:
1025:
1006:
1005:
948:
935:
882:
866:
831:
826:
825:
740:
699:
685:
675:
670:
669:
617:
598:
570:
539:
511:
486:
481:
480:
468:
408:
398:
382:
357:
352:
351:
318:
308:
289:
264:
259:
258:
252:
243:
223:
188:
161:
120:
117:
114:
111:
110:
88:
81:
61:
32:on Knowledge's
29:
12:
11:
5:
1034:
1032:
1024:
1023:
1018:
1008:
1007:
1004:
1003:
965:Fabrice.Neyret
947:
944:
934:
931:
930:
929:
917:
916:
915:
914:
913:
912:
911:
900:
897:
894:
889:
885:
879:
876:
873:
869:
865:
862:
857:
854:
849:
846:
843:
838:
834:
816:
815:
798:
797:
796:
795:
794:
793:
780:
775:
772:
767:
764:
761:
758:
753:
750:
747:
743:
739:
736:
733:
728:
725:
720:
717:
714:
711:
706:
702:
698:
694:
691:
688:
682:
678:
667:
654:
649:
646:
641:
638:
635:
630:
627:
624:
620:
616:
613:
610:
605:
601:
597:
594:
591:
588:
585:
582:
577:
573:
569:
566:
563:
558:
555:
552:
549:
546:
542:
538:
535:
532:
529:
524:
521:
518:
514:
510:
507:
504:
499:
496:
493:
489:
473:
472:
471:
470:
464:
455:
443:
442:
429:
426:
423:
420:
415:
411:
405:
401:
397:
394:
389:
385:
381:
378:
375:
372:
369:
364:
360:
349:
336:
333:
330:
325:
321:
315:
311:
307:
304:
301:
296:
292:
288:
285:
282:
279:
276:
271:
267:
255:
254:
248:
239:
222:
219:
187:
184:
181:
180:
177:the discussion
165:
153:
152:
149:
148:
145:
144:
133:
127:
126:
124:
107:the discussion
94:
93:
77:
65:
64:
56:
44:
43:
37:
26:
13:
10:
9:
6:
4:
3:
2:
1033:
1022:
1019:
1017:
1014:
1013:
1011:
1002:
998:
994:
990:
986:
982:
981:
980:
978:
974:
970:
966:
962:
955:
953:
945:
943:
939:
932:
928:
925:
922:
918:
895:
887:
883:
877:
874:
871:
867:
863:
855:
852:
847:
844:
836:
832:
824:
823:
822:
821:
820:
819:
818:
817:
813:
812:
811:
810:
806:
802:
773:
770:
765:
762:
759:
751:
748:
745:
741:
737:
734:
726:
723:
718:
715:
712:
704:
700:
696:
692:
689:
686:
680:
676:
668:
647:
644:
639:
636:
628:
625:
622:
618:
611:
608:
603:
599:
595:
589:
583:
575:
571:
564:
556:
553:
550:
547:
544:
540:
536:
530:
522:
519:
516:
512:
505:
497:
494:
491:
487:
479:
478:
477:
476:
475:
474:
467:
463:
460:
456:
453:
449:
445:
444:
427:
421:
413:
409:
403:
399:
395:
387:
383:
379:
376:
373:
370:
362:
358:
350:
331:
323:
319:
313:
309:
305:
302:
294:
290:
286:
283:
280:
277:
269:
265:
257:
256:
251:
247:
242:
238:
235:
231:
230:
228:
227:
226:
220:
218:
214:
210:
209:
205:
201:
195:
193:
185:
178:
174:
170:
166:
159:
158:
142:
138:
132:
129:
128:
125:
108:
104:
100:
99:
91:
85:
80:
78:
75:
71:
70:
66:
60:
57:
54:
50:
45:
41:
35:
27:
23:
18:
17:
988:
984:
959:— Preceding
956:
951:
949:
940:
936:
921:Arthur Rubin
799:
465:
461:
249:
245:
240:
236:
224:
215:
211:
196:
189:
137:Low-priority
136:
96:
62:Low‑priority
40:WikiProjects
200:JackSchmidt
112:Mathematics
103:mathematics
59:Mathematics
30:Start-class
1010:Categories
801:Etaittunpe
448:Fibonacci
973:contribs
961:unsigned
169:merging
139:on the
924:(talk)
36:scale.
171:with
997:talk
969:talk
805:talk
457:The
450:and
244:and
204:talk
954:".
131:Low
1012::
999:)
975:)
971:•
919:—
875:−
807:)
749:−
537:−
253:by
206:)
995:(
989:q
985:q
967:(
950:"
899:)
896:x
893:(
888:n
884:T
878:n
872:1
868:2
864:=
861:)
856:4
853:1
848:,
845:x
842:(
837:n
833:D
803:(
779:)
774:4
771:1
766:,
763:x
760:2
757:(
752:1
746:n
742:D
738:4
735:+
732:)
727:4
724:1
719:,
716:x
713:2
710:(
705:n
701:D
697:=
693:)
690:x
687:(
681:n
677:B
653:)
648:4
645:1
640:,
637:x
634:(
629:1
626:+
623:n
619:D
615:)
612:4
609:+
604:2
600:x
596:3
593:(
590:=
587:)
584:x
581:(
576:n
572:B
568:)
565:x
562:(
557:1
554:+
551:j
548:+
545:n
541:B
534:)
531:x
528:(
523:j
520:+
517:n
513:B
509:)
506:x
503:(
498:1
495:+
492:n
488:B
466:n
462:B
454:.
428:.
425:)
422:x
419:(
414:n
410:U
404:n
400:a
396:=
393:)
388:2
384:a
380:,
377:a
374:x
371:2
368:(
363:n
359:E
335:)
332:x
329:(
324:n
320:T
314:n
310:a
306:2
303:=
300:)
295:2
291:a
287:,
284:a
281:x
278:2
275:(
270:n
266:D
250:n
246:U
241:n
237:T
202:(
143:.
42::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
