Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"unique factorisation"”.

  1. Non-commutative Noetherian Unique Factorisation Domains.

    The commutative theory of Unique Factorisation Domains (UFDs) is well-developed (see, for example, Zariski¬-Samuel[75], Chapter 1, and Cohn[2l], Chapter 11). This thesis is concerned with classes of non-commutative Noetherian rings which are generalisations of the commutative idea of UFD. We may …

    whiterose Download PDF for Non-commutative Noetherian Unique Factorisation Domains. (opens in a new tab)

  2. Unique factorization in chain extensions of semigroups

    … numbers, factorization into irreducibles is unique up to order and units. Their proof makes extensive use of the fact that each P = P(x1, x2...) C[[x1, x2...]] determines a sequence {Pn} of power series in the indeterminates x1, x2 ... xn by Pn(x1,...,xn) = P(x1,..., xn, 0, ...). In …

    rice Repository record for Unique factorization in chain extensions of semigroups (opens in a new tab)

  3. Uniqueness and Complexity in Generalised Colouring

    … are: · Additive induced-hereditary families are uniquely factorisable into irreducible families. · If <i>P</i> and <i>Q</i> are additive induced-hereditary graph families, then (<i>P</i>,<i>Q</i>)-COLOURING is NP-hard, with the exception of GRAPH 2-COLOURING. Moreover, with the same exception, …

    waterloo Repository record for Uniqueness and Complexity in Generalised Colouring (opens in a new tab)