A non-Abelian analogue of Whitney’s 2-isomorphism theorem

We give a non-Abelian analogue of Whitney’s 2-isomorphism theorem for graphs. Whitney’s theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an Abelian object, we consider a mildly non-Abelian object, the 2-truncation of the group algebra of the fundamental group of the graph considered as a subalgebra of the 2-truncation of the group algebra of the free group on the edges. The analogue of Whitney’s theorem is that this is a complete invariant of 2-edge connected graphs: let G, G′ be 2-edge connected finite graphs; if there is a bijective correspondence between the edges of G and G′ that induces equality on the 2-truncations of the group algebras of the fundamental groups, then G and G′ are isomorphic.     

Computing the extended centroid of abelian—group graded rings

We compute the extended centroid of a prime ring graded by an abelian group.     

Deformations of permutation representations of Coxeter groups

The permutation representation afforded by a Coxeter group W acting on the cosets of a standard parabolic subgroup inherits many nice properties from W such as a shellable Bruhat order and a flat deformation over ?[q] to a representation of the corresponding Hecke algebra. In this paper we define a larger class of “quasiparabolic” subgroups (more generally, quasiparabolic W-sets), and show that they also inherit these properties. Our motivating example is the action of the symmetric group on fixed-point-free involutions by conjugation.     

Testing Monotonicity

at arguments of its choice, the test always accepts a monotone f, and rejects f with high probability if it is ε-far from being monotone (i.e., every monotone function differs from f on more than an ε fraction of the domain). The complexity of the test is O(n/ε). The analysis of our algorithm relates two natural combinatorial quantities that can be measured with respect to a Boolean function; one being global to the function and the other being local to it. A key ingredient is the use of a switching (or sorting) operator on functions. Received March 29, 1999     

On Preservation Theorems for Two-Variable Logic

We show that the existential preservation theorem fails for two-variable first-order logic FO². It is known that for all k ≥ 3, FO^k does not have an existential preservation theorem, so this settles the last open case, answering a question of Andreka, van Benthem, and Németi. In contrast, we prove that the homomorphism preservation theorem holds for FO².     

Birkhoff normal form for splitting methods applied to semilinear Hamiltonian PDEs. Part I. Finite-dimensional discretization

We consider discretized Hamiltonian PDEs associated with a Hamiltonian function that can be split into a linear unbounded operator and a regular nonlinear part. We consider splitting methods associated with this decomposition. Using a finite-dimensional Birkhoff normal form result, we show the almost preservation of the actions of the numerical solution associated with the splitting method over arbitrary long time and for asymptotically large level of space approximation, provided the Sobolev norm of the initial data is small enough. This result holds under generic non-resonance conditions on the frequencies of the linear operator and on the step size. We apply these results to nonlinear Schrödinger equations as well as the nonlinear wave equation.