Matchings avoiding partial patterns and lattice paths.
The mean value of the matching polynomial is computed in the family of all labeled graphs with n vertices. We introduce the dominating polynomial of a graph whose coefficients enumerate the dominating sets for a graph and study some properties of the polynomial. The mean value of this polynomial is determined in a certain special family of bipartite digraphs.
We prove that, for any prime , there are precisely medial quasigroups of order , up to isomorphism.
is the category of spaces with filters: an object is a pair , a compact Hausdorff space and a filter of dense open subsets of . A morphism is a continuous function for which whenever . This category arises naturally from considerations in ordered algebra, e.g., Boolean algebra, lattice-ordered groups and rings, and from considerations in general topology, e.g., the theory of the absolute and other covers, locales, and frames, though we shall specifically address only one of these...