On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types

From MaRDI portal
Publication:2805472

DOI10.3233/FI-2015-1238zbMATH Open1335.05171OpenAlexW1010616232MaRDI QIDQ2805472FDOQ2805472


Authors: Marcin Gąsiorek, Katarzyna Zając Edit this on Wikidata


Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1238




Recommendations





Cited In (16)





This page was built for publication: On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805472)