English
Related papers

Related papers: Monoids of injective maps closed under conjugation…

200 papers

We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic…

Formal Languages and Automata Theory · Computer Science 2014-04-23 Martin Huschenbett , Dietrich Kuske , Georg Zetzsche

This paper describes an issue that arises when inverting elements of the homotopy groups of an equivariant commutative ring. Equivariant commutative rings possess an enhanced multiplicative structure arising from the presence of "indexed…

Algebraic Topology · Mathematics 2013-03-20 Michael J. Hopkins , Michael A. Hill

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Discrete Mathematics · Computer Science 2011-08-19 Alexander Valyuzhenich

We define link and graph invariants from entropic magmas modeling them on the Kauffman bracket and Tutte polynomial. We define the homology of entropic magmas. We also consider groups that can be assigned to the families of compatible…

Geometric Topology · Mathematics 2014-10-01 Maciej Niebrzydowski , Józef H. Przytycki

Every countable group $G$ can be embedded in a finitely generated group $G^*$ that is hopfian and complete, i.e. $G^*$ has trivial centre and every epimorphism $G^*\to G^*$ is an inner automorphism. Every finite subgroup of $G^*$ is…

Group Theory · Mathematics 2024-11-20 Martin R. Bridson , Hamish Short

Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is called (1) $\mathcal C$-$closed$ if $X$ is closed in every topological semigroup $Y\in\mathcal C$ containing $X$ as a discrete subsemigroup, (2) $ideally$ $\mathcal…

Group Theory · Mathematics 2023-01-09 Taras Banakh , Serhii Bardyla

Let M be a monoidal category endowed with a distinguished class of weak equivalences and with appropriately compatible classifying bundles for monoids and comonoids. We define and study homotopy-invariant notions of normality for maps of…

Algebraic Topology · Mathematics 2012-01-04 Emmanuel D. Farjoun , Kathryn Hess

Our main observation is that the contravariant functor Spec on the category of commutative monoids is representable. We discuss a few consequences of this fact. In particular, we give an efficient way of calculating the Spec(M) of a…

Algebraic Geometry · Mathematics 2012-07-17 Ilia Pirashvili

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

Combinatorics · Mathematics 2019-09-27 Norman Do , Jian He , Daniel V. Mathews

Let $G$ be a countable monoid and let $A$ be an Artinian group (resp. an Artinian module). Let $\Sigma \subset A^G$ be a closed subshift which is also a subgroup (resp. a submodule) of $A^G$. Suppose that $\Gamma$ is a finitely generated…

Dynamical Systems · Mathematics 2022-02-01 Xuan Kien Phung

We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.

Category Theory · Mathematics 2021-02-26 Mark V. Lawson

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Algebraic Geometry · Mathematics 2016-02-26 Rob Eggermont

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

Group Theory · Mathematics 2024-12-05 Jonathan Warne

An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…

Functional Analysis · Mathematics 2013-06-12 Alexey I. Popov

The monoids of simplicial endomorphisms, i.e. the monoids of endomorphisms in the simplicial category, are submonoids of monoids one finds in Temperley-Lieb algebras, and as the monoids of Temperley-Lieb algebras are linked to situations…

Geometric Topology · Mathematics 2007-09-17 K. Dosen

We investigate the representation of the symmetric group afforded by the action on its conjugacy class of fixed point free involutions, over an algebraically closed field of finite characteristic p. We discuss the general form of the set of…

Representation Theory · Mathematics 2009-01-29 Peter Collings

Let I be a countably infinite set, S = Sym(I) the group of permutations of I, and E = End(I) the monoid of self-maps of I. Given two subgroups G, G' of S, let us write G \approx_S G' if there exists a finite subset U of S such that the…

Logic · Mathematics 2012-06-11 Zachary Mesyan

Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…

Group Theory · Mathematics 2024-02-02 Pascal Caron , Jean-Gabriel Luque , Bruno Patrou

In this paper we study submonoids of the monoid $\mathscr{I}_\infty^{\,\Rsh\!\!\!\nearrow}(\mathbb{N})$ of almost monotone injective co-finite partial selfmaps of positive integers $\mathbb{N}$. Let…

Group Theory · Mathematics 2020-01-07 Oleg Gutik , Anatolii Savchuk

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

Logic in Computer Science · Computer Science 2014-09-15 Jiří Adámek