Related papers: On monotone alternating inverse monoids

By the theorems of Cayley and Vagner-Preston, the full transformation monoids and the symmetric inverse monoids play analogous roles in the theory of monoids and inverse monoids, as the symmetric groups do in the theory of groups. Every…

We give a classification of noncommutative algebraic monoid structures on normal affine varieties such that the group of invertible elements of the monoid is connected, solvable, and has a one-dimensional unipotent radical. We describe the…

Let $ \mathcal{I}_n$ be the symmetric inverse semigroup on $X_n = \{1, 2, \ldots , n\}$. Let $\mathcal{OCI}_n$ be the subsemigroup of $\mathcal{I}_n$ consisting of all order-preserving injective partial contraction mappings, and let…

Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…

Let ${\cal I}_n$ be the symmetric inverse semigroup on $X_n = \{1, 2,..., n\}$ and let ${\cal DP}_n$ and ${\cal ODP}_n$ be its subsemigroups of partial isometries and of order-preserving partial isometries of $X_n$, respectively. In this…

We describe the automorphism groups of reductive monoids and of root monoids with active groups of invertible elements.

In this paper we consider endomorphisms of a finite directed path from monoid generators perspective. Our main aim is to determine the rank of the monoid $\wEnd\vec{P}_n$ of all weak endomorphisms of a directed path with $n$ vertices, which…

Shuffle algebras are monoids for an unconvential monoidal category structure on graded vector spaces. We present two homological results on shuffle algebras with monomial relations, and use them to prove exact and asymptotic results on…

We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…

We present a method to construct high-order polynomial approximate invariants (AI) for non-integrable Hamiltonian dynamical systems, and apply it to modern ring-based particle accelerators. Taking advantage of a special property of one-turn…

A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…

The algebraic variety defined by the idempotents of an incidence monoid is investigated. Its irreducible components are determined. The intersection with an antichain submonoid is shown to be the union of these irreducible components. The…

We introduce a class of inverse monoids that can be regarded as non-commutative generalizations of Boolean algebras. These inverse monoids are related to a class of \'etale topological groupoids, under a non-commutative generalization of…

We explore monoids generated by operators on certain infinite partial orders. Our starting point is the work of Fomin and Greene on monoids satisfying the relations $(\u{r}+\u{r+1})\u{r+1}\u{r}=\u{r+1}\u{r}(\u{r}+\u{r+1})$ and…

We introduce a general construction on 2-monads. We develop background on maps of 2-monads, their left semi-algebras, and colimits in 2-category. Then, we introduce the construction of a colimit induced by a map of 2-monads, show that we…

We study the algebraic properties of binary relations whose underlying digraph is smooth, that is has no source or sink. Such objects have been studied as surjective hyper-operations (shops) on the corresponding vertex set, and as binary…

We examine from an invariant theory viewpoint the monoid algebras for two monoids having large symmetry groups. The first monoid is the free left-regular band on $n$ letters, defined on the set of all injective words, that is, the words…

We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…

Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…