Cohomological properties of the quantum shuffle product and application to the construction of quasi-Hopf algebras

For a commutative algebra the shuffle product is a morphism of complexes. We generalize this result to the quantum shuffle product, associated to a class of non-commutative algebras (for example all the Hopf algebras). As a first application we show that the Hochschild-Serre identity is the dual statement of our result. In particular, we extend this identity to Hopf algebras. Secondly, we clarify the construction of a class of quasi-Hopf algebras.     

A posteriori error estimators for the Stokes equations

Summary We present two a posteriori error estimators for the mini-element discretization of the Stokes equations. One is based on a suitable evaluation of the residual of the finite element solution. The other one is based on the solution of suitable local Stokes problems involving the residual of the finite element solution. Both estimators are globally upper and locally lower bounds for the error of the finite element discretization. Numerical examples show their efficiency both in estimating the error and in controlling an automatic, self-adaptive mesh-refinement process. The methods presented here can easily be generalized to the Navier-Stokes equations and to other discretization schemes.This work was accomplished at the Universität Heidelberg with the support of the Deutsche Forschungsgemeinschaft     

Multiderivations of Coxeter arrangements

Let V be an ℓ-dimensional Euclidean space. Let G⊂O(V) be a finite irreducible orthogonal reflection group. Let ? be the corresponding Coxeter arrangement. Let S be the algebra of polynomial functions on V. For H∈? choose α _H ∈V ^* such that H=ker(α _H ). For each nonnegative integer m, define the derivation module D ^(m) (?)={θ∈Der _S |θ(α _H )∈Sα ^m _H }. The module is known to be a free S-module of rank ℓ by K. Saito (1975) for m=1 and L. Solomon-H. Terao (1998) for m=2. The main result of this paper is that this is the case for all m. Moreover we explicitly construct a basis for D ^(m) (?). Their degrees are all equal to mh/2 (when m is even) or are equal to ((m−1)h/2)+m _i (1≤i≤ℓ) (when m is odd). Here m ₁≤···≤m _ℓ are the exponents of G and h=m _ℓ+1 is the Coxeter number. The construction heavily uses the primitive derivation D which plays a central role in the theory of flat generators by K. Saito (or equivalently the Frobenius manifold structure for the orbit space of G). Some new results concerning the primitive derivation D are obtained in the course of proof of the main result. Oblatum 27-XI-2001 & 4-XII-2001?Published online: 18 February 2002     

Characterization of supercommuting matrices

For a given n-by-n matrix A, we consider the set of matrices which commute with A and all of whose principal submatrices commute with the corresponding principal submatrices of A. The properties of this set are examined, with particular attention to its dimension.     

Deciding Frattini is NP-complete

We show that it is a NP-complete problem to decide whether a finite poset arises as the (Birkhoff) dual of the Frattini sublattice of some finite distributive lattice.This work was supported in part by Swiss NSF grant 20-32644.91.     

Graphical operations on projective spaces

Motivated by the work of Crapo and Rota [6] on the lifting of a projective complex, we introduce a class of invariant operations associated to integral-weighted graphs, which we call graphical operations. Such operations generalize the sixth harmonic of a quadranguler set on a projective line. We determine the expansion of the graphical operations in terms of multi-linear bracket polynomials in a Grassmann-Cayley algebra. Reducibility and compositions of such invariant operations are also investigated with a number of examples.Supported by Courant Instructorship, New York University.     

Sewings of crumpled cubes revisited

This paper sets forth three mismatch properties, strictly ordered in strength, about sewings of crumpled n-cubes. The strongest is a sufficient but not a necessary condition for a sewing to yield Sn, and the weakest, a necessary but not sufficient one. We show that when both crumpled cubes satisfies the Disjoint Disks Property, then the weakest property implies the sewing yields Sn, and we also show that the intermediate property leads to the same conclusion when just one of the crumpled cubes possesses the Disjoint Disks Property. In addition, we develop examples that confirm sharpness of the relevant Disjoint Disks conditions.     

Matrices that preserve vectors of fixed sign variation

For each k≥ 0, those nonsingular matrices that transform the set of totally nonzero vectors with k sign variations into (respectively, onto) itself are studied. Necessary and sufficient conditions are provided. The cases k=0,1,2,n-3,n-2,n-1 are completely characterized.     

The homotopy categorical crossed module of a CW-complex

Crossed modules have longstanding uses in homotopy theory and the cohomology of groups. The corresponding notion in the setting of categorical groups, that is, categorical crosses modules, allowed the development of a low-dimensional categorical group cohomology. Now, its relevance is also shown here to homotopy types by associating, to any pointed CW-complex (X,∗), a categorical crossed module that algebraically represents the homotopy 3-type of X.     

Stabilization of linear systems by rotation

We introduce the concept of “stabilization by rotation” for deterministic linear systems with negative trace. This concept encompasses the well-known concept of “vibrational stabilization” introduced by Meerkov in the 1970s and is a deterministic version of ‘stabilization by noise’ for stochastic systems as introduced by Arnold and coworkers in the 1980s. It is shown that a linear system with negative trace can be stabilized by adding a skew-symmetric matrix, multiplied by a suitable scalar so-called “gain function” (possibly a constant) which is sufficiently large. To overcome the problem of what is “sufficiently large”, we also present a servo mechanism which tunes the gain function by learning from the trajectory until finally the trajectory tends to zero. This approach allows to show that one of Meerkov's assumptions for vibrational stabilization is superfluous. Moreover, while Meerkov as well as Arnold and coworkers assume that a stabilizing periodic function or the noise has sufficiently large frequency and amplitude, we also provide a servo mechanism to determine this function dynamically in a deterministic setup.