Monstrous Branes

 We study D-branes in the bosonic closed string theory whose automorphism group is the Bimonster group (the wreath product of the Monster simple group with ℤ₂). We give a complete classification of D-branes preserving the chiral subalgebra of Monster invariants and show that they transform in a representation of the Bimonster. Our results apply more generally to self-dual conformal field theories which admit the action of a compact Lie group on both the left- and right-moving sectors. Received: 20 February 2002 / Accepted: 17 August 2002 Published online: 19 December 2002 Communicated by R.H. Dijkgraaf     

Visions: The coming revolutions in particle physics

We study the branching ratio, CP-violating asymmetry, forward-backward asymmetry and the CP-violating asymmetry in the forward-backward asymmetry for the exclusive decay B → Kτ⁺τ⁻ in the two Higgs doublet model with tree level flavor changing neutral currents (model III). We analyse the dependencies of these quantities on the neutral Higgs boson contributions and the CP parameter sinθ in the model III. We observe that to determine the neutral Higgs boson effects, the measurements of the forward-backward asymmetry and the CP-violating asymmetry in the forward-backward asymmetry for the decay B → Kτ⁺τ⁻ are promising.     

Supersymmetry search via gauge boson fusion

We propose a novel method for the search of supersymmetry, especially for the electroweak gauginos at the large hadron collider (LHC). Gauge boson fusion technique was shown to be useful for heavy and intermediate mass Higgs bosons. In this article, we have shown that this method can also be applied to find the signals of EW gauginos in supersymmetric theories where the canonical search strategies for these particles fail.     

Machine assignment in a nonlinear multi-product flowline

A group of machines for processing a set of jobs in a manufacturing system is often located in a serial line. An efficient strategy for locating these machines such that the total travel distance or the cost of transporting the jobs is minimized is desired. In this research, the assumption of a linear line with equally spaced machine location is relaxed. This research addressed problems of locating unique machines. It is found that the machine distances possess unique properties in this type of a problem. Utilizing these properties, heuristic strategies are proposed to obtain efficient solution where optimal methods are expected to be computationally prohibitive. A lower bound for the optimum solution is also proposed. Results are encouraging.     

The Organization of Interaction Between Oil Refineries

The paper deals with the appropriate form of interaction between two refineries with different demand patterns. This problem can be formulated as finding a decentralized solution of linear programming problems linked by buying and selling activities. The complete problem is first solved for central values of product demands and costs and revenues. The structure of the basis then determines the organization of the interaction in terms of which unit sets quantities and which prices, or whether centralized decisions should be made. If, for expected values of product demand and costs, the structure of the basis is the same then the related organization of trading can be used for day-to-day transactions. For a well-known oil refinery model it is found that, for fairly large demand variations, decentralized interaction is effective, but that the structure of the basis changes easily with crude price variations, and that simulations did not converge for these variations.     

Pit your wits against young minds!

This column is a place for those bits of contagious mathematics that travel from person to person in the community, because they are so elegant, suprising, or appealing that one has an urge to pass them on. Contributions are most welcome.