Separable subgroups of mapping class groups

We investigate separability questions for the mapping class group of a surface. While this group is not subgroup separable in general, we prove a large family of interesting subgroups are separable. This includes many classically studied subgroups such as solvable subgroups, Heegaard and Handlebody groups, geometric subgroups, and all the terms in the Johnson filtration.     

Memory and a priori best strategy in complex adaptive systems

We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004     

A convenient synthesis of sulfonylureas from carboxylic acids and sulfonamides via an in situ Curtius rearrangement

A one-pot reaction of carboxylic acids with sulfonamides to afford sulfonylureas is described.     

On the torsion of Jacobians of principal modular curves of level 3<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We demonstrate that the 3-power torsion points of the Jacobians of the principal modular curves X(3ⁿ) are fixed by the kernel of the canonical outer Galois representation of the pro-3 fundamental group of the projective line minus three points. The proof proceeds by demonstrating the curves in question satisfy a two-part criterion given by Anderson and Ihara. Two proofs of the second part of the criterion are provided; the first relies on a theorem of Shimura, while the second uses the moduli interpretation. Received: 30 September 2005     

A C-symplectic free -manifold with contractible orbits and

An interesting question in symplectic geometry concerns whether or not a closed symplectic manifold can have a free symplectic circle action with orbits contractible in the manifold. Here we present a c-symplectic example, thus showing that the problem is truly geometric as opposed to topological. Furthermore, we see that our example is the only known example of a c-symplectic manifold having non-trivial fundamental group and Lusternik-Schnirelmann category precisely half its dimension.

     

The influence of the liquid crystalline core geometry on the mesogenicity of novel chiral 2-(4-substituted-phenoxy)propanonitriles

The synthesis and characterization of seven novel (R)-2-(4-substituted-phenoxy)propanonitriles are described. The propanonitriles were prepared to evaluate their potential use as thermochromics and ferroelectric dopants, as well as to determine their twist sense properties. The materials exhibit smectic and chiral nematic phases of high thermal stability; the mesogenic behaviour of the nitriles is directly related to the type of two-ring core unit employed. The effects of the different molecular geometries and polarizabilities of the liquid crystalline cores on mesophase stability are discussed, particularly in relation to other members of this series. The chiral nematic phase of the propanonitriles is assigned as having a left-handed twist sense from contact preparation studies, and this is in agreement with rules relating absolute configuration and molecular structure to helical twist sense.     

Elevation of the glass transition temperature in flexible‐chain semicrystalline polymers

In the idealized two‐phase model of a semicrystalline polymer, the amorphous intercrystalline layers are considered to have the same properties as the fully‐amorphous polymer. In reality, these thin intercrystalline layers can be substantially influenced by the presence of the crystals, as individual polymer molecules traverse both crystalline and amorphous phases. In polymers with rigid backbone units, such as poly(etheretherketone), PEEK, previous work has shown this coupling to be particularly severe; the glass transition temperature (T_g) can be elevated by tens of degrees celsius, with the magnitude of the elevation correlating directly with the thinness of the amorphous layer. However, this connection has not been explored for flexible‐chain polymers, such as those formed from vinyl‐type monomers. Here, we examine T_g in both isotactic polystyrene (iPS) and syndiotactic polystyrene (sPS), crystallized under conditions that produce a range of amorphous layer thicknesses. T_g is indeed shown to be elevated relative to fully‐amorphous iPS and sPS, by an amount that correlates with the thinness of the amorphous layer; the magnitude of the effect is severalfold less than that in PEEK, consistent with the minimum lengths of polymer chain required to make a fold in the different cases. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 1198–1204, 2007     

The Ulam number of infinite graphs

The following is a conjecture of Ulam: In any partition of the integer lattice on the plane into uniformly bounded sets, there exists a set that is adjacent to at least six other sets. Two sets are adjacent if each contain a vertex of the same unit square. This problem is generalized as follows. Given any uniformly bounded partitionP of the vertex set of an infinite graphG with finite maximum degree, letP (G) denote the graph obtained by letting each set of the partition be a vertex ofP (G) where two vertices ofP (G) are adjacent if and only if the corresponding sets have an edge between them. The Ulam number ofG is defined as the minimum of the maximum degree ofP (G) where the minimum is taken over all uniformly bounded partitionsP. We have characterized the graphs with Ulam number 0, 1, and 2. Restricting the partitions of the vertex set to connected subsets, we obtain the connected Ulam number ofG. We have evaluated the connected Ulam numbers for several infinite graphs. For instance we have shown that the connected Ulam number is 4 ifG is an infinite grid graph. We have settled the Ulam conjecture for the connected case by proving that the connected Ulam number is 6 for an infinite triangular grid graph. The general Ulam conjecture is equivalent to proving that the Ulam number of the infinite triangular grid graph equals 6. We also describe some interesting geometric consequences of the Ulam number, mainly concerning good drawings of infinite graphs.