On strongly almost trivial embeddings of graphs

We present four new classes of graphs, two of which every member has a strongly almost trivial embedding, and the other two of which every member has no strongly almost trivial embeddings. We show that the property that a graph has a strongly almost trivial embedding and the property that a graph has no strongly almost trivial embeddings are not inherited by minors. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory     

On Schnorr and computable randomness,martingales, and machines

We examine the randomness and triviality of reals using notions arising from martingales and prefix‐free machines. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the structure of groups of virtually trivial automorphisms

If G is an arbitrary group, then the group Aut_vt(G) consists, by definition, of all virtually trivial automorphisms of G, i.e. of all automorphisms that have the fixed-point subgroup of finite index in G. We investigate the structure of Aut_vt(G) and show that it possesses a certain “well-behaved” normal series which demonstrates its closeness to finitary linear groups. This is then used to prove that each simple section of Aut_vt(G) is a finitary linear group.     

On the computability-theoretic complexity of trivial, strongly minimal models

We show the existence of a trivial, strongly minimal (and thus uncountably categorical) theory for which the prime model is computable and each of the other countable models computes . This result shows that the result of Goncharov/Harizanov/Laskowski/Lempp/McCoy (2003) is best possible for trivial strongly minimal theories in terms of computable model theory. We conclude with some remarks about axiomatizability.

     

The first cohomology group of trivial extensions of special biserial algebras

Given a finite dimensional special biserial algebra A with normed basis we obtain the dimension formulae of the first Hochschild homology groups of A and the vector space Alt(DA). As a consequence, an explicit dimension formula of the first Hochschild cohomology group of trivial extension TA = A×DA in terms of the combinatorics of the quiver and relations is determined.     

Fixed point theorems in homotopically trivial spaces

We introduce a new concept of generalized Knaster–Kuratowski–Mazurkiewicz (KKM) family of sets and related to this we obtain fixed point theorems and sections results in homotopically trivial spaces.     

Truth‐table Schnorr randomness and truth‐table reducible randomness

Schnorr randomness and computable randomness are natural concepts of random sequences. However van Lambalgen’s Theorem fails for both randomnesses. In this paper we define truth‐table Schnorr randomness (defined in 6 too only by martingales) and truth‐table reducible randomness, for which we prove that van Lambalgen's Theorem holds. We also show that the classes of truth‐table Schnorr random reals relative to a high set contain reals Turing equivalent to the high set. It follows that each high Schnorr random real is half of a real for which van Lambalgen's Theorem fails. Moreover we establish the coincidence between triviality and lowness notions for truth‐table Schnorr randomness. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Generalized evaluation subgroups of product spaces relative to a factor

For any -complexes and , we show that . We use this fact to compute generalized evaluation subgroups of generalized tori relative to a sphere.

     

Lindelöf models of the reals: Solution to a problem of Sikorski

We show that it is consistent with ZFC that there is a modelM of ZF + DC such that the integers ofM areω ₁-like, the reals ofM have cardinalityω ₂, and the unit interval [0, 1] ^M is Lindelöf (i.e. every open cover has a countable subcover). This answers an old question of Sikorski.     

On small matrix subalgebras with a trivial centralizer

Given an integer n?≥?3, we investigate the minimal dimension of a subalgebra of M _n (𝕂) with a trivial centralizer. It is shown that this dimension is 5 when n is even and 4 when it is odd. In the latter case, we also determine all 4-dimensional subalgebras with a trivial centralizer.     

Bounded Hochschild cohomology of Banach algebras with a matrix-like structure

Let be a unital Banach algebra. A projection in which is equivalent to the identitity may give rise to a matrix-like structure on any two-sided ideal in . In this set-up we prove a theorem to the effect that the bounded cohomology vanishes for all . The hypotheses of this theorem involve (i) strong H-unitality of , (ii) a growth condition on diagonal matrices in , and (iii) an extension of in by an amenable Banach algebra. As a corollary we show that if is an infinite dimensional Banach space with the bounded approximation property, is an infinite dimensional -space, and is the Banach algebra of approximable operators on , then for all .

     

