Boundary quotients of the right Toeplitz algebra of the affine semigroup over the natural numbers

We study the Toeplitz $C^*$-algebra generated by the right-regular representation of the semigroup ${\mathbb N \rtimes \mathbb N^\times}$, which we call the right Toeplitz algebra. We analyse its structure by studying three distinguished quotients. We show that the multiplicative boundary quotient is isomorphic to a crossed product of the Toeplitz algebra of the additive rationals by an action of the multiplicative rationals, and study its ideal structure. The Crisp--Laca boundary quotient is isomorphic to the $C^*$-algebra of the group ${\mathbb Q_+^\times}\!\! \ltimes \mathbb Q$. There is a natural dynamics on the right Toeplitz algebra and all its KMS states factor through the additive boundary quotient. We describe the KMS simplex for inverse temperatures greater than one.

Additive structures on f-vector sets of polytopes

We show that the f-vector sets of d-polytopes have non-trivial additive structure: They span affine lattices and are embedded in monoids that we describe explicitly. Moreover, for many large subclasses, such as the simple polytopes, or the simplicial polytopes, there are monoid structures on the set of f-vectors by themselves: “addition of f-vectors minus the f-vector of the d-simplex” always yields a new f-vector. For general 4-polytopes, we show that the modified addition operation does not always produce an f-vector, but that the result is always close to an f-vector. In this sense, the set of f-vectors of all 4-polytopes forms an “approximate affine semigroup”. The proof relies on the fact for d = 4 every d-polytope, or its dual, has a “small facet”. This fails for d > 4.We also describe a two further modified addition operations on f-vectors that can be geometrically realized by glueing corresponding polytopes. The second one of these may yield a semigroup structure on the f-vector set of all 4-polytopes.

The computation of factorization invariants for affine semigroups

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.

Proportionally modular affine semigroups

This work introduces a new kind of semigroup of [Formula: see text] called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical semigroups. We give an algorithm to compute their minimal generating sets, and we specialize when [Formula: see text]. For this case, we also provide a faster algorithm to compute their minimal system of generators, prove they are Cohen–Macaulay and Buchsbaum, and determinate their (minimal) Frobenius vectors. Besides, Gorenstein proportionally modular affine semigroups are characterized.

THE SHORT RESOLUTION OF A SEMIGROUP ALGEBRA

This work generalises the short resolution given by Pisón Casares [‘The short resolution of a lattice ideal’, Proc. Amer. Math. Soc.131(4) (2003), 1081–1091] to any affine semigroup. We give a characterisation of Apéry sets which provides a simple way to compute Apéry sets of affine semigroups and Frobenius numbers of numerical semigroups. We also exhibit a new characterisation of the Cohen–Macaulay property for simplicial affine semigroups.