English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We extend the theory of maximally even sets to determine the evenness of partitions of the chromatic universe.  Interactions  measure the average evenness of  colour sets  (partitioning sets) of. For 2-colour partitions the Clough-Douthett maximal-evenness algorithm determines maximally even partitions. But to measure the evenness of non-maximally even partitions, it is necessary to use computational methods. Moreover, for more than two colour sets there is no simple algorithm that determines maximally even partitions. Again, we rely on computational methods. We also explore collections of partitions and  partition-classes  (orbits under a dihedral group) and construct tables that order partition-classes according to the evenness of their partitions. We use  Bell numbers, Stirling numbers of the second kind , and  integer partitions  to enumerate relevant combinatorial objects related to our investigation.

Partitions, their classes, and multicolour evenness