Knowledge (XXG)

Sendov's conjecture

Source đź“ť

225: 149: 436: 494: 242: 396: 469: 56: 414: 308: 289: 261: 268: 246: 32: 275: 257: 235: 484: 204: 186: 435:
Brown, Johnny E.; Xiang, Guangping Proof of the Sendov conjecture for polynomials of degree at most eight.
193:
of the roots. It follows that the critical points must be within the unit disk, since the roots are.
489: 282: 36: 375: 28: 426:
Problem 4.5, W. K. Hayman, Research Problems in Function Theory. Althlone Press, London, 1967.
326: 322: 44: 40: 465: 478: 448: 330: 374:
Terence Tao (2020). "Sendov's conjecture for sufficiently high degree polynomials".
350: 224: 208: 190: 182:
roots is at a distance no more than 1 from at least one critical point.
171: 333:. In 1969 Meir and Sharma proved the conjecture for polynomials with 413:
Marden, Morris. Conjectures on the Critical Points of a Polynomial.
380: 329:. In 1967 the conjecture was misattributed to Ljubomir Iliev by 144:{\displaystyle f(z)=(z-r_{1})\cdots (z-r_{n}),\qquad (n\geq 2)} 397:"Sendov's conjecture for sufficiently high degree polynomials" 218: 453:
Approximation Theory: A Volume Dedicated to Blagovest Sendov
345:< 8 in 1996. Brown and Xiang proved the conjecture for 468:
by Bruce Torrence with contributions from Paul Abbott at
455:(B. Bojoanov, ed.), Sofia: DARBA, 2002 pp. 353–369. 325:
in 1959; he described the conjecture to his colleague
59: 27:, concerns the relationship between the locations of 189:
says that all of the critical points lie within the
249:. Unsourced material may be challenged and removed. 143: 437:Journal of Mathematical Analysis and Applications 337:< 6. In 1991 Brown proved the conjecture for 447:G. Schmeisser, "The Conjectures of Sendov and 200: < 9 by Brown-Xiang and for  353:proved the conjecture for sufficiently large 8: 50:The conjecture states that for a polynomial 379: 309:Learn how and when to remove this message 113: 88: 58: 16:Conjecture about the roots of polynomials 196:The conjecture has been proven for  366: 341:< 7. Borcea extended the proof to 321:The conjecture was first proposed by 7: 247:adding citations to reliable sources 470:The Wolfram Demonstrations Project 14: 415:The American Mathematical Monthly 495:Unsolved problems in mathematics 223: 395:Terence Tao (9 December 2020). 234:needs additional citations for 125: 138: 126: 119: 100: 94: 75: 69: 63: 1: 178:| â‰¤ 1, each of the 439:232 (1999), no. 2, 272–292. 511: 417:90 (1983), no. 4, 267-276. 23:, sometimes also called 145: 258:"Sendov's conjecture" 146: 43:. It is named after 243:improve this article 57: 466:Sendov's Conjecture 187:Gauss–Lucas theorem 37:polynomial function 25:Ilieff's conjecture 21:Sendov's conjecture 205:sufficiently large 170:inside the closed 141: 319: 318: 311: 293: 161:, ...,  502: 485:Complex analysis 440: 433: 427: 424: 418: 411: 405: 404: 392: 386: 385: 383: 371: 349:< 9 in 1999. 327:Nikola Obreshkov 323:Blagovest Sendov 314: 307: 303: 300: 294: 292: 251: 227: 219: 150: 148: 147: 142: 118: 117: 93: 92: 45:Blagovest Sendov 41:complex variable 19:In mathematics, 510: 509: 505: 504: 503: 501: 500: 499: 475: 474: 462: 444: 443: 434: 430: 425: 421: 412: 408: 394: 393: 389: 373: 372: 368: 363: 315: 304: 298: 295: 252: 250: 240: 228: 217: 169: 160: 154:with all roots 109: 84: 55: 54: 33:critical points 17: 12: 11: 5: 508: 506: 498: 497: 492: 487: 477: 476: 473: 472: 461: 460:External links 458: 457: 456: 442: 441: 428: 419: 406: 387: 365: 364: 362: 359: 317: 316: 231: 229: 222: 216: 213: 165: 158: 152: 151: 140: 137: 134: 131: 128: 124: 121: 116: 112: 108: 105: 102: 99: 96: 91: 87: 83: 80: 77: 74: 71: 68: 65: 62: 15: 13: 10: 9: 6: 4: 3: 2: 507: 496: 493: 491: 488: 486: 483: 482: 480: 471: 467: 464: 463: 459: 454: 450: 446: 445: 438: 432: 429: 423: 420: 416: 410: 407: 402: 398: 391: 388: 382: 377: 370: 367: 360: 358: 356: 352: 348: 344: 340: 336: 332: 331:Walter Hayman 328: 324: 313: 310: 302: 291: 288: 284: 281: 277: 274: 270: 267: 263: 260: â€“  259: 255: 254:Find sources: 248: 244: 238: 237: 232:This article 230: 226: 221: 220: 214: 212: 210: 206: 203: 199: 194: 192: 188: 183: 181: 177: 173: 168: 164: 157: 135: 132: 129: 122: 114: 110: 106: 103: 97: 89: 85: 81: 78: 72: 66: 60: 53: 52: 51: 48: 46: 42: 38: 34: 30: 26: 22: 452: 431: 422: 409: 400: 390: 369: 354: 346: 342: 338: 334: 320: 305: 296: 286: 279: 272: 265: 253: 241:Please help 236:verification 233: 201: 197: 195: 184: 179: 175: 166: 162: 155: 153: 49: 24: 20: 18: 490:Conjectures 351:Terence Tao 191:convex hull 479:Categories 401:What's new 381:2012.04125 361:References 269:newspapers 357:in 2020. 299:July 2015 172:unit disk 133:≥ 107:− 98:⋯ 82:− 283:scholar 215:History 285:  278:  271:  264:  256:  449:Smale 376:arXiv 290:JSTOR 276:books 39:of a 35:of a 29:roots 262:news 185:The 31:and 451:," 245:by 209:Tao 207:by 481:: 399:. 211:. 47:. 403:. 384:. 378:: 355:n 347:n 343:n 339:n 335:n 312:) 306:( 301:) 297:( 287:· 280:· 273:· 266:· 239:. 202:n 198:n 180:n 176:z 174:| 167:n 163:r 159:1 156:r 139:) 136:2 130:n 127:( 123:, 120:) 115:n 111:r 104:z 101:( 95:) 90:1 86:r 79:z 76:( 73:= 70:) 67:z 64:( 61:f

Index

roots
critical points
polynomial function
complex variable
Blagovest Sendov
unit disk
Gauss–Lucas theorem
convex hull
sufficiently large
Tao

verification
improve this article
adding citations to reliable sources
"Sendov's conjecture"
news
newspapers
books
scholar
JSTOR
Learn how and when to remove this message
Blagovest Sendov
Nikola Obreshkov
Walter Hayman
Terence Tao
arXiv
2012.04125
"Sendov's conjecture for sufficiently high degree polynomials"
The American Mathematical Monthly
Journal of Mathematical Analysis and Applications

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

↑