Locally extended affine Lie algebras were introduced by Morita and Yoshii in [J. Algebra 301(1) (2006), 59-81] as a natural generalization of extended affine Lie algebras. After that, various generalizations of these Lie algebras have been investigated by others. It is known that a locally extended affine Lie algebra can be recovered from its centerless core, i.e., the ideal generated by weight...

‎we investigate graham higman's paper enumerating $p$-groups‎, ‎ii‎, ‎in which he formulated his famous porc conjecture‎. ‎we are able to simplify some of the theory‎. ‎in particular‎, ‎higman's paper contains five pages of homological algebra which he uses in‎ ‎his proof that the number of solutions in a finite field to a finite set of‎ ‎monomial equations is porc‎. ‎it turns out tha...

The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of attention in literature; in particular, the way the graph-theoretical structure of the variables and constraints influences the complexity of the problem is intensiv...

This report is a comprehensive review of the field of molecular enumeration from early isomer counting theories to evolutionary algorithms that design molecules in silico. The core of the review is a detail account on how molecules are counted, enumerated, and sampled. The practical applications of molecular enumeration are also reviewed for chemical information, structure elucidation, molecula...

We are given a set S of n points in the Euclidean plane. assume that is general position. A simple polygon P an empty if each vertex point and every either outside or P. In this paper, we consider problem enumerating all polygons set. To design efficient enumeration algorithm, use reverse search by Avis Fukuda with child lists. propose algorithm enumerates O(n2 |ϵ(S) |)-time, where ϵ(S) S. More...