The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We describe algorithms for computing the nilradical and the zero-divisors of a finitely generated commutative -monoid. These algorithms will be used for deciding if a given ideal of a finitely generated commutative -monoid is prime, radical or primary.
If is a pseudo-symmetric numerical semigroup, is its Frobenius number and is a minimal generator of , then , S and are also numerical semigroups. In this paper we study these constructions.
Si studiano i monoidi commutativi ridotti con due componenti archimedee e si forniscono dei teoremi di strutture. Si presta particolare attenzione a quei monoidi che sono finitamente generati, e si danno degli algoritmi che permettono di ottenere informazioni a partire da un delle loro presentazioni.
Download Results (CSV)