Finite basis for analytic multiple gaps

DC Field	Value	Language
dc.contributor.author	Avilés, Antonio	en
dc.contributor.author	Todorčević, Stevo	en
dc.date.accessioned	2020-05-01T20:29:22Z	-
dc.date.available	2020-05-01T20:29:22Z	-
dc.date.issued	2015-06-27	en
dc.identifier.issn	0073-8301	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/2186	-
dc.description.abstract	An n-gap consists of n many pairwise orthogonal families of subsets of a countable set that cannot be separated. We prove that for every positive integer n there is a finite basis for the class of analytic n-gaps. The proof requires an analysis of certain combinatorial problems on the n-adic tree, and in particular a new partition theorem for trees.	en
dc.publisher	Springer Link	-
dc.relation.ispartof	Publications Mathematiques de l'Institut des Hautes Etudes Scientifiques	en
dc.title	Finite basis for analytic multiple gaps	en
dc.type	Article	en
dc.identifier.doi	10.1007/s10240-014-0063-8	en
dc.identifier.scopus	2-s2.0-84929961618	en
dc.relation.firstpage	57	en
dc.relation.lastpage	79	en
dc.relation.issue	1	en
dc.relation.volume	121	en
dc.description.rank	M21a	-
item.fulltext	No Fulltext	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
crisitem.author.orcid	0000-0003-4543-7962	-

9

checked on Apr 2, 2025

21

checked on Jan 31, 2025

Check