# coya: Coya monoids

Take some log semiring R. Then, for any two x,y :: R, the following holds:

x ^ log y == y ^ log x == e ^ (log x * log y)

A Coya monoid is some commutative monoid (R, y = x ^ log y. The following laws hold:

e # x = x (Left Identity)

x # e = x (Right Identity)

If the R is a poset where all elements in R are greater than one, then R also forms a group:

x # (e ^ (1 / log (x))) == x

[Skip to Readme]

Versions [faq] | 0.1 |
---|---|

Change log | CHANGELOG.md |

Dependencies | base (>=4.10.1 && <4.13), groups (>=0.4), primitive (>=0.6.4), refined (>=0.3), semirings (>=0.3) [details] |

License | BSD-3-Clause |

Copyright | 2019 chessai |

Author | chessai |

Maintainer | chessai1996@gmail.com |

Category | Data, Math |

Home page | https://github.com/chessai/coya |

Bug tracker | https://github.com/chessai/coya/issues |

Source repo | head: git clone https://github.com/chessai/coya.git |

Uploaded | by chessai at Thu Apr 11 18:05:34 UTC 2019 |

Distributions | NixOS:0.1 |

Downloads | 214 total (22 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs available [build log] Last success reported on 2019-04-11 [all 1 reports] |

## Downloads

- coya-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)