Correction to: Involutions of Type G2 over a Field of Characteristic Two

Algebras and Representation Theory - We would like to correct two errors in our paper Involutions of type G2 over a field of characteristic 2 [2].     

Sur Les Groupes D’Homotopie Des Espaces Dont La Cohomologie Modulo 2 Est Nilpotente

The main object of this note is to prove the following generalisation of a theorem of Serre. A simply connected space of finite type whose mod. 2 cohomology is nilpotent (and non-trivial) has infinitely many homotopy groups which are not of odd torsion. Incidentally we show that for every fibrationF( _→ ^ί )E ( _→ ^p )B, satisfying certain mild conditions, the following holds. If a classx in the mod. 2 cohomology ofE belongs to the kernel ofi*, then some power ofx belongs to the ideal generated by the image underp* of the mod. 2 reduced cohomology ofB.      

Ultraslow phonon-assisted collapse of tubular image states

We predict ultraslow collapse of “tubular image states” (TIS) on material surfaces. TIS are bound Rydberg-like electronic states formed at large distances (∼30 nm) from the surfaces of suspended circularly-symmetric nanowires, such as metallic C nanotubes. The states are formed in potential wells, resulting from a combination of the TIS-electron attraction to image charges in the nanotube and its centrifugal repulsion, caused by spinning around the tube. We demonstrate that TIS can collapse on the tube surface by passing their angular momentum l to circularly polarized flexural phonons excited in the tube. Our analysis shows that for highly detached TIS with l ? 6 the relaxation lifetimes are of the order of 10 ns-1 μs, while for l < 6 these lifetimes are reduced by several orders of magnitude.     

The boundary trace and generalized boundary value problem for semilinear elliptic equations with coercive absorption

In the first part of the paper we establish the existence of a boundary trace for positive solutions of the equation ?Δu + g(x, u) = 0 in a smooth domain Ω ? ?^N, for a general class of positive nonlinearities. This class includes every space independent, monotone increasing g which satisfies the Keller‐Osserman condition as well as degenerate nonlinearities g_α,q of the form g_α,q (x, u) = d(x, ?Ω)^α |u|^q?1 u, with α > ?2 and q > 1. The boundary trace is given by a positive regular Borel measure which may blow up on compact sets. In the second part we concentrate on the family of nonlinearities {g_α,q}, determine the critical value of the exponent q (for fixed α > ?2) and discuss (a) positive solutions with an isolated singularity, for subcritical nonlinearities and (b) the boundary value problem for ?Δu + g_α,q (x, u) = 0 with boundary data given by a positive regular Borel measure (possibly unbounded). We show that, in the subcritical case, the problem possesses a unique solution for every such measure. © 2003 Wiley Periodicals, Inc.     

Information recovery from black holes

We argue that if black hole entropy arises from a finite number of underlying quantum states, then any particular such state can be identified from infinity. The finite density of states implies a discrete energy spectrum, and, in general, such spectra are non-degenerate except as determined by symmetries. Therefore, knowledge of the precise energy, and of other commuting conserved charges, determines the quantum state. In a gravitating theory, all conserved charges including the energy are given by boundary terms that can be measured at infinity. Thus, within any theory of quantum gravity, no information can be lost in black holes with a finite number of states. However, identifying the state of a black hole from infinity requires measurements with Planck scale precision. Hence observers with insufficient resolution will experience information loss. First Award in the 2006 Essay Competition of the Gravity Research Foundation.     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

Nitrogen bridgehead compounds. Part 70. Studies on quinolizine derivatives. Part 4. Ultraviolet-visible spectra and chemical properties of some quinolizine derivatives and their monocyclic tautomers

Ultraviolet-visible spectra of 4-oxo 1 and 4-imino 2 quinolizines or their monocyclic tautomers 3, 4 have been studied in neutral, acidic and basic ethanolic solution as well as in dimethyl sulfoxide and chloroform. Ring B of 4-oxo and 6-unsubstituted 4-imino compounds can be cleaved by sodium ethanolate more or less easily. Ring B of 6-methyl-4-iminoquinolizines is very unstable and they are present mainly in the monocyclic form which are partly dissociated in ethanol and dimethyl sulfoxide especially in higher dilution or in the presence of sodium ethanolate. In dilute acidic ethanol or chloroform, the dissociation is suppressed and in the latter solvent and in some cases, absorption bands can be observed due to a small amount of the 4-imino-6-methylquinolizines. In acidic solution of compounds 3B=C, 3D, 4E, 4F=G having simultaneously cyano and ethoxycarbonyl groups in 1 and 3 position, not simple reprotonation occurs but irreversible changes can be observed.     

Stable Subnorms II

In this paper we continue our study of stability properties of subnorms on subsets of finite-dimensional, power-associative algebras over the real or the complex numbers.     

Inverse Pattern Matching

Let a textstringTofnsymbols from some alphabet Σ and an integerm < nbe given. A patternPof lengthmover Σ is sought such thatPminimizes (alternatively, maximizes) the total number of pairwise character mismatches generated whenPis compared with allm-character substrings ofT. Two additional variants of the problem are obtained by adding the constraint thatPbe (respectively, not be) a substring ofT. Efficient sequential algorithms are proposed in this paper for the problem and its variants.