We partner with a secure submission system to handle manuscript submissions.
Please note:
You will need an account for the submission system, which is separate to your Cambridge Core account. For login and submission support, please visit the
submission and support pages.
Please review this journal's author instructions, particularly the
preparing your materials
page, before submitting your manuscript.
Click Proceed to submission system to continue to our partner's website.
To save this undefined to your undefined account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your undefined account.
Find out more about saving content to .
To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The importance of the fundamental group of a graph in group theory has been well known for many years. The recent work of Meakin, Margolis and Stephen has shown how effective graph theoretic techniques can be in the study of word problems in inverse semigroups. Our goal here is to characterize those deterministic inverse word graphs that are Schutzenberger graphs and consider how deterministic inverse word graphs and Schutzenberger graphs can be constructed from subgroups of free groups.
The relation ℛ* is defined on a semigroup S by the rule that ℛ*b if and only if the elements a, b of S are related by the Green's relation ℛ in some oversemigroup of S. A semigroup S is an E-semigroup if its set E(S)of idempotents is a subsemilattice of S. A left adequate semigroup is an E-semigroup in which every ℛ*-class contains an idempotent. It is easy to see that, in fact, each ℛ*-class of a left adequate semigroup contains a unique idempotent [2]. We denote the idempotent in the ℛ*-class of a by a+.
The Dedekind eta-function is defined for any τ in the upper half-plane by
where x = exp(2πiτ) and x1/24 = exp(2πiτ/24). By an eta-product we shall mean a function
where N ≥ 1 and eachrδ ∈ ℤ. In addition, we shall always assume that is an integer. Using the Legendre-Jacobi symbol (—), we define a Dirichlet character ∈ by
when a is odd. If p is a prime for which ∈(p) ≠ 0and if F is a function with a Fourier series
For any compact convex set K ⊂ ℂ there is a unital Banach algebra Ea(K) generated by an element h in which every polynomial in h attains its maximum norm over all Banach algebras subject to the numerical range V(h) being contained in K, [1]. In the case of K a line segment in ℝ, we show here that Ea(K) does not have Arens regular multiplication. We also show that ideas about Ea(K) give simple proofs of, and extend, two inequalities of C. Frappier [4].
Let S be a semigroup. A class of S-automata is called a hereditary pretorsion class (HPC) if it is closed under quotients, subautomata, coproducts (disjoint unions) and finite products. In this paper we present two characterizations of HPC. Specifically, we show that there is a bijective correspondence between the HPCs of S-automata, the right linear topologies on S′ and the idempotent preradicals r on the category of S-automata such that the set of automata {M|r(M) = M} is closed under subautomata and finite products.
Let G be a group and let ℓ(G) be the set of all conjugacy classes [H] of subgroups H of G, where a partial order ≤ is defined by [H1] ≤ [H2] if and only if H1, is contained in some conjugate of H2.
A number of papers (see for example [1] and the references mentioned there) deal with the question of characterizing groups G by the poset ℓ(G). For example, in [1] it was shown that if ℓ(G) and ℓ(H) are order-isomorphic and G is a noncyclic p-group then |G| = |H|. Moreover, if G is abelian, then G = H, and if G is metacyclic then H is metacyclic.
The study of bounded distributive lattices endowed with an additional dual homomorphic operation began with a paper by J. Berman [3]. Subsequently these algebras were called distributive Ockham lattices and an order-topological duality theory for them was developed by A. Urquhart [12]. In [9], M. S. Goldberg extended this theory and described the injective algebras in the subvarieties of the variety O of distributive Ockham algebras which are generated by a single subdirectly irreducible algebra. The aim here is to investigate some elementary properties of injective algebras in join reducible members of the lattice of subvarieties of Kn,1 and to give a complete description of injectivealgebras in the subvarieties of the Ockham subvariety defined by the identity x Λ f2n(x) = x.
Let R and S be arbitrary rings, RM and SN countably generated free modules, and let φ:End(RM)→End(sN) be an isomorphism between the endomorphism rings of M and N. Camillo [3] showed in 1984 that these assumptions imply that R and S are Morita equivalent rings. Indeed, as Bolla pointed out in [2], in this case the isomorphism φ must be induced by some Morita equivalence between R and S. The same holds true if one assumes that RM and SN are, more generally, non-finitely generated free modules.
The notation in this paper will be standard and it may be found in [3], for example. In particular, the notation A ⊂′ B stands for the statement “A is an essential submodule of B”. As is customary, we say that a ring R is a Goldie ring when R is both left and right Goldie. Similarly, a ring is noetherian if and only if it is both right and left noetherian, etc.
Let G be a finite group, (ZG) the group of units of the integral group ring ZG and 1(ZG) the subgroup of units of augmentation 1. In this paper, we are primarily concerned with the problem of describing constructively (ZG) for particular groups G. This has been done for a small number of groups (see [11] for an excellent survey), and most recently Jespers and Leal [3] described (ZG) for several 2-groups. While the situation is clear for all groups of order less than 16, not all groups of order 16 were discussed in their paper. Our main aim is to complete the description of (ZG) for all groups of order 16. Since the structure of the unit group of abelian groups is very well known (see for example [10]), we are only interested in the non-abelian case.
In this paper we prove an identity between sums of reciprocals of Fibonacci and Lucas numbers. The Fibonacci numbers are defined for all n ≥ 0 by the recurrence relation Fn + 1 = Fn + Fn-1 for n ≥ 1, where F0 = 0 and F1 = 0. The Lucas numbers Ln are defined for all n ≥ 0 by the same recurrence relation, where L0 = 2 and L1 = 1 We prove the following identify.
An algebra L = L = (A; V, Λ, *, +, 0, 1) of type (2, 2, 1, 1, 0, 0) is called a distributive double p-algebra whenever its reduct (A, V, Λ, 0, 1) is a distributive (0, 1)-lattice that, for any a ∈ A, contains a greatest element a* such that a Λ a* = 0 and a least element a+ for which a v a+ = 1.
Let {a, b} designate the Pythagorean ratio (a2 - b2)/2ab between the sides of a rational right angled triangle. This paper studies the circumstances in which Pythagorean ratios can occupy consecutive places in an arithmetic progression. Part I deals with sets of three such ratios, while Part II discusses sets of four ratios.
Theorem 3 of the paper, published in the Glasgow Mathematical Journal 35 (1993), 95–98, is stated incorrectly.
The subgroup G′ ∩ L(G) is nilpotent but not, in general, finitely generated (a suitable counterexample being provided by the group whose presentation is given n the Introduction). In groups with the property σ the Fitting radical is itself finitely generated and so the conclusion of Theorem 3 holds in this special case. The words “finitely generated” should be deleted from the paragraph preceding the statement of Theorem 4, but both this theorem and its proof are correct.