Datenvertragswerk
cartesian graph factorization family
For a fully captured simple undirected graph on original labels0..n-1,n1..6, edge_mask bits are lexicographic unordered pairs(0,1),(0,2),.,(n-2,n-1). Synthesize ALL decompositions G=A square B into TWO connected simple factors with2<=a<=b and a*b=n. Product adjacency holds exactly when one coordinate agrees and the other factor has an edge. Return decompositions records{a,b,mask_a,mask_b,grid},count,decomposable. Factor masks use their own lexicographic unordered pairs. grid[i*b+j] is the.
POST https://datenvertrag.halowerk.com/v1/cartesian-graph-factorization-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| edge_mask | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 6
},
{
"type": "null"
}
]
},
"edge_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 32767
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"decompositions": {
"type": "array",
"items": {
"type": "object",
"properties": {
"a": {
"type": "integer",
"minimum": 2,
"maximum": 3
},
"b": {
"type": "integer",
"minimum": 2,
"maximum": 3
},
"mask_a": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"mask_b": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"grid": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 4,
"maxItems": 6
}
},
"required": [
"a",
"b",
"mask_a",
"mask_b",
"grid"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 24
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 2880
},
"decomposable": {
"type": "boolean"
}
},
"required": [
"decompositions",
"count",
"decomposable"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"edge_mask",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 1,
"edge_mask": 0,
"claim": {
"decompositions": [],
"count": 0,
"decomposable": false
}
}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.