Datenvertragswerk
ribbon bollobas riordan polynomial ledger
Computes the complete three-variable Bollobas-Riordan polynomial of one orientable ribbon embedding of a connected simple labelled graph (n 1..4): R(u,v,w)=sum over all spanning edge subsets F of u^(r(G)-r(F))*v^nullity(F)*w^(k(F)-bc(F)+nullity(F)), r(F)=n-k(F), nullity(F)=edges(F)-r(F). Inputs are edge_mask over lexicographic pairs and rotations, one complete cyclic neighbor order per vertex with the smallest neighbor first. Reversals remain distinct.
POST https://datenvertrag.halowerk.com/v1/ribbon-bollobas-riordan-polynomial-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| edge_mask | See schema | Yes | |
| rotations | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"edge_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 63
},
{
"type": "null"
}
]
},
"rotations": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"u": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"v": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"w": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"coefficient": {
"type": "integer",
"minimum": 1,
"maximum": 64
}
},
"required": [
"u",
"v",
"w",
"coefficient"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 32
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"edge_mask",
"rotations",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 1,
"edge_mask": 0,
"rotations": [
[]
],
"claim": [
{
"u": 0,
"v": 0,
"w": 0,
"coefficient": 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.