Let R be an artinian ring. A family, ℳ, of isomorphism types of R-modules of finite length is said to be canonical if every R-module of finite length is a direct sum of modules whose isomorphism types are in ℳ. In this paper we show that ℳ is canonical if the following conditions are simultaneously satisfied: (a) ℳ contains the isomorphism type of every simple R-module; (b) ℳ has a preorder with the property that every nonempty subfamily of ℳ with a common bound on the lengths of its members has a smallest type; (c) if M is a nonsplit extension of a module of isomorphism type II1 by a module of isomorphism type II2, with II1, II2 in ℳ, then M contains a submodule whose type II3 is in ℳ and II1 does not precede II3. We use this result to give another proof of Kronecker's theorem on canonical pairs of matrices under equivalence. If R is a tame hereditary finite-dimensional algebra we show that there is a preorder on the family of isomorphism types of indecomposable R-modules of finite length that satisfies Conditions (b) and (c).

Let and .

In 1951 Mohanty proved the following theorem: .

In this paper a general theorem on summability |R,l (w), 1 | of Σ An(x) has been given which improves upon Mohanty's result in different ways (see Corollaries 1, 2 and 3) and it is also shown that some of the results of this note are the best possible.

Felix Behrend was born at Berlin-Charlottenburg, Germany, on 23 April, 1911, the eldest of four children of Dr. Felix W. Behrend and his wife Maria, nee Zöllner. Felix Behrend senior was a mathematics and physics master at the Herderschule, a noted “Reform-Realgymnasium” in one of the western suburbs of Berlin; he was a widely known educationalist, and later headmaster of an important school elsewhere in Berlin, until demoted and finally dismissed by the Nazis, partly because of some Jewish ancestry, partly because of his liberal political views.

This paper gives characterizations of functionally compact spaces in terms of filterbases and nets. Also, a topological property that is weaker than countable compactness but stronger than first countable minimality is investigated.

We present the definition of crossed products of Hilbert C*-bimodules by Hilbert bundles with commuting finite group actions and finite dimensional fibers. This is a general construction containing the bundle construction and crossed products of Hilbert C*-bimodule by finite groups. We also study the structure of endomorphism algebras of the tensor products of bimodules. We also define the multiple crossed products using three bimodules containing more than 2 bundles and show the associativity law. Moreover, we present some examples of crossed product bimodules easily computed by our method.

Some results on fixed points of certain involutions in Banach spaces have been obtained, and whence a few coincidence theorems are also derived. These are indeed generalization of previously known results due to Browder, Goebel-Zlotkiewicz and Iséki. Illustrative examples are also given.

A probabilistic convergence structure assigns a probability that a given filter converges to a given element of the space. The role of the t-norm (triangle norm) in the study of regularity of probabilistic convergence spaces is investigated. Given a probabilistic convergence space, there exists a finest T-regular space which is coarser than the given space, and is referred to as the ‘T-regular modification’. Moreover, for each probabilistic convergence space, there is a sequence of spaces, indexed by nonnegative ordinals, whose first term is the given space and whose last term is its T-regular modification. The T-regular modification is illustrated in the example involving ‘convergence with probability λ’ for several t-norms. Suitable function space structures in terms of a given t-norm are also considered.

A Symplectic lattice L is a free Z-module of finite rank endowed with a non-degenerate alternating bilinear form. Thus we have a bilinear mapping Φ of L × L into the domain of integers Z; we donote Φ (α, β) by α · β (where α, β ∈ L). Then α2 = 0 and α·β = −β·α.

We find the potential function whose gradient best approximates an observed square integrable function on a bounded open set subject to prescribed weight factors. With an appropriate choice of topology, we show that the gradient operator is a bounded linear operator and that the desired potential function is obtained by solving a second-order, self-adjoint, linear, elliptic partial differential equation. The main result makes a precise analogy with a standard procedure for the best approximate solution of a system of linear algebraic equations. The use of bounded operators means that the definitive equation is expressed in terms of well-defined functions and that the error in a numerical solution can be calculated by direct substitution into this equation. The proposed method is illustrated with a hypothetical example.

Some embeddings of general linear groups into hyperbolic Clifford groups are constructed generically by using Jordan pairs of rectangular and alternating matrices over a ring. In low rank cases through exceptional isomorphisms, their direct description and relationships to some automorphisms of Clifford groups are given. Generic norms are calculated in detail, and equivariant embeddings of representation spaces are constructed.

We establish a characterization of certain trees of polygons similar to that of n-gon-trees given by Chao and Li.

