Hamiltonicity of Amalgams

 An amalgam is obtained from two Halin graphs having skirting cycles of the same length. We are interested in hamiltonicity of amalgams constructed from two identical Halin graphs without any shift along the skirting cycle. We establish hamiltonicity of amalagams constructed from cubic Halin graphs. We give a sufficient condition for hamiltonicity of non-cubic amalgams and characterize infinite classes of non-Hamiltonian amalgams. We also characterize hamiltonicity of amalgams constructed by shifting the component Halin graphs by one and of general amalgams of higher degree. Received: June 23, 1997     

Normal forms for semigroup amalgams

We define a class of inverse semigroup amalgams and derive normal forms for the amalgamated free products in the variety of semigroups. The class includes all amalgams of finite inverse semigroups, recently studied by Cherubini, Jajcayova, Meakin, Nuccio, Piochi and Rodaro (2005–2014), and lower bounded amalgams, that were introduced by the author (1997). We provide sufficient conditions for decidable word problem. We show that the word problem is decidable for an amalgamated free product of finite inverse semigroups. The normal forms can be used to study amalgams in subvarieties of inverse semigroups. In a forthcoming paper by the author, the results are used for varieties of semilattices of groups.     

On the Hausdorff-Young theorem for amalgams

Certain function spaces called amalgams have been used and studied in several recent papers on abstract harmonic analysis. In this paper, we give a new proof of a Hausdorff-Young theorem for amalgams on locally compact abelian groups. We also prove some complementary results about amalgams and their Fourier transforms, and in particular give simple proofs of some facts about the Fourier multipliers from certain spaces of functions with compact support intoA(G).     

Rings with countably many direct summands

We consider commutative monoid amalgams having as their cores a conical cancellative monoid. In this context we present sufficient conditions for the amalgam to be strongly embeddable and for some properties of the factors to be transmitted to the amalgamated free product.     

On Free Products and Amalgams of Pomonoids

The study of amalgamation in the category of partially ordered monoids was initiated by Fakhuruddin in the 1980s. In 1986 he proved that, in the category of commutative pomonoids, every absolutely flat commutative pomonoid is a weak amalgmation base and every commutative pogroup is a strong amalgamation base. Some twenty years later, Bulman-Fleming and Sohail in 2011 extended this work to what they referred to as pomonoid amalgams. In particular, they proved that pogroups are poamalgmation bases in the category of pomonoids. Sohail, also in 2011, proved that absolutely poflat commutative pomonoids are poamalgmation bases in the category of commutative pomonoids. In the present article, we extend the work on pomonoid amalgams by generalizing the work of Renshaw on amalgams of monoids and extension properties of acts over monoids.     

Amalgams of Cubic Bipartite Graphs

The amalgamation technique has been introduced for groups by Higman et al. [8] and Goldschmidt [7] and developed on geometries by Kegel and Schleiermacher [9]. We define a “graph amalgam” to point out a different approach to certain classes of cubic bipartite graphs. Furthermore, we find relations between graph amalgams, 3-bridges and star-products of cubic bipartite graphs.     

Inductive Limits of Area-Preserving Diffeomorphism Groups

A compact oriented surface with a given area form is considered. For each coordinate domain, we take the group of diffeomorphisms supported in this domain and preserving the area form. Finally, consider codimension 1 normal subgroups in these groups. For each pair of coordinate domains one of which contains the closure of the other, there is an obvious inclusion of the corresponding groups. We describe the inductive limits (amalgams) of these two families of groups.     

Perfect Graphs, Partitionable Graphs and Cutsets

We prove a theorem about cutsets in partitionable graphs that generalizes earlier results on amalgams, 2-amalgams and homogeneous pairs. Received December 13, 1999 RID="*" ID="*" This work was supported in part by the Fields Institute for Research in Mathematical Sciences, Toronto, Canada, and by NSF grants DMI-0098427 and DMI-9802773 and ONR grant N00014-97-1-0196.     

On the Phan system of the Schur cover of SU(4, 32)

This article is part of the program described in Bennett et al. (in: Ivanov et al. (ed.) Groups, combinatorics, and geometry, 2003) [3]. We study the Phan amalgams and their universal completions that occur for q = 3 in rank n = 3 for the diagram A ₃ = D ₃, corresponding to SU(4, 3²) ≅ Spin ⁻(6, 3). We show that the associated geometries admit universal 9-fold coverings, by showing that the universal completion of the Phan amalgam is the central extension of SU(4, 3²) by its Schur multiplier. This information provides the last missing piece of information in the full classification of Phan amalgams and their universal completions for A _n and D _n .      

Amalgams of free inverse semigroups

We study inverse semigroup amalgams of the formS * _U T whereS andT are free inverse semigroups andU is an arbitrary finitely generated inverse subsemigroup ofS andT. We make use of recent work of Bennett to show that the word problem is decidable for any such amalgam. This is in contrast to the general situation for semigroup amalgams, where recent work of Birget, Margolis and Meakin shows that the word problem for a semigroup amalgamS * _U T is in general undecidable, even ifS andT have decidable word problem,U is a free semigroup, and the membership problem forU inS andT is decidable. We also obtain a number of results concerning the structure of such amalgams. We obtain conditions for theD-classes of such an amalgam to be finite and we show that the amalgam is combinatorial in such a case. For example every one-relator amalgam of this type has finiteD-classes and is combinatorial. We also obtain information concerning when such an amalgam isE-unitary: for example every one relator amalgam of the formInv<A ∪B :u =v > whereA andB are disjoint andu (resp.v) is a cyclically reduced word overA ∪A ⁻¹ (resp.B ∪B ⁻¹) isE-unitary. Research of all authors supported by a grant from the Italian CNR. The first and third authors’ research was partially supported by MURST. The second author’s research was also partially supported by NSF and the Center for Communication and Information Science of the University of Nebraska at Lincoln.     