半交换环的一个推广研究

In this paper, a generalization of the class of semicommutative rings is investigated.A ring R is called left GWZI if for any a ∈ R, l(a) is a GW-ideal of R. We prove that a ring R is left GWZI if and only if S3(R) is left GWZI if and only if Vn(R) is left GWZI for any n ≥ 2.     

Abelian group pairs having a trivial coGalois group

Torsion-free covers are considered for objects in the category q ₂. Objects in the category q ₂ are just maps in R-Mod. For R = ℤ, we find necessary and sufficient conditions for the coGalois group G(A → B), associated to a torsion-free cover, to be trivial for an object A → B in q ₂. Our results generalize those of E. Enochs and J. Rado for abelian groups.     

Maximality properties for isometric interpolating sequences and sequences of trivial points in the spectrum of H∞

Let (x_n) be an isometric interpolating sequence or a sequence of trivial points in the spectrum of H^∞. It is shown that either every cluster point of that sequence has a maximal support set or there exists y ∈ M(H^∞+C) such that the support of x_n is contained in the support of y for infinitely many n. Similar results for Gleason parts are obtained, too. We also investigate the H^∞‐convex hulls of countable unions of support sets and show that whenever supp x ? supp y and x /∈ , then the H^∞‐convex hull of supp x does not meet . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

一类二阶非线性微分方程零解的全局渐近稳定性

本文研究二阶非线性微分方程■零解的全局渐近稳定性,其中各函数是实数上的连续函数．我们得到了零解全局渐近稳定的一些充分必要条件和充分条件．推广和改进了文献中的一些结论．     

New reals: Can live with them,can live without them

We give a self‐contained proof of the preservation theorem for proper countable support iterations known as “tools‐preservation”, “Case A” or “first preservation theorem” in the literature. We do not assume that the forcings add reals. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The Interplay Between Fairness and Randomness in a Spatial Computer Game

This article describes how children use an expressive microworld to articulate ideas about how to make a game seem fair with the use of randomness. Our aim in this study is to disentangle different flavours of fairness and to find out how children used each flavour to make sense of potentially complex behaviour. In order to achieve this, a spatial computer game was designed to enable children to examine the consequences of their attempts to make the game fair. The study investigates how 23 children, aged between 5.5 and 8 years, engaged in constructing a crucial part of a mechanism for a fair spatial lottery machine (microworld). In particular, the children tried to construct a fair game given a situation in which the key elements happened randomly. The children could select objects, determine their properties, and arrange their spatial layout in the machine. The study is based on task-based interviewing of children who were interacting with the computer game. The study shows that children have various cognitive resources for constructing a random fair environment. The spatial arrangement, the visualisation and the manipulations in the lottery machine allow us gain a view into the children’s thinking of the two central concepts, fairness and randomness. The paper reports on two main strategies by which the children attempted to achieve a balance in the lottery machine. One involves arranging the balls symmetrically and the other randomly. We characterize the nature of the thinking in these two strategies: the first we see as deterministic and the latter as stochastic, exploiting the random collisions of the ball. In this article we trace how the children’s thinking moved between these two perspectives.

The chaos game revisited: Yet another, but a trivial proof of the algorithm’s correctness

The aim of this work is to explain why the most popular algorithm for approximating IFS fractals, the chaos game, works. Although there are a few proofs of the algorithm’s correctness in the relevant literature, the majority of them utilize notions and theorems of measure and ergodic theories. As a result, paradoxically, although the rules of the chaos game are very simple, the logic underlying the algorithm seems to be hard to comprehend for non-mathematicians. In contrast, the proof presented in this work uses only fundamentals of probability and can be understood by anyone interested in fractals.     

The elementary diagram of a trivial,weakly minimal structure is near model complete

We prove that if M is any model of a trivial, weakly minimal theory, then the elementary diagram T(M) eliminates quantifiers down to Boolean combinations of certain existential formulas. M. C. Laskowski has been partially supported by NSF grant DMS-0600217.