stereoisograms of octahedral complexes are classified into five types (type i--typev) under the action of the corresponding rs-stereoisomeric group. their enumeration is accomplished in a type-itemized fashion, where fujita's proligand method developed originally for combinatorial enumeration under point groups (s. fujita, theor. chem. acc., 113, 73--79 (2005)) is extended to meet the requireme...

a new medium, termed ecol was developed for the detection and enumeration of e. coli. the selective properties of ecol medium for the detection of e.coli from mixed culture in wastewater was tested and compared with conventional coliform media at 37°c and 44°c. results clearly showed that ecol medium was enable to direct confirmation of e.coli to be carried out by the indole reaction. the resul...

In this paper, we enumerate enumeration problems and algorithms. Other useful catalogues for enumeration algorithms are provided by Komei Fukuda and Yasuko Matsui. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.

Fischer provided a new type of binomial determinant for the number alternating sign matrices involving third root unity. In this paper we prove that her formula, when replacing unity by an indeterminate q, actually gives (q?1+2+q)-enumeration matrices. By evaluating generalisation are able to reprove conjecture Mills, Robbins and Rumsey stating Q-enumeration is product two polynomials in Q. Fur...

‎there is much interest in finding short presentations for the finite‎ ‎simple groups‎. ‎indeed it has been suggested that all these groups are‎ ‎efficient in a technical sense‎. ‎in previous papers we produced nice‎ ‎efficient presentations for all except one of the simple groups with‎ ‎order less than one million‎. ‎here we show that all simple groups with‎ ‎order between $1$ million and $5$ ...

An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices. The complexity of our algorithm is linear in the number of vertices of the projected polytope and we show empirically that the performance is significantly be...