Amalgamations ofl-varieties

It is proved that only o-approximable l-varieties can share the amalgamation property. We construct a formation of rigidly ordered groups that is not amalgamated in the variety of o-approximable l-groups and, in particular, in the variety of rigid l-groups. It is shown that all the known formations of o-approximable l-groups having no amalgams in the variety of o-approximable l-groups are amalgamated in the variety of all lattice-ordered groups. Translated fromAlgebra i Logika, Vol. 35, No. 1, pp. 31–40, January–February, 1996.     

The dimension of orthomodular posets constructed by pasting Boolean algebras

The main aim of this paper is the calculation of the dimension of certain atomic amalgams. These consist of finite Boolean algebras (blocks) pasted together in such a way that a pair of blocks intersects either trivially in the bounds, or the intersection consists of the bounds, an atom, and its complement.     

Rewriting Systems and Geometric Three-Manifolds

The fundamental groups of most (conjecturally, all) closed three-manifolds with uniform geometries have finite complete rewriting systems. The fundamental groups of a large class of amalgams of circle bundles also have finite complete rewriting systems. The general case remains open.     

Fusion systems and amalgams

We study reduced fusion systems from the point of view of their essential subgroups, using the classification by Goldschmidt and Fan of amalgams of prime index to analyze certain pairs of such subgroups. Our results are applied here to study reduced fusion systems over $2$ -groups of order at most 64, and also reduced fusion systems over $2$ -groups having abelian subgroups of index two. More applications are given in later papers.     

Locally compact groups acting on trees and propertyT

FollowingKazhdan, a separable locally compact groupG is said to have propertyT if the trivial representation is isolated in the dual space,, of equivalence classes of continuous irreducible unitary representations ofG. We generalize results ofMargulis—Tits by showing that groups which have propertyT can not be amalgams.Research supported by NSF.     

On symmetric and locally finite actions of groups on the quintic tree

In this paper, we determine all faithful, symmetric and locally finite actions of a group on the tree of valency five. As a corollary we complete the classification of the isomorphism types of vertex and edge stabilisers in a group acting symmetrically on a graph of valency five. This builds on work of Weiss and recent work of Feng, Zhou and Feng, Guo. Our approach is to classify the isomorphism types of finite, faithful amalgams of degree (5, 2).     

A class of highly symmetric graphs,symmetric cylindrical constructions and their spectra

In this article, we introduce the algebra of block-symmetric cylinders and we show that symmetric cylindrical constructions on base-graphs admitting commutative decompositions behave as generalized tensor products. We compute the characteristic polynomial of such symmetric cylindrical constructions in terms of the spectra of the base-graph and the cylinders in a general setting. This gives rise to a simultaneous generalization of some well-known results on the spectra of a variety of graph amalgams, as various graph products, graph subdivisions and generalized Petersen graph constructions. While our main result introduces a connection between spectral graph theory and commutative decompositions of graphs, we focus on commutative cyclic decompositions of complete graphs and tree-cylinders along with a subtle group labeling of trees to introduce a class of highly symmetric graphs containing the Petersen and the Coxeter graphs. Also, using techniques based on recursive polynomials we compute the characteristic polynomials of these highly symmetric graphs as an application of our main result.     

Coxeter–Chein Loops

In 1974, Orin Chein discovered a new family of Moufang loops which are now called Chein loops. Such a loop can be created from any group W together with ?₂ by a variation on a semidirect product. We first settle an open problem, originally proposed by Petr Vojtěchovský in 2003, by finding a minimal presentation for the Chein loop with respect to a presentation for W. We then study these loops in the case where W is a Coxeter group and show that it has what we call a Chein-Coxeter system, a small set of generators of order 2, together with a set of relations closely related to the Coxeter relations and Chein relations. In particular, even if the Moufang loop is infinite, it is finitely presented. Viewing these presentations as amalgams of loops, we then apply methods due to Blok and Hoffman to describe a family of twisted Coxeter–Chein loops.     

Average Widths and Optimal Recovery of Multivariate Besov Classes in the Amalgams of Lq and lp

In this paper, we obtain some weak asymptotic results for average -K width, average -L width, and optimal recovery of Besov classes in the amalgams of L^q and l^p.     

On Finite 2‐Path‐Transitive Graphs

The class of graphs that are 2‐path‐transitive but not 2‐arc‐transitive is investigated. The amalgams for such graphs are determined, and structural information regarding the full automorphism groups is given. It is then proved that a graph is 2‐path‐transitive but not 2‐arc‐transitive if and only if its line graph is half‐arc‐transitive, thus providing a method for constructing new families of half‐arc‐transitive graphs. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 225–237, 2013