Related papers: Primely generated refinement monoids
We construct a family of finitely generated infinite periodic groups. The basic example is a 2-group, called the tetrahedron group. We generalize the construction by suggesting a family of infinite finitely generated dice groups. We provide…
Garside families have recently emerged as a relevant context for extending results involving Garside monoids and groups, which themselves extend the classical theory of (generalized) braid groups. Here we establish various characterizations…
We study a special set of constellations of primes generated by twin primes.
A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…
We expound the properties of ribbons in a setting which is general enough to encompass spherical Artin monoids and dual braid monoids of well-generated complex reflection groups. We generalize to our setting results on parabolic subgroups…
We define and explore semireflection monoids on a finite-dimensional vector space. These are monoids generated by semireflections: linear maps fixing a subspace of codimension 1. We mostly focus on the case of projection monoids (where the…
We describe a generating set for the initial ideal of simplicial toric ideals with respect to the graded reverse lexicographic order, using representations of elements of affine monoids as sums of irreducible elements. Although the…
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…
We propose a slight weakening of the definitions of Artin monoids and Coxeter monoids. We study one `infinite series' in detail.
A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…
We construct a recursive formula for a complete system of primitive orthogonal idempotents for any $R$-trivial monoid. This uses the newly proved equivalence between the notions of $R$-trivial monoid and weakly ordered monoid.
A slight modification of the definition of the Thompson-Higman groups G_k1 and F_k1 leads to inverse monoids that map onto G_k1 (respectively F_k1), and that have interesting properties: they are finitely generated, and residually finite.…
We study a natural set of refinements of the Ehrhart series of a closed polytope, first considered by Chapoton. We compute the refined series in full generality for a simplex of dimension d, a cross-polytope of dimension d, respectively a…
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
We define and study the Picard group of a monoid scheme and the class group of a normal monoid scheme. To do so, we develop some ideal theory for (pointed abelian) noetherian monoids, including primary decomposition and discrete valuations.…
It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. Considering the Foata normal form metric on trace monoids and uniformly continuous endomorphisms, a…
We show that, under certain assumptions, strongly finitary enriched monads are given by discrete enriched Lawvere theories. On the other hand, monads given by discrete enriched Lawvere theories preserve surjections.
We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…
According to generalized Mellin derivative (Kargin), we introduce a new family of polynomials called higher order generalized geometric polynomials. We obtain some properties of them.We discuss their connections to degenerate Bernoulli and…
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…