On testing the divisibility of lacunary polynomials by cyclotomic polynomials

An algorithm is described that determines whether a given polynomial with integer coefficients has a cyclotomic factor. The algorithm is intended to be used for sparse polynomials given as a sequence of coefficient-exponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time.

     

Standardization of Methods for Characterizing the Surface Geometry of Solids

Since a comprehensive survey published in 1999 [1] much work was done in standardizing measuring methods to characterize the surface geometry of dispersed and/or porous solids and to certify reference materials. The present paper is an extension of a short communication [2]. It gives a survey on existing standards and reports on new drafts and proposals.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

The representation dimension of domestic weakly symmetric algebras

Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically closed fields having simply connected Galois coverings.     

Neocompact Sets and the Fixed Point Property

We use a newly introduced concept of neocompactness to study problems from metric fixed point theory. In particular, we give a sufficient condition for a superreflexive Banach space X to have the fixed point property and obtain shorter proofs of some well-known results in that theory.     

Deactivation reactions in the modeled 2,2,6,6‐tetramethyl‐1‐piperidinyloxy‐mediated free‐radical polymerization of styrene: A comparative study with the 2,2,6,6‐tetramethyl‐1‐piperidinyloxy/acrylonitrile system

The competitiveness of the combination and disproportionation reactions between a 1‐phenylpropyl radical, standing for a growing polystyryl macroradical, and a 2,2,6,6‐tetramethyl‐1‐piperidinyloxy (TEMPO) radical in the nitroxide‐mediated free‐radical polymerization of styrene was quantitatively evaluated by the study of the transition geometry and the potential energy profiles for the competing reactions with the use of quantum‐mechanical calculations at the density functional theory (DFT) UB3‐LYP/6‐311+G(3df, 2p)//(unrestricted) Austin Model 1 level of theory. The search for transition geometries resulted in six and two transition structures for the radical combination and disproportionation reactions, respectively. The former transition structures, mainly differing in the out‐of‐plane angle of the N? O bond in the transition structure TEMPO molecule, were correlated with the activation energy, which was determined to be in the range of 8.4–19.4 kcal mol^?1 from a single‐point calculation at the DFT UB3‐LYP/6‐311+G(3df, 2p)//unrestricted Austin Model 1 level. The calculated activation energy for the disproportionation reaction was less favorable by a value of more than 30 kcal mol^?1 in comparison with that for the combination reaction. The approximate barrier difference for the TEMPO addition and disproportionation reaction was slightly smaller for the styrene polymerization system than for the acrylonitrile polymerization system, thus indicating that a β‐proton abstraction through a TEMPO radical from the polymer backbone could diminish control over the radical polymerization of styrene with the nitroxide even more than in the latter system. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 232–241, 2007     

On invariability of self-injective algebras of tilted type under stable equivalences

We prove that a large class of self-injective algebras of tilted type is invariant under stable equivalences of module categories.

     

Properties of Ergodic Projection for Quantum Dynamical Semigroups

We study properties of ergodic projection forquantum dynamical semigroups on W *-algebras. Inparticular, we describe the normal and singular parts ofthis projection, characterize normal invariantfunctionals, and derive some conclusions for ergodicsemigroups.