On convexity of polynomial paths and generalized majorizations

DC Field	Value	Language
dc.contributor.author	Dodig, Marija	en
dc.contributor.author	Stošić, Marko	en
dc.date.accessioned	2020-04-27T10:33:25Z	-
dc.date.available	2020-04-27T10:33:25Z	-
dc.date.issued	2010-08-20	en
dc.identifier.issn	1077-8926	-
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/660	-
dc.description.abstract	In this paper we give some useful combinatorial properties of polynomial paths. We also introduce generalized majorization between three sequences of integers and explore its combinatorics. In addition, we give a new, simple, purely polynomial proof of the convexity lemma of E. M. de Sá and R. C. Thompson. All these results have applications in matrix completion theory.	en
dc.relation	FCT, project ISFL-1-1431	-
dc.relation	Ministry of Science of Serbia, projects no. 144014 and 144032	-
dc.relation.ispartof	Electronic Journal of Combinatorics	en
dc.title	On convexity of polynomial paths and generalized majorizations	en
dc.type	Article	en
dc.identifier.doi	10.37236/333	-
dc.identifier.scopus	2-s2.0-77955632596	en
dc.relation.firstpage	1	en
dc.relation.lastpage	16	en
dc.relation.issue	1	en
dc.relation.volume	17	en
dc.description.rank	M22	-
item.cerifentitytype	Publications	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
crisitem.author.orcid	0000-0001-8209-6920	-
crisitem.author.orcid	0000-0002-4464-396X	-

22

checked on Dec 20, 2024

18

checked on Dec 22, 2024

Check