We present a method for proving q-series identities by combinatorial telescoping in the sense that one can transform a bijection or classification of combinatorial objects into a ...
Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptograp...
Abstract. Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids...
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
In a recent work, M. Covington discusses the enumeration of two different sets of alignments of two strings of symbols using elementary combinatorial techniques. He defines two fu...