We consider several familiar varieties of completely regular semigroups such as groups and completely simple semigroups. For each of them, we characterize their members in terms of absence of certain kinds of subsemigroups, as well as absence of certain divisors, and in terms of a homomorphism of a concrete semigroup into the semigroup itself. For each of these varieties $ \mathcal{V} $ we determine minimal non-$ \mathcal{V} $ varieties, provide a basis for their identities, determine their join and give a basis for its identities. Most of this is complete; one of the items missing is a basis for identities for minimal nonlocal orthogroups. Three tables and a figure illustrate the results obtained.

We continue the study of operators from an Archimedean vector lattice E into a cofinal sublattice H which have the property that there is λ > 0 such that if x ∈ E, h ∈ H and |x|≤|h|, then |Tx| ≤ λ|h|. The collection Z(E|H) of all of those operators forms an algebra under composition. We investigate the relationship between the properties of having an identity, being Abelin and being semi-simple for such-algebras, culminating in a proof that they are equivalent if H is Dedekind complete. We also study various for such an operator T, showing that, apart from 0, its spectrum relative to Z(E|H) is the same as that of T|H relative to Z(H) and that of T relative to ℒ(E) (Provided E is a Banach lattice and H is closed).

A generalisation of Descartes’ rule of signs to other functions is derived and a bound for the number of positive zeros of a class of integral transforms is deduced from that. A more precise rule of signs is also discussed in the light of these results.

In modelling joint probability distributions it is often desirable to incorporate standard marginal distributions and match a set of key observed mixed moments. At the same time it may also be prudent to avoid additional unwarranted assumptions. The problem is to find the least ordered distribution that respects the prescribed constraints. In this paper we will construct a suitable joint probability distribution by finding the checkerboard copula of maximum entropy that allows us to incorporate the appropriate marginal distributions and match the nominated set of observed moments.

Let ${\mathcal{L}}=-\unicode[STIX]{x1D6E5}+{\mathcal{V}}$ be a Schrödinger operator on $\mathbb{R}^{n},n\geq 3$, where ${\mathcal{V}}$ is a potential satisfying an appropriate reverse Hölder inequality. In this paper, we prove the boundedness of the Riesz transforms and the Littlewood–Paley square function associated with Schrödinger operators ${\mathcal{L}}$ in some new function spaces, such as new weighted Bounded Mean Oscillation (BMO) and weighted Lipschitz spaces, associated with ${\mathcal{L}}$. Our results extend certain well-known results.

Let $\{f_{n}\}_{n\geq 1}$ be an infinite iterated function system on $[0,1]$ and let $\unicode[STIX]{x1D6EC}$ be its attractor. Then, for any $x\in \unicode[STIX]{x1D6EC}$, it corresponds to a sequence of integers $\{a_{n}(x)\}_{n\geq 1}$, called the digit sequence of $x$, in the sense that

$$\begin{eqnarray}x=\lim _{n\rightarrow \infty }f_{a_{1}(x)}\circ \cdots \circ f_{a_{n}(x)}(1).\end{eqnarray}$$

Tent spaces of vector-valued functions were recently studied by Hytönen, van Neerven and Portal with an eye on applications to $H^{\infty }$-functional calculi. This paper extends their results to the endpoint cases $p=1$ and $p=\infty $ along the lines of earlier work by Harboure, Torrea and Viviani in the scalar-valued case. The main result of the paper is an atomic decomposition in the case $p=1$, which relies on a new geometric argument for cones. A result on the duality of these spaces is also given.

We answer some questions which arise from a recent paper of Campbell, Heggie, Robertson and Thomas on one-relator free products of two cyclic groups. In the process we show how publicly accessible computer programs can be used to help answer questions about finite group presentations.

Let ε, Λ, Λ*, ΛR stand for the set of non-negative integers, isols, isolic integers and regressive isols respectively, and let P(τ) be the ω-group of Gödel numbers of permutations of the set τ ε ε which move only finitely many elements of τ. The concept of an ω-group was studied by Hassett [5]. He proved in P12 of [5] that for an isolated set τ, the decomposition of P(τ) into conjugacy sets is a gc-decomposition if and only if τ is regressive. For the finite symmetric group on n elements, Sn it is known that the order of the conjugacy class is p(n), where p(n) is the partition function. The author shows in this paper, using a result of Barback [1], that if pΛ(T) is Nerode's canonical extension of p(n) to Λ and Req (τ) = T, then pΛ(T) = Req Cτ, where Cτ is the decomposition of P(τ) into conjugacy sets. The reader is assumed to be familiar with the contents of [2], [4] and [5].