A numerical semigroup
is an additively closed set of nonnegative integers, and a factorization of an element
of
is an expression
of
as a sum of
generators of
.
It is known that for a given numerical semigroup
, the number of
factorizations of
coincides with a quasipolynomial (that is, a polynomial whose coefficients are periodic
functions of
).
One of the standard methods for computing certain semigroup-theoretic invariants
involves assembling a graph or simplicial complex derived from the factorizations of
. We
prove that for two such graphs (which we call the factorization support graph and the
trade graph), the number of edges coincides with a quasipolynomial function of
, and
identify the degree, period, and leading coefficient of each. In the process, we uncover
a surprising geometric connection: a combinatorially assembled cubical complex that
is homeomorphic to real projective space.
PDF Access Denied
We have not been able to recognize your IP address
216.73.216.158
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.