对称群上Cayley图的连通性

本文研究限制性边连通度的λ′-原子．运用所得结果可以证明Cayley图C(Sn,S)是最优超-λ的．这里Sn是n次对称群,S是若干由奇置换构成的共轭类的并，另外，我们还证明了C(Sn，S)是Vosperian的．除非它是完全二部图．     

Codimension Two PL Embeddings of Spheres with Nonstandard Regular Neighborhoods

For a given polyhedron K(?)M,the notation RM(K)denotes a regular neigh- borhood of K in M.The authors study the following problem:find all pairs(m,k) such that if K is a compact k-polyhedron and M a PL m-manifold,then R_M(f(K))≌R_M(g(K))for each two homotopic PL embeddings f,g:K→M.It is proved that R_S~(k 2)(S~k)(?)S~k×D~2 for each k(?)2 and some PL sphere S~k(?)S~(k 2)(even for any PL sphere S~k(?)S~(K 2)having an isolated non-locally flat point with the singularity S~(k-1)(?) S~(k 1)such thatπ_1(S~(k 1)-S~(k-1))(?)Z).     

LENTICULAR NONCOMMUTATIVE TORI

All C*-algebras of sections of locally trivial C* -algebra bundles over ∏i=1sLki(ni) with fibres Aw Mc(C) are constructed, under the assumption that every completely irrational noncommutative torus Aw is realized as an inductive limit of circle algebras, where Lki (ni) are lens spaces. Let Lcd be a cd-homogeneous C*-algebra over whose cd-homogeneous C*-subalgebra restricted to the subspace Tr × T2 is realized as C(Tr) A1/d Mc(C), and of which no non-trivial matrix algebra can be factored out.The lenticular noncommutative torus Lpcd is defined by twisting in by a totally skew multiplier p on Tr+2 × Zm-2. It is shown that is isomorphic to if and only if the set of prime factors of cd is a subset of the set of prime factors of p, and that Lpcd is not stablyisomorphic to if the cd-homogeneous C*-subalgebra of Lpcd restricted to some subspace LkiLki (ni) is realized as the crossed product by the obvious non-trivial action of Zki on a cd/ki-homogeneous C*-algebra over S2ni+1 for ki an integer greater than     

Linear maps leaving the alternating group invariant

Let A_n be the group of n×n even permutation matrices, and let V_n be the real linear space spanned by A_n. The purpose of this note is to characterize those linear operators φ on V_n satisfying φ(A_n)=A_n. This answers a question raised by C.K. Li, B.S. Tam, N.K. Tsing [Linear Algebra Appl., to appear].     

Synthesis of dual pH/temperature‐responsive polymers with amino groups by living cationic polymerization

For the precision synthesis of primary amino functional polymers, cationic polymerization of a phthalimide‐containing vinyl ether monomer precursor, 2‐vinyloxyethyl phthalimide (PIVE), was examined using a base‐assisting initiating system. Living polymerization of PIVE in CH₂Cl₂ in the presence of 1,4‐dioxane as an added base yielded nearly monodispersed polymers (M_w/M_n < 1.1) and higher molecular weight polymers, which have never been obtained using other initiating systems. Furthermore, block copolymers with hydrophobic or hydrophilic groups could be prepared. The deprotection of the pendant phthalimide groups gave well‐defined pH‐responsive polymers with pendant primary amino groups. Dual‐stimuli–responsive block copolymers having a pH‐responsive polyamine segment and a thermosensitive segment self‐assembled in water in response to both pH and temperature. © 2010 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 48: 1207–1213, 2010     

Gauge semi-simple extension of the Poincaré group

An approach to the cosmological term problem is proposed, using the gauge semi-simple tensor extension of the D-dimensional Poincaré group as a basis.     

Where Forward-Looking and Backward-Looking Models Meet

The present paper begins by deriving an instantaneous formulation for the backward-looking (reinforcement based learning) satisfaction balance model of Gray and Tallman (1984). This model is then used to generate interactional data from four simulated agents in a network interaction experiment. Because this initial model does not generate stable interaction structures in the network experiment, it is altered step by step in the direction of a forward-looking (agent with goals) model that has been shown to generate such stable interaction structures. The purpose of the modifications are to learn what aspects of the forward-looking model are needed to evolve a stable interaction structure, and to learn how these aspects may be incorporated into a model that remains essentially reinforcement based.     

Stable Planes from Lie Groups with Planar Partitions

We describe necessary and sufficient conditions under which a topological translation structure obtained from a Lie group with planar partition can be turned into a stable plane, thereby proving a conjecture due to Stroppel.     

Approximations for interactive Markov chains in discrete and continuous time

A class of models called interactive Markov chains is studied in both discrete and continuous time. These models were introduced by Conlisk and serve as a rich class for sociological modeling, because they allow for interactions among individuals. In discrete time, it is proved that the Markovian processes converge to a deterministic process almost surely as the population size becomes infinite. More importantly, the normalized process is shown to be asymptotically normal with specified mean vector and covariance matrix. In continuous time, the chain is shown to converge weakly to a diffusion process with specified drift and scale terms. The distributional results will allow for the construction of a likelihood function from interactive Markov chain data, so these results will be important for questions of statistical inference. An example from manpower planning is given which indicates the use of this theory in constructing and evaluating control policies for certain social systems.