Datenvertragswerk
minimum monoid generator family
For one finite monoid multiplication table of order 1..4 with identity 0, given as flat row-major n*n entries 0..n-1, finds every minimum-cardinality subset of elements generating the entire monoid. Associativity and table[0,a]=table[a,0]=a are required; no commutativity, Latin/group or cancellation assumption. Returns minimum_size, all generator_masks in ascending numeric order and count; bit v marks element v and identity 0 is never in a minimum set.
POST https://datenvertrag.halowerk.com/v1/minimum-monoid-generator-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| table | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"minimum_size": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"generator_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 0,
"maxItems": 16
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 17
}
},
"required": [
"minimum_size",
"generator_masks",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"table",
"claim"
],
"additionalProperties": false
}Published input example
{
"table": [
0
],
"claim": {
"minimum_size": 0,
"generator_masks": [
0
],
"count": 1
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.