The classification of algebras of level one

In the present paper we obtain a list of algebras, up to isomorphism, such that the closure of any complex finite-dimensional algebra contains one of the algebras of the given list.     

Nonnegative realization of spectra having negative real parts

The nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary and sufficient conditions for a list of complex numbers σ to be the spectrum of a nonnegative matrix. In this paper the problem is completely solved in the case when all numbers in the given list σ except for one (the Perron eigenvalue) have real parts smaller than or equal to zero.     

A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.     

Numerical analogues of the Kodaira dimension and the Abundance Conjecture

We add further notions to Lehmann’s list of numerical analogues to the Kodaira dimension of pseudo-effective divisors on smooth complex projective varieties, and show new relations between them. Then we use these notions and relations to fill in a gap in Lehmann’s arguments, thus proving that most of these notions are equal. Finally, we show that the Abundance Conjecture, as formulated in the context of the Minimal Model Program, and the Generalized Abundance Conjecture using these numerical analogues to the Kodaira dimension, are equivalent for non-uniruled complex projective varieties.     

Spectral Sequences on Combinatorial Simplicial Complexes

The goal of this paper is twofold. First, we give an elementary introduction to the usage of spectral sequences in the combinatorial setting. Second we list a number of applications.In the first group of applications the simplicial complex is the nerve of a poset; we consider general posets and lattices, as well as partition-type posets. Our last application is of a different nature: the -quotient of the complex of directed forests is a simplicial complex whose cell structure is defined combinatorially.     

Almost complex and complex structures on real projective Stiefel manifolds

We give a complete list of real projective Stiefel manifolds which admit almost complex structures and show that many of them are in fact complex manifolds. The first named author was supported in part by Grants 1/1486/94 and 2/1225/96 of VEGA (Slovakia) during the preparation of this work.     

Invariant complex structures on four-dimensional solvable real lie groups

In this paper, invariant complex structures on four-dimensional, solvable, simply-connected real Lie groups are classified where the dimension of the commutator is less than three. The resulting complex surfaces corresponding to these structures are also determined. The classification problem is reduced to determining certain complex “structure” subalgebras of the complexifications of the four-dimensional, solvable real Lie algebras. Most of the eleven types of non-abelian solvable real Lie algebras do have complex structure subalgebras; three do not. Only three types of algebras have solvable complex structure subalgebras, and only one possesses both abelian and solvable complex structure subalgebras. Each of the possible homogeneous surfaces is represented in the list of resulting manifolds.     

Explicit weight two motivic cohomology complexes and algebraicK-theory

Beilinsonet al.'s motivic cohomology complex is related to a motivic complex (considered earlier by Lichtenbaum) formed using groups related to the scissors congruence groups. This involves an algebraic study of configurations of lines in projective spaces. One thereby obtains a more precise relationship between the cohomology of Beilinson's complex and lower dimensionalK-groups. Most of the proofs omitted in Beilinsonet al. are supplied here. There is also a list of certain torsional elements of the thirdK-group for fields between the rationals and the real cyclotomics.     

Symmetric <Emphasis Type="Italic">X</Emphasis><Subscript>9</Subscript> singularities and complex affine reflection groups

We establish a natural correspondence between the finite order automorphisms of the function singularities X ₉ and the complex crystallographic groups. A complete list of the related objects is obtained. To Vladimir Igorevich on the occasion of his 70th birthday     

Computational Complexity in Algebraic Systems

Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems.     

Picard-Zahlen komplexer Tori

We give explicit equations for the calculation of Chern classes of holomorphic line bundles on a complex torus X. As easy applications we deduce properties of the Picard numbers ρ(X) of n-dimensional tori, when the complex structure changes. The tori with ρ(X)≥k form a countable union of analytic subsets in a moduli space M; furthermore the set of tori with ρ(X)=k is empty or dense in M. For n-dimensional tori one has O≤ρ(X)≤n², but for n≥3 not all numbers 0≤k≤n² occur as Picard numbers. We conclude our considerations with a list of examples and with some remarks about this gap phenomenon in the distribution of Picard numbers of complex tori.     

