Counting edges in factorization graphs of numerical semigroup elements

The ability of a chemical reaction network to generate itself by catalyzed reactions from constantly present environmental food sources is considered a fundamental property in origin-of-life research. Based on Kaufmann’s autocatalytic sets, Hordijk and Steel have constructed the versatile formalism of catalytic reaction systems (CRS) to model and to analyze such self-generating networks, which they named reflexively autocatalytic and food-generated. Recently, it was established that the subsequent and simultaenous catalytic functions of the chemicals of a CRS give rise to an algebraic structure, termed a semigroup model. The semigroup model allows to naturally consider the function of any subset of chemicals on the whole CRS. This gives rise to a generative dynamics by iteratively applying the function of a subset to the externally supplied food set. The fixed point of this dynamics yields the maximal self-generating set of chemicals. Moreover, the set of all functionally closed self-generating sets of chemicals is discussed and a structure theorem for this set is proven. It is also shown that a CRS which contains self-generating sets of chemicals cannot have a nilpotent semigroup model and thus a useful link to the combinatorial theory of finite semigroups is established. The main technical tool introduced and utilized in this work is the representation of the semigroup elements as decorated rooted trees, allowing to translate the generation of chemicals from a given set of resources into the semigroup language.

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many previous results, provides more natural and intuitive proofs, and yields a completely explicit error bound.

The uncovering of new structure on the Cuntz semigroup of a C*-algebra of stable rank one leads to several applications: we answer affirmatively, for the class of stable rank-one C*-algebras, a conjecture by Blackadar and Handelman on dimension functions, the global Glimm halving problem, and the problem of realizing functions on the cone of 2-quasitraces as ranks of Cuntz semigroup elements. We also gain new insights into the comparability properties of positive elements in C*-algebras of stable rank one.

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $\Delta_m$ that arises in the study of multigraded Betti numbers. We compute squarefree divisor complexes for certain classes numerical semigroups, and exhibit a new family of simplicial complexes that are occur as the squarefree divisor complex of some numerical semigroup element.

We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of computing the tame degree of an affine semigroup, and (iii) a dynamic algorithm to compute catenary degrees of affine semigroup elements. Our algorithms rely on theoretical results from combinatorial commutative algebra involving Gröbner bases, Hilbert bases, and other standard techniques. Implementation in the computer algebra system GAP is discussed.

On factorization invariants and Hilbert functions

Abstract A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemerédi’s theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs is that, for actions of semigroups, a certain kind of one recurrence (mixing along a filter) amplifies itself to multiple recurrence. This amplification is proved using a so-called van der Corput difference lemma for a suitable filter on the semigroup. Particular instances of this lemma (for concrete filters) have been proven before (by Furstenberg, Bergelson–McCutcheon, and others), with a somewhat different proof in each case. We define a notion of differentiation for subsets of semigroups and isolate the class of filters that respect this notion. The filters in this class (call them ∂-filters) include all those for which the van der Corput lemma was known, and our main result is a van der Corput lemma for ∂-filters, which thus generalizes all its previous instances. This is done via proving a Ramsey theorem for graphs on the semigroup with edges between the semigroup elements labeled by their ratios.

SummaryWe construct semigroups with any given positive rational commuting probability, extending a Classroom Capsule from November 2008 in this Journal.

Let S be a semigroup and let be an S-graded ring. Rs = 0 for all but finitely many elements s ∈ S1, then R is said to have finite support. In this paper we concern ourselves with the question of whether a graded ring R with finite support inherits a given ring theoretic property from the homogeneous subrings Re corresponding to idempotent semigroup elements e.

We give a generalization of the well-known theorem stating that the category of primitively generated Hopf algebras is equivalent to the category of (restricted) Lie algebras. In so doing, instead of Lie algebras, we consider color Lie superalgebras, and instead of a primitively generated Hopf algebra, we take a Hopf algebra H whose semigroup elements form an Abelian group G =G(H), and H is generated by its relatively primitive elements which “supercommute” with the elements of G.

Remarks on the semigroup elements free of large prime factors

The prefix problem consists of computing all the products x 0 x 1 … x j ( j = 0, … , N - 1), given a sequence x = ( x 0 , x 1 , … , x N- 1 ) of elements in a semigroup. In this paper we completely characterize the size-time complexity of computing prefixes with Boolean networks, which are synchronized interconnections of Boolean gates and one-bit storage devices. This complexity crucially depends upon two properties of the underlying semigroup, which we call cycle-freedom (no cycle of length greater than one in the Cayley graph of the semigroup), and memory-induciveness (arbitrarily long products of semigroup elements are true functions of all their factors). A nontrivial characterization is given of non-memory-inducive semigroups as those whose recurrent subsemigroup (formed by the elements with self-loops in the Cayley graph) is the direct product of a left-zero semigroup and a right-zero semigroup. Denoting by S and T size and computation time, respectively, we have S = Θ(( N / T )log( N / T )) for memory-inducive non-cycle-free semigroups, and S = Θ( N / T ) for all other semigroups. We have T ε [Ω(log N ), Ο( N )] for all semigroups, with the exception of those whose recurrent subsemigroup is a right-zero semigroup, for which T ε [Ω(1), Ο( N )]. The preceding results are also extended to the VLSI model of computation. Area-time optimal circuits are obtained for both boundary and nonboundary I/O protocols.

On the time required to sum n semigroup elements on a parallel machine with simultaneous writes