Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/979
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Arsenović, Miloš | en_US |
dc.contributor.author | Bakić, Radoš | en_US |
dc.date.accessioned | 2022-08-17T11:10:50Z | - |
dc.date.available | 2022-08-17T11:10:50Z | - |
dc.date.issued | 2018-01-01 | - |
dc.identifier.issn | 13101331 | en |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/979 | - |
dc.description.abstract | We are investigating the problem of finding the upper bound of the modulus of elementary symmetric polynomials ek (z1, …, zn), where variables z1, …, zn are subject to conditions z1 + · · · + zn = 0 and |zj | ≤ R for all j = 1, …, n. We give a sharp upper bound in the case k = n−1. We also give an estimate in the case k = n − 2, which is sharp for even n. These estimates are then applied to give results on location of zeros of polynomials. | en |
dc.relation.ispartof | Comptes Rendus de L'Academie Bulgare des Sciences | en |
dc.subject | Elementary symmetric polynomials | en |
dc.subject | Location of zeros | en |
dc.title | Some inequalities for elementary symmetric polynomials in the complex domain | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.7546/CRABS.2018.04.01 | - |
dc.identifier.scopus | 2-s2.0-85046811708 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85046811708 | - |
dc.contributor.affiliation | Mathematical Analysis | en_US |
dc.relation.firstpage | 447 | en |
dc.relation.lastpage | 452 | en |
dc.relation.volume | 71 | en |
dc.relation.issue | 4 | en |
item.fulltext | No Fulltext | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Mathematical Analysis | - |
crisitem.author.orcid | 0000-0002-5450-2407 | - |
Appears in Collections: | Research outputs |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.