A note on the growth of topological Sidon sets

We give an estimate for the number of elements in the intersection of topological Sidon sets inR ⁿ with compact convex subsets and deduce a necessary and sufficient conditions for an orbit of a linear transformation ofR ⁿ to be a topological Sidon set.     

Pure adaptive search in global optimization

Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.This work was supported in part by NATO grant 0119/89.     

Fixed Point Theorems on Product Topological Spaces and Applications

A new collectively fixed point theorem for a family of set-valued mappings defined on product spaces of non-compact topological spaces without linear structure is proved and some special cases are also discussed. As applications, some non-empty intersection theorems of sets with convex sections and equilibrium existence theorem of abstract economies are obtained under much weaker assumptions. Our results includes a number of known results as many special cases.     

Synthesis, morphology and random laser action of ZnO nanostructures

Three-dimensional (3-D) ZnO random-wall nanostructures and one-dimensional (1-D) ZnO nanorods were prepared on silicon substrates by a simple solid-vapour phase thermal sublimation technique. Optical pumped random lasing has been observed in the ZnO random-wall arrays with a threshold intensity of 0.38 MW/cm² in the emission wavelength from 380 to 395 nm. The optical gain was attributed to the closed-loop scattering and light amplification of the ZnO random-wall. The experimental result suggests that the morphology of nanostructure is the key factor to effect random lasing.     

About the Notion of Semiring of Sets

We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved.     

Propagator matrices as matrices of power''s series. II. It''s relationship with HF''s stability problem and alternative solutions

Some non-singlet quasi-instabilities (QIs) cases that arise in the calculation of NMR-J parameters are analyzed within response theory. The relationship between ‘very close to zero’ eigenvalues of the principal propagator and the rate of convergency for specific coupling pathways is shown by a power series implemented to calculate the principal propagator matrix. A natural criterion for the analysis of the stability problem emerges from that series. This is more general and accurate compared with previous proposals. Its relationship with π-type molecular orbitals is given. We present an alternative scheme to minimize the effects of non-singlet QIs in such a way that the NMR-J parameters become close to the best theoretical calculations for H₂CX (X=CH₂, NH and O).     

Contractibility of Efficient Frontier of Simply Shaded Sets

In finite dimensional Euclidean space, we prove the contractibility of the efficient frontier of simply shaded sets. This work extends the result of Peleg [7], which confirms the contractibility of the efficient frontier in the convex case.     

Noninferior Nash Strategies for Multi-Team Systems

This paper is concerned with the optimization of systems that are controlled by several teams of decision makers. The decision makers within each team cooperate for the benefit of their team. On the other hand, the teams compete among themselves in order to achieve an objective that relates to the overall performance of the system. An approach that merges concepts from team theory and game theory for dealing with such systems and a solution called the noninferior Nash strategy are introduced. This multi-team solution provides a new framework for analyzing hierarchically controlled systems so as to address complicated coordination problems among the decision makers. The properties of the noninferior Nash solution in static multi-team systems are investigated and necessary conditions for its existence are derived. Analytical expressions for the noninferior Nash strategies are derived for a class of linear-quadratic static multi-team games. In order to deal with the issue of nonuniqueness of the solution, the concept of a noninferior Nash strategy with a team leader is introduced. Several examples are presented to illustrate the results.     

New Results on the Queens_n 2 Graph Coloring Problem

For the Queens_n ² graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14.     

Iterative Schemes for Nonconvex Variational Inequalities

In this paper, we suggest and analyze some iterative methods for solving nonconvex variational inequalities using the auxiliary principle technique, the convergence of which requires either only pseudomonotonicity or partially relaxed strong monotonicity. Our proofs of convergence are very simple. As special cases, we obtain earlier results for solving general variational inequalities involving convex sets.