A minimax problem about unit vectors in the plane
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, SH (Kim, SH) | - |
dc.date.accessioned | 2022-04-19T12:22:22Z | - |
dc.date.available | 2022-04-19T12:22:22Z | - |
dc.date.issued | 2002-04 | - |
dc.identifier.issn | 1331-4343 | - |
dc.identifier.uri | https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/149358 | - |
dc.description.abstract | For n greater than or equal to 2, we obtain the extremal values of the minimax problem for exponential sums mu(n) := min max(\x\=1){\Sigma(k=0)(n-1)x(k)\, \Sigma(k=0)(n-1)x(kn)\}. Moreover, we show that the polynomial with coefficients 0 and 1 derived from mu(n) does not have zeros on the unit circle. | - |
dc.format.extent | 9 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | ELEMENT | - |
dc.title | A minimax problem about unit vectors in the plane | - |
dc.type | Article | - |
dc.publisher.location | 크로아티아 | - |
dc.identifier.doi | 10.7153/mia-05-34 | - |
dc.identifier.scopusid | 2-s2.0-0036000448 | - |
dc.identifier.wosid | 000175630800017 | - |
dc.identifier.bibliographicCitation | MATHEMATICAL INEQUALITIES APPLICATIONS, v.5, no.2, pp 305 - 313 | - |
dc.citation.title | MATHEMATICAL INEQUALITIES APPLICATIONS | - |
dc.citation.volume | 5 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 305 | - |
dc.citation.endPage | 313 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.identifier.url | http://mia.ele-math.com/05-34/A-minimax-problem-about-unit-vectors-in-the-plane | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Sookmyung Women's University. Cheongpa-ro 47-gil 100 (Cheongpa-dong 2ga), Yongsan-gu, Seoul, 04310, Korea02-710-9127
Copyright©Sookmyung Women's University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.