Serial and Unserial Combinatorial Families

Simple item page
dc.creatorMelo, Glaucio G. M.
dc.creatorLima, Emerson A. Oliveira
dc.date2005-03-16
dc.date.accessioned2026-07-07T05:18:02Z
dc.date.available2026-07-07T05:18:02Z
dc.descriptionThis article presents the \emph{Serial and Unserial Methods} (SUM). The algorithms are strongly related to the first part of a classical reference in combinatorics, the \emph{Combinatorial algorithms for computers and calculators}, from Albert Nijenhuis and Herbert Wilf. The \emph{Serial Method} proposal is to obtain the output of a specific kind of combinatorial family from its position on the list of all combinatorial possibilities. The \emph{Unserial Method} is the inverted step of Serial Method, getting the serial number from the combinatorial family given as input. The \emph{serial number} is the position of the combinatorial family on the list.
dc.descriptionArticle submitted to J. of Discrete Algorithms
dc.identifierhttps://arxiv.org/abs/math/0503335
dc.identifierhttp://arxiv.org/abs/math/0503335
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74519
dc.subjectCombinatorics
dc.subject68Rxx
dc.titleSerial and Unserial Combinatorial Families
dc.typetext

Files

Collections

arXiv