We study and classify those tame irreducible elliptic quasi-simple Lie algebras which are simply laced and of rank l 3. The first step is to identify the core of such an algebra up to central isogeny by identifying the coordinates. When the type is D or E the coordinates are Laurent polynomials in & variables, while for type A the coordinates can be any quantum torus in & variables. The next step is to study the universal central extension as well as the derivation algebra of the core. These are related to the first Connes cyclic homology group of the coordinates. The final step is to use this information to give constructions of Lie algebras which we then prove yield representatives of all isomorphism classes of the above types of algebras.
A continuous quadratic programming formulation is given for min-cut graph partitioning problems. In these problems, we partition the vertices of a graph into a collection of disjoint sets satisfying specified size constraints, while minimizing the sum of weights of edges connecting vertices in different sets. An optimal solution is related to an eigenvector (Fiedler vector) corresponding to the second smallest eigenvalue of the graph's Laplacian. Necessary and sufficient conditions characterizing local minima of the quadratic program are given. The effect of diagonal perturbations on the number of local minimizers is investigated using a test problem from the literature.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.