DC FieldValueLanguage
dc.contributor.authorVrećica, Sinišaen
dc.contributor.authorŽivaljević, Radeen
dc.date.accessioned2020-04-12T18:03:58Z-
dc.date.available2020-04-12T18:03:58Z-
dc.date.issued2009-02-01en
dc.identifier.issn0195-6698en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/295-
dc.description.abstractChessboard complexes and their relatives have been an important recurring theme of topological combinatorics. Closely related "cycle-free chessboard complexes" have been recently introduced by Ault and Fiedorowicz in [S. Ault, Z. Fiedorowicz, Symmetric homology of algebras. arXiv:0708.1575v54 [math.AT] 5 Nov 2007; Z. Fiedorowicz, Question about a simplicial complex, Algebraic Topology Discussion List (maintained by Don Davis) http://www.lehigh.edu/~dmd1/zf93] as a tool for computing symmetric analogues of the cyclic homology of algebras. We study connectivity properties of these complexes and prove a result that confirms a strengthened conjecture from [S. Ault, Z. Fiedorowicz, Symmetric homology of algebras. arXiv:0708.1575v54 [math.AT] 5 Nov 2007].en
dc.publisherElsevier-
dc.relationGrants 144026 and 144014 of the Ministry for Science of Serbia-
dc.relation.ispartofEuropean Journal of Combinatoricsen
dc.titleCycle-free chessboard complexes and symmetric homology of algebrasen
dc.typeArticleen
dc.identifier.doi10.1016/j.ejc.2008.03.006en
dc.identifier.scopus2-s2.0-57149111718en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage542en
dc.relation.lastpage554en
dc.relation.issue2en
dc.relation.volume30en
dc.description.rankM21-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-9801-8839-
Show simple item record

SCOPUSTM   
Citations

4
checked on Jan 29, 2023

Page view(s)

11
checked on Jan 30, 2023

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.