A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

(Anti-)de Sitter Black Hole Entropy and Generalized Uncertainty Principle

We generalize the method that is used to study corrections to Cardy-Verlinde formula due to generalized uncertainty principle and discuss corrections to Cardy-Verlinde formula due to generalized uncertainty principle in (anti)-de Sitter space. Because in de Sitter black hole spacetime the radiation temperature of the black hole horizon is different from the one of the cosmological horizon, this spacetime is a thermodynamical non-equilibrium spacetime.     

On Quantum Team Games

Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied.     

Irregularities of distribution with respect to strips

Summary A lower bound is established for the strip discrepancy of a broad class of point distributions. The bound implies unbounded strip discrepancy for equally weighted point distributions under favorable conditions. The methods of proof use notions from integral geometry.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

Schrödinger Uncertainty Relations and Physical Features of Correlated-Coherent States

We show that the difference between the Schrödinger uncertainty relations (UR) and the Heisenberg UR is fundamental. We propose a modified version of stochastic mechanics that allows clearly demonstrating that the contributions from the anticommutator and the commutator to the Schrödinger UR are equally important. A classification of quantum states minimizing the Schrödinger UR at an arbitrary instant is proposed. We show that the correlation of the coordinate and momentum fluctuations in such correlated-coherent states (CCS) is largely determined by the contributions from not only the commutator but also the anticommutator of the corresponding operators. We demonstrate that the character of this correlation changes qualitatively in time from the antiphase correlation typical for the Heisenberg UR to the inphase correlation for which the contribution from the anticommutator is decisive. We comparatively analyze properties of a free microparticle and a quantum oscillator in CCS and show that the CCS correspond to traveling-standing de Broglie waves in both models.     

Harmonic mappings of the Sierpinski gasket to the circle

Harmonic mappings from the Sierpinski gasket to the circle are described explicitly in terms of boundary values and topological data. In particular, all such mappings minimize energy within a given homotopy class. Explicit formulas are also given for the energy of the mapping and its normal derivatives at boundary points.

     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Economic Equilibrium: Optimality and Price Decentralization

Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001