Knowledge (XXG)

Williamson conjecture

Source 📝

533: 403: 264: 608:. However, in 1993 the Williamson conjecture was shown to be false via an exhaustive computer search by Dragomir Ž. Ðoković, who showed that Williamson matrices do not exist in order 794: 890: 183: 632: 756: 606: 563: 583: 395: 375: 355: 335: 311: 287: 156: 136: 116: 96: 66: 46: 585:
and that the structure of Williamson matrices could provide a route to proving the Hadamard conjecture that Hadamard matrices exist for all orders
926: 883: 528:{\displaystyle {\begin{bmatrix}A&B&C&D\\-B&A&-D&C\\-C&D&A&-B\\-D&-C&B&A\end{bmatrix}}} 314: 1032: 876: 800: 1027: 690: 1001: 21: 936: 981: 653: 191: 921: 996: 956: 951: 911: 991: 76: 17: 976: 971: 966: 986: 961: 916: 837:
Holzmann, W. H.; Kharaghani, H.; Tayfeh-Rezaie, B. (2008). "Williamson matrices up to order 59".
707: 761: 946: 931: 846: 809: 699: 662: 73: 69: 858: 823: 719: 674: 165: 854: 819: 715: 670: 611: 539: 290: 738: 588: 545: 941: 651:
Williamson, John (1944). "Hadamard's determinant theorem and the sum of four squares".
568: 380: 360: 340: 320: 296: 272: 141: 121: 101: 81: 51: 31: 1021: 814: 734: 688:
Golomb, Solomon W.; Baumert, Leonard D. (1963). "The Search for Hadamard Matrices".
666: 900: 850: 565:. It was once considered likely that Williamson matrices exist for all orders 634:. In 2008, the counterexamples 47, 53, and 59 were additionally discovered. 868: 711: 703: 872: 412: 764: 741: 614: 591: 571: 548: 406: 383: 363: 343: 323: 299: 275: 194: 168: 144: 124: 104: 84: 54: 34: 788: 750: 626: 600: 577: 557: 527: 389: 369: 349: 329: 305: 281: 258: 177: 150: 130: 110: 90: 60: 40: 16:In combinatorial mathematics, specifically in 884: 8: 259:{\displaystyle A^{2}+B^{2}+C^{2}+D^{2}=4nI} 891: 877: 869: 813: 763: 740: 613: 590: 570: 547: 407: 405: 382: 362: 342: 322: 298: 274: 238: 225: 212: 199: 193: 167: 143: 123: 103: 83: 53: 33: 643: 28:is that Williamson matrices of order 7: 185:and they satisfy the relationship 14: 48:exist for all positive integers 839:Designs, Codes and Cryptography 735:"Williamson matrices of order 1: 733:Ðoković, Dragomir Ĺ˝. (1993). 691:American Mathematical Monthly 667:10.1215/S0012-7094-44-01108-7 397:are Williamson matrices then 815:10.1016/0012-365X(93)90495-F 22:combinatorial matrix theory 18:combinatorial design theory 1049: 789:{\displaystyle n=33,35,39} 907: 851:10.1007/s10623-007-9163-5 654:Duke Mathematical Journal 790: 752: 628: 602: 579: 559: 529: 391: 371: 351: 331: 307: 283: 260: 179: 152: 132: 112: 92: 62: 42: 1033:Disproved conjectures 927:Euler's sum of powers 791: 753: 629: 603: 580: 560: 530: 392: 372: 352: 332: 308: 284: 261: 180: 178:{\displaystyle \pm 1} 162:if their entries are 153: 133: 113: 93: 63: 43: 26:Williamson conjecture 1028:Combinatorial design 801:Discrete Mathematics 762: 739: 627:{\displaystyle n=35} 612: 589: 569: 546: 404: 381: 361: 341: 321: 297: 273: 192: 166: 142: 122: 102: 82: 52: 32: 160:Williamson matrices 917:Chinese hypothesis 786: 751:{\displaystyle 4n} 748: 624: 601:{\displaystyle 4n} 598: 575: 558:{\displaystyle 4n} 555: 525: 519: 387: 367: 347: 327: 303: 279: 256: 175: 148: 128: 108: 88: 58: 38: 1015: 1014: 578:{\displaystyle n} 390:{\displaystyle D} 370:{\displaystyle C} 350:{\displaystyle B} 330:{\displaystyle A} 306:{\displaystyle n} 282:{\displaystyle I} 151:{\displaystyle D} 131:{\displaystyle C} 111:{\displaystyle B} 91:{\displaystyle A} 61:{\displaystyle n} 41:{\displaystyle n} 1040: 967:Ono's inequality 893: 886: 879: 870: 863: 862: 834: 828: 827: 817: 795: 793: 792: 787: 757: 755: 754: 749: 730: 724: 723: 685: 679: 678: 648: 633: 631: 630: 625: 607: 605: 604: 599: 584: 582: 581: 576: 564: 562: 561: 556: 534: 532: 531: 526: 524: 523: 396: 394: 393: 388: 376: 374: 373: 368: 356: 354: 353: 348: 336: 334: 333: 328: 312: 310: 309: 304: 288: 286: 285: 280: 265: 263: 262: 257: 243: 242: 230: 229: 217: 216: 204: 203: 184: 182: 181: 176: 157: 155: 154: 149: 137: 135: 134: 129: 117: 115: 114: 109: 97: 95: 94: 89: 67: 65: 64: 59: 47: 45: 44: 39: 1048: 1047: 1043: 1042: 1041: 1039: 1038: 1037: 1018: 1017: 1016: 1011: 903: 897: 867: 866: 836: 835: 831: 760: 759: 737: 736: 732: 731: 727: 704:10.2307/2312777 687: 686: 682: 650: 649: 645: 640: 610: 609: 587: 586: 567: 566: 544: 543: 540:Hadamard matrix 518: 517: 512: 507: 499: 490: 489: 481: 476: 471: 462: 461: 456: 448: 443: 434: 433: 428: 423: 418: 408: 402: 401: 379: 378: 359: 358: 339: 338: 319: 318: 317:showed that if 315:John Williamson 295: 294: 291:identity matrix 271: 270: 234: 221: 208: 195: 190: 189: 164: 163: 140: 139: 120: 119: 100: 99: 80: 79: 50: 49: 30: 29: 12: 11: 5: 1046: 1044: 1036: 1035: 1030: 1020: 1019: 1013: 1012: 1010: 1009: 1004: 999: 994: 989: 984: 979: 974: 969: 964: 959: 954: 949: 944: 942:Hauptvermutung 939: 934: 929: 924: 919: 914: 908: 905: 904: 898: 896: 895: 888: 881: 873: 865: 864: 845:(3): 343–352. 829: 808:(1): 267–271. 785: 782: 779: 776: 773: 770: 767: 747: 744: 725: 680: 642: 641: 639: 636: 623: 620: 617: 597: 594: 574: 554: 551: 536: 535: 522: 516: 513: 511: 508: 506: 503: 500: 498: 495: 492: 491: 488: 485: 482: 480: 477: 475: 472: 470: 467: 464: 463: 460: 457: 455: 452: 449: 447: 444: 442: 439: 436: 435: 432: 429: 427: 424: 422: 419: 417: 414: 413: 411: 386: 366: 346: 326: 302: 278: 267: 266: 255: 252: 249: 246: 241: 237: 233: 228: 224: 220: 215: 211: 207: 202: 198: 174: 171: 147: 127: 107: 87: 57: 37: 13: 10: 9: 6: 4: 3: 2: 1045: 1034: 1031: 1029: 1026: 1025: 1023: 1008: 1005: 1003: 1000: 998: 995: 993: 990: 988: 985: 983: 980: 978: 975: 973: 970: 968: 965: 963: 960: 958: 955: 953: 950: 948: 945: 943: 940: 938: 935: 933: 930: 928: 925: 923: 920: 918: 915: 913: 910: 909: 906: 902: 894: 889: 887: 882: 880: 875: 874: 871: 860: 856: 852: 848: 844: 840: 833: 830: 825: 821: 816: 811: 807: 803: 802: 797: 783: 780: 777: 774: 771: 768: 765: 745: 742: 729: 726: 721: 717: 713: 709: 705: 701: 697: 693: 692: 684: 681: 676: 672: 668: 664: 660: 656: 655: 647: 644: 637: 635: 621: 618: 615: 595: 592: 572: 552: 549: 541: 520: 514: 509: 504: 501: 496: 493: 486: 483: 478: 473: 468: 465: 458: 453: 450: 445: 440: 437: 430: 425: 420: 415: 409: 400: 399: 398: 384: 364: 344: 324: 316: 300: 292: 276: 253: 250: 247: 244: 239: 235: 231: 226: 222: 218: 213: 209: 205: 200: 196: 188: 187: 186: 172: 169: 161: 158:are known as 145: 125: 105: 85: 78: 75: 71: 55: 35: 27: 23: 19: 1006: 937:Hedetniemi's 842: 838: 832: 805: 799: 728: 698:(1): 12–17. 695: 689: 683: 661:(1): 65–81. 658: 652: 646: 537: 268: 159: 25: 15: 997:Von Neumann 901:conjectures 1022:Categories 1007:Williamson 1002:Weyl–Berry 982:Schoen–Yau 899:Disproved 638:References 542:of order 502:− 494:− 484:− 466:− 451:− 438:− 293:of order 170:± 74:circulant 70:symmetric 977:Ragsdale 957:Keller's 952:Kalman's 912:Borsuk's 77:matrices 987:Seifert 962:Mertens 859:2372843 824:1217635 720:0146195 712:2312777 675:0009590 289:is the 68:. Four 992:Tait's 947:Hirsch 922:Connes 857:  822:  718:  710:  673:  538:is an 269:where 972:PĂłlya 932:Ganea 708:JSTOR 758:for 72:and 24:the 20:and 847:doi 810:doi 806:115 700:doi 663:doi 313:. 1024:: 855:MR 853:. 843:46 841:. 820:MR 818:. 804:. 798:. 784:39 778:35 772:33 716:MR 714:. 706:. 696:70 694:. 671:MR 669:. 659:11 657:. 622:35 377:, 357:, 337:, 138:, 118:, 98:, 892:e 885:t 878:v 861:. 849:: 826:. 812:: 796:" 781:, 775:, 769:= 766:n 746:n 743:4 722:. 702:: 677:. 665:: 619:= 616:n 596:n 593:4 573:n 553:n 550:4 521:] 515:A 510:B 505:C 497:D 487:B 479:A 474:D 469:C 459:C 454:D 446:A 441:B 431:D 426:C 421:B 416:A 410:[ 385:D 365:C 345:B 325:A 301:n 277:I 254:I 251:n 248:4 245:= 240:2 236:D 232:+ 227:2 223:C 219:+ 214:2 210:B 206:+ 201:2 197:A 173:1 146:D 126:C 106:B 86:A 56:n 36:n

Index

combinatorial design theory
combinatorial matrix theory
symmetric
circulant
matrices
identity matrix
John Williamson
Hadamard matrix
Duke Mathematical Journal
doi
10.1215/S0012-7094-44-01108-7
MR
0009590
American Mathematical Monthly
doi
10.2307/2312777
JSTOR
2312777
MR
0146195
"Williamson matrices of order 4 n {\displaystyle 4n} for n = 33 , 35 , 39 {\displaystyle n=33,35,39} "
Discrete Mathematics
doi
10.1016/0012-365X(93)90495-F
MR
1217635
doi
10.1007/s10623-007-9163-5
MR
2372843

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