Vines and partial transformations

We introduce the partial vine monoid PVn. This monoid is related to the partial transformation semigroup PTn in the same way as the braid group Bn is related to the symmetric group Sn, and contains both the vine monoid [T.G. Lavers, The theory of vines, Comm. Algebra 25 (4) (1997) 1257-1284] and the inverse braid monoid [D. Easdown, T.G. Lavers, The inverse braid monoid, Adv. Math. 186 (2) (2004) 438-455]. We give a presentation for PVn in terms of generators and relations, as well as a faithful representation in a monoid of endomorphisms of a free group. We also derive a new presentation for PTn.     

Closures on partial partitions from closures on sets

Jordens and Sturm investigated the link between closure systems on sets and closure systems on partitions. We extend that study to the wider framework of partial partitions, and highlight better the relation between these two families of closure systems. Then we consider the construction of a closure operator on partial partitions by the iterated application a set operator to the blocks of a partial partition; the resulting closure system fits into our framework.     

Balanced subsets of the semigroup of partial transformations

For the elements of subsets of the semigroup of partial transformations we study when the sets of commuting and noncommuting elements are of the same cardinality.     

Completely regular semigroups as semigroups of partial transformations

Communicated by G. Lallement     

Enumeration of symplectic and orthogonal injective partial transformations

In this paper, we compute the generating function of , where a is a real number with a≥1. We then use this function to determine the generating functions of the symplectic and orthogonal Renner monoids. Furthermore, we show that these functions are closely related to Laguerre polynomials.     

Representations of inverse semigroups by one-to-one partial transformations of a set

We show that each representation ϕ, say, of an inverse semigroup S, by means of transformations of a set X, determines a representation ϕ^* by means of partial one-to-one transformations of X, in such a fashion that sϕ ↦ sϕ^*, for s ∈ S, is an isomorphism of Sϕ upon Sϕ^*. An immediate corollary is the classical faithful representation of an inverse semigroup as a semigroup of partial one-to-one transformations.     

Semigroups of partial transformations with kernel and image restricted by an equivalence

Semigroup Forum - For an arbitrary set X and an equivalence relation $$mu$$ on X, denote by $$P_mu (X)$$ the semigroup of partial transformations $$alpha$$ on X such that $$xmu subseteq x(ker...     

Lattice closures of polyhedra

Mathematical Programming - Given $$P\subset {\mathbb {R}}^n$$, a mixed-integer set $$P^I=P\cap ({\mathbb {Z}}^{t}\times {\mathbb {R}}^{n-t}$$), and a k-tuple of n-dimensional integral vectors...     

Group actions,gauge transformations,and the calculus of variations

The first author was supported by various research projects of the DFG     

On the finite basis problem for the monoids of partial extensive injective transformations

Let \(PEI_n (POEI_n)\) be the monoid of all partial (order-preserving) extensive and injective transformations over a chain of order n. We give a sufficient condition under which a semigroup is nonfinitely based and apply this condition to show that the monoid \(PEI_3 (POEI_3)\) is nonfinitely based. This together with the results of Edmunds and Goldberg gives a complete answer to the finite basis problem for the monoid \(PEI_n (POEI_n)\): the monoid \(PEI_n (POEI_n)\) is nonfinitely based if and only if \(n\geqslant 3\). Furthermore, it is shown that the monoid \(PEI_n (POEI_n)\) is hereditarily finitely based if and only if \(n\leqslant 2\).