This paper surveys and develops links between polynomial invariants of finite groups, factorization theory of Krull domains, and product-one sequences over finite groups. The goal is to gain a better understanding of the multiplicative ideal theory of invariant rings, and connections between the Noether number and the Davenport constants of finite groups.

This paper explores the linguistic implications of Non-commutative Linear Logic, restricted to its multiplicative fragment NMLL. In the paper particular emphasis is given to the logical representation of lexical information and of the principles of the X-bar theory.

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm.

We give a small functorial algebraic model for the 2-stage Postnikov section of the K-theory spectrum of a Waldhausen category and use our presentation to describe the multiplicative structure with respect to biexact functors.

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.