Related papers: Primely generated refinement monoids

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…

Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this…

The class of refinement monoids (abelian monoids satisfying the Riesz refinement property) is subdivided into those which are tame, defined as being an inductive limit of finitely generated refinement monoids, and those which are wild,…

We prove a refinement of the results of Gross and Zagier on prime factorizations of singular moduli.

The goal of this paper is to study the possible monoids appearing as the associated monoids of the initial algebra of a finitely generated homogeneous $\Bbbk$-subalgebra of a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. Clearly, any affine…

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…

Rodaro and Silva proved that the fixed points submonoid and the periodic points submonoid of a trace monoid endomorphism are always finitely generated. We show that for finitely generated left preGarside monoids, that includs finitely…

We show that pure monomorphisms are cofibrantly generated---generated from a set of morphisms by pushouts, transfinite composition, and retracts---in any locally finitely presentable additive category. In particular, this is true in any…

We give several characterizations of Mersenne primes (Theorem 1.1) and of primes for which 2 is a primitive root (Theorem 1.2). These characterizations involve group algebras, circulant matrices, binomial coefficients, and bipartite graphs.

Say that a cone is a commutative monoid in which x+y=0 implies that x=y=0. We show that cones (resp. simple cones) of many kinds order-embed or even embed unitarily into refinement cones (resp. simple refinement cones) of the same kind,…

We prove two main results concerning mesoprimary decomposition of monoid congruences, as introduced by Kahle and Miller. First, we identify which associated prime congruences appear in every mesoprimary decomposition, thereby completing the…

Extending a classical estimate of Mertens for the sum of the reciprocals of the first primes, we provide an explicit remainder formula for products of an arbitrary, but fixed, number of primes.

We prove every regular element of a free profinite monoid generates a prime ideal; in particular the minimal ideal is prime. The latter result was first proved by Almeida and Volkov using techniques from symbolic dynamics; our proof is…

We explore residually finite and profinite quandles. We prove that the endomorphism monoid and the automorphism group of finitely generated residually finite quandles are residually finite. In fact, we establish the similar result for a…

Necessary and sufficient conditions are given for the endomorphism monoid of a profinite semigroup to be profinite. A similar result is established for the automorphism group.

Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of…

We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…

Using the Rowland idea, we find two infinite sets of generators of primes. We also pose some conjectures concerning twin primes.

For polynomials of degree two over finite fields, we present an improvement of Fitzgerald's characterization (Finite Fields Appl. 9(1):117-121, 2003). We then use this new characterization to obtain an explicit, complete, and simple…