On length and product of harmonic forms in Kähler geometry

Motivated by understanding the limiting case of a certain systolic inequality we study compact Riemannian manifolds having all harmonic 1-forms of constant length. We give complete characterizations as far as Kähler and hyperbolic geometries are concerned. In the second part of the paper, we give algebraic and topological obstructions to the existence of a geometrically 2-formal Kähler metric, at the level of the second cohomology group. A strong interaction with almost Kähler geometry is to be noted. In complex dimension 3, we list all the possible values of the second Betti number of a geometrically 2-formal Kähler metric.     

Nonnegative matrices with prescribed spectrum and elementary divisors

In this paper we give new sufficient conditions for the existence and construction of nonnegative matrices with prescribed elementary divisors, which drastically improve and contain some of the previous known conditions. We also show how to perturb complex eigenvalues of a nonnegative matrix while keeping its nonnegativity. These results allow us, under certain conditions, to easily decide if a given list is realizable with prescribed elementary divisors.     

Real trivectors of rank seven

Complex trivectors have been classified up to rank 8 and real trivectors to rank 6. In this paper we determine the equivalence classes of real trivectors of rank 7. The equivalence relation is that induced by the general linear group on the underlying seven dimensional vector space. We have found three extra equivalence classes not in the list already present in the complex case and show that these complete the classification.     

Design and Evaluation of Tabu Search Algorithms for Multiprocessor Scheduling

Using a simple multiprocessor scheduling problem as a vehicle, we explore the behavior of tabu search algorithms using different tabu, local search and list management strategies. We found that random blocking of the tail of the tabu list always improved performance; but that the use of frequency-based penalties to discourage frequently selected moves did not. Hash coding without conflict resolution was an effective way to represent solutions on the tabu list. We also found that the most effective length of the tabu list depended on features of the algorithm being used, but not on the size and complexity of the problem being solved. The best combination of features included random blocking of the tabu list, tasks as tabus and a greedy local search. An algorithm using these features was found to outperform a recently published algorithm solving a similar problem.     

Moduli spaces ℳ<Subscript>2,1</Subscript> and ℳ<Subscript>3,1</Subscript>

The cell structure of the spaces ℳ_2,1 and ℳ_3,1 is considered. These are the spaces of complex curves of genus 2 and 3 with one marked point. For the space ℳ_2,1, nine cells of the highest dimension 8 are described and their adjacency is studied. For the space ℳ_3,1, a list of all 1726 cells of the highest dimension 14 (with orientation) is obtained. The list of adjacent couples of cells is also obtained. These lists can be found on the web.     

Complete intersections with metrics of positive scalar curvature

We give a complete list of complex projective complete intersections admitting Riemannian metrics of positive scalar curvature. To cite this article: F. Fang, P. Shao, C. R. Acad. Sci. Paris, Ser. I 347 (2009).     

Quadratic centers defining elliptic surfaces

Let X be a quadratic vector field with a center whose generic orbits are algebraic curves of genus one. To each X we associate an elliptic surface (a smooth complex compact surface which is a genus one fibration). We give the list of all such vector fields and determine the corresponding elliptic surfaces.     

Real plane algebraic curves

We study real algebraic plane curves, at an elementary level, using as little algebra as possible. Both cases, affine and projective, are addressed. A real curve is infinite, finite or empty according to the fact that a minimal polynomial for the curve is indefinite, semi-definite nondefinite or definite. We present a discussion about isolated points. By means of the P operator, these points can be easily identified for curves defined by minimal polynomials of order bigger than one. We also discuss the conditions that a curve must satisfy in order to have a minimal polynomial. Finally, we list the most relevant topological properties of affine and projective, complex and real plane algebraic curves.