Combinatorial structures to modeling simple games and applications

We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures (from the viewpoint of structures or graphs). Second, we formally define molecules as combinations of atoms. It let us to modeling molecules as combinatorial structures (from the viewpoint of combinations). It is open to generate such combinatorial structures using some specific techniques as genetic algorithms, (meta-)heuristics algorithms and parallel programming, among others.Peer ReviewedPostprint (published version

Combinatorial structures to construct simple games and molecules

We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures (from the viewpoint of structures or graphs). Second, we formally define molecules as combinations of atoms. It let us to modeling molecules as combinatorial structures (from the viewpoint of combinations). It is open to generate such combinatorial structures using some specific techniques as genetic algorithms, (meta-) heuristics algorithms and parallel programming, among others.Peer ReviewedPostprint (published version

A family of classes in nested chain abacus and related generating functions

Abacus model has been employed widely to represent partitions for any positive integer. However, no study has been carried out to develop connected beads of abacus in graphical representation for discrete objects. To resolve this connectedness problem this study is oriented in characterising n - connected objects knows as n connected ominoes, which then generate nested chain abacus. Furthermore, the theoretical conceptual properties for the nested chain abacus are being formulated. Along the construction, three different types of transformation are being created that are essential in building a family of classes. To enhance further, based on theses classes, generating functions are also being formulated by employing enumeration of combinatorial objects (ECO). In ECO method, each object is obtained from smaller object by making some local expansions. These local expansions are described in a simple way by a succession rule which can be translated into a function equation for the generating function. In summary, this stud has succeeded in producing novel graphical representation of nested chain abacus, which can be applied in tiling finite grid

Random generation of RNA secondary structures according to native distributions

Nebel M, Scheid A, Weinberg F. Random generation of RNA secondary structures according to native distributions. Algorithms for Molecular Biology. 2011;6(1): 24