Proof of Dieudonne Criterion for Univalent Polynomials

  • Context: Graduate 
  • Thread starter Thread starter jem05
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on the proof of the Dieudonné Criterion for univalent polynomials, specifically stating that a polynomial of degree n is univalent in the open disk if the expression sum(k=1 --> n) a_k sin(kt)/sint z^(k-1) is non-zero in the open unit disk for 0 < t < π/2. A participant confirmed they successfully proved the criterion, although they could not locate the original proof. The conversation highlights the importance of this criterion in complex analysis and its applications in polynomial theory.

PREREQUISITES
  • Understanding of univalent functions and their properties
  • Familiarity with complex analysis concepts
  • Knowledge of polynomial theory and degree
  • Basic trigonometric identities and their applications
NEXT STEPS
  • Research the original proof of the Dieudonné Criterion in complex analysis literature
  • Explore applications of univalent polynomials in mathematical analysis
  • Study the implications of the criterion on polynomial mappings
  • Investigate related topics such as the Schwarz lemma and its connection to univalent functions
USEFUL FOR

Mathematicians, particularly those specializing in complex analysis, polynomial theory, and researchers interested in the properties of univalent functions.

jem05
Messages
54
Reaction score
0
hello,
i need a proof for the diedonne criterion on univalent polynomials.
i was wondering if anyone knows a book or reference where i can find it.
it says:
polyn. of degree n is univalent in the open disk iff sum(k=1 --> n) a_k sin(kt)/sint z^(k-1)
is not 0 in open unit disk, given 0 < t < pi/2
thank you
 
Physics news on Phys.org
hey guys,
i worked on the problem, and i proved it, it's very cute.
anyway i did not find the original proof, but this is sufficient too.
so thank you anyway, and if someone is interested, let me know i will post the solution.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 21 ·
Replies
21
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 29 ·
Replies
29
Views
5K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K