Pedro Bello

Efficient Counting of the Number of Independent Sets on Polygonal Trees

We present a method to compute the number of independent sets for two basic graph patterns: simple cycles and trees. We show how to extend this initial method for processing efficiently more complex graph topologies.

Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT

To count models for two conjunctive forms (#2SAT problem) is a classic #P problem. We determine different structural patterns on the underlying graph of a 2-CF F allowing the efficient computation of #2SAT(F ). We show that if the constrained graph of a formula is acyclic or the cycles on the graph can be arranged as independent and embedded cycles, then the number of models of F can be counted efficiently.To count models for two conjunctive forms (#2SAT problem) is a classic #P problem. We determine different structural patterns on the underlying graph of a 2-CF F allowing the efficient computation of #2SAT(F).

High Mountain Cosmic Ray Observatory

In this paper, we present a progress report of the Pico de Orizaba’s cosmic ray observatory. The scientific rationale, and a brief description of the present status of each component are discussed.