The Topology of Algebra: Combinatorics of Squaring

We study the graph each of whose edges connects an element of a given ring with the square of itself. For a finite commutative group (e.g., for the multiplicative group of coprime residue classes modulo a positive integer), we describe this graph explicitly: each of its connected components is an oriented attracting cycle equipped with identical -vertex rooted trees of special form whose roots reside on the cycle. We also compute the graphs of permutation groups on not too many elements and of the subgroups of even permutations; the connected components of these graphs are also uniformly equipped cycles.     

From a Nonlinear, Nonconvex Variational Problem to a Linear, Convex Formulation

   Abstract. We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature.     

凸度量空间中单值和集值映象的公共不动点定理

§ 1.　Introduction　　Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa…     

Induced product representations of extended Cuntz algebras

Let _H be the extended Cuntz algebra over the Hilbert space H. Since its zero grade part _H⁰ is the C^*-inductive limit of B(H^r), we look for some family of representations on an inductive limit of H^r as r. When such construction is shaped according to the structure of _H⁰, von Neumanns notion of a reference sequence of unit vectors for Hilbert infinite tensor products emerges; after a further Rieffel induction step, a class IPR[H] of representations of _H arises. For any two such representations, we describe explicitly their associated intertwiners. Any two representations in IPR[H] are either disjoint or unitarily equivalent. Actions of the group by translation on sequences of unit vectors are involved, as well as the ideals of .     

Crystal Bases for Quantum Affine Algebras and Combinatorics of Young Walls

In this paper we give a realization of crystal bases for quantumaffine algebras using some new combinatorial objects which wecall the Young walls. The Young walls consist of colored blockswith various shapes that are built on a given ground-state walland can be viewed as generalizations of Young diagrams. Therules for building Young walls and the action of Kashiwara operatorsare given explicitly in terms of combinatorics of Young walls.The crystal graph of a basic representation is characterizedas the set of all reduced proper Young walls. The characterof a basic representation can be computed easily by countingthe number of colored blocks that have been added to the ground-statewall. 2000 Mathematical Subject Classification: 17B37, 17B65,81R50, 82B23.     

Higher-Order Convex Approximations of Young Measures in Optimal Control

The general theory of approximation of (possibly generalized) Young measures is presented, and concrete cases are investigated. An adjoint-operator approach, combined with quasi-interpolation of test integrands, is systematically used. Applicability is demonstrated on an optimal control problem for an elliptic system, together with one-dimensional illustrative calculations of various options.     

THE STRUCTURE AND APPROXIMATION OF A.S. SELF-SIMILAR SET

The structure of any a.s. self-similar set K(w) generated by a class of random elements {gn,wσ} taking values in the space of contractive operators is given and the approximation of K(w) by the fixed points {Pn,wσ} of {gn,ow} is obtained. It is useful to generate the fractal in computer.     

Speeding up the FMMR perfect sampling algorithm: A case study revisited

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

Half-life of41Ca

The half-life of⁴¹Ca has been redetermined to be (1.01 ±0.10)×10⁵ yr from the specific activity of a sample of enriched calcium material and its⁴¹Ca concentration. The activity was measured with a Si(Li) detector via the 3.3-keV X rays emitted in the electron capture decay of⁴¹Ca to⁴¹K. The⁴¹Ca concentration was measured by mass spectrometry. Since our result agrees well with the two most recent half-life measurements of Mabuchi et al. (1974), (1.13±0.12)×10⁵ yr, and Klein et al. (1990), (1.03±0.07)×10⁵ yr, we recommend the weighted mean of these three measurements, t_1/2=(1.04±0.05)×10⁵ yr, as the most accurate value of the half-life of⁴¹Ca.Dedicated to Prof. Dr. P. Kienle on the occasion of his 60th birthday     

杨氏弹性模量光学系统的调节

本文介绍了在杨氏弹性模量测定的实验中，光学系统的速调整。