Tight inverse semigroups that are not bisimple

A semigroup is tight if each of its congruences is uniquely determined by each of the congruence classes. Bisimple inverse semigroups are tight, and tight semigroups are either simple or congruence-free with zero. Although congruence-free semigroups are tight, they are not necessarily bisimple. We construct tight inverse semigroups and tight inverse monoids that are neither bisimple nor congruence-free.     

Almost disjoint large subsets of semigroups

There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick, central, syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain substantial combinatorial structure. It is known that in (N,+) any central set may be partitioned into infinitely many pairwise disjoint central sets. We extend this result to a large class of semigroups (including (N,+)) by showing that if S is a semigroup in this class which has cardinality κ then any central set can be partitioned into κ many pairwise disjoint central sets. We also show that for this same class of semigroups, if there exists a collection of μ almost disjoint subsets of any member S, then any central subset of S contains a collection of μ almost disjoint central sets. The same statement applies if “central” is replaced by “thick”; and in the case that the semigroup is left cancellative, “central” may be replaced by “piecewise syndetic”. The situation with respect to syndetic sets is much more restrictive. For example, there does not exist an uncountable collection of almost disjoint syndetic subsets of N. We investigate the extent to which syndetic sets can be split into disjoint syndetic sets.     

Equations in free groups are not finitely approximable

We give an equation in any free group of rank that has a solution in any finite quotient of , but has no solution in .

     

On equations in free semigroups and groups

The unsolvability of some algorithmic problems is proved for equations in free groups and semigroups, namely, some simple properties of the solutions of the equations are determined and the absence of an algorithm permitting the determination of whether an arbitrary equation in a free group or semigroup has a solution with the properties introduced is proved.Translated from Matematicheskie Zametki, Vol. 16, No. 5, pp. 717–724, November, 1974.     

Finite simple groups that are not spectrum critical

Let G be a finite group. The spectrum of G is the set ω(G) of orders of all its elements. The subset of prime elements of ω(G) is called the prime spectrum and is denoted by π(G). A group G is called spectrum critical (prime spectrum critical) if, for any subgroups K and L of G such that K is a normal subgroup of L, the equality ω(L/K) = ω(G) (π(L/K) = π(G), respectively) implies that L = G and K = 1. In the present paper, we describe all finite simple groups that are not spectrum critical. In addition, we show that a prime spectrum minimal group G is prime spectrum critical if and only if its Fitting subgroup F(G) is a Hall subgroup of G.     

Finite groups are big as semigroups

We prove that a finite group G occurs as a maximal proper subsemigroup of an infinite semigroup (in the terminology of Freese, Ježek, and Nation, G is a big semigroup) if and only if |G| ≥ 3. In fact, any finite semigroup whose minimal ideal contains a subgroup with at least three elements is big.     

Ordered semigroups which are both right commutative and right cancellative

In this paper we prove that each right commutative, right cancellative ordered semigroup (S,.,??) can be embedded into a right cancellative ordered semigroup (T,??,?) such that (T,??) is left simple and right commutative. As a consequence, an ordered semigroup S which is both right commutative and right cancellative is embedded into an ordered semigroup T which is union of pairwise disjoint abelian groups, indexed by a left zero subsemigroup of?T.     

Commutative semigroups whose homomorphic images in groups are groups

In this paper we study commutative semigroups whose every homomorphic image in a group is a group. We find that for a commutative semigroup S, this property is equivalent to S being a union of subsemigroups each of which either has a kernel or else is isomorphic to one of a sequence T₀, T₁, T₂, ... of explicitly given, countably infinite semigroups without idempotents. Moreover, if S is also finitely generated then this property is equivalent to S having a kernel.     

Subgroups of free idempotent generated semigroups need not be free

We study the maximal subgroups of free idempotent generated semigroups on a biordered set by topological methods. These subgroups are realized as the fundamental groups of a number of 2-complexes naturally associated to the biorder structure of the set of idempotents. We use this to construct the first example of a free idempotent generated semigroup containing a non-free subgroup.     

Minimal free resolutions that are not supported by a CW-complex

We provide the first examples of minimal free resolutions of monomial ideals which cannot be supported by any CW-complex. Their existence answers negatively the fundamental question of whether every monomial ideal admits a minimal cellular resolution.     

Triangle free graphs that are not 3-embeddable in Sd

A triangle free graph which cannot be $\text{3}$ embedded in a unit sphere is constructed. The construction uses the powerful orthogonal representation of graphs due to Lovász, and exhibits a strong connection between embeddability and Ramsey numbers. We also show that for every ε > 0 there is a triangle free graph G_ε that is not $\text{2+?}$ embeddable, thus settling Larman's conjecture.     

Groups of p-absolute Galois type that are not absolute Galois groups

Let p be a prime. We study pro-p groups of p-absolute Galois type, as defined by Lam–Liu–Sharifi–Wake–Wang. We prove that the pro-p completion of the right-angled Artin group associated to a chordal simplicial graph is of p-absolute Galois type, and moreover it satisfies a strong version of the Massey vanishing property. Also, we prove that Demushkin groups are of p-absolute Galois type, and that the free pro-p product — and, under certain conditions, the direct product — of two pro-p groups of p-absolute Galois type satisfying the Massey vanishing property, is again a pro-p group of p-absolute Galois type satisfying the Massey vanishing property. Consequently, there is a plethora of pro-p groups of p-absolute Galois type satisfying the Massey vanishing property that do not occur as absolute Galois groups.