If A is a norm closed algebra of compact operators on a Hilbert space and if its Jacobson radical J(A) consists of all quasinilpotent operators in A then A/ J(A) is commutative. The result is not valid for a general algebra of polynomially compact operators.

We give a sharp upper bound on the size of a triangle-free graph of a given order and connected domination. Our bound, apart from strengthening an old classical theorem of Mantel and of Turán improves on a theorem of Sanchis. Further, as corollaries, we settle a long standing conjecture of Graffiti on the leaf number and local independence for triangle-free graphs and answer a question of Griggs, Kleitman, and Shastri on a lower bound of the leaf number in triangle-free graphs.

We characterize model polynomials that are cyclic in Dirichlet-type spaces in the unit ball of $\mathbb C^n$, and we give a sufficient capacity condition in order to identify noncyclic vectors.

We show that for $U$ and $V$ balanced open subsets of $\left( \text{Qno} \right)$ Fréchet spaces $E$ and $F$ that we have the topological identity

$$\text{(}\mathcal{H}(U\times V),{{\tau }_{\omega }})=\left( \mathcal{H}\left( U;\left( \mathcal{H}(V),{{\tau }_{\omega }} \right) \right),{{\tau }_{\omega }} \right).$$

Analogous results for the compact open topology have long been established. We also give an example to show that the $\left( \text{Qno} \right)$ hypothesis on both $E$ and $F$ is necessary.

Let f be an L integrable real valued function of period 2π and let

(1)

be its Fourier series. It is known that if f is of bounded variation then all nan and nbn(n=1,2,3,…) lie in the interval [-V(F)/π, V(F)/π;] where V(f) is the total variation of f. M. Izumi and S. Izumi [3] have recently asserted the following theorem A about the density of the positive and negative Fourier sine coefficients of a function of bounded variation.

In what follows small latin letters denote rational integers (whole numbers) and we write

Let us consider the system of k equations

1

that is

These equations are obviously satisfied if the b are a permutation of the a; such a solution we call trivial.

Let S = k[[x,y]] be a formal power series ring in two variables x, y over a field k and I an (x, y)-primary ideal of S. We show that S/I is selfinjective if Hi(S/I, S/I ⊗k S/I) = 0 for i = 1 and 2.

Leeming [3] has defined a sequence of polynomials {Q4n(x)} and a sequence of integers {Q4n} by means of

1.1

and

1.2

Thus

1.3

and equivalently

1.4

The concept of a firm fixed point of a selfmap of a metric space is introduced. Loosely speaking a fixed point is firm if it cannot be moved to a point nearby with the help of a map which is arbitrarily close to the given map. It is shown that a continuum always admits a selfmap with a firm fixed point if the continuum contains a triod and if the vertex of the triod has a neighbourhood which is a dendrite. This condition holds in particular for local dendrites. Hence a local dendrite is an arc or a simple closed curve if and only if it does not admit a selfmap which has a firm fixed point.

It is well known and immediate that in an associative ring a nilpotent one-sided ideal generates a nilpotent two-sided ideal. The corresponding open question for alternative rings was raised by M. Slater [6, p. 476]. Hitherto the question has been answered only in the case of a trivial one-sided ideal J (i.e., in case J2 = 0) [5]. In this note we solve the question in its entirety by showing that a nilpotent one-sided ideal K of an alternative ring generates a nilpotent two-sided ideal. In the process we find an upper bound for the index of nilpotency of the ideal generated. The main theorem provides another proof of the fact that a semiprime alternative ring contains no nilpotent one-sided ideals. Finally we note the analogous result for locally nilpotent one-sided ideals.

The homotopy groups of a finite partially ordered set (poset) can be described entirely in the context of posets, as shown in a paper by $\text{B}$. Larose and $\text{C}$. Tardif. In this paper we describe the relative version of such a homotopy theory, for pairs $\left( X,\,A \right)$ where $X$ is a poset and $A$ is a subposet of $X$. We also prove some theorems on the relevant version of the notion of weak homotopy equivalences for maps of pairs of such objects. We work in the category of reflexive binary relational structures which contains the posets as in the work of Larose and Tardif.

In 1968, Galvin conjectured that an uncountable poset $P$ is the union of countably many chains if and only if this is true for every subposet $Q\,\subseteq \,P$ with size ${{\aleph }_{1}}$. In 1981, Rado formulated a similar conjecture that an uncountable interval graph $G$ is countably chromatic if and only if this is true for every induced subgraph $H\,\subseteq \,G$ with size ${{\aleph }_{1}}$. Todorčević has shown that Rado's conjecture is consistent relative to the existence of a supercompact cardinal, while the consistency of Galvin's conjecture remains open. In this paper, we survey and collect a variety of results related to these two conjectures. We also show that the extension of Rado's conjecture to the class of all chordal graphs is relatively consistent with the existence of a supercompact cardinal.

A partially ordered set P is said to have the n-cutset property if for every element x of P, there is a subset S of P all of whose elements are noncomparable to x, with |S| ≤ n, and such that every maximal chain in P meets {x} ∪ S. It is known that if P has the n-cutset property then P has at most 2n maximal elements. Here we are concerned with the extremal case. We let Max P denote the set of maximal elements of P. We establish the following result. THEOREM: Let n be a positive integer. Suppose P has the n-cutset property and that |Max P| = 2n. Then P contains a complete binary tree T of height n with Max T = Max P and such that C ∩ T is a maximal chain in T for every maximal chain C of P. Two examples are given to show that this result does not extend to the case when n is infinite. However the following is shown. THEOREM: Suppose that P has the ω-cutset property and that |Max P| = 2ω. If P — Max P is countable then P contains a complete binary tree of height ω